We present an algorithm for curve skeleton extraction via Laplacian-based contraction. Our algorithm can be applied to surfaces with boundaries, polygon soups, and point clouds. We develop a contraction operation that is designed to work on generalized discrete geometry data, particularly point clouds, via local Delaunay triangulation and topological thinning. Our approach is robust to noise and can handle moderate amounts of missing data, allowing skeleton-based manipulation of point clouds without explicit surface reconstruction. By avoiding explicit reconstruction, we are able to perform skeleton-driven topology repair of acquired point clouds in the presence of large amounts of missing data. In such cases, automatic surface reconstruction schemes tend to produce incorrect surface topology. We show that the curve skeletons we extract provide an intuitive and easy-to-manipulate structure for effective topology modification, leading to more faithful surface reconstruction.

No abstract

Low cost carbon paste using as the back electrode for perovskite solar cells (PSCs), interfacial engineering plays a crucial role in both bi-interfacial structure and tri-interfacial structure.

Partial Differential Equations (PDEs) have been successful in solving many low-level vision tasks. However, it is a challenging task to directly utilize PDEs for visual saliency detection due to the difficulty in incorporating human perception and high-level priors to a PDE system. Instead of designing PDEs with fixed formulation and boundary condition, this paper proposes a novel framework for adaptively learning a PDE system from an image for visual saliency detection. We assume that the saliency of image elements can be carried out from the relevances to the saliency seeds (i.e., the most representative salient elements). In this view, a general Linear Elliptic System with Dirichlet boundary (LESD) is introduced to model the diffusion from seeds to other relevant points. For a given image, we first learn a guidance map to fuse human prior knowledge to the diffusion system. Then by optimizing a discrete submodular function constrained with this LESD and a uniform matroid, the saliency seeds (i.e., boundary conditions) can be learnt for this image, thus achieving an optimal PDE system to model the evolution of visual saliency. Experimental results on various challenging image sets show the superiority of our proposed learning-based PDEs for visual saliency detection.

This paper proposes an unsupervised model to inspect various detects in fabric images with diverse textures. A fabric image with defects is usually composed of a relatively consistent background texture and some sparse defects, which can be represented as a low-rank matrix plus a sparse matrix in a certain feature space. The process is formulated as a least squares regression based subspace segmentation model, which is convex, smooth and can be solved efficiently. A simple and effective prior is also learnt from local texture features of the image itself. Instead of considering only the feature space' s global structure, the local prior is incorporated with it seamlessly by the proposed subspace segmentation model to guide and improve the segmentation. Experiments on a variety of fabric images demonstrate the effectiveness and robustness of the proposed method. Compared with existing methods, our method is more robust and locates various defects more precisely.