CONTOUR CORRESPONDENCE USING ANT COLONY OPTIMIZATION

Authors

  • Mr. B. Chandrashaker Reddy Assistant Professor, Electronics and Communication Engineering, NNRG, Telangana, India
  • V. Ushaswini Student, Electronics and Communication Engineering, NNRG, Telangana, India
  • N. Karthik Student, Electronics and Communication Engineering, NNRG, Telangana, India
  • R. Manasa Student, Electronics and Communication Engineering, NNRG, Telangana, India

Keywords:

Quadratic assignment problem, Proximity, Order preservation, Hungarian Algorithm, Swarm intelligence, Stigmergy.

Abstract

This Paper formulates contour correspondence as a Quadratic Assignment Problem (QAP), this can be
solved by incorporating proximity information and order preservation. By this we can only get an appropriate solution,
Hence we are going for Hungarian algorithm. Hungarian Algorithm is used to solve Assignment Problem. There are
many experiments for solving this problem but it demonstrates that this approach yields high-quality correspondence
results and is computationally efficient when compared to other methods.

Downloads

Published

2017-03-25

How to Cite

Mr. B. Chandrashaker Reddy, V. Ushaswini, N. Karthik, & R. Manasa. (2017). CONTOUR CORRESPONDENCE USING ANT COLONY OPTIMIZATION. International Journal of Advance Engineering and Research Development (IJAERD), 4(3), 734–742. Retrieved from https://ijaerd.org/index.php/IJAERD/article/view/2178

Issue

Vol. 4 No. 3 (2017): Volume 4 Issue 3 March 2017

Section

Articles