Three-dimensional motion and dense-structure estimation using convex projections
Author
Alatan, A. Aydın
Erdem, A. Tanju
Onural, Levent
Date
1997-02Source Title
Electronic Imaging '97 - Proceedings - Visual Communications and Image Processing '97
Print ISSN
0277-786X
Publisher
SPIE
Pages
1122 - 1131
Language
English
Type
Conference PaperItem Usage Stats
155
views
views
124
downloads
downloads
Abstract
We propose a novel method for estimating the 3D motion and dense structure of an object form its two 2D images. The proposed method is an iterative algorithm based on the theory of projections onto convex sets (POCS) that involves successive projections onto closed convex constraint sets. We seek a solution for the 3D motion and structure information that satisfies the following constraints: (i) rigid motion - the 3D motion parameters are the same for each point on the object. (ii) Smoothness of the structure - depth values of the neighboring points on the object vary smoothly. (iii) Temporal correspondence - the intensities in the given 2D images match under the 3D motion and structure parameters. We mathematically derive the projection operators onto these sets and discuss the convergence properties of successive projections. Experimental results show that the proposed method significantly improves the initial motion and structure estimates.
Keywords
3-D motion estimationProjections onto convex sets
Structure estimation
Video coding
Communication
Constraint theory
Digital image storage
Image coding
Image communication systems
Image enhancement
Image processing
Imaging systems
Mechanisms
Motion compensation
Motion estimation
Programming theory
Set theory
Visual communication
2d images
3d motions
Convergence properties
Convex constraints
Convex projections
Dense structures
Iterative algorithms
Neighboring points
Novel methods
Projection operators
Projections onto convex sets
Structure informations
Structure parameters
Video coding
Three dimensional
Permalink
http://hdl.handle.net/11693/27692Published Version (Please cite this version)
http://dx.doi.org/10.1117/12.263192Collections
Related items
Showing items related by title, author, creator and subject.
-
Projections onto the epigraph set of the filtered variation function based deconvolution algorithm
Tofighi, M.; Çetin, A. Enis (IEEE, 2017)A new deconvolution algorithm based on orthogonal projections onto the hyperplanes and the epigraph set of a convex cost function is presented. In this algorithm, the convex sets corresponding to the cost function are ... -
Filtered Variation method for denoising and sparse signal processing
Köse, Kıvanç; Cevher V.; Çetin, A. Enis (IEEE, 2012)We propose a new framework, called Filtered Variation (FV), for denoising and sparse signal processing applications. These problems are inherently ill-posed. Hence, we provide regularization to overcome this challenge by ... -
Algorithms for linear and convex feasibility problems: A brief study of iterative projection, localization and subgradient methods
Özaktaş, Hakan (Bilkent University, 1998)Several algorithms for the feasibility problem are investigated. For linear systems, a number of different block projections approaches have been implemented and compared. The parallel algorithm of Yang and Murty is ...