Feature Curve Co‐Completion in Noisy Data. (May 2018)

• Record Type: Journal Article
• Authors: Gehre, Anne; Lim, Isaak; Kobbelt, Leif
• Is Part Of: Computer graphics forum. Volume 37:Number 2(2018)
• Page Start: 1
• Page End: 12
• Publication Date: 2018-05
• Subjects: CCS Concepts -- Computing methodologies → Shape Analysis; Computer graphics -- Periodicals; 006.605
• DOI: 10.1111/cgf.13337
• Languages: English
• ISSNs: 0167-7055

Abstract

Abstract: Feature curves on 3D shapes provide important hints about significant parts of the geometry and reveal their underlying structure. However, when we process real world data, automatically detected feature curves are affected by measurement uncertainty, missing data, and sampling resolution, leading to noisy, fragmented, and incomplete feature curve networks. These artifacts make further processing unreliable. In this paper we analyze the global co‐occurrence information in noisy feature curve networks to fill in missing data and suppress weakly supported feature curves. For this we propose an unsupervised approach to find meaningful structure within the incomplete data by detecting multiple occurrences of feature curve configurations (co‐occurrence analysis). We cluster and merge these into feature curve templates, which we leverage to identify strongly supported feature curve segments as well as to complete missing data in the feature curve network. In the presence of significant noise, previous approaches had to resort to user input, while our method performs fully automatic feature curve co‐completion. Finding feature reoccurrences however, is challenging since naïve feature curve comparison fails in this setting due to fragmentation and partial overlaps of curve segments. To tackle this problem we propose a robust method for partial curve matching. This provides us with the means to apply symmetry detection methods to identify co‐occurring configurations. Finally, Bayesian model selection enables us to detect and group re‐occurrences that describe the data well and with low redundancy.