Results 11 - 20
of
4,605
Probability Distributions of Optical Flow
- PROC. CONF. COMP. VISION AND PATT. RECOGNITION
, 1991
"... Gradient methods are widely used in the computation of optical flow. We discuss extensions of these methods which compute probability distributions of optical flow. The use of distributions allows representation of the uncertainties inherent in the optical flow computation, facilitating the combinat ..."
Abstract
-
Cited by 214 (14 self)
- Add to MetaCart
of motion information from visual input is an important task for both natural and artificial vision systems. Most models for the analysis of visual motion begin by extracting two-dimensional motion information. In particular, computer vision techniques typically compute twodimensional optical flowvectors
Lucas/Kanade meets Horn/Schunck: Combining local and global optic flow methods
- International Journal of Computer Vision
, 2005
"... Abstract. Differential methods belong to the most widely used techniques for optic flow computation in image sequences. They can be classified into local methods such as the Lucas–Kanade technique or Bigün’s structure tensor method, and into global methods such as the Horn/Schunck approach and its e ..."
Abstract
-
Cited by 229 (15 self)
- Add to MetaCart
extensions. Often local methods are more robust under noise, while global techniques yield dense flow fields. The goal of this paper is to contribute to a better understanding and the design of novel differential methods in four ways: (i) We juxtapose the role of smoothing/regularisation processes
Flux Maximizing Geometric Flows
- IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... Several geometric active contour models have been proposed for segmentation in computer vision and image analysis. The essential idea is to evolve a curve (in 2D) or a surface (in 3D) under constraints from image forces so that it clings to features of interest in an intensity image. Recent variatio ..."
Abstract
-
Cited by 126 (8 self)
- Add to MetaCart
Several geometric active contour models have been proposed for segmentation in computer vision and image analysis. The essential idea is to evolve a curve (in 2D) or a surface (in 3D) under constraints from image forces so that it clings to features of interest in an intensity image. Recent
SIFT Flow: Dense Correspondence across Different Scenes
"... While image registration has been studied in different areas of computer vision, aligning images depicting different scenes remains a challenging problem, closer to recognition than to image matching. Analogous to optical flow, where an image is aligned to its temporally adjacent frame, we propose ..."
Abstract
-
Cited by 136 (15 self)
- Add to MetaCart
SIFT flow, a method to align an image to its neighbors in a large image collection consisting of a variety of scenes. For a query image, histogram intersection on a bag-of-visual-words representation is used to find the set of nearest neighbors in the database. The SIFT flow algorithm then consists
Support vector machines: Training and applications
- A.I. MEMO 1602, MIT A. I. LAB
, 1997
"... The Support Vector Machine (SVM) is a new and very promising classification technique developed by Vapnik and his group at AT&T Bell Laboratories [3, 6, 8, 24]. This new learning algorithm can be seen as an alternative training technique for Polynomial, Radial Basis Function and Multi-Layer Perc ..."
Abstract
-
Cited by 223 (3 self)
- Add to MetaCart
The Support Vector Machine (SVM) is a new and very promising classification technique developed by Vapnik and his group at AT&T Bell Laboratories [3, 6, 8, 24]. This new learning algorithm can be seen as an alternative training technique for Polynomial, Radial Basis Function and Multi
Nonuniform Sampling and Reconstruction in Shift-Invariant Spaces
, 2001
"... This article discusses modern techniques for nonuniform sampling and reconstruction of functions in shift-invariant spaces. It is a survey as well as a research paper and provides a unified framework for uniform and nonuniform sampling and reconstruction in shift-invariant spaces by bringing togeth ..."
Abstract
-
Cited by 218 (13 self)
- Add to MetaCart
of shift-invariant spaces. (b) The general theory works in arbitrary dimension and for a broad class of generators. (c) The reconstruction of a function from any sufficiently dense nonuniform sampling set is obtained by efficient iterative algorithms. These algorithms converge geometrically and are robust
Image Based Flow Visualization
, 2002
"... A new method for the visualization of two-dimensional fluid flow is presented. The method is based on the advection and decay of dye. These processes are simulated by defining each frame of a flow animation as a blend between a warped version of the previous image and a number of background images. ..."
Abstract
-
Cited by 133 (3 self)
- Add to MetaCart
. For the latter a sequence of filtered white noise images is used: filtered in time and space to remove high frequency components. Because all steps are done using images, the method is named Image Based Flow Visualization (IBFV). With IBFV a wide variety of visualization techniques can be emulated. Flow can
Structure-accentuating Dense Flow Visualization
"... Vector field visualization approaches can broadly be categorized into approaches that directly visualize local or integrated flow and approaches that analyze the topological structure and visualize extracted features. Our goal was to come up with a method that falls into the first category, yet reve ..."
Abstract
- Add to MetaCart
reveals structural information. We have developed a dense flow visualization method that shows the overall flow behavior while accentuating structural information without performing a topological analysis. Our method is based on a geometry-based flow integration step and a texture-based visual exploration
Dense Estimation and Object-Based Segmentation of the Optical Flow with Robust Techniques
, 1998
"... In this paper we address the issue of recovering and segmenting the apparent velocity field in sequences of images. As for motion estimation, we minimize an objective function involving two robust terms. The first one cautiously captures the optical flow constraint, while the second (a priori) term ..."
Abstract
-
Cited by 113 (20 self)
- Add to MetaCart
In this paper we address the issue of recovering and segmenting the apparent velocity field in sequences of images. As for motion estimation, we minimize an objective function involving two robust terms. The first one cautiously captures the optical flow constraint, while the second (a priori) term
Over Two Decades of Integration-Based, Geometric Flow Visualization
- EUROGRAPHICS 2009 / M. PAULY AND G. GREINER, STAR -- STATE OF THE ART REPORT
, 2009
"... Flow visualization is a fascinating sub-branch of scientific visualization. With ever increasing computing power, it is possible to process ever more complex fluid simulations. However, a gap between data set sizes and our ability to visualize them remains. This is especially true for the field of f ..."
Abstract
-
Cited by 74 (13 self)
- Add to MetaCart
of flow visualization which deals with large, timedependent, multivariate simulation datasets. In this paper, geometry based flow visualization techniques form the focus of discussion. Geometric flow visualization methods place discrete objects in the vector field whose characteristics reflect
Results 11 - 20
of
4,605