TY - GEN

T1 - Estimation of motion and structure of planar surfaces from a sequence of monocular images

AU - Sull, Sanghoon

AU - Ahuja, Narendra

PY - 1991

Y1 - 1991

N2 - An algorithm is presented which estimates 10 parameters for motion and structure of a rigid planar patch given point correspondences in a monocular image sequence under perspective projection. The rotational velocity is assumed constant and the rotation center arbitrary. The algorithm mainly consists of two steps. First, the 3-D space of (ωx, ωy, ωz) is searched exhaustively and for each (ωx, ωy, ωz) all the other parameters with the value of an objective function are computed linearly. Some of the (ωx, ωy, ωz) and the corresponding structure values are used as the initial guesses in the second step. The objective function is iteratively minimized with respect to five variables for rotation and structure. The solution corresponding to the global minimum is used to obtain least squares estimates of the remaining unknowns, for translation and rotation center. It was experimentally found that the objective function converges well so that the 3-D space need not be densely searched. Results are presented for three image sequences, two simulated and one real.

AB - An algorithm is presented which estimates 10 parameters for motion and structure of a rigid planar patch given point correspondences in a monocular image sequence under perspective projection. The rotational velocity is assumed constant and the rotation center arbitrary. The algorithm mainly consists of two steps. First, the 3-D space of (ωx, ωy, ωz) is searched exhaustively and for each (ωx, ωy, ωz) all the other parameters with the value of an objective function are computed linearly. Some of the (ωx, ωy, ωz) and the corresponding structure values are used as the initial guesses in the second step. The objective function is iteratively minimized with respect to five variables for rotation and structure. The solution corresponding to the global minimum is used to obtain least squares estimates of the remaining unknowns, for translation and rotation center. It was experimentally found that the objective function converges well so that the 3-D space need not be densely searched. Results are presented for three image sequences, two simulated and one real.

UR - http://www.scopus.com/inward/record.url?scp=0026390824&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026390824&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0026390824

SN - 0818621486

T3 - Proc 91 IEEE Comput Soc Conf Comput Vision Pattern Recognit

SP - 732

EP - 733

BT - Proc 91 IEEE Comput Soc Conf Comput Vision Pattern Recognit

PB - Publ by IEEE

T2 - Proceedings of the 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Y2 - 3 June 1991 through 6 June 1991

ER -