An important form of prior information in clustering comes in form of cannot-link and must-link constraints. We present a generalization of the popular spectral clustering techniq...
This paper presents a sparse representation of 2D planar shape through the composition of warping functions, termed formlets, localized in scale and space. Each formlet subjects t...
Consider the system of Diophantine equations x2 − ay2 = b, P (x, y) = z2, where P is a given integer polynomial. Historically, such systems have been analyzed by using Baker’s ...
Algorithms based on the minimization of the Total Variation are prevalent in computer vision. They are used in a variety of applications such as image denoising, compressive sensi...
— Image matching is a fundamental task of many computer vision problems. In this paper we present a novel approach to match two images in presenting significant geometric deform...