When detecting ridge-valley lines on 3D mesh model, estimation of the curvature and curvature derivatives may often yields to squiggly and noisy result, because the estimation is sensitive against unwanted surface noises. We present two algorithms to obtain smooth and noiseless ridge-valley lines. First, we apply an iterative procedure on ridge and valley vertices and their previous and next neighbors on connected feature lines, which leads to smooth lines. Secondly, we propose an algorithm to distinguish noises from meaningful feature lines based on graph theory model. Each separate feature line is considered as an undirected weighted graph which is called as Feature Graph. We can reasonably get rid of most noises and preserve meaningful f...
http://www.cvpapers.com/cvpr2014.htmlA method for identifying shape features of local nature on the ...
3D edge detection in voxel images provides points corresponding to the surfaces forming the 3D struc...
Most current algorithms typically lack in robustness to noise or do not handle T-shaped curve joinin...
Feature lines, especially view- and scale-independent ridge-valley lines can indicate most prominent...
We propose a simple and effective method for detecting view- and scale-independent ridge-valley line...
Feature lines are salient surface characteristics. Their definition involves third and fourth order ...
Polygonal mesh is the collection of vertices, edges and surfaces that defines the shape of a 3D obje...
Journal ArticleIn this paper, we present a novel two-step, variational and feature preserving smooth...
We present in this article an algorithm dedicated to the feature line detection on 3D triangulated o...
We propose an energy-based framework for approximating surfaces from a cloud of point measurements c...
Figure 1: The dragon model (left) is artificially corrupted by Gaussian noise (σ = 1/5 of the mean e...
Abstract A method for detection of salient ridges and ravines on surfaces approximated by dense tria...
Point-based geometry representations have become widely used in numerous contexts, ranging from part...
We propose a fast and robust method for detecting crest lines on surfaces approximated by dense tria...
Figure 1: Principal curvatures and creases computed at scales 2e and 10e, with e the average length ...
http://www.cvpapers.com/cvpr2014.htmlA method for identifying shape features of local nature on the ...
3D edge detection in voxel images provides points corresponding to the surfaces forming the 3D struc...
Most current algorithms typically lack in robustness to noise or do not handle T-shaped curve joinin...
Feature lines, especially view- and scale-independent ridge-valley lines can indicate most prominent...
We propose a simple and effective method for detecting view- and scale-independent ridge-valley line...
Feature lines are salient surface characteristics. Their definition involves third and fourth order ...
Polygonal mesh is the collection of vertices, edges and surfaces that defines the shape of a 3D obje...
Journal ArticleIn this paper, we present a novel two-step, variational and feature preserving smooth...
We present in this article an algorithm dedicated to the feature line detection on 3D triangulated o...
We propose an energy-based framework for approximating surfaces from a cloud of point measurements c...
Figure 1: The dragon model (left) is artificially corrupted by Gaussian noise (σ = 1/5 of the mean e...
Abstract A method for detection of salient ridges and ravines on surfaces approximated by dense tria...
Point-based geometry representations have become widely used in numerous contexts, ranging from part...
We propose a fast and robust method for detecting crest lines on surfaces approximated by dense tria...
Figure 1: Principal curvatures and creases computed at scales 2e and 10e, with e the average length ...
http://www.cvpapers.com/cvpr2014.htmlA method for identifying shape features of local nature on the ...
3D edge detection in voxel images provides points corresponding to the surfaces forming the 3D struc...
Most current algorithms typically lack in robustness to noise or do not handle T-shaped curve joinin...