By Topic

Affine invariant matching of broken boundaries based on an enhanced genetic algorithm and distance transform

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
$31 $31
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

2 Author(s)
Tsang, P.W.M. ; Dept. of Electron. Eng., City Univ. of Hong Kong, Hong Kong ; Yuen, T.Y.F.

Past research work has shown that the process of shape matching can be rendered into an optimisation problem that determines, based on evolutionary algorithms, the best matching score between pairs of object boundaries. This important finding has enabled near planar objects to be identified efficiently when they are captured under different camera viewpoints. Among other evolutionary techniques, the genetic algorithm (GA) has demonstrated its feasibility in matching silhouette images of objects that are captured under a well-controlled environment. As the latter is not guaranteed in practice, the method has also been extended to match fragmented and incomplete contours. Despite the moderate success achieved, the overall performance is rather inconsistent and also varies significantly among different geometries. To overcome this problem, two variants of a novel approach based on the integration of a simple GA, the distance transform and the migrant principle are developed and presented. Experimental results reveal that the proposed methods are capable of matching incomplete and broken contours with a high success rate and exhibit good stability in performance.

Published in:

Computer Vision, IET  (Volume:2 ,  Issue: 3 )