File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/383259.383282
- Scopus: eid_2-s2.0-0035156965
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Topology matching for fully automatic similarity estimation of 3D shapes
Title | Topology matching for fully automatic similarity estimation of 3D shapes |
---|---|
Authors | |
Keywords | shape recognition computer vision 3D search |
Issue Date | 2001 |
Citation | 28th International Conference on Computer Graphics and Interactive Techniques, Los Angeles, CA, 12-17 August 2001. In SIGGRAPH '01: Proceedings of the 28th annual conference on Computer graphics and interactive techniques, 2001, p. 203-212 How to Cite? |
Abstract | There is a growing need to be able to accurately and efficiently search visual data sets, and in particular, 3D shape data sets. This paper proposes a novel technique, called Topology Matching, in which similarity between polyhedral models is quickly, accurately, and automatically calculated by comparing Multiresolutional Reeb Graphs (MRGs). The MRG thus operates well as a search key for 3D shape data sets. In particular, the MRG represents the skeletal and topological structure of a 3D shape at various levels of resolution. The MRG is constructed using a continuous function on the 3D shape, which may preferably be a function of geodesic distance because this function is invariant to translation and rotation and is also robust against changes in connectivities caused by a mesh simplification or subdivision. The similarity calculation between 3D shapes is processed using a coarse-to-fine strategy while preserving the consistency of the graph structures, which results in establishing a correspondence between the parts of objects. The similarity calculation is fast and efficient because it is not necessary to determine the particular pose of a 3D shape, such as a rotation, in advance. Topology Matching is particularly useful for interactively searching for a 3D object because the results of the search fit human intuition well. © 2001 ACM. |
Persistent Identifier | http://hdl.handle.net/10722/289047 |
ISBN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hilaga, Masaki | - |
dc.contributor.author | Shinagawa, Yoshihisa | - |
dc.contributor.author | Kohmura, Taku | - |
dc.contributor.author | Kunii, Tosiyasu L. | - |
dc.date.accessioned | 2020-10-12T08:06:32Z | - |
dc.date.available | 2020-10-12T08:06:32Z | - |
dc.date.issued | 2001 | - |
dc.identifier.citation | 28th International Conference on Computer Graphics and Interactive Techniques, Los Angeles, CA, 12-17 August 2001. In SIGGRAPH '01: Proceedings of the 28th annual conference on Computer graphics and interactive techniques, 2001, p. 203-212 | - |
dc.identifier.isbn | 9781581133745 | - |
dc.identifier.uri | http://hdl.handle.net/10722/289047 | - |
dc.description.abstract | There is a growing need to be able to accurately and efficiently search visual data sets, and in particular, 3D shape data sets. This paper proposes a novel technique, called Topology Matching, in which similarity between polyhedral models is quickly, accurately, and automatically calculated by comparing Multiresolutional Reeb Graphs (MRGs). The MRG thus operates well as a search key for 3D shape data sets. In particular, the MRG represents the skeletal and topological structure of a 3D shape at various levels of resolution. The MRG is constructed using a continuous function on the 3D shape, which may preferably be a function of geodesic distance because this function is invariant to translation and rotation and is also robust against changes in connectivities caused by a mesh simplification or subdivision. The similarity calculation between 3D shapes is processed using a coarse-to-fine strategy while preserving the consistency of the graph structures, which results in establishing a correspondence between the parts of objects. The similarity calculation is fast and efficient because it is not necessary to determine the particular pose of a 3D shape, such as a rotation, in advance. Topology Matching is particularly useful for interactively searching for a 3D object because the results of the search fit human intuition well. © 2001 ACM. | - |
dc.language | eng | - |
dc.relation.ispartof | SIGGRAPH '01: Proceedings of the 28th annual conference on Computer graphics and interactive techniques | - |
dc.subject | shape recognition | - |
dc.subject | computer vision | - |
dc.subject | 3D search | - |
dc.title | Topology matching for fully automatic similarity estimation of 3D shapes | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1145/383259.383282 | - |
dc.identifier.scopus | eid_2-s2.0-0035156965 | - |
dc.identifier.spage | 203 | - |
dc.identifier.epage | 212 | - |