Share Email Print

Proceedings Paper

Matching sets of 3D segments
Author(s): Concettina Guerra; Valerio Pascucci
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The problem of matching 3D objects has been studied extensively in computer vision. Here we consider the case of polyhedral objects extracted from range images and presented in terms of 3D lines. Given two sets of line segments A and B the problem is to find a rigid body transformation T that minimizes a given dissimilarity measure between T(A) and B. We discuss two practical approximate solutions to the segment matching problem in 3D that can be used to recognize planar- faced objects from range data. The first method is based on indexing and the second is a minimization of the Hausdorff distance. We show the advantage of an integrated use of the two strategies improving the overall performance without degradation in the quality of the results.

Paper Details

Date Published: 23 September 1999
PDF: 11 pages
Proc. SPIE 3811, Vision Geometry VIII, (23 September 1999); doi: 10.1117/12.364090
Show Author Affiliations
Concettina Guerra, Univ. degli Studi di Padova (United States)
Valerio Pascucci, Univ. of Texas/Austin (United States)

Published in SPIE Proceedings Vol. 3811:
Vision Geometry VIII
Longin Jan Latecki; Robert A. Melter; David M. Mount; Angela Y. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top