Identification and Analysis of Airborne Laser Swath Mapping Data in a Novel Feature Space

被引:13
作者
Luzum, Brian J. [1 ]
Slatton, K. Clint [1 ,2 ]
Shrestha, Ramesh L. [1 ]
机构
[1] Univ Florida, Dept Civil & Coastal Engn, Gainesville, FL 32611 USA
[2] Univ Florida, Dept Elect & Comp Engn, Gainesville, FL 32611 USA
关键词
Airborne laser swath mapping (ALSM); distance measure; feature space; lidar;
D O I
10.1109/LGRS.2004.832229
中图分类号
P3 [地球物理学]; P59 [地球化学];
学科分类号
0708 ; 070902 ;
摘要
Several novel features are examined to determine their effectiveness in separating buildings from trees in airborne laser swath mapping (ALSM) data. New one- and two-dimensional distance measures are created to quantify the separability of the classes using the different features. Several features involving the intensity of the laser returns were found to be highly effective at separating the classes. The new distance measure provides insight into what makes a good/bad feature when discriminating between classes. It also lays the groundwork for future classification of ALSM data by providing a systematic method of ranking features to be used for classification.
引用
收藏
页码:268 / 271
页数:4
相关论文
共 13 条
  • [1] Processing of laser scanner data - algorithms and applications
    Axelsson, PE
    [J]. ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, 1999, 54 (2-3) : 138 - 147
  • [2] Some new indexes of cluster validity
    Bezdek, JC
    Pal, NR
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1998, 28 (03): : 301 - 315
  • [3] Carter W., 2001, EOS, Transac tions of American Geophysical Union, V82, P549, DOI DOI 10.1029/01EO00321
  • [4] Carter W. E., 2001, T AGU, V82, P550
  • [5] CARTER WE, 2001, T AGU, V82, P555
  • [6] Davies D. L., 1979, IEEE T PATTERN ANAL, V1, P2224
  • [7] Dunn J.C., 1973, J CYBERNETICS, V3, P32, DOI DOI 10.1080/01969727308546046
  • [8] Hart, 2006, PATTERN CLASSIFICATI
  • [9] Hug C., 1997, AUT EXTR MAN MAD OBJ
  • [10] Data clustering: A review
    Jain, AK
    Murty, MN
    Flynn, PJ
    [J]. ACM COMPUTING SURVEYS, 1999, 31 (03) : 264 - 323