29,568 research outputs found

    Elastic Net Constraints for Shape Matching

    Get PDF
    We consider a parametrized relaxation of the widely adopted quadratic assignment problem (QAP) formulation for minimum distortion correspondence between deformable shapes. In order to control the accuracy/sparsity trade-off we introduce a weighting parameter on the combination of two existing relaxations, namely spectral and game-theoretic. This leads to the introduction of the elastic net penalty function into shape matching problems. In combination with an efficient algorithm to project onto the elastic net ball, we obtain an approach for deformable shape matching with controllable sparsity. Experiments on a standard benchmark confirm the effectiveness of the approach. © 2013 IEEE

    SHREC'16: partial matching of deformable shapes

    Get PDF
    Matching deformable 3D shapes under partiality transformations is a challenging problem that has received limited focus in the computer vision and graphics communities. With this benchmark, we explore and thoroughly investigate the robustness of existing matching methods in this challenging task. Participants are asked to provide a point-to-point correspondence (either sparse or dense) between deformable shapes undergoing different kinds of partiality transformations, resulting in a total of 400 matching problems to be solved for each method - making this benchmark the biggest and most challenging of its kind. Five matching algorithms were evaluated in the contest; this paper presents the details of the dataset, the adopted evaluation measures, and shows thorough comparisons among all competing methods

    Generalized conditional gradient: analysis of convergence and applications

    Get PDF
    The objectives of this technical report is to provide additional results on the generalized conditional gradient methods introduced by Bredies et al. [BLM05]. Indeed , when the objective function is smooth, we provide a novel certificate of optimality and we show that the algorithm has a linear convergence rate. Applications of this algorithm are also discussed

    Stationary shapes of deformable particles moving at low Reynolds numbers

    Full text link
    Lecture Notes of the Summer School ``Microswimmers -- From Single Particle Motion to Collective Behaviour'', organised by the DFG Priority Programme SPP 1726 (Forschungszentrum J{\"{u}}lich, 2015).Comment: Pages C7.1-16 of G. Gompper et al. (ed.), Microswimmers - From Single Particle Motion to Collective Behaviour, Lecture Notes of the DFG SPP 1726 Summer School 2015, Forschungszentrum J\"ulich GmbH, Schriften des Forschungszentrums J\"ulich, Reihe Key Technologies, Vol 110, ISBN 978-3-95806-083-

    Fluid-membrane tethers: minimal surfaces and elastic boundary layers

    Full text link
    Thin cylindrical tethers are common lipid bilayer membrane structures, arising in situations ranging from micromanipulation experiments on artificial vesicles to the dynamic structure of the Golgi apparatus. We study the shape and formation of a tether in terms of the classical soap-film problem, which is applied to the case of a membrane disk under tension subject to a point force. A tether forms from the elastic boundary layer near the point of application of the force, for sufficiently large displacement. Analytic results for various aspects of the membrane shape are given.Comment: 12 page

    Non-Rigid Puzzles

    Get PDF
    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
    • …
    corecore