The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
A novel method of snakes with shape prior is presented in this paper. We propose to add a new force which makes the curve evolve to particular shape corresponding to a template to...
Images taken from different views of a planar object are
related by planar homography. Recovering the parameters
of such transformations is a fundamental problem in computer
vis...
Image moments have been widely used for designing robust shape descriptors that are invariant to rigid transformations. In this work, we address the problem of estimating non-rigid...
A novel approach is proposed to estimate the parameters of a diffeomorphism that aligns two binary images. Classical approaches usually define a cost function based on a similarit...