Results 1  10
of
1,059,304
Video Motion for Every Visible Point
"... Dense motion of image points over many video frames can provide important information about the world. However, occlusions and drift make it impossible to compute long motion paths by merely concatenating optical flow vectors between consecutive frames. Instead, we solve for entire paths directly, a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
neighborhood of every pixel, we guarantee complete coverage of all visible points in all frames. We achieve stateoftheart results on real sequences including both rigid and nonrigid motions with significant occlusions. 1.
Visible Points in Convex Sets and Best Approximation
, 2014
"... The concept of a visible point of a convex set relative to a given point is introduced. A number of basic properties of such visible point sets is developed. In particular, it is shown that this concept is useful in the study of best approximation, and it also seems to have potential value in the st ..."
Abstract
 Add to MetaCart
The concept of a visible point of a convex set relative to a given point is introduced. A number of basic properties of such visible point sets is developed. In particular, it is shown that this concept is useful in the study of best approximation, and it also seems to have potential value
Visible Points on Curves over Finite
, 2008
"... For a prime p and an absolutely irreducible modulo p polynomial f(U,V) ∈ Z[U,V] we obtain an asymptotic formulas for the number of solutions to the congruence f(x,y) ≡ a (mod p) in positive integers x � X, y � Y, with the additional condition gcd(x,y) = 1. Such solutions have a natural interpreta ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
interpretation as solutions which are visible from the origin. These formulas are derived on average over a for a fixed prime p, and also on average over p for a fixed integer a. 1
Some remarks on the visible points of a lattice
, 1999
"... We comment on the set of visible points of a lattice and its Fourier transform, thus continuing and generalizing previous work by Schroeder [1] and Mosseri [2]. A closed formula in terms of Dirichlet series is obtained for the Bragg part of the Fourier transform. We compare this calculation with the ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We comment on the set of visible points of a lattice and its Fourier transform, thus continuing and generalizing previous work by Schroeder [1] and Mosseri [2]. A closed formula in terms of Dirichlet series is obtained for the Bragg part of the Fourier transform. We compare this calculation
Detection and Tracking of Point Features
 International Journal of Computer Vision
, 1991
"... The factorization method described in this series of reports requires an algorithm to track the motion of features in an image stream. Given the small interframe displacement made possible by the factorization approach, the best tracking method turns out to be the one proposed by Lucas and Kanade i ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
The factorization method described in this series of reports requires an algorithm to track the motion of features in an image stream. Given the small interframe displacement made possible by the factorization approach, the best tracking method turns out to be the one proposed by Lucas and Kanade in 1981. The method defines the measure of match between fixedsize feature windows in the past and current frame as the sum of squared intensity differences over the windows. The displacement is then defined as the one that minimizes this sum. For small motions, a linearization of the image intensities leads to a NewtonRaphson style minimization. In this report, after rederiving the method in a physically intuitive way, we answer the crucial question of how to choose the feature windows that are best suited for tracking. Our selection criterion is based directly on the definition of the tracking algorithm, and expresses how well a feature can be tracked. As a result, the criterion is optima...
QSplat: A Multiresolution Point Rendering System for Large Meshes
, 2000
"... Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing and p ..."
Abstract

Cited by 500 (8 self)
 Add to MetaCart
and progressively displaying these meshes that combines a multiresolution hierarchy based on bounding spheres with a rendering system based on points. A single data structure is used for view frustum culling, backface culling, levelofdetail selection, and rendering. The representation is compact and can
Iterative point matching for registration of freeform curves and surfaces
, 1994
"... A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract

Cited by 659 (7 self)
 Add to MetaCart
, which is required for environment modeling (e.g., building a Digital Elevation Map). Objects are represented by a set of 3D points, which are considered as the samples of a surface. No constraint is imposed on the form of the objects. The proposed algorithm is based on iteratively matching points
Plenoptic Modeling: An ImageBased Rendering System
, 1995
"... Imagebased rendering is a powerful new approach for generating realtime photorealistic computer graphics. It can provide convincing animations without an explicit geometric representation. We use the “plenoptic function” of Adelson and Bergen to provide a concise problem statement for imagebased ..."
Abstract

Cited by 770 (23 self)
 Add to MetaCart
based rendering paradigms, such as morphing and view interpolation. The plenoptic function is a parameterized function for describing everything that is visible from a given point in space. We present an imagebased rendering system based on sampling, reconstructing, and resampling the plenoptic function
Local grayvalue invariants for image retrieval
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1997
"... Abstract—This paper addresses the problem of retrieving images from large image databases. The method is based on local grayvalue invariants which are computed at automatically detected interest points. A voting algorithm and semilocal constraints make retrieval possible. Indexing allows for efficie ..."
Abstract

Cited by 545 (28 self)
 Add to MetaCart
Abstract—This paper addresses the problem of retrieving images from large image databases. The method is based on local grayvalue invariants which are computed at automatically detected interest points. A voting algorithm and semilocal constraints make retrieval possible. Indexing allows
Results 1  10
of
1,059,304