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

Ulf Grenander

dblp:g/UlfGrenander · DBLP profile ↗
← Back
12ranked-venue papers
5as first author
0since 2021 · last 2007
—ORCID · none

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

Artificial intelligence and machine learning · 7 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-authorTheory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 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 · 73% Geometric modeling and processing · 15% Multimedia analysis and retrieval · 13%
Artificial intelligence
3 papers
3D vision · 43% Probabilistic and Bayesian machine learning · 34% Image recognition and object detection · 23%
Theoretical computer science
1 paper
Information theory · 100%

Topics — the 14 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing
image representation
0.132002
Universal Analytical Forms for Modeling Image Probabilities · IEEE Trans. Pattern Anal. Mach. Intell. 2002
Analytical Image Models and Their Applications · ECCV (1) 2002
Probability Models for Clutter in Natural Images · IEEE Trans. Pattern Anal. Mach. Intell. 2001
Image and video processing › image representation
stochastic image models
0.012002
Universal Analytical Forms for Modeling Image Probabilities · IEEE Trans. Pattern Anal. Mach. Intell. 2002
Image and video processing
texture analysis
0.012000
Bayesian Segmentation via Asymptotic Partition Functions · IEEE Trans. Pattern Anal. Mach. Intell. 2000
Image and video processing › image segmentation
texture segmentation
0.012000
Bayesian Segmentation via Asymptotic Partition Functions · IEEE Trans. Pattern Anal. Mach. Intell. 2000
Computer vision › 3D vision
pose estimation
0.011998
Hilbert-Schmidt Lower Bounds for Estimators on Matrix Lie Groups for ATR · IEEE Trans. Pattern Anal. Mach. Intell. 1998
Geometric modeling and processing › surface processing
geodesic distance computation
0.011998
Dynamic Programming Generation of Curves on Brain Surfaces · IEEE Trans. Pattern Anal. Mach. Intell. 1998
Information theory › estimation theory › mean-square estimation
minimum mean-square error
0.011998
Hilbert-Schmidt Lower Bounds for Estimators on Matrix Lie Groups for ATR · IEEE Trans. Pattern Anal. Mach. Intell. 1998
Multimedia analysis and retrieval › object recognition
automatic target recognition
0.011997
Automatic target recognition organized via jump-diffusion algorithms · IEEE Trans. Image Process. 1997
Multimedia analysis and retrieval
object tracking
0.011997
Automatic target recognition organized via jump-diffusion algorithms · IEEE Trans. Image Process. 1997
Computer vision › Image recognition and object detection › object recognition
automatic target recognition
0.012002
Universal Analytical Forms for Modeling Image Probabilities · IEEE Trans. Pattern Anal. Mach. Intell. 2002
Image and video processing
image similarity
0.012002
Universal Analytical Forms for Modeling Image Probabilities · IEEE Trans. Pattern Anal. Mach. Intell. 2002
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.012000
Bayesian Segmentation via Asymptotic Partition Functions · IEEE Trans. Pattern Anal. Mach. Intell. 2000
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
partition function approximation
0.012000
Bayesian Segmentation via Asymptotic Partition Functions · IEEE Trans. Pattern Anal. Mach. Intell. 2000
Bioinformatics and computational biology › bioimage informatics
electron microscopy image analysis
0.012000
Bayesian Segmentation via Asymptotic Partition Functions · IEEE Trans. Pattern Anal. Mach. Intell. 2000

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

deformable template model · 0.1asymptotic maximum-likelihood · 0.1spectral decomposition · 0.1bessel k forms · 0.1hilbert-schmidt metric · 0.0bayesian estimation · 0.0bandpass filtering · 0.0band-pass filtering · 0.0probability modeling · 0.0analytical density derivation · 0.0dynamic programming · 0.0jump-diffusion algorithm · 0.0bayesian inference · 0.0
YearPublicationVenuePosition
2007 A Pattern-Theoretic Characterization of Biological Growth
abstract
Mathematical and statistical modeling of biological growth is an important problem in medical diagnostics. Here, we seek tools to analyze changes in anatomical parts using images collected over time. We introduce a structured model, called Growth by Random Iterated Diffeomorphisms (GRID), that treats a cumulative growth deformation as a composition of several elementary deformations. Each elementary deformation applies to a small region by capturing deformation local to that region and is characterized by a seed and a radial deformation pattern around that seed. These GRID variables--seed locations and radial deformation patterns---are estimated from observed images in two steps: 1) estimate a cumulative deformation over an observation interval; 2) estimate GRID variables using maximum-likelihood criterion from this estimated cumulative deformation. We demonstrate this framework using an MRI image data of a rat's brain growth. For future statistical analysis, we propose a time-varying Poisson process for the seed placements and a random drawing from a predetermined catalog of deformations for the radial deformation patterns.
Ulf Grenander, Anuj Srivastava, Sanjay Saini
IEEE Trans. Medical Imaging1
2002 Analytical Image Models and Their Applications
Anuj Srivastava, Xiuwen Liu 0001, Ulf Grenander
ECCV (1)3
2002 Universal Analytical Forms for Modeling Image Probabilities
abstract
Seeking probability models for images, we employ a spectral approach where the images are decomposed using bandpass filters and probability models are imposed on the filter outputs (also called spectral components). We employ a (two-parameter) family of probability densities, called Bessel K forms, for modeling the marginal densities of the spectral components, and demonstrate their fit to the observed histograms for video, infrared, and range images. Motivated by object-based models for image analysis, a relationship between the Bessel parameters and the imaged objects is established. Using L/sup 2/-metric on the set of Bessel K forms, we propose a pseudometric on the image space for quantifying image similarities/differences. Some applications, including clutter classification and pruning of hypotheses for target recognition, are presented.
Anuj Srivastava, Xiuwen Liu 0001, Ulf Grenander
IEEE Trans. Pattern Anal. Mach. Intell.3
2001 A compact probability model for natural clutter
abstract
We present a framework for modeling background clutter in natural images. Assuming that: (i) images are made up of 2D (projected) views of 3D (real) objects, and (ii) certain simplifying conditions hold, we present an analytical density for the derivatives of the natural images. This expression is shown to match well with the observed densities (histograms).
Ulf Grenander, Anuj Srivastava
ICIP (2)1
2001 Analytical models for reduced spectral representations of images
abstract
Spectral components, obtained via bandpass filtering of images, have become important tools in capturing image variability. We present a two-parameter family of probability densities, called the Bessel forms, to model the marginal densities of the spectral components. The two parameters, shape and scale parameters, are used to characterize each spectral component of the image. We derive an L/sup 2/-metric on the space of Bessel forms that leads to a metric on the space of natural images. The strength of these forms/metric is demonstrated via a study of natural clutter images.
Anuj Srivastava, Xiuwen Liu 0001, Ulf Grenander
ICIP (1)3
2001 Probability Models for Clutter in Natural Images
abstract
We propose a framework for modeling clutter in natural images. Assuming that: 1) images are made up of 2D (projected) views of 3D (real) objects and 2) certain simplifying conditions hold, we derive an analytical density for natural images. This expression is shown to match well with the observed densities (histograms). In addition to deriving multidimensional densities, several extensions are also proposed.
Ulf Grenander, Anuj Srivastava
IEEE Trans. Pattern Anal. Mach. Intell.1
2000 Bayesian Segmentation via Asymptotic Partition Functions
abstract
Asymptotic approximations to the partition function of Gaussian random fields are derived. Textures are characterized via Gaussian random fields induced by stochastic difference equations determined by finitely supported, stationary, linear difference operators, adjusted to be nonstationary at the boundaries. It is shown that as the scale of the underlying shape increases, the log-normalizer converges to the integral of the log-spectrum of the operator inducing the random field. Fitting the covariance of the fields amounts to fitting the parameters of the spectrum of the differential operator-induced random field model. Matrix analysis techniques are proposed for handling textures with variable orientation. Examples of texture parameters estimated from training data via asymptotic maximum-likelihood are shown. Isotropic models involving powers of the Laplacian and directional models involving partial derivative mixtures are explored. Parameters are estimated for mitochondria and actin-myocin complexes in electron micrographs and clutter in forward-looking infrared images. Deformable template models are used to infer the shape of mitochondria in electron micrographs, with the asymptotic approximation allowing easy recomputation of the partition function as inference proceeds.
Aaron D. Lanterman, Ulf Grenander, Michael I. Miller
IEEE Trans. Pattern Anal. Mach. Intell.2
2000 Asymptotic performance analysis of Bayesian target recognition
abstract
This article investigates the asymptotic performance of Bayesian target recognition algorithms using deformable-template representations. Rigid computer-aided design (CAD) models represent the underlying targets; low-dimensional matrix Lie-groups (rotation and translation) extend them to particular instances. Remote sensors observing the targets are modeled as projective transformations, converting three-dimensional scenes into random images. Bayesian target recognition corresponds to hypothesis selection in the presence of nuisance parameters; its performance is quantified as the Bayes' error. Analytical expressions for this error probability in small noise situations are derived, yielding asymptotic error rates for exponential error probability decay.
Ulf Grenander, Anuj Srivastava, Michael I. Miller
IEEE Trans. Inf. Theory1
1998 Hilbert-Schmidt Lower Bounds for Estimators on Matrix Lie Groups for ATR
abstract
Deformable template representations of observed imagery model the variability of target pose via the actions of the matrix Lie groups on rigid templates. In this paper, we study the construction of minimum mean squared error estimators on the special orthogonal group, SO(n), for pose estimation. Due to the nonflat geometry of SO(n), the standard Bayesian formulation of optimal estimators and their characteristics requires modifications. By utilizing Hilbert-Schmidt metric defined on GL(n), a larger group containing SO(n), a mean squared criterion is defined on SO(n). The Hilbert-Schmidt estimate (HSE) is defined to be a minimum mean squared error estimator, restricted to SO(n). The expected error associated with the HSE is shown to be a lower bound, called the Hilbert-Schmidt bound (HSB), on the error incurred by any other estimator. Analysis and algorithms are presented for evaluating the HSE and the HSB in cases of both ground-based and airborne targets.
Ulf Grenander, Michael I. Miller, Anuj Srivastava
IEEE Trans. Pattern Anal. Mach. Intell.1
1998 Dynamic Programming Generation of Curves on Brain Surfaces
abstract
Dynamic programming algorithms are presented for automated generation of length minimizing geodesics and curves of extremal curvature on the neocortex of the macaque and the visible human. Probabilistic models of curve variation are constructed in terms of the variability in speed, curvature, and torsion in the Frenet representation.
Navin Khaneja, Michael I. Miller, Ulf Grenander
IEEE Trans. Pattern Anal. Mach. Intell.3
1997 On The Geometry and Shape of Brain Sub-Manifolds
abstract
This paper develops mathematical representations for neuro-anatomically significant substructures of the brain and their variability in a population. The focus of the paper is on the neuro-anatomical variation of the geometry and the "shape" of two-dimensional surfaces in the brain. As examples, we focus on the cortical and hippocampal surfaces in an ensemble of Macaque monkeys and human MRI brains. The "shapes" of the substructures are quantified via the construction of templates; the variations are represented by defining probabilistic deformations of the template. Methods for empirically estimating probability measures on these deformations are developed by representing the deformations as Gaussian random vector fields on the embedded sub-manifolds. The Gaussian random vector fields are constructed as quadratic mean limits using complete orthonormal bases on the sub-manifolds. The complete orthonormal bases are generated using modes of vibrations of the geometries of the brain sub-manifolds. The covariances are empirically estimated from an ensemble of brain data. Principal component analysis is presented for characterizing the "eigen-shape" of the hippocampus in an ensemble of MRI-MPRAGE whole brain images. Clustering based on eigen-shape is presented for two sub-populations of normal and schizophrenic.
Sarang C. Joshi, Michael I. Miller, Ulf Grenander
Int. J. Pattern Recognit. Artif. Intell.3
1997 Automatic target recognition organized via jump-diffusion algorithms
abstract
Proposes a framework for simultaneous detection, tracking, and recognition of objects via data fused from multiple sensors. Complex dynamic scenes are represented via the concatenation of simple rigid templates. The variability of the infinity of pose is accommodated via the actions of matrix Lie groups extending the templates to individual instances. The variability of target number and target identity is accommodated via the representation of scenes as unions of templates of varying types, with the associated group transformations of varying dimension. We focus on recognition in the air-to-ground and ground-to-air scenarios. The remote sensing data is organized around both the coarse scale associated with detection as provided by tracking and range radars, along with the fine scale associated with pose and identity supported by high-resolution optical, forward looking infrared and delay-Doppler radar imagers. A Bayesian approach is adopted in which prior distributions on target scenarios are constructed via dynamical models of the targets of interest. These are combined with physics-based sensor models which define conditional likelihoods for the coarse/fine scale sensor data given the underlying scene. Inference via the Bayes posterior is organized around a random sampling algorithm based on jump-diffusion processes. New objects are detected and object identities are recognized through discrete jump moves through parameter space, the algorithm exploring scenes of varying complexity as it proceeds. Between jumps, the scale and rotation group transformations are generated via continuous diffusions in order to smoothly deform templates into individual instances of objects.
Michael I. Miller, Ulf Grenander, Joseph A. O'Sullivan, Donald L. Snyder
IEEE Trans. Image Process.2