Procedings of the British Machine Vision Conference 2007 2007
DOI: 10.5244/c.21.96
|View full text |Cite
|
Sign up to set email alerts
|

Denoising Manifold and Non-Manifold Point Clouds

Abstract: The faithful reconstruction of 3-D models from irregular and noisy point samples is a task central to many applications of computer vision and graphics. We present an approach to denoising that naturally handles intersections of manifolds, thus preserving high-frequency details without oversmoothing. This is accomplished through the use of a modified locally weighted regression algorithm that models a neighborhood of points as an implicit product of linear subspaces. By posing the problem as one of energy mini… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2010
2010
2013
2013

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 16 publications
0
5
0
Order By: Relevance
“…Such objects possess sharp features such as corners and edges which are created when these smooth surfaces intersect. One way to overcome this is may be to use a modified local regression technique, such as presented in [35], that models sharp intersections as an implicit product of lower dimensional subspaces. The geometric fitting of these sharp features may be done by iteratively first solving a generalized eigenvector problem to fit a smooth surface and then subjecting the solution to some non-linear constraints required for the model parameters to represent a degenerate surface.…”
Section: Discussionmentioning
confidence: 99%
“…Such objects possess sharp features such as corners and edges which are created when these smooth surfaces intersect. One way to overcome this is may be to use a modified local regression technique, such as presented in [35], that models sharp intersections as an implicit product of lower dimensional subspaces. The geometric fitting of these sharp features may be done by iteratively first solving a generalized eigenvector problem to fit a smooth surface and then subjecting the solution to some non-linear constraints required for the model parameters to represent a degenerate surface.…”
Section: Discussionmentioning
confidence: 99%
“…These approaches are usually time expensive, due to the enlarged state space. Aiming to reduce noise, Unnikrishnan and Hebert locally fit high-order polynomials to 3D data [17]. However, large-scale deformations will not be corrected by such a local approach.…”
Section: Simultaneous Localization and Mappingmentioning
confidence: 99%
“…surface smoothness, water tightness, viewpoint invariance and topology [BMR*99, AC01, Flö09, DG03, CSD04, JR07, DLRW09, TOZ*11, SSZCO10, KBH06]. For noisy clouds, we distinguish between denoising [UH07] and surface extraction methods [DG04, SW09, MDD*10]. Chang et al .…”
Section: Related Workmentioning
confidence: 99%
“…Section 4 presents CSD04, JR07, DLRW09, TOZ*11, SSZCO10,KBH06]. For noisy clouds, we distinguish between denoising [UH07] and surface extraction methods [DG04, SW09, MDD*10]. Chang et al present a comprehensive comparison of the strengths and limitations of 16 surface reconstruction methods [CLK09].…”
Section: Introductionmentioning
confidence: 99%