Learn More
This paper describes a robust method for crease detection and curvature estimation on large, noisy triangle meshes. We assume that these meshes are approximations of piecewise-smooth surfaces derived from range or medical imaging systems and thus may exhibit measurement or even registration noise. The proposed algorithm, which we call normal vector voting,(More)
In the short time since publication of Boykov and Jolly's seminal paper [3], graph cuts have become well established as a leading method in 2D and 3D semi-automated image segmentation. Although this approach is computationally feasible for many tasks, the memory overhead and supralin-ear time complexity of leading algorithms results in an excessive(More)
In this paper, we describe a robust method for the estimation of curvature on a triangle mesh, where this mesh is a discrete approximation of a piecewise smooth surface. The proposed method avoids the computationally expensive process of surface fitting and instead employs normal voting to achieve robust results. This method detects crease discontinuities(More)
This paper proposes a new, efficient surface representation method for surface matching. A feature carrier for a surface point, which is a set of two-dimensional (2-D) contours that are the projections of geodesic circles on the tangent plane, is generated. The carrier is named point fingerprint because its pattern is similar to human fingerprints and plays(More)
This paper presents a framework of surface modeling from multi-view range and color images. The input to the algorithms are pairs of triangle meshes and color images, and each pair is obtained by a single-view scanning. In the proposed framework, the triangle meshes from raw data are first processed by the novel surface denoising algorithm based on area(More)
Triangle meshes are widely used in representing surfaces in computer vision and computer graphics. Although 2D image processing-based edge detection techniques have been popular in many application areas, they are not well developed for surfaces represented by triangle meshes. This paper proposes a robust edge detection algorithm for triangle meshes and its(More)
This paper presents an approach based on graph cuts initially used for motion segmentation that is being applied to the non-rigid registration problem. The main contribution of our method is the formulation of landmarks in the graph cut minimization framework. In the graph cut method, we add a penalty cost based on landmarks to the data energy. In the(More)
  • Y Sun, J K Paik, A Koschan, M A Abidi
  • 2001
This paper presents a framework of surface model-ing from multi-view range data. The input to the algorithms are triangle meshes, each of which is from a single view range scan. The triangle meshes generated from raw data are first processed by the proposed area decreasing flow for surface denoising. Although the proposed flow is mathematically equivalent(More)
In this paper, we investigate the impact of intensity edge maps (IEMs) on the segmentation of noisy range images. Two edge-based segmentation algorithms are considered. The first is a watershed-based segmentation technique and the other is the scan-line grouping technique. Each of these algorithms is implemented in two different forms. In the first form, an(More)