• DocumentCode
    875456
  • Title

    Genetic algorithm for model-based matching of projected images of three-dimensional objects

  • Author

    Tsang, P.W.M. ; Yu, Z.

  • Author_Institution
    Dept. of Electron. Eng., City Univ. of Hong Kong, China
  • Volume
    150
  • Issue
    6
  • fYear
    2003
  • Firstpage
    351
  • Lastpage
    359
  • Abstract
    A novel genetic algorithm (GA) is proposed for searching for the existence of a projective transform which, when applied to the model, results in the best alignment with an unknown 2D edge image. The presence of a valid solution reflects that the latter can be regarded as one of the projected views of the model. On this basis, the identity of an unknown edge image can be deduced by matching it against a set of 3D reference models. To increase the efficiency of the process, a two-pass, coarse-to-fine strategy is adopted. Initially, an unknown image is first classified to a small group of models by matching their outermost boundaries. Next, a fine but slower matching algorithm selects model(s) that share similar internal edge features as the unknown image. In the design of the method, the authors have adopted an alternative projective transform representation that involves fewer parameters and allows constraints to be easily imposed on their dynamic ranges. This effectively lowers the chance of premature convergence and increases the success rate. Experimental results obtained with the proposed scheme are encouraging and demonstrate the feasibility of the approach.
  • Keywords
    convergence of numerical methods; edge detection; feature extraction; genetic algorithms; image classification; image matching; object recognition; 2D edge image; GA; convergence; edge features; genetic algorithm; image classification; image matching; object recognition; projected images; projective transform representation; three-dimensional objects;
  • fLanguage
    English
  • Journal_Title
    Vision, Image and Signal Processing, IEE Proceedings -
  • Publisher
    iet
  • ISSN
    1350-245X
  • Type

    jour

  • DOI
    10.1049/ip-vis:20030841
  • Filename
    1263268