By Topic

Estimating the orientation of planar surfaces: algorithms and bounds

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Permuter, H. ; Dept. of Electr. & Comput. Eng., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel ; Francos, J.M.

This paper presents a computationally and statistically efficient parametric solution to the problem of estimating the orientation in space of a planar textured surface from a single, noisy, observed image of it. The coordinate transformation from surface to image coordinates, due to the perspective projection, transforms each homogeneous sinusoidal component of the surface texture into a sinusoid whose frequency is a function of location. The functional dependence of the sinusoid phase in location is uniquely determined by the tilt and slant angles of the surface. From the physical model of the perspective projection, we derive the Cramer-Rao lower bound on the error variance of estimating the tilt and slant of the observed surface in the presence of observation noise. It is shown in this paper that the phase of each of the sinusoids can be expressed as a linear function of some variables that are related to the surface tilt and slant angles. Using the phase differencing algorithm, we fit a polynomial phase model to a sinusoidal component of the observed texture. Substituting in the derived linear relation, the unknown phase with the one estimated using the phase differencing algorithm, we obtain a closed-form, analytic, and computationally efficient solution to the problem of estimating the tilt and slant angles. The algorithm performance is shown to be close to the Cramer-Rao bound, even for low signal-to-noise ratios, at computational complexity which is considerably lower than that of any existing algorithm

Published in:

Information Theory, IEEE Transactions on  (Volume:46 ,  Issue: 5 )