Abstract
The aim of this paper is to describe different estimation techniques in order to deal with point-wise surface normal estimation from calibrated stereo configuration. We show here that the knowledge of the affine transformation between two projections is sufficient for computing the normal vector unequivocally. The formula which describes the relationship among the cameras, normal vectors and affine transformations is general, since it works for every kind of cameras, not only for the pin-hole one. However, as it is proved in this study, the normal estimation can optimally be solved for the perspective camera. Other non-optimal solutions are also proposed for the problem. The methods are tested both on synthesized data and real-world images. The source codes of the discussed algorithms are available on the web.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Triggs, B., McLauchlan, P.F., Hartley, R.I., Fitzgibbon, A.W.: Bundle adjustment – a modern synthesis. In: Triggs, B., Zisserman, A., Szeliski, R. (eds.) ICCV-WS 1999. LNCS, vol. 1883, pp. 298–372. Springer, Heidelberg (2000)
Björck, Å.: Numerical Methods for Least Squares Problems. SIAM, Philadelphia (1996)
Faugeras, O., Lustman, F.: Motion and structure from motion in a piecewise planar environment. Technical Report RR-0856, INRIA (1988)
Fischler, M., Bolles, R.: Random Sampling Consensus: a paradigm for model fitting with application to image analysis and automated cartography. Commun. Assoc. Comp. Mach. 24, 358–367 (1981)
Fodor, B., Kazó, C., Zsolt, J., Hajder, L.: Normal map recovery using bundle adjustment. IET Comput. Vis. 8, 66–75 (2014)
Furukawa, Y., Ponce, J.: Accurate, dense, and robust multi-view stereopsis. IEEE Trans. Pattern Anal. Mach. Intell. 32(8), 1362–1376 (2010)
Habbecke, M., Kobbelt, L.: Iterative multi-view plane fitting. In: VMV06, pp. 73–80 (2006)
Habbecke, M., Kobbelt, L.: A surface-growing approach to multi-view stereo reconstruction. In: CVPR (2007)
Hartley, R.I., Sturm, P.: Triangulation. Comput. Vis. Image Underst. CVIU 68(2), 146–157 (1997)
Hartley, R.I., Zisserman, A.: Multiple View Geometry in Computer Vision. Cambridge University Press, Cambridge (2003)
Kreyszig, E.: Differential Geometry. Dover Publications, New York (1991)
Liu, H.: Deeper Understanding on Solution Ambiguity in Estimating 3D Motion Parameters by Homography Decomposition and its Improvement. Ph.D. thesis, University of Fukui (2012)
Malis, E., Vargas, M.: Deeper understanding of the homography decomposition for vision-based control. Technical Report RR-6303, INRIA (2007)
Tanacs, A., Majdik, A., Molnar, J., Rai, A., Kato, Z.: Establishing correspondences between planar image patches. In: International Conference on Digital Image Computing: Techniques and Applications (DICTA) (2014)
Woodham, R.J.: Photometric stereo: A reflectance map technique for determining surface orientation from image intensity. In: Image Understanding Systems and Industrial Applications, Proceedings SPIE, vol. 155, pp. 136–143 (1978)
Yu, G., Morel, J.-M.: ASIFT: an algorithm for fully affine invariant comparison. Image Processing On Line, 2011 (2011)
Megyesi, Z., K’os, G., Chetverikov, D.: Dense 3d reconstruction from images by normal aided matching. Mach. Graph. Vis. 15, 3–28 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
A Appendix
A Appendix
Algorithm for Optimal Normal Estimation. The task is to minimize the cost function defined in Eq. 12 with respect to normal vector n. The scale of the vector is arbitrary, only the direction of the normal is required. Such kind of problems are typically solved using Lagrange-multipliers, however, it cannot be applied here since the derivatives become very difficult. For this reason, we utilize another constraint for the normal: let the sum of the coordinates be 1. Thus, n is written as \(n=[n_x,n_y,1-n_x-n_y]^T\). Equation 12 can be reformulated as,
where \(m=[n_x,n_y]\), \(q_i=[w_{i,x}-w_{i,z},w_{i,y}-w_{i,z}]^T\). (Indices x, y, and z denote the first, second, and third coordinates of vectors, respectively.)
The minima/maxima can be obtained by taking the derivative with respect to vector m:
where
After taking the lowest common multiple of the fractions, the left side should be equal to zero as \(\sum _{k=1}^{4} \delta _k \kappa _k =0\), where
It can be simplified as \(\sum _{k=1}^{4} e^1_k e^2_k =0\), where
This is an equation with a 2D-vector:
where \(r=\left( m^{T}(q_{k}-a_{k}\alpha q_{5})+(w_{k,z}-a_{k}\alpha w_{5,z})\right) \).
By introducing the \(m=[x,y]^{T}\) notation, the vector equation is modified as follows
where
The rows of the vector equation give two special quadratic curves. They are written by their implicit equations as \(\sum _{k=1}^{4}A_{k}^{l}x^{2}+\sum _{k=1}^{4}B_{k}^{l}y^{2}+\sum _{k=1}^{4}C_{k}^{l}xy+\sum _{k=1}^{4}D_{k}^{l}x+\sum _{k=1}^{4}E_{k}^{l}y+\sum _{k=1}^{4}F_{k}^{l}=0\), where \(A_{k}^{l}=\varOmega _{k}\varOmega _{k}^{l}\), \(B_{k}^{l}=\varPsi _{k}\varPsi _{k}^{l}\), \(C_{k}^{l}=\varOmega _{k}^{l}\varPsi _{k}+\varPsi _{k}^{l}\varOmega _{k}\), \(D_{k}^{l}=\varOmega _{k}^{l}\varGamma _{k}+\varGamma _{k}^{l}\varOmega _{k}\), \(E_{k}^{l}=\varPsi _{k}^{l}\varGamma _{k}+\varGamma _{k}^{l}\varPsi _{k}\) and \(F_{k}^{l}=\varGamma _{k}\varGamma _{k}^{l}\), \(l\in {1,2}\). They are special because \(A_{k}^{1}=0\) and \(B_{k}^{2}=0\).
The solution of the optimal method described in the study (within appendix) is given by the intersection of two quadratic equations.
Parameter y can be obtained from the latter equation as
Substituting y into the first equation the following expression is obtained
If both sides are multiplied with \((C_{2}x+E_{2})^{2}\), then the equation modifies as follows
This is a fourth-order polynomial where the coefficients are as follows
Remark that the equation \(C_{2}x+E_{2}=0\) can also be considered. (In this case the first equation is independent from y.)
An example for two quadratic curves with three real intersections is visualized in Fig. 12. (The parameters of curves are \(B1 = -1.9055\), \(C1 = 2.2632\), \(D1 = 2.8577\), \(E1 = -9.4392\), \(F1 = 7.7081\), and \(A2 = -2.2632\), \(C2 = 1.9055\), \(D2 = -4.2074\), \(E2 = 2.3903\), \(F2 = -1.1190\)).
Affine Parameters from Homography. The affine parameters can be obtained from the homography between the stereo image pairs. Let us assume that the homography H is given. Then the correspondence between the coordinates on the first (u and v) and second (\(u'\) and \(v'\)) images is written as
where the \(3 \times 3\) homography matrix H is written as
The affine parameters come from the partial derivatives of the perspective plane-plane transformation. The top left element \(a_{11}\) of affine transformation matrix is as follows
where \(s=h_3^T [u,v,1]^T\). The other components of affine matrix are obtained similarly
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Barath, D., Molnar, J., Hajder, L. (2016). Novel Methods for Estimating Surface Normals from Affine Transformations. In: Braz, J., et al. Computer Vision, Imaging and Computer Graphics Theory and Applications. VISIGRAPP 2015. Communications in Computer and Information Science, vol 598. Springer, Cham. https://doi.org/10.1007/978-3-319-29971-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-29971-6_17
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29970-9
Online ISBN: 978-3-319-29971-6
eBook Packages: Computer ScienceComputer Science (R0)