Add to ORKGWe present a 3D matching framework based on a many-to-many matching algorithm that works with skele-tal representations of 3D volumetric objects. We demon-strate the performance of this approach on a large database of 3D objects containing more than 1000 exem-plars. The method is especially suited to matching objects with distinct part structure and is invariant to part ar-ticulation. Skeletal matching has an intuitive quality that helps in defining the search and visualizing the re-sults. In particular, the matching algorithm produces a di-rect correspondence between two skeletons and their parts, which can be used for registration and juxtaposi-tion. 1
This thesis is about geometric algorithms for shape-based image retrieval. The shapes we consider a...
Given a query that specifies partial shape, a Part-based 3D Model Retrieval (P3DMR) system would ret...
Similarity-based retrieval from shape databases typically employs a pairwise shape matcher and one o...
We present a 3D matching framework based on a many-to-many matching algorithm that works with skelet...
As an increasing number of digital images are generated, a demand for an efficient and effective ima...
Abstract—In this paper, we propose a new approach for 3D-shape matching. This approach encloses an o...
This paper describes a powerful inexact matching algorithm that has been applied with success to hig...
Skeletons are often used as a framework for part-based shape description and matching. This paper de...
Three dimensional object representations have become an integral part of modern computer graphic app...
[[abstract]]A multi-view representation scheme and a multi-matching strategy for 3D object recogniti...
The development of effective content-based multimedia search systems is an important research issue,...
In this PhD research study, we focus on building a content-based search engine for 3D articulated ge...
Abstract. This dissertation focuses on the problem of 3D object re-trieval from large datasets in a ...
Recent developments in techniques for modeling, digitizing and visualizing 3D shapes has led to an e...
International audienceThe majority of shape matching and retrieval methods use only one single shape...
This thesis is about geometric algorithms for shape-based image retrieval. The shapes we consider a...
Given a query that specifies partial shape, a Part-based 3D Model Retrieval (P3DMR) system would ret...
Similarity-based retrieval from shape databases typically employs a pairwise shape matcher and one o...
We present a 3D matching framework based on a many-to-many matching algorithm that works with skelet...
As an increasing number of digital images are generated, a demand for an efficient and effective ima...
Abstract—In this paper, we propose a new approach for 3D-shape matching. This approach encloses an o...
This paper describes a powerful inexact matching algorithm that has been applied with success to hig...
Skeletons are often used as a framework for part-based shape description and matching. This paper de...
Three dimensional object representations have become an integral part of modern computer graphic app...
[[abstract]]A multi-view representation scheme and a multi-matching strategy for 3D object recogniti...
The development of effective content-based multimedia search systems is an important research issue,...
In this PhD research study, we focus on building a content-based search engine for 3D articulated ge...
Abstract. This dissertation focuses on the problem of 3D object re-trieval from large datasets in a ...
Recent developments in techniques for modeling, digitizing and visualizing 3D shapes has led to an e...
International audienceThe majority of shape matching and retrieval methods use only one single shape...
This thesis is about geometric algorithms for shape-based image retrieval. The shapes we consider a...
Given a query that specifies partial shape, a Part-based 3D Model Retrieval (P3DMR) system would ret...
Similarity-based retrieval from shape databases typically employs a pairwise shape matcher and one o...