Efficient Segmentation Method For Range Data

Thomas C. Henderson

doi:10.1117/12.933610

22 November 1982 Efficient Segmentation Method For Range Data

Thomas C. Henderson

Proceedings Volume 0336, Robot Vision; (1982) https://doi.org/10.1117/12.933610
Event: 1982 Technical Symposium East, 1982, Arlington, United States

Abstract

A method for finding planar faces in sets of range data images is described. First, the object points are extracted from the range data image (or images). These are then organized in a k-d tree using the x, y and z values as keys. From the k-d tree a spatial proximity graph is efficiently constructed. Finally, a set of seed points for a possible face is chosen, and the spatial proximity graph is used to guide the search for neighboring points lying on this face.

Citation Download Citation

Thomas C. Henderson "Efficient Segmentation Method For Range Data", Proc. SPIE 0336, Robot Vision, (22 November 1982); https://doi.org/10.1117/12.933610

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