Sciweavers

PG
2007
IEEE

Contour Correspondence via Ant Colony Optimization

13 years 10 months ago
Contour Correspondence via Ant Colony Optimization
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. Various experiments are presented which demonstrate that this approach yields highquality correspondence results and is computationally efficient when compared to other methods.
Oliver van Kaick, Ghassan Hamarneh, Hao Zhang 0002
Added 04 Jun 2010
Updated 13 Aug 2010
Type Conference
Year 2007
Where PG
Authors Oliver van Kaick, Ghassan Hamarneh, Hao Zhang 0002, Paul Wighton
Comments (0)