Results 1 
6 of
6
A Theoretical Framework for Convex Regularizers in PDEBased Computation of Image Motion
, 2000
"... Many differential methods for the recovery of the optic flow field from an image sequence can be expressed in terms of a variational problem where the optic flow minimizes some energy. Typically, these energy functionals consist of two terms: a data term, which requires e.g. that a brightness consta ..."
Abstract

Cited by 76 (20 self)
 Add to MetaCart
Many differential methods for the recovery of the optic flow field from an image sequence can be expressed in terms of a variational problem where the optic flow minimizes some energy. Typically, these energy functionals consist of two terms: a data term, which requires e.g. that a brightness constancy assumption holds, and a regularizer that encourages global or piecewise smoothness of the flow field. In this paper we present a systematic classification of rotation invariant convex regularizers by exploring their connection to diffusion filters for multichannel images. This taxonomy provides a unifying framework for datadriven and flowdriven, isotropic and anisotropic, as well as spatial and spatiotemporal regularizers. While some of these techniques are classic methods from the literature, others are derived here for the first time. We prove that all these methods are wellposed: they posses a unique solution that depends in a continuous way on the initial data. An interesting structural relation between isotropic and anisotropic flowdriven regularizers is identified, and a design criterion is proposed for constructing anisotropic flowdriven regularizers in a simple and direct way from isotropic ones. Its use is illustrated by several examples.
Shapeadapted smoothing in estimation of 3D shape cues from affine distortions of local 2D brightness structure
, 2001
"... This article describes a method for reducing the shape distortions due to scalespace smoothing that arise in the computation of 3D shape cues using operators (derivatives) de ned from scalespace representation. More precisely, we are concerned with a general class of methods for deriving 3D shap ..."
Abstract

Cited by 52 (3 self)
 Add to MetaCart
This article describes a method for reducing the shape distortions due to scalespace smoothing that arise in the computation of 3D shape cues using operators (derivatives) de ned from scalespace representation. More precisely, we are concerned with a general class of methods for deriving 3D shape cues from 2D image data based on the estimation of locally linearized deformations of brightness patterns. This class
Velocity Likelihoods in Biological and Machine Vision
 In Probabilistic Models of the Brain: Perception and Neural Function
, 2001
"... Recent approaches to estimating twodimensional image motion and to modeling the perception of image motion have achieved success with Bayesian formulations. With a Bayesian approach, the goal is to compute the posterior probability distribution of velocity, which is proportional to a likelihood ..."
Abstract

Cited by 35 (4 self)
 Add to MetaCart
Recent approaches to estimating twodimensional image motion and to modeling the perception of image motion have achieved success with Bayesian formulations. With a Bayesian approach, the goal is to compute the posterior probability distribution of velocity, which is proportional to a likelihood function and a prior. The likelihood function describes the probability of observing the image data given the image velocity; surprisingly, there is still disagreement about the right likelihood function to use. Here we derive a likelihood function by starting from a generative model. We assume that the scene translates, conserving image brightness, while the image is equal to the projected scene plus noise. We discuss the connection between the resulting likelihood function and existing models of motion analysis. We show that the likelihood can be calculated by a population of units whose response properties are similar to \motion energy" units. This suggests that a population o...
Computing Optic Flow by ScaleSpace Integration of Normal Flow
 in `Proc. ScaleSpace'01
, 2001
"... In this paper we will present a least committed multiscale method for computation of optic flow fields. We extract optic flow fields from normal flow, by fitting the normal components of a local polynomial model of the optic flow to the normal flow. This fitting is based on an analytically solvable ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper we will present a least committed multiscale method for computation of optic flow fields. We extract optic flow fields from normal flow, by fitting the normal components of a local polynomial model of the optic flow to the normal flow. This fitting is based on an analytically solvable optimization problem, in which an integration scalespace over the normal flow field regularizes the solution. An automatic local scale selection mechanism is used in order to adapt to the local structure of the flow field. The performance profile of the method is compared with that of existing optic flow techniques and we show that the proposed method performs at least as well as the leading algorithms on the benchmark image sequences proposed by Barron et al. [3]. We also do a performance comparison on a synthetic fire particle sequence and apply our method to a real sequence of smoke circulation in a pigsty. Both consist of highly complex nonrigid motion.
Evaluating OpticalFlow Algorithms on a Parallel Machine
 Image and Vision Comp
"... Algorithmic development of opticalow routines is hampered by slow turnaround times (to iterate over testing, evaluation, and adjustment of the algorithm). To ease the problem, parallel implementation on a convenient generalpurpose parallel machine is possible. A generic parallel pipeline struct ..."
Abstract
 Add to MetaCart
Algorithmic development of opticalow routines is hampered by slow turnaround times (to iterate over testing, evaluation, and adjustment of the algorithm). To ease the problem, parallel implementation on a convenient generalpurpose parallel machine is possible. A generic parallel pipeline structure, suitable for distributedmemory machines, has enabled parallelisation to be quickly achieved. Gradient, correlation, and phasebased methods of opticalow detection have been constructed to demonstrate the approach.