Non-Rigid Puzzles
- URL: http://arxiv.org/abs/2011.13076v1
- Date: Thu, 26 Nov 2020 00:32:30 GMT
- Title: Non-Rigid Puzzles
- Authors: Or Litany, Emanuele Rodol\`a, Alex Bronstein, Michael Bronstein,
Daniel Cremers
- Abstract summary: We present a non-rigid multi-part shape matching algorithm.
We assume to be given a reference shape and its multiple parts undergoing a non-rigid deformation.
Experimental results on synthetic as well as real scans demonstrate the effectiveness of our method.
- Score: 50.213265511586535
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Shape correspondence is a fundamental problem in computer graphics and
vision, with applications in various problems including animation, texture
mapping, robotic vision, medical imaging, archaeology and many more. In
settings where the shapes are allowed to undergo non-rigid deformations and
only partial views are available, the problem becomes very challenging. To this
end, we present a non-rigid multi-part shape matching algorithm. We assume to
be given a reference shape and its multiple parts undergoing a non-rigid
deformation. Each of these query parts can be additionally contaminated by
clutter, may overlap with other parts, and there might be missing parts or
redundant ones. Our method simultaneously solves for the segmentation of the
reference model, and for a dense correspondence to (subsets of) the parts.
Experimental results on synthetic as well as real scans demonstrate the
effectiveness of our method in dealing with this challenging matching scenario.
Related papers
- Beyond Complete Shapes: A quantitative Evaluation of 3D Shape Matching Algorithms [41.95394677818476]
Finding correspondences between 3D shapes is an important problem in computer vision, graphics and beyond.
We provide a generic and flexible framework for the procedural generation of challenging partial shape matching scenarios.
We manually create cross-dataset correspondences between seven existing (complete geometry) shape matching datasets, leading to a total of 2543 shapes.
arXiv Detail & Related papers (2024-11-05T21:08:19Z) - Geometrically Consistent Partial Shape Matching [50.29468769172704]
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics.
An often neglected but essential property of matching geometrics is consistency.
We propose a novel integer linear programming partial shape matching formulation.
arXiv Detail & Related papers (2023-09-10T12:21:42Z) - A Light Touch Approach to Teaching Transformers Multi-view Geometry [80.35521056416242]
We propose a "light touch" approach to guiding visual Transformers to learn multiple-view geometry.
We achieve this by using epipolar lines to guide the Transformer's cross-attention maps.
Unlike previous methods, our proposal does not require any camera pose information at test-time.
arXiv Detail & Related papers (2022-11-28T07:54:06Z) - 3D Textured Shape Recovery with Learned Geometric Priors [58.27543892680264]
This technical report presents our approach to address limitations by incorporating learned geometric priors.
We generate a SMPL model from learned pose prediction and fuse it into the partial input to add prior knowledge of human bodies.
We also propose a novel completeness-aware bounding box adaptation for handling different levels of scales.
arXiv Detail & Related papers (2022-09-07T16:03:35Z) - Video Anomaly Detection by Solving Decoupled Spatio-Temporal Jigsaw
Puzzles [67.39567701983357]
Video Anomaly Detection (VAD) is an important topic in computer vision.
Motivated by the recent advances in self-supervised learning, this paper addresses VAD by solving an intuitive yet challenging pretext task.
Our method outperforms state-of-the-art counterparts on three public benchmarks.
arXiv Detail & Related papers (2022-07-20T19:49:32Z) - Learning to Assemble Geometric Shapes [40.2815083025929]
Assembling parts into an object is a problem that arises in a variety of contexts in the real world and involves numerous applications in science and engineering.
Previous work tackles limited cases with identical unit parts or jigsaw-style parts of textured shapes.
In this work, we introduce the more challenging problem of shape assembly, which involves textureless fragments of arbitrary shapes with indistinctive junctions.
arXiv Detail & Related papers (2022-05-24T06:07:13Z) - Registration Techniques for Deformable Objects [1.713291434132985]
In general, the problem of non-rigid registration is about matching two different scans of a dynamic object taken at two different points in time.
Since new parts of the model may come into view and other parts get occluded in between two scans, the region of overlap is a subset of both scans.
This thesis is addressing is mapping deforming objects and localizing cameras in the environment at the same time.
arXiv Detail & Related papers (2021-11-07T11:25:36Z) - Discovering 3D Parts from Image Collections [98.16987919686709]
We tackle the problem of 3D part discovery from only 2D image collections.
Instead of relying on manually annotated parts for supervision, we propose a self-supervised approach.
Our key insight is to learn a novel part shape prior that allows each part to fit an object shape faithfully while constrained to have simple geometry.
arXiv Detail & Related papers (2021-07-28T20:29:16Z) - Shape Completion via IMLE [9.716911810130576]
Shape completion is the problem of completing partial input shapes such as partial scans.
We propose a novel multimodal shape completion technique that is effectively able to learn a one-to-many mapping.
We show that our method is superior to alternatives in terms of completeness and diversity of shapes.
arXiv Detail & Related papers (2021-06-30T17:45:10Z) - Pictorial and apictorial polygonal jigsaw puzzles: The lazy caterer
model, properties, and solvers [14.08706290287121]
We formalize a new type of jigsaw puzzle where the pieces are general convex polygons generated by cutting through a global polygonal shape/image with an arbitrary number of straight cuts.
We analyze the theoretical properties of such puzzles, including the inherent challenges in solving them once pieces are contaminated with geometrical noise.
arXiv Detail & Related papers (2020-08-17T22:07:40Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.