Contour Correspondence via Ant Colony Optimization

Abstract

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… (More)
DOI: 10.1109/PG.2007.56
View Slides

11 Figures and Tables

Topics

  • Presentations referencing similar topics