Sciweavers

3244 search results - page 272 / 649
» On convex complexity measures
Sort
View
CVPR
1996
IEEE
16 years 8 months ago
Minimal operator set for passive depth from defocus
A fundamental problem in depth from defocus is the measurement of relative defocus between images. We propose a class of broadband operators that, when used together, provide inva...
Masahiro Watanabe, Shree K. Nayar
CVPR
1999
IEEE
16 years 8 months ago
Explaining Optical Flow Events with Parameterized Spatio-Temporal Models
A spatio-temporal representation for complex optical flow events is developed that generalizes traditional parameterized motion models (e.g. affine). These generative spatio-tempo...
Michael J. Black
CVPR
2005
IEEE
16 years 8 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...
ICIP
2003
IEEE
16 years 8 months ago
Shape analysis algorithm based on information theory
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...
Andreas Koschan, Besma Roui-Abidi, David L. Page, ...
ICPR
2006
IEEE
16 years 7 months ago
Robust Image Registration Based on Markov-Gibbs Appearance Model
A new approach to align an image of a textured object with a given prototype is proposed. Visual appearance of the images, after equalizing their signals, is modeled with a Markov...
Alaa E. Abdel-Hakim, Aly A. Farag, Ayman El-Baz, G...