CONTOUR CORRESPONDENCE USING ANT COLONY OPTIMIZATION
| Author(s) | : | Mr. B. Chandrashaker Reddy, V. Ushaswini, N. Karthik, R. Manasa |
| Institution | : | Assistant Professor, Electronics and Communication Engineering, NNRG, Telangana, India |
| Published In | : | Vol. 4, Issue 3 — March 2017 |
| Page No. | : | 734-742 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
This Paper formulates contour correspondence as a Quadratic Assignment Problem (QAP), this can besolved 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 aremany experiments for solving this problem but it demonstrates that this approach yields high-quality correspondenceresults and is computationally efficient when compared to other methods.
Mr. B. Chandrashaker Reddy, V. Ushaswini, N. Karthik, R. Manasa, “CONTOUR CORRESPONDENCE USING ANT COLONY OPTIMIZATION”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 4, Issue 3, pp. 734-742, March 2017.
