Feature Curve Co-Completion in Noisy Data

dc.contributor.authorGehre, Anneen_US
dc.contributor.authorLim, Isaaken_US
dc.contributor.authorKobbelt, Leifen_US
dc.contributor.editorGutierrez, Diego and Sheffer, Allaen_US
dc.date.accessioned2018-04-14T18:22:55Z
dc.date.available2018-04-14T18:22:55Z
dc.date.issued2018
dc.description.abstractFeature 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 (cooccurrence 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.en_US
dc.description.number2
dc.description.sectionheadersCurves and Details
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume37
dc.identifier.doi10.1111/cgf.13337
dc.identifier.issn1467-8659
dc.identifier.pages1-12
dc.identifier.urihttps://doi.org/10.1111/cgf.13337
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf13337
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectComputing methodologies
dc.subjectShape Analysis
dc.titleFeature Curve Co-Completion in Noisy Dataen_US
Files
Collections