3D model retrieval using principal plane analysis and dynamic programming

作者:

Highlights:

摘要

Three dimensional models play an important role in many applications; the problem is how to select the appropriate models from a 3D database rapidly and accurately. In recent years, a variety of shape representations, statistical methods, and geometric algorithms have been proposed for matching 3D shapes or models. In this paper, we propose a 3D shape representation scheme based on a combination of principal plane analysis and dynamic programming. The proposed 3D shape representation scheme consists of three steps. First, a 3D model is transformed into a 2D image by projecting the vertices of the model onto its principal plane. Second, the convex hall of the 2D shape of the model is further segmented into multiple disjoint triangles using dynamic programming. Finally, for each triangle, a projection score histogram and moments are extracted as the feature vectors for similarity searching. Experimental results showed the robustness of the proposed scheme, which resists translation, rotation, scaling, noise, and destructive attacks. The proposed 3D model retrieval method performs fairly well in retrieving models having similar characteristics from a database of 3D models.

论文关键词:3D models,3D model retrieval,Principal plane analysis,Graph matching,Dynamic programming

论文评审过程:Received 3 November 2005, Revised 21 April 2006, Accepted 2 June 2006, Available online 1 August 2006.

论文官网地址:https://doi.org/10.1016/j.patcog.2006.06.006