A Novel GA-Based Method for n-Dimensional Point Pattern Matching

Publish Year: 1383
نوع سند: مقاله کنفرانسی
زبان: English
View: 1,726

This Paper With 6 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

این Paper در بخشهای موضوعی زیر دسته بندی شده است:

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

ICMVIP03_091

تاریخ نمایه سازی: 22 مهر 1390

Abstract:

Point pattern matching (PPM) is an important problem in pattern recognition, digital video processing and computer vision. In this paper novel robust and fast procedure based on Genetic Algorithm, for n-dimensional PPM is described. Most matching techniques solved the PPM problem by determining the correspondence between points localized spatially within two sets, then to get the proper transformation parameters, solved a set of equations. In this paper, we use this fact that correspondence and transformation matrices are two unitary polar factors of Grammian matrices. We estimate one of this factors by the Genetic Algorithm's population and evaluate this estimation by computing another factor using fitness function. This approach is easily implemented one and because of using the genetic algorithm in it, its computational complexity is lower than other knownmethods. Simulation results on randomly generated points patterns and real point patterns with varying amount of noise, show that the algorithm is very effective.

Authors

Mehdi Ezoji

Amirkabir University of Technology

Karim Faez

Amirkabir University of Technology

Majid Ziaratban

Amirkabir University of Technology

مراجع و منابع این Paper:

لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :
  • H. Li and R. Hartley, "A new and compact algorithm ...
  • H. Li and R. hartley, _ C orrespondence from polar ...
  • M. Carcassoni and E. R. Hancock, " Spectral corre spondence ...
  • A.Goshtasby and G.C. Stockman, " Point pattern matching using convex ...
  • D. H. Ballard, " Generalized hough transform to detect arbitrary ...
  • 2 Fingerprint Minutiae Matching ...
  • Here, we use two fingerprint images from FVC2000 database [14] ...
  • rd MVIP, Feb. 2005, Vol. 2 ...
  • G.Stockman, S. Kopstein and S. Benett, "Matching images to models ...
  • S.Gold, A. Rangarajan, C. P. Lu, S. Pappu and E. ...
  • _ orrespondence _ _ Pattern Recognition, Vol. 31, No. 8, ...
  • L. Zhang, W. Xu and C. Chang, "Genetic algorithm for ...
  • P.B. Van Wamelen, Z. Li and S.S. Iyengar , "A ...
  • B. Li, Q. Meng and H. Holstein, "Point Pattern Matching ...
  • A.G. Percus and O.C. Martin, "Scaling universalities of k-th nearest ...
  • M. Srinivas and Lalit M Patnik, "Genetic Algorithms: A Survey", ...
  • Federal Bureau of Investigation, "The Science of Fingerprint: Classification and ...
  • D. Maio, D. Maltoni, R. Cappeli, J.L. Wayman and A.K. ...
  • rd MVIP, Feb. 2005, Vol. 2 ...
  • نمایش کامل مراجع