Results 231 to 240 of about 26,495 (255)
Some of the next articles are maybe not open access.
International Journal of Computer Applications in Technology, 2017
The majority of shape matching and retrieval methods use only one single shape descriptor. Unfortunately, no shape descriptor is sufficient to provide suitable results for all kinds of shapes. The most common way to improve the performance of shape descriptors is to fuse them.
Sebti Foufou
exaly +2 more sources
The majority of shape matching and retrieval methods use only one single shape descriptor. Unfortunately, no shape descriptor is sufficient to provide suitable results for all kinds of shapes. The most common way to improve the performance of shape descriptors is to fuse them.
Sebti Foufou
exaly +2 more sources
A robust matching algorithm for shape recognition based on geometric consistency
2020 IEEE 3rd International Conference on Information Communication and Signal Processing (ICICSP), 2020Though there are many algorithms which devote to extracting the descriptors for the shapes, the correspondences between shapes established only by descriptor distance are not reliably. To address this issue, a new shape matching algorithm is proposed on the basis of the geometric consistency between shapes. Each shape pair is represented as a node in a
Wei Wang +4 more
exaly +2 more sources
Elastic Geometric Shape Matching for Point Sets under Translations
2015In geometric shape matching problems one is given a pattern P, a model Q, a distance measure d (which formalizes the intuitive notion of similarity of such shapes), and a class of geometric transformations applicable to the pattern P. The task is to find a transformation t in the given class that minimizes the distance of the transformed pattern t(P ...
Christian Knauer, Fabian Stehn
openaire +1 more source
Spectral Geometric Descriptor for Deformable 3D Shape Matching and Retrieval
2013We propose a spectral-geometric skeletal graph for nonrigid 3D shape retrieval. The skeleton is constructed from the isocontours of the second eigenfunction of the Laplace-Beltrami operator. We also introduce a graph matching mechanism based on a dissimilarity between the endpoints of the skeletal graph.
Anis Kacem 0002 +2 more
openaire +1 more source
Topological Pattern and Geometric Shape Matching for Layout Case Retrieval
1998In Case-Based Design (CBD) systems, pattern matching is a key process in case retrieval. Specifically, in the domain of spatial layout design, whilst symbolic pattern matching approaches have been widely used, the use of other pattern matching approaches including topological pattern matching and image-based matching has also begun to emerge.
Djauhar Manfaat +2 more
openaire +1 more source
3D Shape Matching and Inspection Using Geometric Features and Relational Learning
Computer Vision and Image Understanding, 1998In this paper we consider the problem of matching 3D sensed data with models and inspection for defects where the correspondence between models and data needs to be solved in robust and efficient ways. We explore the use of machine learning (in particular, relational learning) as an efficient method for solving correspondence (and so, pose estimation ...
Terry Caelli +2 more
openaire +1 more source
2006 IEEE Workshop on Multimedia Signal Processing, 2006
In this paper, an efficient method for boundary-based shapes matching and retrieval in the presence of occlusion is presented. The geometric and topological information of boundary curves are encoded in the form of longest common sub-curves (LCS) graphs and their similarity is estimated by graph matching. B-Spline is used for approximating the original
Raffaele De Amicis
exaly +2 more sources
In this paper, an efficient method for boundary-based shapes matching and retrieval in the presence of occlusion is presented. The geometric and topological information of boundary curves are encoded in the form of longest common sub-curves (LCS) graphs and their similarity is estimated by graph matching. B-Spline is used for approximating the original
Raffaele De Amicis
exaly +2 more sources
Fast Bayesian Shape Matching Using Geometric Algorithms
2007Abstract We present a Bayesian approach to comparison of geometric shapes with applications to classification of the molecular structures of proteins. Our approach involves the use of distributions defined on transformation invariant shape spaces and the specification of prior distributions on bipartite matchings.
exaly +2 more sources
Measuring Similarity Among Various Shapes Based on Geometric Matching
Geographical Analysis, 2005The purpose of this article is to examine how to measure the degree of similarity among various shapes, including for the first time those that are fragmented and perforated, by the overlap‐based elongation index. It is argued that complete removal of the effects of position, size, and orientation on shape, which is essential for the calibration of ...
Zuoquan Zhao, Roger R. Stough
openaire +1 more source
Matching Geometric Shapes in 4D Space Incorporating Curvature Information
Volume 6: 33rd Design Automation Conference, Parts A and B, 2007The Iterative Closest Point (ICP) algorithm and its variants are widely used in matching different patches of 3-Dimensional (3D) scanning data. In this paper, a 4-Dimensional (4D) based approach is proposed to improve the robustness of the ICP algorithm.
Y. Song, J. S. M. Vergeest
openaire +1 more source