Sharp edges, ridges, valleys and prongs are critical for the appearance and an accurate representation of a 3D model. In this paper, we propose a novel approach that deals with the global shape of features in a robust way. Based on a remeshing algorithm which delivers an isotropic mesh in a feature sensitive metric, features are recognized on multiple scales via integral invariants of local neighborhoods. Morphological and smoothing operations are then used for feature region extraction and classification into basic types such as ridges, valleys and prongs. The resulting representation of feature regions is further used for feature-specific editing operations.

No abstract uploaded!

A collaborative convex framework for factoring a data matrix <i>X</i> into a nonnegative product <i>AS</i> , with a sparse coefficient matrix <i>S</i> , is proposed. We restrict the columns of the dictionary matrix <i>A</i> to coincide with certain columns of the data matrix <i>X</i> , thereby guaranteeing a physically meaningful dictionary and dimensionality reduction. We use <i>l</i> _1, regularization to select the dictionary from the data and show that this leads to an exact convex relaxation of <i>l</i> ₀ in the case of distinct noise-free data. We also show how to relax the restriction-to- <i>X</i> constraint by initializing an alternating minimization approach with the solution of the convex model, obtaining a dictionary close to but not necessarily in <i>X</i> . We focus on applications of the proposed framework to hyperspectral endmember and abundance identification and also show an application to blind source separation of nuclear magnetic resonance data.

No abstract uploaded!

3D models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Model segmentation is an important step towards model understanding, and acts as a useful tool for different model processing applications, e.g. reverse engineering and modeling by example. We extend a random walk method used previously for image segmentation to give algorithms for both interactive and automatic model segmentation. This method is extremely efficient, and scales almost linearly with the number of faces, and the number of regions. For models of moderate size, interactive performance is achieved with commodity PCs. We demonstrate that this method can be applied to both triangle meshes and point cloud data. It is easy to implement, robust to noise in the model, and yields results suitable for downstream applications for both graphical and engineering models.