Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
We propose a variational framework for the integration of multiple competing shape priors into level set based segmentation schemes. By optimizing an appropriate cost functional wi...
Daniel Cremers, Nir A. Sochen, Christoph Schnö...
Abstract. We propose a variational framework for the integration multiple competing shape priors into level set based segmentation schemes. By optimizing an appropriate cost functi...
Daniel Cremers, Nir A. Sochen, Christoph Schnö...
Region growing has become a popular method for 3D segmentation. Starting from a seed, this approach allows one to extract a region by merging all its neighbors and comparing the e...
Abstract. We match shapes, even under severe deformations, via a smooth reparametrization of their integral invariant signatures. These robust signatures and correspondences are th...
Siddharth Manay, Daniel Cremers, Anthony J. Yezzi,...