Multiple Shape Correspondence by Dynamic Programming

Download

index.pdf

Date

2014-10-01

Author

Sahillioğlu, Yusuf

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

168
views

0
downloads

We present a multiple shape correspondence method based on dynamic programming, that computes consistent bijective maps between all shape pairs in a given collection of initially unmatched shapes. As a fundamental distinction from previous work, our method aims to explicitly minimize the overall distortion, i.e., the average isometric distortion of the resulting maps over all shape pairs. We cast the problem as optimal path finding on a graph structure where vertices are maps between shape extremities. We exploit as much context information as possible using a dynamic programming based algorithm to approximate the optimal solution. Our method generates coarse multiple correspondences between shape extremities, as well as denser correspondences as by-product. We assess the performance on various mesh sequences of (nearly) isometric shapes. Our experiments show that, for isometric shape collections with non-uniform triangulation and noise, our method can compute relatively dense correspondences reasonably fast and outperform state of the art in terms of accuracy.

URI

https://hdl.handle.net/11511/42043

Journal

COMPUTER GRAPHICS FORUM

DOI

https://doi.org/10.1111/cgf.12480

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

Image segmentation by fusion of low level and domain specific information via Markov Random Fields Karadag, Ozge Oztimur; Yarman Vural, Fatoş Tunay (2014-09-01) We propose a new segmentation method by fusing a set of top-down and bottom-up segmentation maps under the Markov Random Fields (MRF) framework. The bottom-up segmentation maps are obtained by varying the parameters of an unsupervised segmentation method, such as Mean Shift. The top-down segmentation maps are constructed from some priori information, called domain specific information (DSI), received from a domain expert in the form of general properties about the image dataset. The properties are then used...
Dense depth map estimation for multiple view coding Ozkalayci, Burak; Alatan, Abdullah Aydın (2006-01-01) In this paper the basics of a proposed method that handles the stereo and especially multiple view coding problem in a geometrical way, are explained. For this purpose, estimation of the depth maps of the multiple views, captured by fully calibrated cameras, are done. In depth map estimation problem Markov Random Field modelling is used to have a depth map in a desired smoothness and in an efficient coding fashion. The geometric structure which is acquired by the depth map estimation, is used to reconstruct...
Multiple Description Coding of 3D Dynamic Meshes Based on Temporal Subsampling Bici, M. Oguz; Akar, Gözde (2010-01-21) In this paper, we propose a Multiple Description Coding (MDC) method for reliable transmission of compressed time consistent 3D dynamic meshes. It trades off reconstruction quality for error resilience to provide the best expected reconstruction of 3D mesh sequence at the decoder side. The method is based on partitioning the mesh frames into two sets by temporal subsampling and encoding each set independently by a 3D dynamic mesh coder. The encoded independent bitstreams or so-called descriptions are transm...
Coarse-to-Fine Isometric Shape Correspondence by Tracking Symmetric Flips Sahillioğlu, Yusuf; Yemez, Y. (2013-02-01) We address the symmetric flip problem that is inherent to multi-resolution isometric shape matching algorithms. To this effect, we extend our previous work which handles the dense isometric correspondence problem in the original 3D Euclidean space via coarse-to-fine combinatorial matching. The key idea is based on keeping track of all optimal solutions, which may be more than one due to symmetry especially at coarse levels, throughout denser levels of the shape matching process. We compare the resulting den...
Scale Normalization for Isometric Shape Matching Sahillioğlu, Yusuf; Yemez, Y. (2012-09-01) We address the scale problem inherent to isometric shape correspondence in a combinatorial matching framework. We consider a particular setting of the general correspondence problem where one of the two shapes to be matched is an isometric (or nearly isometric) part of the other up to an arbitrary scale. We resolve the scale ambiguity by finding a coarse matching between shape extremities based on a novel scale-invariant isometric distortion measure. The proposed algorithm also supports (partial) dense matc...

Citation Formats

Y. Sahillioğlu, “Multiple Shape Correspondence by Dynamic Programming,” COMPUTER GRAPHICS FORUM, pp. 121–130, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/42043.