We design an effective shape prior embedded human silhouettes extraction algorithm. Human silhouette extraction is found challenging because of articulated structures, pose variations, and background clutters. Many segmentation algorithms, including the Min-Cut algorithm, meet difficulties in human silhouette extraction. We aim at improving the performance of the Min-Cut algorithm by embedding ...

Abstract. We propose an approach for matching deformed, occluded and unoccluded shapes using Dynamic Programming (DP). We distinguish among various cases of matching including cases where the shapes are scaled with respect to each other or cases where one shape matches the whole or only a part of the other shape. Our approach handles noise and shape distortions by allowing matching of merged se...

A number of morphological shape representation algorithms have been proposed over the years. However, not many shape matching algorithms have been developed based on these representation algorithms. In this paper, we present a structural shape matching algorithm that uses both internal and external shape components selected from the maximal disks determined by a traditional and a generalized mo...

Many methods have been proposed to solve the problem of shape matching, where the task is to determine similarity between given shapes. In this paper, we propose a novel method to combine many shape matching methods using procedural knowledge to increase the precision of the shape matching process in retrieval problems like place recognition task. The idea of our approach is to assign the best ...

This paper presents a method of hand posture estimation from silhouette images taken by two cameras. First, we extract the silhouette contour for a pair of images. We construct an eigenspace from images of hands with various postures. For effective matching, we define a shape complexity for each image to see how well the shape feature is represented. For a pair of input images, the total matchi...

Docking simulates molecular interactions. Protein protein docking, owing to the sizes of molecules, is a very challenging problem. As the number of degrees of freedom in the molecular structure of proteins is huge, docking algorithms consider the molecules as relatively rigid bodies. Shape matching of two protein molecules is computationally difficult because the possibilities of matching the m...

We address the scale problem inherent to isometric shape correspondence in a combinatorial matching framework. We consider a particular setting of the general correspondence problem where one of the two shapes to be matched is an isometric (or nearly isometric) part of the other up to an arbitrary scale. We resolve the scale ambiguity by finding a coarse matching between shape extremities based...

We present a novel geometric model for robot mapping based on shape. Shape similarity measure and matching techniques originating from computer vision are specially redesigned for matching range scans. The fundamental geometric representation is a structural one, polygonal lines are ordered according to the cyclic order of visibility. This approach is an improvement of the underlying geometric ...

This paper describes a Bayesian graph matching algorithm for data-mining from large structural data-bases. The matching algorithm uses edge-consistency and node attribute similarity to determine the a posteriori probability of a query graph for each of the candidate matches in the data-base. The node feature-vectors are constructed by computing normalised histograms of pairwise geometric attrib...