DocumentCode
2816664
Title
Contour Tracking Using Centroid Distance Signature and Dynamic Programming Method
Author
Wang, Shi ; Kim, Hyongsuk ; Chen, Hongxin
Author_Institution
Div. of Electron. & Inf. Eng., Chonbuk Nat. Univ., Jeonju, South Korea
Volume
1
fYear
2009
fDate
24-26 April 2009
Firstpage
274
Lastpage
278
Abstract
In this paper, we propose a novel approach based on centroid distance signature and dynamic programming (DP), which can be used to guide a contour tracking execution. Edges are detected by an improved canny method; however, they still contain many noises as well as interferential information. So an edge-based contour tracking method is proposed to link the optimal object´s outline. First, we apply centroid distance function to the obtained edges to get the rough signature graph. Second, the optimal path ofthe signature graph is acquired based on DP algorithm. Last, we resume the optimal contour using the acquired signature trace after inverse transform. The superiority of the proposed model comes from 1) the accurate acquisition of object´s outline based on DP algorithm, and 2) scale and rotational invariant expression of contours with the centroid distance function.
Keywords
dynamic programming; edge detection; graph theory; target tracking; canny method; centroid distance signature; dynamic programming method; edge detection; edge-based contour tracking method; interferential information; inverse transform; rotational invariant expression; rough signature graph; Computational complexity; Dynamic programming; Electronic mail; Glass; Image edge detection; Iterative algorithms; Object recognition; Optimization methods; Resumes; Shape;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on
Conference_Location
Sanya, Hainan
Print_ISBN
978-0-7695-3605-7
Type
conf
DOI
10.1109/CSO.2009.201
Filename
5193693
Link To Document