首页 | 本学科首页   官方微博 | 高级检索  
     


Shape retrieval using triangle-area representation and dynamic space warping
Authors:Naif Alajlan [Author Vitae]  Ibrahim El Rube [Author Vitae] [Author Vitae]  George Freeman [Author Vitae]
Affiliation:a Department of Electrical Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi Arabia
b Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ont., Canada N2L 3G1
Abstract:
In this paper, we present a shape retrieval method using triangle-area representation for nonrigid shapes with closed contours. The representation utilizes the areas of the triangles formed by the boundary points to measure the convexity/concavity of each point at different scales (or triangle side lengths). This representation is effective in capturing both local and global characteristics of a shape, invariant to translation, rotation, and scaling, and robust against noise and moderate amounts of occlusion. In the matching stage, a dynamic space warping (DSW) algorithm is employed to search efficiently for the optimal (least cost) correspondence between the points of two shapes. Then, a distance is derived based on the optimal correspondence. The performance of our method is demonstrated using four standard tests on two well-known shape databases. The results show the superiority of our method over other recent methods in the literature.
Keywords:Shape matching   Shape retrieval   Dynamic space warping   Dynamic programming
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号