#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2011

2017

- This year (2)
- Last 5 years (5)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We introduce morphable part models for smart shape manipulation using an assembly of deformable parts with appropriate boundary conditions. In an analysis phase, we characterize the continuous allowable variations both for the individual parts and their interconnections using Gaussian shape models with low rank covariance. The discrete aspect of how parts… (More)

- Zorah Lähner, Emanuele Rodolà, +6 authors Yusuf Sahillioglu
- 2016

A particularly challenging setting of the shape matching problem arises when the shapes being matched have topological artifacts due to the coalescence of spatially close surface regions – a scenario that frequently occurs when dealing with real data under suboptimal acquisition conditions. This track of the SHREC’16 contest evaluates shape matching… (More)

We consider the problem of establishing dense correspondences within a set of related shapes of strongly varying geometry. For such input, traditional shape matching approaches often produce unsatisfactory results. We propose an ensemble optimization method that improves given coarse correspondences to obtain dense correspondences. Following ideas from… (More)

We present a novel approach for the calculation of dense correspondences between non-isometric shapes. Our work builds on the well known functional map framework and investigates a novel embedding for the alignment of shapes. We therefore identify points with their Green’s functions of the Laplace–Beltrami operator, and hence, embed shapes into their own… (More)

Quadratic assignment problems (QAPs) and quadratic assignment matchings (QAMs) recently gained a lot of interest in computer graphics and vision, e.g. for shape and graph matching. Literature describes several convex relaxations to approximate solutions of the NP-hard QAPs in polynomial time. We compare the convex relaxations recently introduced in computer… (More)

- Oliver Burghard, Reinhard Klein
- VMV
- 2015

In this paper we exploit redundant information in geodesic distance fields for a quick approximation of all-pair distances. Starting with geodesic distance fields of equally distributed landmarks we analyze the lower and upper bound resulting from the triangle inequality and show that both bounds converge reasonably fast to the original distance field. The… (More)

- ‹
- 1
- ›