Results 221 to 230 of about 166,612 (266)
Some of the next articles are maybe not open access.
Research on Shape Similarity and Shape Matching
2008 International Conference on Computer Science and Software Engineering, 2008A triangular mesh model matching method by combination of principle component analysis (PCA) and ICP algorithm is presented. Firstly, two 3D models are initially located by using PCA method. Secondly, ICP algorithm is applied to do fine adjustment and calibration.
Bin Liu, Ning Shangguan
openaire +1 more source
Coarse filters for shape matching
IEEE Computer Graphics and Applications, 2002This article describes the coarse shape filters that support the 3D, Internet-based search engine ShapeSifter, which aims to locate parts already in production that have a shape similar to a desired new part. The search engine analyzes the target model's shape characteristics and performs a similarity match on the database's contents.
Corney, Jonathan R. +5 more
openaire +3 more sources
2002
Many visual matching algorithms can be described in terms of the features and the inter-feature distance or metric. The most commonly used metric is the sum of squared differences (SSD), which is valid from a maximum likelihood perspective when the real noise distribution is Gaussian.
Sebe, Niculae, M. S. Lew
openaire +1 more source
Many visual matching algorithms can be described in terms of the features and the inter-feature distance or metric. The most commonly used metric is the sum of squared differences (SSD), which is valid from a maximum likelihood perspective when the real noise distribution is Gaussian.
Sebe, Niculae, M. S. Lew
openaire +1 more source
ENHANCED HIERARCHICAL SHAPE MATCHING FOR SHAPE TRANSFORMATION
International Journal of Shape Modeling, 2003Summary: The quality of 3D object transformation very often relies on the quality of the matching between the two objects. Geometric considerations regarding scale, rotation and translation, and user defined constraints are used to control the matching.
Ariel Shamir +2 more
openaire +2 more sources
ACM SIGGRAPH 2002 conference abstracts and applications, 2002
With the advent of the world wide web, the number of available 3D models has increased substantially and the challenge has changed from "How do we generate 3D models?" to "How do we find them?" In this sketch we describe a new 3D model matching and indexing algorithm that uses spherical harmonics to compute discriminating similarity measures without ...
Michael Kazhdan, Thomas A. Funkhouser
openaire +1 more source
With the advent of the world wide web, the number of available 3D models has increased substantially and the challenge has changed from "How do we generate 3D models?" to "How do we find them?" In this sketch we describe a new 3D model matching and indexing algorithm that uses spherical harmonics to compute discriminating similarity measures without ...
Michael Kazhdan, Thomas A. Funkhouser
openaire +1 more source
2011
Anpassung deformierbarer Formen ist zu einem wichtigen Baustein in der akademischen Welt sowie in der Industrie geworden. Gegeben zwei dreidimensionale Formen A und B, suchen wir nach einer Verformungsfunktion f, die die Deformation von A auf B abbildet. Die Funktion f wird durch eine Menge von korrespondierenden Punktepaaren diskretisiert. Leider sind
openaire +3 more sources
Anpassung deformierbarer Formen ist zu einem wichtigen Baustein in der akademischen Welt sowie in der Industrie geworden. Gegeben zwei dreidimensionale Formen A und B, suchen wir nach einer Verformungsfunktion f, die die Deformation von A auf B abbildet. Die Funktion f wird durch eine Menge von korrespondierenden Punktepaaren diskretisiert. Leider sind
openaire +3 more sources
Efficient matching of nonrectangular shapes
Annals of Mathematics and Artificial Intelligence, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amihood Amir, Martin Farach
openaire +2 more sources
An Approach to Perceptual Shape Matching
2006In contrast to geometric similarity, perceptual similarity is manifold and much more difficult to handle. Relatively few work is known towards capturing the perceptual similarity. In this work we introduce the concept of local shape width and show that it can be applied to measure the perceptual significance of shape parts.
Xiaoyi Jiang 0001, Sergej Lewin
openaire +1 more source
Hierarchical skeleton for shape matching
2016 IEEE International Conference on Image Processing (ICIP), 2016The skeleton is an efficient and complete shape descriptor often used for matching. However, existing skeleton-based shape matching methods are computationally intensive. To reduce the algorithmic complexity, we propose to exploit the natural hierarchy of the skeleton.
Leborgne, Aurélie +2 more
openaire +2 more sources
Information Theoretic Shape Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2014In this paper, we describe two related algorithms that provide both rigid and non-rigid point set registration with different computational complexity and accuracy. The first algorithm utilizes a nonlinear similarity measure known as correntropy.
Erion Hasanbelliu +2 more
openaire +2 more sources