MODELBASE PARTITIONING USING PROPERTY MATRIX SPECTRA

Citation
K. Sengupta et Kl. Boyer, MODELBASE PARTITIONING USING PROPERTY MATRIX SPECTRA, Computer vision and image understanding, 70(2), 1998, pp. 177-196
Citations number
32
Categorie Soggetti
Computer Science Software Graphycs Programming","Computer Science Software Graphycs Programming
ISSN journal
10773142
Volume
70
Issue
2
Year of publication
1998
Pages
177 - 196
Database
ISI
SICI code
1077-3142(1998)70:2<177:MPUPMS>2.0.ZU;2-Z
Abstract
In this paper, we present an eigenvalue or spectral-based representati on for CAD models to be used in conjunction with the more traditional attributed graph based representation of these models. The eigenvalues provide a gross description of the structure of the objects and help to divide a large modelbase into structurally homogeneous partitions. Models in each partition are next hierarchically organized according t o the algorithm we presented in a previous paper [IEEE Trans. Pattern Anal. Machine Intell. 17, 1995, 321-332]. In recognition, gross featur es computed from an object in a range image are used to prune the mode lbase by selecting a few ''favorable'' partitions in which the correct object model is likely to lie. We also model the perturbations in the eigenvalues computed from objects in real scenes and show how this pe rturbation model can be used effectively during recognition. The parti tioning experiments presented here are for real range images using a m odelbase of 125 CAD objects with planar, cylindrical, and spherical su rfaces. From our recognition results, we observe that for a reasonable degree of error in the low-level processes (surface segmentation and grouping), the correct partition is always included. Experimental resu lts also point to a significant increase in recognition speed, even on modelbases much smaller than the ones we consider here. (C) 1998 Acad emic Press.