By Topic

Contour Tracking Using Centroid Distance Signature and Dynamic Programming Method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shi Wang ; Div. of Electron. & Inf. Eng., Chonbuk Nat. Univ., Jeonju, South Korea ; Hyongsuk Kim ; Hongxin Chen

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.

Published in:

Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on  (Volume:1 )

Date of Conference:

24-26 April 2009