Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andrea Mennucci

dblp:86/3647 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
0since 2021 · last 2015
0000-0002-4302-3275ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
6 papers
Image and video processing · 70% Geometric modeling and processing · 28% Computational photography and imaging · 2%
Artificial intelligence
3 papers
Video understanding and tracking · 78% 3D vision · 22%
Theoretical computer science
2 papers
Mathematical optimization · 57% Computational geometry · 43%

Topics — the 11 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing › image segmentation
active contour
0.452009
New Possibilities with Sobolev Active Contours · Int. J. Comput. Vis. 2009
Coarse-to-Fine Segmentation and Tracking Using Sobolev Active Contours · IEEE Trans. Pattern Anal. Mach. Intell. 2008
Sobolev Active Contours · Int. J. Comput. Vis. 2007
Computer vision › Video understanding and tracking › object tracking › contour tracking
active contour tracking
0.122008
Coarse-to-Fine Segmentation and Tracking Using Sobolev Active Contours · IEEE Trans. Pattern Anal. Mach. Intell. 2008
Tracking With Sobolev Active Contours · CVPR (1) 2006
Computer vision › Video understanding and tracking
object tracking
0.122008
Coarse-to-Fine Segmentation and Tracking Using Sobolev Active Contours · IEEE Trans. Pattern Anal. Mach. Intell. 2008
Tracking With Sobolev Active Contours · CVPR (1) 2006
Image and video processing
image segmentation
0.122009
Coarse-to-Fine Segmentation and Tracking Using Sobolev Active Contours · IEEE Trans. Pattern Anal. Mach. Intell. 2008
New Possibilities with Sobolev Active Contours · Int. J. Comput. Vis. 2009
Geometric modeling and processing › deformable models
curve evolution
0.112008
Coarse-to-Fine Segmentation and Tracking Using Sobolev Active Contours · IEEE Trans. Pattern Anal. Mach. Intell. 2008
Mathematical optimization
variational methods
0.112007
Sobolev Active Contours · Int. J. Comput. Vis. 2007
Geometric modeling and processing
shape analysis
0.112005
Conformal Metrics and True "Gradient Flows" for Curves · ICCV 2005
Geometric modeling and processing
shape optimization
0.112005
Conformal Metrics and True "Gradient Flows" for Curves · ICCV 2005
Computational geometry › differential geometry
riemannian geometry
0.112005
Conformal Metrics and True "Gradient Flows" for Curves · ICCV 2005
Computer vision › 3D vision
depth estimation
0.012003
Observing Shape from Defocused Images · Int. J. Comput. Vis. 2003
Computer vision › 3D vision › depth estimation › focus-based depth estimation
depth from defocus
0.012003
Observing Shape from Defocused Images · Int. J. Comput. Vis. 2003

Methods — techniques the papers use, named apart from their topics

sobolev gradient · 0.4variational optimization · 0.2scale-space analysis · 0.2riemannian metric · 0.2fourier domain analysis · 0.1gradient flow · 0.1geodesic distance · 0.1conformal factors · 0.1point spread function modeling · 0.1
YearPublicationVenuePosition
2015 Banach-Like Distances and Metric Spaces of Compact Sets
abstract
In the first part we study general properties of the metrics obtained by isometrically identifying a generic metric space with a subset of a Banach space; we obtain a rigidity result. We then discuss the Hausdorff distance, proposing some less-known but important results: a closed-form formula for geodesics; generically two compact sets are connected by a continuum of geodesics. In the second part we present and study a family of distances on the space of compact subsets of $\mathbb{R}^N$ (that we call “shapes''). These distances are “geometric,” that is, they are independent of rotation and translation, and the resulting metric spaces enjoy many interesting properties, as, for example, the existence of geodesics. We view our metric space of shapes as a subset of Banach (or Hilbert) spaces, so we can define a “tangent manifold” to shapes and (in a very weak form) talk of a “Riemannian geometry” of shapes. Some of the metrics that we propose are topologically equivalent to the Hausdorff distance.
Andrea Mennucci, Alessandro Duci
SIAM J. Imaging Sci.1
2011 A New Geometric Metric in the Space of Curves, and Applications to Tracking Deforming Objects by Prediction and Filtering
abstract
We define a novel metric on the space of closed planar curves which decomposes into three intuitive components. According to this metric, centroid translations, scale changes, and deformations are orthogonal, and the metric is also invariant with respect to reparameterizations of the curve. While earlier related Sobolev metrics for curves exhibit some general similarities to the novel metric proposed in this work, they lacked this important three-way orthogonal decomposition, which has particular relevance for tracking in computer vision. Another positive property of this new metric is that the Riemannian structure that is induced on the space of curves is a smooth Riemannian manifold, which is isometric to a classical well-known manifold. As a consequence, geodesics and gradients of energies defined on the space can be computed using fast closed-form formulas, and this has obvious benefits in numerical applications. The obtained Riemannian manifold of curves is ideal for addressing complex problems in computer vision; one such example is the tracking of highly deforming objects. Previous works have assumed that the object deformation is smooth, which is realistic for the tracking problem, but most have restricted the deformation to belong to a finite-dimensional group—such as affine motions—or to finitely parameterized models. This is too restrictive for highly deforming objects such as the contour of a beating heart. We adopt the smoothness assumption implicit in previous work, but we lift the restriction to finite-dimensional motions/deformations. We define a dynamical model in this Riemannian manifold of curves and use it to perform filtering and prediction to infer and extrapolate not just the pose (a finitely parameterized quantity) of an object but its deformation (an infinite-dimensional quantity) as well. We illustrate these ideas using a simple first-order dynamical model and show that it can be effective even on image sequences where existing methods fail.
Ganesh Sundaramoorthi, Andrea Mennucci, Stefano Soatto, Anthony J. Yezzi
SIAM J. Imaging Sci.2
2009 New Possibilities with Sobolev Active Contours
Ganesh Sundaramoorthi, Anthony J. Yezzi, Andrea Mennucci, Guillermo Sapiro
Int. J. Comput. Vis.3
2008 Coarse-to-Fine Segmentation and Tracking Using Sobolev Active Contours
abstract
Recently proposed Sobolev active contours introduced a new paradigm for minimizing energies defined on curves by changing the traditional cost of perturbing a curve and thereby redefining their gradients. Sobolev active contours evolve more globally and are less attracted to certain intermediate local minima than traditional active contours, and it is based on a well-structured Riemannian metric. In this paper, we analyze Sobolev active contours using scale-space analysis in order to understand their evolution across different scales. This analysis shows an extremely important and useful behavior of Sobolev contours, namely, that they move successively from coarse to increasingly finer scale motions in a continuous manner. This property illustrates that one justification for using the Sobolev technique is for applications where coarse-scale deformations are preferred over fine scale deformations. Along with other properties to be discussed, the coarse-to-fine observation reveals that Sobolev active contours are, in particular, ideally suited for tracking algorithms that use active contours. We will also justify our assertion that the Sobolev metric should be used over the traditional metric for active contours in tracking problems by experimentally showing how a variety of active contour based tracking methods can be significantly improved merely by evolving the active contour according to the Sobolev method.
Ganesh Sundaramoorthi, Anthony J. Yezzi, Andrea Mennucci
IEEE Trans. Pattern Anal. Mach. Intell.3
2007 Sobolev Active Contours
Ganesh Sundaramoorthi, Anthony J. Yezzi, Andrea Mennucci
Int. J. Comput. Vis.3
2006 Tracking With Sobolev Active Contours
abstract
Recently proposed Sobolev active contours introduced a new paradigm for minimizing energies defined on curves by changing the traditional cost of perturbing a curve and thereby redefining their gradients. Sobolev active contours evolve more globally and are less attracted to certain intermediate local minima than traditional active contours. In this paper we analyze Sobolev active contours in the Fourier domain in order to understand their evolution across different scales. This analysis shows an important and useful behavior of Sobolev contours, namely, that they move successively from coarse to increasingly finer scale motions in a continuous manner. Along with other properties, the previous observation reveals that Sobolev active contours are ideally suited for tracking problems that use active contours. Our purpose in this work is to show how a variety of active contour based tracking methods can be significantly improved merely by evolving the active contours according to the Sobolev method.
Ganesh Sundaramoorthi, Jeremy D. Jackson, Anthony J. Yezzi, Andrea Mennucci
CVPR (1)4
2005 Conformal Metrics and True "Gradient Flows" for Curves
abstract
We wish to endow the manifold M of smooth curves in /spl Ropf//sup n/ with a Riemannian metric that allows us to treat continuous morphs (homotopies) between two curves c/sub 0/ and c/sub 1/ as trajectories with computable lengths which are independent of the parameterization or representation of the two curves (and the curves making up the morph between them). We may then define the distance between the two curves using the trajectory of minimal length (geodesic) between them, assuming such a minimizing trajectory exists. At first we attempt to utilize the metric structure implied rather unanimously by the past twenty years or so of shape optimization literature in computer vision. This metric arises as the unique metric which validates the common references to a wide variety of contour evolution models in the literature as "gradient flows" to various formulated energy functionals. Surprisingly, this implied metric yields a pathological and useless notion of distance between curves. In this paper, we show how this metric can be minimally modified using conformal factors that depend upon a curve's total arclength. A nice property of these new conformal metrics is that all active contour models that have been called "gradient flows" in the past will constitute true gradient flows with respect to these new metrics under specific time reparameterizations.
Anthony J. Yezzi, Andrea Mennucci
ICCV2
2003 Observing Shape from Defocused Images
Paolo Favaro, Andrea Mennucci, Stefano Soatto
Int. J. Comput. Vis.2