Matching sets of 3D segments

Concettina Guerra; Valerio Pascucci

doi:10.1117/12.364090

23 September 1999 Matching sets of 3D segments

Concettina Guerra, Valerio Pascucci

Proceedings Volume 3811, Vision Geometry VIII; (1999) https://doi.org/10.1117/12.364090
Event: SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, 1999, Denver, CO, United States

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.

Citation Download Citation

Concettina Guerra and Valerio Pascucci "Matching sets of 3D segments", Proc. SPIE 3811, Vision Geometry VIII, (23 September 1999); https://doi.org/10.1117/12.364090

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available