Learn More
This paper addresses the problem of recognizing multiple rigid objects that are common to two images. We propose a generic algorithm that allows to simultaneously decide if one or several objects are common to the two images and to estimate the corresponding geometric transformations. The considered transformations include similarities, homographies and(More)
This article details two approaches to compute barycenters of measures using 1-D Wasserstein distances along radial projections of the input measures. The first method makes use of the Radon transform of the measures, and the second is the solution of a convex optimization problem over the space of measures. We show several properties of these barycenters(More)
—This paper focuses on the matching of local features between images. Given a set of query descriptors and a database of candidate descriptors, the goal is to decide which ones should be matched. This is a crucial issue, since the matching procedure is often a preliminary step for object detection or image matching. In practice, this matching step is often(More)
This work is concerned with the modification of the gray level or color distribution of digital images. A common drawback of classical methods aiming at such modifications is the revealing of artefacts or the attenuation of details and textures. In this work, we propose a generic filtering method enabling, given the original image and the radiometrically(More)
This paper presents a new method for 2-D and 3-D shape retrieval based on geodesic signatures. These signatures are high dimensional statistical distributions computed by extracting several features from the set of geodesic distance maps to each point. The resulting high dimensional distributions are matched to perform retrieval using a fast approximate(More)
Many computer vision algorithms make use of local features, and rely on a systematic comparison of these features. The chosen dissimilarity measure is of crucial importance for the overall performances of these algorithms and has to be both robust and computationally efficient. Some of the most popular local features (like SIFT [4] descriptors) are based on(More)
In this contribution, we study Monge-Kantorovich distances between discrete set of points on the unit circle S 1 , when the ground distance between two points x and y on the circle is defined as c(x, y) = min(|x − y|, 1 − |x − y|). We first prove that computing a Monge-Kantorovich distance between two given sets of pairwise different points boils down to(More)
This paper introduces a novel and generic framework embedding statistical constraints for variational problems. We resort to the theory of Monge-Kantorovich optimal mass transport to define penalty terms depending on statistics from images. To cope with the computation time issue of the corresponding Wasserstein distances involved in this approach, we(More)