Learn 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)
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)
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)
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)
We present a novel method for aligning images under arbitrary poses, based on finding correspondences between image region features. In contrast with using purely feature-based or intensity-based methods, we adopt a hybrid method that integrates the merits of both approaches. Our method uses a small number of automatically extracted scale-invariant salient(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)
We present a novel feature-based non-rigid image registration algorithm using a small number of automatically extracted points and their associated local salient region features. Our automatic registration is a hybrid approach co-optimizing point-based and image-based terms. Motivated by the paradigm of the TPS-RPM algorithm [6], we develop the RHDM (Robust(More)