A three-dimensional object similarity test using graph matching techniques

Carsten Maple; Yu Wang

doi:10.1109/IV.2004.1320169

A three-dimensional object similarity test using graph matching techniques

Carsten Maple
, Yu Wang

University of Bedfordshire

Research output: Contribution to journal › Conference article › peer-review

3 Citations (Scopus)

Abstract

In this paper we present method for finding similarities in a pair of three-dimensional objects. The method involves obtaining Boundary Cubes approximations to the two objects, see [14]. The Boundary Cubes algorithm is a modification to the well-known Marching Cubes algorithm of Lorensen and Cline [11]. Having obtained the approximations we can apply exact and inexact graph-matching algorithms to quantify the similarity between two objects. This paper considers methods for exact and inexact graph matching and provides novel and efficient algorithms for graph matching applied to Boundary Cubes representations.

Original language	English
Pages (from-to)	363-369
Number of pages	7
Journal	Proceedings of the Information Visualization Conference
Volume	8
DOIs	https://doi.org/10.1109/IV.2004.1320169
Publication status	Published - 9 Aug 2004
Event	Proceedings - Eighth International Conference on Information Visualisation, IV 2004 - London, United Kingdom Duration: 14 Jul 2004 → 16 Jul 2004

ASJC Scopus subject areas

Software
Signal Processing
Computer Vision and Pattern Recognition

Access to Document

10.1109/IV.2004.1320169

https://ieeexplore.ieee.org/document/1320169

Handle.net

Persistent link

Cite this

@article{0d6374de8b554270863c893dc2b12d38,

title = "A three-dimensional object similarity test using graph matching techniques",

abstract = "In this paper we present method for finding similarities in a pair of three-dimensional objects. The method involves obtaining Boundary Cubes approximations to the two objects, see [14]. The Boundary Cubes algorithm is a modification to the well-known Marching Cubes algorithm of Lorensen and Cline [11]. Having obtained the approximations we can apply exact and inexact graph-matching algorithms to quantify the similarity between two objects. This paper considers methods for exact and inexact graph matching and provides novel and efficient algorithms for graph matching applied to Boundary Cubes representations.",

author = "Carsten Maple and Yu Wang",

year = "2004",

month = aug,

day = "9",

doi = "10.1109/IV.2004.1320169",

language = "English",

volume = "8",

pages = "363--369",

journal = "Proceedings of the Information Visualization Conference",

issn = "1093-9547",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings - Eighth International Conference on Information Visualisation, IV 2004 ; Conference date: 14-07-2004 Through 16-07-2004",

}

TY - JOUR

T1 - A three-dimensional object similarity test using graph matching techniques

AU - Maple, Carsten

AU - Wang, Yu

PY - 2004/8/9

Y1 - 2004/8/9

N2 - In this paper we present method for finding similarities in a pair of three-dimensional objects. The method involves obtaining Boundary Cubes approximations to the two objects, see [14]. The Boundary Cubes algorithm is a modification to the well-known Marching Cubes algorithm of Lorensen and Cline [11]. Having obtained the approximations we can apply exact and inexact graph-matching algorithms to quantify the similarity between two objects. This paper considers methods for exact and inexact graph matching and provides novel and efficient algorithms for graph matching applied to Boundary Cubes representations.

AB - In this paper we present method for finding similarities in a pair of three-dimensional objects. The method involves obtaining Boundary Cubes approximations to the two objects, see [14]. The Boundary Cubes algorithm is a modification to the well-known Marching Cubes algorithm of Lorensen and Cline [11]. Having obtained the approximations we can apply exact and inexact graph-matching algorithms to quantify the similarity between two objects. This paper considers methods for exact and inexact graph matching and provides novel and efficient algorithms for graph matching applied to Boundary Cubes representations.

UR - https://www.scopus.com/pages/publications/4644313338

U2 - 10.1109/IV.2004.1320169

DO - 10.1109/IV.2004.1320169

M3 - Conference article

AN - SCOPUS:4644313338

SN - 1093-9547

VL - 8

SP - 363

EP - 369

JO - Proceedings of the Information Visualization Conference

JF - Proceedings of the Information Visualization Conference

T2 - Proceedings - Eighth International Conference on Information Visualisation, IV 2004

Y2 - 14 July 2004 through 16 July 2004

ER -

A three-dimensional object similarity test using graph matching techniques

Abstract

ASJC Scopus subject areas

Access to Document

Handle.net

Other files and links

Fingerprint

Cite this