Conventional shape matching for engineering models primarily considers rigid shape similarity. They do not seek global shape similarity while considering large local deformations. However, engineering models created by some parametric-based design can involve large parametric changes. As a result, they do not share similarity in their global shape. Hence our goal is to develop shape representat...

Because of recent advances in graphics hardand software, both the production and use of 3D models are increasing at a rapid pace. As a result, a large number of 3D models have become available on the web, and new research is being done on 3D model retrieval methods. Query and retrieval can be done solely based on associated text, as in image retrieval, for example (e.g. Google Image Search [1] ...

This paper describes an interactive application we have developed based on shaped-based image retrieval technique. The key concepts described in the project are, i)matching of images based on contour matching; ii)matching of images based on edge matching; iii)matching of images based on pixel matching of colours. Further, the application facilitates the matching of images invariant of transform...

In this paper, we present a robust shape matching approach based on bottom-up segmentation. We show how over-segmentation results can be used to overcome both ambiguity of contour matching and occlusion. To measure the shape difference between a template and the object in the input, we use oriented chamfer matching. However, in contrast to previous work, we eliminate the affection of the backgr...

Shape matching represents a challenging problem in both information engineering and computer science, exhibiting not only a wide spectrum of multimedia applications, but also a deep relation with conformal geometry. After reviewing the theoretical foundations and the practical issues involved in this fashinating subject, we focus on two state-of-the-art approaches relying respectively on local ...

We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up correspondence as an integer quadratic programming problem, where the cost function has terms based on similarity of corresponding geometric blur point descriptors as well as the geometric distortion between pairs of corresp...

We present improved algorithms to match two polygonal shapes P and Q to approximate their maximum overlap. Let n be their total number of vertices. Our first algorithm finds a translation that approximately maximizes the overlap area of P and Q under translation in Õ(n2ε−3) time. The error is additive and it is at most ε · min{area(P ), area(Q)} with probability 1 − n−O(1). We also obtain an al...

We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes X and Y by means of a convex relaxation. Rather than mapping points to points we match infinitesimal surface patches while preserving the geometric structures. In this spirit, we consider matchings between objects’ surfaces as diffeomorphisms which are by definition geometricall...

Shape Matching and Object Recognition by Alexander Christiansen Berg Doctor of Philosophy in Computer Science University of California, Berkeley Professor Jitendra Malik, Chair We address comparing related, but not identical shapes in images following a deformable template strategy. At the heart of this is the notion of an alignment between the shapes to be matched. The transformation necessary...

-Binary image representation by its morphological skeleton transform has been proposed in the past as an information preserving representation. In this paper this skeleton representation is adopted as the start point for the development of a binary shape recognition scheme. A skeleton matching algorithm is presented that efficiently characterizes the similarity between two skeletons as a distan...