Abstract
This paper develops new insight into the local structure of occluding boundaries on 3D surfaces. Prior literature has addressed the relationship between 3D occluding boundaries and their 2D image projections by radial curvature, planar curvature, and Gaussian curvature. Occluding boundaries have also been studied implicitly as intersections of level surfaces, avoiding their explicit description in terms of local surface geometry. In contrast, this work studies and characterizes the local structure of occluding curves explicitly in terms of the local geometry of the surface. We show how the first order structure of the occluding curve (its tangent) can be extracted from the second order structure of the surface purely along the viewing direction, without the need to consider curvatures or torsions in other directions. We derive a theorem to show that the tangent vector of the occluding boundary exhibits a strikingly elegant decomposition along the viewing direction and its orthogonal tangent, where the decomposition weights precisely match the geodesic torsion and the normal curvature of the surface respectively only along the line-of-sight! Though the focus of this paper is an enhanced theoretical understanding of the occluding curve in the continuum, we nevertheless demonstrate its potential numerical utility in a straight-forward marching method to explicitly trace out the occluding curve. We also present mathematical analysis to show the relevance of this theory to computer vision and how it might be leveraged in more accurate future algorithms for 2D/3D registration and/or multiview stereo reconstruction.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
This assumes no radial/tangential lens distortion, otherwise we must also multiply the right hand side of (6) by the determinant of the distortion model’s Jacobian.
References
Abdel-All, N.H., Badr, S.A.N., Soliman, M., Hassan, S.A.: Intersection curves of two implicit surfaces in r3. J. Math. Comput. Sci. 2(2), 152–171 (2012)
Abdel-Malek, K., Yeh, H.J.: On the determination of starting points for parametric surface intersections. Comput. Aided Des. 29(1), 21–35 (1997)
Bajaj, C.L., Hoffmann, C.M., Lynch, R.E., Hopcroft, J.: Tracing surface intersections. Comput. Aided Geomet. Des. 5(4), 285–307 (1988)
Chen, H.C., et al.: Model-based measurement of food portion size for image-based dietary assessment using 3D/2D registration. Meas. Sci. Technol. 24(10), 105701 (2013)
Dambreville, S., Sandhu, R., Yezzi, A., Tannenbaum, A.: Robust 3D Pose estimation and efficient 2D region-based segmentation from a 3D shape prior. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008. LNCS, vol. 5303, pp. 169–182. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-88688-4_13
De Vivo, F., Battipede, M., Gili, P.: Occlusion points identification algorithm. Comput. Aided Des. 91, 75–83 (2017)
DeCarlo, D., Finkelstein, A., Rusinkiewicz, S., Santella, A.: Suggestive contours for conveying shape. In: ACM SIGGRAPH 2003 Papers. pp. 848–855 (2003)
Düldül, B.U., Çalişkan, M.: The geodesic curvature and geodesic torsion of the intersection curve of two surfaces. Acta Universitatis Apulensis. Math. Informat 24, 161–172 (2010)
Fabbri, R., Kimia, B.B.: Multiview differential geometry of curves. Int. J. Comput. Vision 120(3), 324–346 (2016)
Faugeras, O., Keriven, R.: Variational principles, surface evolution, PDE’s, level set methods and the stereo problem. IEEE Trans. Image Process. 7, 336–344 (2002)
Giblin, P.: Reconstruction of surfaces from profiles. In: Proceedings of 1st International Conference on Computer Vision, London, 1987 (1987)
Ikeuchi, K., Horn, B.K.: Numerical shape from shading and occluding boundaries. Artif. Intell. 17(1–3), 141–184 (1981)
Kaptein, B., Valstar, E., Stoel, B., Rozing, P., Reiber, J.: A new model-based RSA method validated using cad models and models from reversed engineering. J. Biomech. 36(6), 873–882 (2003)
Kehtarnavaz, N., Defigueiredo, R.: Recognition of 3D curves based on curvature and torsion. In: Digital and Optical Shape Representation and Pattern Recognition. vol. 938, pp. 357–364. International Society for Optics and Photonics (1988)
Koenderink, J.J.: What does the occluding contour tell us about solid shape? Perception 13(3), 321–330 (1984)
Kolev, K., Klodt, M., Brox, T., Cremers, D.: Continuous global optimization in multiview 3D reconstruction. Int. J. Comput. Vision 84(1), 80–96 (2009)
Kriegman, D.J., Ponce, J.: A new curve tracing algorithm and some applications. In: Curves and Surfaces, pp. 267–270. Elsevier, Philadelphia (1991)
Kriegman, D.J., Ponce, J.: Geometric modeling for computer vision. In: Curves and Surfaces in Computer Vision and Graphics II, vol. 1610, pp. 250–260. International Society for Optics and Photonics (1992)
Lamecker, H., Wenckebach, T.H., Hege, H.C.: Atlas-based 3D-shape reconstruction from X-ray images. In: 18th International Conference on Pattern Recognition (ICPR 2006), vol. 1, pp. 371–374. IEEE (2006)
Lazebnik, S., Ponce, J.: The local projective shape of smooth surfaces and their outlines. Int. J. Comput. Vision 63(1), 65–83 (2005)
Li, T.M., Aittala, M., Durand, F., Lehtinen, J.: Differentiable monte CARLO ray tracing through edge sampling. ACM Trans. Graph. 37(6), 1–11 (2018)
Lindstrom, P., Turk, G.: Fast and memory efficient polygonal simplification. In: Proceedings Visualization’98 (Cat. No. 98CB36276,. pp. 279–286. IEEE (1998)
Lone, M.S., Shahid, M.H., Sharma, S.: A new approach towards transversal intersection curves of two surfaces in \(\mathbb{R} ^3\). Geom. Imag. Comput. 3(3), 81–99 (2016)
Marr, D.: Analysis of occluding contour. Proc. R. Soc. Lond. Ser. B. Biol. Sci. 197(1129), 441–475 (1977)
Ponce, J., Hebert, M.: On image contours of projective shapes. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) ECCV 2014. LNCS, vol. 8692, pp. 736–749. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-10593-2_48
Prisacariu, V.A., Reid, I.D.: PWP3D: real-time segmentation and tracking of 3D objects. Int. J. Comput. Vis. 98(3), 335–354 (2012)
Runz, M., et al.: Frodo: From detections to 3D objects. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 14720–14729 (2020)
Sandhu, R., Dambreville, S., Yezzi, A., Tannenbaum, A.: A nonrigid kernel-based framework for 2D–3D pose estimation and 2D image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 33(6), 1098–1115 (2010)
Soliman, M.A.L., Abdel-All, N.H., Hassan, S.A., Badr, S.A.N., et al.: Intersection curves of implicit and parametric surfaces in r 3. Appl. Math. 2(08), 1019 (2011)
Thirion, J.P., Gourdon, A.: The 3D marching lines algorithm. Graph. Models Image Process. 58(6), 503–509 (1996)
Vaillant, R.: Using occluding contours for 3D object modeling. In: Faugeras, O. (ed.) ECCV 1990. LNCS, vol. 427, pp. 454–464. Springer, Heidelberg (1990). https://doi.org/10.1007/BFb0014895
Vaillant, R., Faugeras, O.D.: Using extremal boundaries for 3-d object modeling. IEEE Trans. Pattern Anal. Mach. Intell. 14(02), 157–173 (1992)
Wang, C., Fu, H., Tao, D., Black, M.: Occlusion boundary: A formal definition & its detection via deep exploration of context. IEEE Trans. Pattern Anal. Mach. Intell. 44, 2641–2656 (2020)
Ye, X., Maekawa, T.: Differential geometry of intersection curves of two surfaces. Comput. Aided Geomet. Des. 16(8), 767–788 (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
1 Electronic supplementary material
Below is the link to the electronic supplementary material.
A Appendices
A Appendices
1.1 A.1 Intrinsic Gradient
If \(f:\mathcal {S}\rightarrow \mathbb {R}\) is a differentiable function defined on \(\mathcal {S}\), the “intrinsic gradient” would naturally correspond to the projection onto the tangent plane of the standard \(\mathbb {R}^{3}\) gradient of any local differentiable extension \(\hat{f}:\mathbb {R}^{3}\rightarrow \mathbb {R}\), where \(\hat{f}(S)=f(S)\).
However, we can intrinsically define the gradient of f, without reference to any extension function \(\hat{f}\), as the unique tangent vector \(\nabla _{S}f\) which satisfies the equality \(\partial _\textbf{t}f=\nabla _{S}f\cdot \textbf{t}\) for any tangent vector \(\textbf{t}\) (where \(\partial _\textbf{t}f\) denotes the directional derivative of f along the vector \(\textbf{t}\)). We can solve for this vector using the first fundamental form coefficients E, F, G together with the partial derivatives of f with respect to the surface parameters u, v as follows.
1.2 A.2 Orthogonal Decomposition of the Shape Operator
We first orthogonally decompose the shape operator (which actually generalizes Theorem 1) to see both its covariant action and its contravariant action which is ignored in classical differential geometry but highly relevant to our exploration.
Lemma 1
The action of the shape operator \(\mathbb {S}\) on any tangent vector \(\textbf{t} \in \mathbb {R}^3\) can be decomposed into a covariant component parallel to its argument \(\textbf{t}\) and a contravariant component along the perpendicular tangent direction \(\textbf{t}_{\perp }=\textbf{n}\times \textbf{t}\)
where \(\kappa (\textbf{t})\) is the normal curvature (by definition) in the direction of \(\textbf{t}\) and where \(\tau (\textbf{t})\) matches the geodesic torsion in the direction of \(\textbf{t}\).
Proof
As an operator from the tangent space back to the tangent space, we may decompose the action of the shape operator into two orthogonal directions within the tangent plane, one parallel to its argument \(\textbf{t}\) and the other along the perpendicular tangent direction \(\textbf{t}_{\perp }\) as follows,
1.3 A.3 Proof for Theorem 1
Proof
We first compute the intrinsic gradient of the local occlusion function g.
Notice that
which allows us to substitute \(\textbf{e}_{r}\) with \(\textbf{t}_{r}=\begin{bmatrix}\frac{\partial S}{\partial u}&\frac{\partial S}{\partial v}\end{bmatrix}t_{r}\), where \(t_{r}\) denotes the 2D intrinsic representation of \(\textbf{t}_{r}\) in the basis \(\frac{\partial S}{\partial u}\) and \(\frac{\partial S}{\partial v}\)
where e, f, g are the coefficients of second fundamental form \(\textbf{II}\). The appearance of the Weingarten formulas allows us to recognize this part of the expression as the shape operator \(\mathbb {S}\) applied to the radial tangent vector \(\textbf{t}_{r}\) and therefore write
Since we define in Lemma 1 the direction of \(\textbf{t}_\perp ^*\) opposite to direction of \(\nabla _{_S}g\), we may then write
Subsequently, the occluding tangent is computed as follows,
For the outward unit normal \(\textbf{n}\), we negate \(\textbf{n}\) in the equations above. Therefore, we have
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Yang, H., Yezzi, A. (2022). Decomposing the Tangent of Occluding Boundaries According to Curvatures and Torsions. In: Avidan, S., Brostow, G., Cissé, M., Farinella, G.M., Hassner, T. (eds) Computer Vision – ECCV 2022. ECCV 2022. Lecture Notes in Computer Science, vol 13692. Springer, Cham. https://doi.org/10.1007/978-3-031-19824-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-19824-3_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-19823-6
Online ISBN: 978-3-031-19824-3
eBook Packages: Computer ScienceComputer Science (R0)