• DocumentCode
    681321
  • Title

    Normal estimation algorithm for point cloud using KD-Tree

  • Author

    Liu Ran ; Wan Wanggen ; Zhou Yiyuan ; Lu Libing ; Zhang Ximin

  • Author_Institution
    Sch. of Commun. & Inf. Eng. Inst. of Smart City, Shanghai Univ., Shanghai, China
  • fYear
    2013
  • fDate
    19-20 Aug. 2013
  • Firstpage
    334
  • Lastpage
    337
  • Abstract
    This paper proposes the normal vector estimation algorithm based on KD-Tree. The speed of searching neighbor field is improved by utilizing KD-Tree data structure. The orientation of normal vectors computed by PCA is ambiguous and confused. In order to solve this problem, the viewpoint of point cloud is set to check and flip over the orientation. For the purpose of obtaining the correct normal vector estimation, the scope of neighbor field is extended to improve the antinoise ability of normal vector estimation. The experiment result proves that the normal vector estimation algorithm is robust.
  • Keywords
    data visualisation; estimation theory; principal component analysis; tree data structures; KD-tree data structure; PCA; antinoise ability; neighbor field; normal vector estimation algorithm; point cloud; Euclidean Distance; Neighbor Field; Normal Vector; Orientation of Normal Vector; PCA; Point Cloud;
  • fLanguage
    English
  • Publisher
    iet
  • Conference_Titel
    Smart and Sustainable City 2013 (ICSSC 2013), IET International Conference on
  • Conference_Location
    Shanghai
  • Electronic_ISBN
    978-1-84919-707-6
  • Type

    conf

  • DOI
    10.1049/cp.2013.1978
  • Filename
    6737842