%0 Conference Proceedings
%T An Improved Ant Colony Matching by Using Discrete Curve Evolution
%+ University of Malaya = Universiti Malaya [Kuala Lumpur, Malaisie] (UM)
%+ AMCS Research Center
%A Saadi, Younes
%A Sari, Eka, Novita
%A Herawan, Tutut
%Z Part 1: Information & Communication Technology-EurAsia Conference 2014, ICT-EurAsia 2014
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 2nd Information and Communication Technology - EurAsia Conference (ICT-EurAsia)
%C Bali, Indonesia
%Y David Hutchison
%Y Takeo Kanade
%Y Bernhard Steffen
%Y Demetri Terzopoulos
%Y Doug Tygar
%Y Gerhard Weikum
%Y Linawati
%Y Made Sudiana Mahendra
%Y Erich J. Neuhold
%Y A Min Tjoa
%Y Ilsun You
%Y Josef Kittler
%Y Jon M. Kleinberg
%Y Alfred Kobsa
%Y Friedemann Mattern
%Y John C. Mitchell
%Y Moni Naor
%Y Oscar Nierstrasz
%Y C. Pandu Rangan
%I Springer
%3 Information and Communication Technology
%V LNCS-8407
%P 248-256
%8 2014-04-14
%D 2014
%R 10.1007/978-3-642-55032-4_24
%K Ant Colony Optimization
%K Quadratic assignment problem
%K Discrete curve evolution
%K Contour matching
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X In this paper we present an improved Ant Colony Optimization (ACO) for contour matching, which can be used to match 2D shapes. Discrete Curve Evolution (DCE) technique is used to simplify the extracted contour. In order to find the best correspondence between shapes, the match process is formulated as a Quadratic Assignment Problem (QAP) and resolved by using Ant Colony Optimization (ACO). The experimental results justify that Discrete Curve Evolution (DCE) performs better than the previous Constant Sampling (CS) technique which has been selected for the ACO matching.
%G English
%Z TC 5
%Z TC 8
%2 https://inria.hal.science/hal-01397203/document
%2 https://inria.hal.science/hal-01397203/file/978-3-642-55032-4_24_Chapter.pdf
%L hal-01397203
%U https://inria.hal.science/hal-01397203
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC5
%~ IFIP-TC8
%~ IFIP-ICT-EURASIA
%~ IFIP-LNCS-8407