Contour Correspondence via Ant Colony Optimization

ACO correspondence framework

O. van Kaick, G. Hamarneh, H. Zhang, P. Wighton
Contour Correspondence via Ant Colony Optimization
Proc. 15th Pacific Conference on Computer Graphics and Applications (Pacific Graphics 2007), Maui, Hawaii, United States, pp. 271-280, October 29-30 & November 01-02, 2007.
[PDF]   [DOI]   [Bib]

We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way, we show that better matching results are obtained in practice. We propose the first Ant Colony Optimization (ACO) algorithm specifically aimed at solving the QAP-based shape correspondence problem. Our ACO framework is flexible in the sense that it can handle general point correspondence, but also allows extensions, such as order preservation, for the more specialized contour matching problem.


Files related to this paper:

Presentation slides: PDF

Animations external to the presentation:


MATLAB code available for download (version 1.2):

Link at MATLAB Central: ACO