Abstract
It is well known that one can collect the coefficients of five (or more) homographies between two views into a large, rank deficient matrix. In principle, this implies that one can refine the accuracy of the estimates of the homography coefficients by exploiting the rank constraint. However, the standard rank-projection approach is impractical for two different reasons: it requires many homographies to even score a modest gain; and, secondly, correlations between the errors in the coefficients will lead to poor estimates.
In this paper we study these problems and provide solutions to each. Firstly, we show that the matrices of the homography coefficients can be recast into two parts, each consistent with ranks of only one. This immediately establishes the prospect of realistically (that is, with as few as only three or four homographies) exploiting the redundancies of the homographies over two views. We also tackle the remaining issue: correlated coefficients. We compare our approach with the “gold standard”; that is, non-linear bundle adjustment (initialized from the ground truth estimate—the ideal initialization). The results confirm our theory and show one can implement rank-constrained projection and come close to the gold standard in effectiveness. Indeed, our algorithm (by itself), or our algorithm further refined by a bundle adjustment stage; may be a practical algorithm: providing generally better results than the “standard” DLT (direct linear transformation) algorithm, and even better than the bundle adjustment result with the DLT result as the starting point. Our unoptimized version has roughly the same cost as bundle adjustment and yet can generally produce close to the “gold standard” estimate (as illustrated by comparison with bundle adjustment initialized from the ground truth).
Independent of the merits or otherwise of our algorithm, we have illuminated why the naive approach of direct rank-projection is relatively doomed to failure. Moreover, in revealing that there are further rank constraints, not previously known; we have added to the understanding of these issues, and this may pave the way for further improvements.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Aguiar, P. M. Q., & Moura, J. M. F. (1999a). Factorization as a rank 1 problem. In Proc. conf. computer vision and pattern recognition (pp. 178–184).
Aguiar, P. M. Q., & Moura, J. M. F. (1999b). A fast algorithm for rigid structure from image sequences. In Proc. int’l conf. image processing.
Aguiar, P. M. Q., & Moura, J. M. F. (2000). Weighted factorization. In ICIP (pp. 549–552).
Aguiar, P. M. Q., & Moura, J. M. F. (2001). Three-dimensional modeling from two-dimensional video. IEEE Transactions on Image Processing, 10(10).
Aguiar, P. M. Q., & Moura, J. M. F. (2003). Rank 1 weighted factorization for 3d structure recovery: algorithms and performance analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(9), 1134–1149.
Anandan, P., & Irani, M. (2002). Factorization with uncertainty. International Journal of Computer Vision, 49(2/3), 101–116.
Basri, R., & Jacobs, D. W. (1999). Lambertian reflectance and linear subspaces. In Proc. int’l conf. computer vision (pp. 383–390).
Basri, R., & Jacobs, D. W. (2003). Lambertian reflectance and linear subspaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(2), 218–233.
Brand, M. (2002). Incremental singular value decomposition of uncertain data with missing values. In Proc. European conf. computer vision (pp. 707–720).
Chen, P. (2004). An investigation of statistical aspects of linear subspace analysis for computer vision applications. PhD thesis, Monash University.
Chen, P., & Suter, D. (2008, to appear). Error analysis in homography estimation by first order approximation tools: A general technique. Journal of Mathematical Imaging and Vision.
Chen, P., & Suter, D. (2006). An analysis of linear subspace approaches for computer vision and pattern recognition. International Journal of Computer Vision, 68(1), 83–106.
Chen, P., & Suter, D. (2007). A bilinear approach to the parameter estimation of a general heteroscedastic linear system, with application to conic fitting. Journal of Mathematical Imaging and Vision, 28(3), 191–208.
Fischler, M. A., & Rolles, R. C. (1981). Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM, 24(6), 381–395.
Golub, G. H., & Loan, C. F. V. (1996). Matrix computations (3nd edn.). Baltimore: Johns Hopkins University Press.
Hartley, R. I., & Zisserman, A. (2003). Multiple view geometry in computer vision (2nd edn.). Cambridge: Cambridge University Press.
Irani, M., & Anandan, P. (2000). Factorization with uncertainty. In Proc. European conf. computer vision (Vol. 49, pp. 539–553).
Leedan, Y., & Meer, P. (2000). Heteroscedastic regression in computer vision: Problems with bilinear constraint. International Journal of Computer Vision, 37(2), 127–150.
Manton, J. H., Mahony, R., & Hua, Y. (2003). The geometry of weighted low-rank approximations. IEEE Transactions on Signal Processing, 51(2), 500–514.
Morita, T., & Kanade, T. (1997). A sequential factorization method for recovering shape and motion from image streams. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(8), 858–867.
Poelman, C., & Kanade, T. (1994). A paraperspective factorization method for shape and motion recovery. In Proc. European conf. computer vision (pp. 206–218).
Poelman, C., & Kanade, T. (1997). A paraperspective factorization method for shape and motion recovery. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(3), 206–219.
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1992). Numerical recipes in C (2nd edn.). Cambridge: Cambridge University Press.
Ramamoorthi, R. (2002). Analytic PCA construction for theoretical analysis of lighting variability in images of a Lambertian object. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(10), 1322–1333.
Ramamoorthi, R., & Hanrahan, P. (2001). On the relationship between radiance and irradiance: Determining the illumination from images of a convex Lambertian object. Journal of the Optical Society of America (JOSA A), 18(10), 2448–2459.
Shashua, A., & Avidan, S. (1996). The rank 4 constraint in multiple (>2) view geometry. In Proc. European conf. computer vision (pp. 196–206).
Tomasi, C., & Kanade, T. (1990). Shape and motion without depth. In Proc. int’l conf. computer vision.
Tomasi, C., & Kanade, T. (1992). Shape and motion from image streams under orthography: A factorization method. International Journal of Computer Vision, 9(2), 137–154.
Triggs, B., McLauchlan, P., Hartley, R., & Fitzgibbon, A. (2000). Bundle adjustment—A modern synthesis. In W. Triggs, A. Zisserman, & R. Szeliski (Eds.), LNCS. Vision algorithms: theory and practice (pp. 298–375). Berlin: Springer.
Zelnik-Manor, L., & Irani, M. (1999a). Multi-frame alignment of planes. In Proc. conf. computer vision and pattern recognition.
Zelnik-Manor, L., & Irani, M. (1999b). Multi-view subspace constraints on homographies. In Proc. int’l conf. computer vision (pp. 710–715).
Zelnik-Manor, L., & Irani, M. (2002). Multi-view subspace constraints on homographies. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(2), 214–223.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chen, P., Suter, D. Rank Constraints for Homographies over Two Views: Revisiting the Rank Four Constraint. Int J Comput Vis 81, 205–225 (2009). https://doi.org/10.1007/s11263-008-0167-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11263-008-0167-z