By Topic

Detection of geometric shapes by the combination of genetic algorithm and subpixel accuracy

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

2 Author(s)
Yaodong Wang ; Tokyo Metropolitan Inst. of Technol., Japan ; Funakubo, N.

Detecting specific shape from image is an important problem in computer vision. A minimal subset is the smallest number of points (pixels) necessary to define an unique instance of a geometric primitive. To extract certain type of geometric primitives genetic algorithm has been studied. However in that method, it doesn't go far enough to detection accuracy, convergent speed and simultaneous detection of multiple shapes. In this paper, we proposed a new approach that improves detection accuracy and convergent speed for geometric shapes by the combination of genetic algorithm and subpixel accuracy (GA&SA). We also presented an algorithm to be able to implement simultaneous detection of multiple shapes based on standardized cost function and similarity between instances, taking advantage of genetic algorithm with “population search”. In addition we have confirmed these practical usefulness through some experiments

Published in:

Pattern Recognition, 1996., Proceedings of the 13th International Conference on  (Volume:4 )

Date of Conference:

25-29 Aug 1996