2009 2nd International Conference on Biomedical Engineering and Informatics 2009
DOI: 10.1109/bmei.2009.5305186
|View full text |Cite
|
Sign up to set email alerts
|

A Reduction Method of Three-Dimensional Point Cloud

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 4 publications
0
5
0
Order By: Relevance
“…The point cloud is so large that the computational complexity is very intensive, especially for the Delaunay triangulation process. Usually, the overdense data is not necessary, so some point cloud reduction algorithms can be applied to reduce the computational cost [18]. In this paper, an improved bounding box method is used.…”
Section: Discussionmentioning
confidence: 99%
“…The point cloud is so large that the computational complexity is very intensive, especially for the Delaunay triangulation process. Usually, the overdense data is not necessary, so some point cloud reduction algorithms can be applied to reduce the computational cost [18]. In this paper, an improved bounding box method is used.…”
Section: Discussionmentioning
confidence: 99%
“…In particular, feature extraction, registration and simplification are the most important visual processing tools recently worked upon in the rapid prototyping community. In (Mérigit et al, 2011;Novatnack and Nishino, 2007;Zhao et al, 2010;Zheng et al, 2009), normal estimation and corner extraction over unorganized point sets are algorithmically defined in order to perform UPS registration (Lin and He, 2011;Myronenko and Song, 2010;Rusu et al, 2008) or simplification (Sareen et al, 2009;Song et al, 2009;Xiao and Huang, 2010) for instance. A lot of works also deal with surface segmentation issues like in (Douillard et al, 2010;Huang & Menq, 2001;Jagannathan & Miller, 2007;Rabbani et al, 2006).…”
Section: Unorganized Point Set Filteringmentioning
confidence: 99%
“…The effectiveness and performance of the proposed approach are validated and illustrated through case studies using synthetic as well as practical data sets. Song [7] presented a convenient way to solve the problem. The scattered point cloud data is first regularized and compressed by the octree structure and then reduced further according to a curvature rule.…”
Section: Introductionmentioning
confidence: 99%