Shortest Distance-based Initial Window Determination for Mobile Object Tracking Systems
碩士 === 國立交通大學 === 電機資訊國際學程 === 105 === Mobile object tracking is an interesting topic in computer vision. Many applications have been developed in many domains, i.e. surveillance tracking systems, augmented reality, etc. In this work, we adopt mean shift tracking scheme with the pattern recognition...
Main Authors: | Trinh Tran Thai Sang, 鄭陳泰創 |
---|---|
Other Authors: | Feng, Kai-Ten |
Format: | Others |
Language: | en_US |
Published: |
2016
|
Online Access: | http://ndltd.ncl.edu.tw/handle/ef8km6 |
Similar Items
-
Shortest Average-Distance Query on Heterogeneous Neighboring Objects
by: Wu-HsiuKuo, et al.
Published: (2014) -
Shortest Average-Distance Queries on Heterogeneous Neighboring Objects in Road Networks
by: Chun-HsingSu, et al.
Published: (2015) -
Multiple Object Tracking Using the Shortest Path Faster Association Algorithm
by: Zhenghao Xi, et al.
Published: (2014-01-01) -
Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks
by: Glenn, Andrew M., 1978-
Published: (2014) -
Stochastic and dynamic shortest distance problems
by: Polychronopoulos, George H. (George Harry)
Published: (2005)