TL;DR
This paper introduces a new sparse surface representation method that effectively captures shape features and is robust against over-fitting, suitable for geometry processing tasks like mesh compression.
Contribution
It proposes a novel feature-aware mesh subdivision and combines global dictionary learning with modified Orthogonal Marching Pursuit for surface approximation.
Findings
Preserves shape features effectively.
Robust to over-fitting in surface approximation.
Promising for mesh compression and surface re-sampling.
Abstract
The sparse representation of signals defined on Euclidean domains has been successfully applied in signal processing. Bringing the power of sparse representations to non-regular domains is still a challenge, but promising approaches have started emerging recently. In this paper, we investigate the problem of sparsely representing discrete surfaces and propose a new representation that is capable of providing tools for solving different geometry processing problems. The sparse discrete surface representation is obtained by combining innovative approaches into an integrated method. First, to deal with irregular mesh domains, we devised a new way to subdivide discrete meshes into a set of patches using a feature-aware seed sampling. Second, we achieve good surface approximation with over-fitting control by combining the power of a continuous global dictionary representation with a modified…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
