Learn More
This paper deals with dense optical flow estimation from the perspective of the trade-off between quality of the estimated flow and computational cost which is required by real-world applications. We propose a fast and robust local method, denoted by eFOLKI, and describe its implementation on GPU. It leads to very high performance even on large image(More)
We study dense optical flow estimation using iterative registration of local window, also known as iterative Lucas-Kanade (LK) [B. Lucas et al, 1981]. We show that the usual iterative-warping scheme encounters divergence problems and propose a modified scheme with better behavior. It yields good results with a much lower cost than the exact dense LK(More)
Iteratively Reweighted Least Squares (IRLS) and Residual Steepest descent (RSD) algorithms of robust statistics arise as special cases of half-quadratic schemes . Here, we adopt a statistical framework and we show that both algorithms are instances of the EM algorithm. The augmented dataset respectively involves a scale and a location mixture of Gaussians.(More)
Super-resolution (SR) techniques make use of subpixel shifts between frames in an image sequence to yield higher resolution images. We propose an original observation model devoted to the case of nonisometric inter-frame motion as required, for instance, in the context of airborne imaging sensors. First, we describe how the main observation models used in(More)
We address performance modeling of superresolution (SR) techniques. Superresolution consists in combining several images of the same scene to produce an image with better resolution and contrast. We propose a discrete data-continuous reconstruction framework to conduct SR performance analysis and derive a theoretical expression of the reconstruction mean(More)
—This paper provides a complete characterization of stationary Markov random fields on a finite rectangular (non-toroidal) lattice in the basic case of a second-order neighborhood system. Equivalently, it characterizes stationary Markov fields on 2 whose restrictions to finite rectangular subsets are still Markovian (i.e., even on the boundaries). Until(More)
Robust estimation of the optical flow is addressed through a multiresolution energy minimization. It involves repeated evaluation of spatial and temporal gradients of image intensity which rely usually on bilinear interpolation and image filtering. We propose to base both computations on a single pyramidal cubic B-spline model of image intensity. We show(More)
We address the issue of distinguishing point objects from a cluttered background and estimating their position by image processing. We are interested in the specific context in which the object's signature varies significantly relative to its random subpixel location because of aliasing. The conventional matched filter neglects this phenomenon and causes a(More)