A memetic algorithm for efficient solution of 2D and 3D shape matching problems

  • Authors:
  • Mohammad Sharif Khan;Tapabrata Ray

  • Affiliations:
  • School of Engineering and Information Technology, University of New South Wales, Canberra, Australia;School of Engineering and Information Technology, University of New South Wales, Canberra, Australia

  • Venue:
  • AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Shape representation and the associated morphing (repair) operators play a vital role in any shape optimization exercise. This paper presents a novel and an efficient methodology for morphing via smart repair of control points, wherein a repaired sequence of control points are generated. The repaired set of control points are then used to define the curve or the surface using a B-spline representation, while the control points themselves are optimized using a memetic algorithm. While the authors have already proposed the approach for 2D shape matching, this paper extends the approach to deal with 3D shape matching problems. Two 2D and one 3D examples have been presented to illustrate the performance of the proposed approach.