Genetic Algorithm for Silhouette Matching

Genetic algorithms (GAs) have been applied to matching problem. However, traditional GAs do not perform well in matching problem because there can be many locally similar parts. This paper presents a new genetic algorithm for silhouette matching. New concepts of partially matched gene-strings in the initial population, the extending operator and the order adjustment algorithm are proposed. Each gene-string in the initial population only has three matched points while other points are unmatched. During the evolution, each gene-string will have more matched points due to the applications of the crossover and extending operators. The extending operator determines a potential match for an unmatched point near a matched point by searching the local space. After the application of the crossover and extending operators, the adjustment algorithm enforces each gene-string to be an ordered list by removing some matched points, if necessary. Our experiments show that the new matching algorithm based on GA performs better than traditional GA-based algorithms

[1]  Michael J. Swain,et al.  Color indexing , 1991, International Journal of Computer Vision.

[2]  B. S. Manjunath,et al.  Texture Features for Browsing and Retrieval of Image Data , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Ponnuthurai N. Suganthan,et al.  Structural pattern recognition using genetic algorithms , 2002, Pattern Recognit..

[4]  Mandyam D. Srinath,et al.  Partial Shape Classification Using Contour Matching in Distance Transformation , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Mohan S. Kankanhalli,et al.  Cluster-based color matching for image retrieval , 1996, Pattern Recognit..

[6]  Longin Jan Latecki,et al.  Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution , 1999, Comput. Vis. Image Underst..

[7]  Richard J. Prokop,et al.  A survey of moment-based techniques for unoccluded object representation and recognition , 1992, CVGIP Graph. Model. Image Process..

[8]  Bir Bhanu,et al.  Recognition of occluded objects: A cluster-structure algorithm , 1987, Pattern Recognit..

[9]  Daphna Weinshall,et al.  Flexible Syntactic Matching of Curves and Its Application to Automatic Hierarchical Classification of Silhouettes , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Edwin R. Hancock,et al.  Convergence of a hill-climbing genetic algorithm for graph matching , 2000, Pattern Recognit..

[11]  Anil K. Jain,et al.  Image retrieval using color and shape , 1996, Pattern Recognit..

[12]  Jon Sporring,et al.  Perceptually relevant and piecewise linear matching of silhouettes , 2005, Pattern Recognit..

[13]  Peter Wai Ming Tsang,et al.  A genetic algorithm for aligning object shapes , 1997, Image Vis. Comput..

[14]  Carlos Orrite,et al.  Shape matching of partially occluded curves invariant under projective transformation , 2004 .

[15]  Longin Jan Latecki,et al.  Application of planar shape comparison to object retrieval in image databases , 2002, Pattern Recognit..

[16]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[17]  Santanu Chaudhury,et al.  Matching structural shape descriptions using genetic algorithms , 1997, Pattern Recognit..

[18]  Yi Li,et al.  Extraction of parametric human model for posture recognition using genetic algorithm , 2000, Proceedings Fourth IEEE International Conference on Automatic Face and Gesture Recognition (Cat. No. PR00580).

[19]  Georgy L. Gimel'farb,et al.  On retrieving textured images from an image database , 1996, Pattern Recognit..

[20]  Guojun Lu,et al.  Review of shape representation and description techniques , 2004, Pattern Recognit..

[21]  Josef Kittler,et al.  Enhancing CSS-based shape retrieval for objects with shallow concavities , 2000, Image Vis. Comput..