Structural-surface extraction from 3-D laser-radar point clouds

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 5412, Issue , 2004, Pages 345-353

  Lersch, James R ^a   Webb, Brian N ^a   West, Karen F ^a  

^a SCIENCE APPLICATIONS INTERNATIONAL CORPORATION   (United States)

Author keywords

3D; Filtering; LADAR; Minimum spanning tree; Point cloud; Region growing; Scanning; Segmentation; Structural surface element

Indexed keywords

3-D LADAR DATA; MINIMUM SPANNING TREE; POINT CLOUD; REGION GROWING; STRUCTURAL SURFACE ELEMENT;

ACOUSTIC NOISE; ALGORITHMS; ARRAYS; DATA ACQUISITION; DATA STRUCTURES; FILTRATION; INFORMATION RETRIEVAL; SENSORS; STATISTICAL METHODS;

OPTICAL RADAR;

EID: 10044236667     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.542701     Document Type: Conference Paper

References (16)

1. J. L. Bentley, Multidimensional Binary Search Trees Used for Associative Searching, Communications of the ACM, Vol. 18, pp. 509-517, September 1975.
2. J. L. Bentley, Decomposable Searching Problems, Information Processing Letters, vol. 8, pp. 244 - 251, June 1979.
3. J. L. Bentley and H. A. Maurer, Efficient Worst-Case Data Structures for Range Searching, Acta Informatica, vol. 13, pp. 155-168, 1980.
4. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, Berlin: Springer, 1998.
5. B. Chazelle and L. J. Guibas, Fractional Cascading: I. A Data Structuring Technique, Algorithmica, Vol. 1, 133-162, 1986.
6. B. Chazelle and L. J. Guibas, Fractional Cascading: II. Applications, Algorithmica, Vol. 1, pp. 163-191, 1986.
7. D. Cheriton and R. E. Tarjan, Finding Minimum Spanning Trees, SIAM Journal on Computing, Vol. 5, No. 4, pp. 724-742, Dec. 1976.
8. E. W. Dijkstra, A Note on Two Problems in Connection with Graphs, Numeriche Mathematics, Vol. 1, No. 5, pp. 269-271, Oct. 1959.
9. O. D. Faugeras, M. Hebert, The Representation, Recognition, and Locating of 3-D Objects, The International Journal of Robotics Research, Vol. 5, No. 3, pp. 27-52, 1986.
10. J. B. Kruskal, Jr., On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, Proceedings of the American Mathematical Society, Vol. 7, pp. 48-50, 1956.
11. J. R. Lersch, et al., Segmentation of multiband imagery using minimum spanning trees, Algorithms for Multispectral and Hyperspectral Imagery II, Proceedings of SPIE Vol. 2758, 1996.
12. th Annual Symposium on Foundations of Computer Science, pp. 28-34, Oct. 1978.
13. R. C. Prim, Shortest Connection Networks and Some Generalizations, Bell System Technical Journal, Vol. 36, pp. 1389-1401, Nov. 1957.
14. H. Samet, The Design and Analysis of Spatial Data Structures, Reading, Massachusetts: Addison-Wesley Publishing Company, Inc., 1989.
15. K. F. West et al., Automatic extraction and identification of lines of communication from high-resolution multispectral imagery, Algorithms for Multispectral and Hyperspectral Imagery II, Proceedings of SPIE Vol. 2758, 1996.
16. K. F. West et al., Context-driven automated target detection in 3-D data, in Automatic Target Recognition XIV, Proceedings of SPIE Vol. 5426, 2004.