139 research outputs found
Feature preserving smoothing of 3D surface scans
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2004.Includes bibliographical references (p. 63-70).With the increasing use of geometry scanners to create 3D models, there is a rising need for effective denoising of data captured with these devices. This thesis presents new methods for smoothing scanned data, based on extensions of the bilateral filter to 3D. The bilateral filter is a non-linear, edge-preserving image filter; its extension to 3D leads to an efficient, feature preserving filter for a wide class of surface representations, including points and "polygon soups."by Thouis Raymond Jones.S.M
Robust Feature Detection and Local Classification for Surfaces Based on Moment Analysis
The stable local classification of discrete surfaces with respect to features such as edges and corners or concave and convex regions, respectively, is as quite difficult as well as indispensable for many surface processing applications. Usually, the feature detection is done via a local curvature analysis. If concerned with large triangular and irregular grids, e.g., generated via a marching cube algorithm, the detectors are tedious to treat and a robust classification is hard to achieve. Here, a local classification method on surfaces is presented which avoids the evaluation of discretized curvature quantities. Moreover, it provides an indicator for smoothness of a given discrete surface and comes together with a built-in multiscale. The proposed classification tool is based on local zero and first moments on the discrete surface. The corresponding integral quantities are stable to compute and they give less noisy results compared to discrete curvature quantities. The stencil width for the integration of the moments turns out to be the scale parameter. Prospective surface processing applications are the segmentation on surfaces, surface comparison, and matching and surface modeling. Here, a method for feature preserving fairing of surfaces is discussed to underline the applicability of the presented approach.
Robust Feature-Preserving Mesh Denoising Based on Consistent Sub-Neighborhoods
published_or_final_versio
Feature preserving variational smoothing of terrain data
Journal ArticleIn this paper, we present a novel two-step, variational and feature preserving smoothing method for terrain data. The first step computes the field of 3D normal vectors from the height map and smoothes them by minimizing a robust penalty function of curvature. This penalty function favors piecewise planar surfaces; therefore, it is better suited for processing terrain data then previous methods which operate on intensity images. We formulate the total curvature of a height map as a function of its normals. Then, the gradient descent minimization is implemented with a second-order partial differential equation (PDE) on the field of normals. For the second step, we define another penalty function that measures the mismatch between the the 3D normals of a height map model and the field of smoothed normals from the first step. Then, starting with the original height map as the initialization, we fit a non-parametric terrain model to the smoothed normals minimizing this penalty function. This gradient descent minimization is also implemented with a second-order PDE. We demonstrate the effectiveness of our approach with a ridge/gully detection application
Non-Iterative, Feature-Preserving Mesh Smoothing
With the increasing use of geometry scanners to create 3D models, there is a rising need for fast and robust mesh smoothing to remove inevitable noise in the measurements. While most previous work has favored diffusion-based iterative techniques for feature-preserving smoothing, we propose a radically different approach, based on robust statistics and local first-order predictors of the surface. The robustness of our local estimates allows us to derive a non-iterative feature-preserving filtering technique applicable to arbitrary "triangle soups". We demonstrate its simplicity of implementation and its efficiency, which make it an excellent solution for smoothing large, noisy, and non-manifold meshes.Singapore-MIT Alliance (SMA
Segmentation Based Mesh Denoising
Feature-preserving mesh denoising has received noticeable attention recently.
Many methods often design great weighting for anisotropic surfaces and small
weighting for isotropic surfaces, to preserve sharp features. However, they
often disregard the fact that small weights still pose negative impacts to the
denoising outcomes. Furthermore, it may increase the difficulty in parameter
tuning, especially for users without any background knowledge. In this paper,
we propose a novel clustering method for mesh denoising, which can avoid the
disturbance of anisotropic information and be easily embedded into
commonly-used mesh denoising frameworks. Extensive experiments have been
conducted to validate our method, and demonstrate that it can enhance the
denoising results of some existing methods remarkably both visually and
quantitatively. It also largely relaxes the parameter tuning procedure for
users, in terms of increasing stability for existing mesh denoising methods
Geometric surface smoothing via anisotropic diffusion of normals
Journal ArticleThis paper introduces a method for smoothing complex, noisy surfaces, while preserving (and enhancing) sharp, geometric features. It has two main advantages over previous approaches to feature preserving surface smoothing. First is the use of level set surface models, which allows us to process very complex shapes of arbitrary and changing topology. This generality makes it well suited for processing surfaces that are derived directly from measured data. The second advantage is that the proposed method derives from a well-founded formulation, which is a natural generalization of anisotropic diffusion, as used in image processing. This formulation is based on the proposition that the generalization of image filtering entails filtering the normals of the surface, rather than processing the positions of points on a mesh
Nonlinear Spectral Geometry Processing via the TV Transform
We introduce a novel computational framework for digital geometry processing,
based upon the derivation of a nonlinear operator associated to the total
variation functional. Such operator admits a generalized notion of spectral
decomposition, yielding a sparse multiscale representation akin to
Laplacian-based methods, while at the same time avoiding undesirable
over-smoothing effects typical of such techniques. Our approach entails
accurate, detail-preserving decomposition and manipulation of 3D shape geometry
while taking an especially intuitive form: non-local semantic details are well
separated into different bands, which can then be filtered and re-synthesized
with a straightforward linear step. Our computational framework is flexible,
can be applied to a variety of signals, and is easily adapted to different
geometry representations, including triangle meshes and point clouds. We
showcase our method throughout multiple applications in graphics, ranging from
surface and signal denoising to detail transfer and cubic stylization.Comment: 16 pages, 20 figure
- …