Abstract
We present a Non-Rigid Structure-from-Motion (NRSfM) method to reconstruct an object whose topology is known. We represent the topology by a 3D shape that weakly resembles the object, which we call a Topological Template (ToTem). The ToTem has two main differences with the template used in Shape-from-Template (SfT). First, the shape in the ToTem is not necessarily feasible for the object, whereas it must be in the SfT template. Second, the ToTem only models shape, excluding the classical texture-map representing colour in the SfT template. These two differences greatly alleviate the practical difficulty of constructing a template. However, they make the reconstruction problem challenging, as they preclude the use of strong deformation constraints between the template shape and the reconstruction and the possibility of directly establishing correspondences between the template and the images. Our method uses an isometric deformation prior and proceeds in four steps. First, it reconstructs point-clouds from the images. Second, it aligns the ToTem to the point-clouds. Third, it creates a coherent surface parameterisation. Fourth, it performs a global refinement, posed as Bundle Adjustment (BA). We show experimentally that our method outperforms the existing methods for its isolated steps and NRSfM methods overall, in terms of 3D accuracy, ability to reconstruct the object’s visible surface and ability to approximate the object’s invisible surface.
Similar content being viewed by others
Data availability
Code and data available at https://github.com/agnivsen/ToTem-NRSfM
References
Azagra, P., Sostres, C., Ferrandez, Á., Riazuelo, L., Tomasini, C., Barbed, O. L., Morlana, J., Recasens, D., Batlle, V. M., Gómez-Rodríguez, J. J., et al. (2022). Endomapper dataset of complete calibrated endoscopy procedures. arXiv preprint arXiv:2204.14240
Bai, F., & Bartoli, A. (2022). Procrustes analysis with deformations: A closed-form solution by eigenvalue decomposition. International Journal of Computer Vision, 547, 1–27.
Barron, J. T., & Malik, J. (2014). Shape, illumination, and reflectance from shading. IEEE Transactions on Pattern Analysis and Machine Intelligence, 37(8), 1670–1687.
Bartoli, A., Gérard, Y., Chadebecq, F., Collins, T., & Pizarro, D. (2015). Shape-from-template. IEEE Transactions on Pattern Analysis and Machine Intelligence, 37(10), 2099–2118.
Bartoli, A., Perriollat, M., & Chambon, S. (2010). Generalized thin-plate spline warps. International Journal of Computer Vision, 88(1), 85–110.
Bellekens, B., Spruyt, V., Berkvens, R., & Weyn, M. (2014). A survey of rigid 3D pointcloud registration algorithms. In AMBIENT 2014: The fourth international conference on ambient computing, applications, services and technologies, August 24–28, 2014 (pp. 8–13). Rome, Italy.
Berger, M., Tagliasacchi, A., Seversky, L. M., Alliez, P., Guennebaud, G., Levine, J. A., Sharf, A., & Silva, C. T. (2017). A survey of surface reconstruction from point clouds. In Computer graphics forum (Vol. 36, pp. 301–329). Wiley.
Bernard, F., Schmidt, F. R., Thunberg, J., & Cremers, D. (2017). A combinatorial solution to non-rigid 3D shape-to-image matching. In Proceedings of the IEEE conference on computer vision and pattern recognition (pp. 1000–1009).
Bernardini, F., Mittleman, J., Rushmeier, H., Silva, C., & Taubin, G. (1999). The ball-pivoting algorithm for surface reconstruction. IEEE Transactions on Visualization and Computer Graphics, 5(4), 349–359.
Besl, P. J. & McKay, N. D. (1992). Method for registration of 3-D shapes. In Sensor fusion IV: Control paradigms and data structures (Vol. 1611, pp. 586–606). International Society for Optics and Photonics.
Bezdek, J. C., & Hathaway, R. J. (2002). Some notes on alternating optimization. In AFSS international conference on fuzzy systems (pp. 288–300). Springer.
Bhatia, R., & Kittaneh, F. (2000). Notes on matrix arithmetic-geometric mean inequalities. Linear Algebra and Its Applications, 308(1–3), 203–211.
Bhoi, A. (2019). Monocular depth estimation: A survey. arXiv preprint arXiv:1901.09402
Biswas, P., Toh, K.-C., & Ye, Y. (2008). A distributed SDP approach for large-scale noisy anchor-free graph realization with applications to molecular conformation. SIAM Journal on Scientific Computing, 30(3), 1251–1277.
Bookstein, F. L. (1989). Principal warps: Thin-plate splines and the decomposition of deformations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(6), 567–585.
Bregler, C., Hertzmann, A., & Biermann, H. (2000). Recovering non-rigid 3D shape from image streams. In Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No. PR00662) (Vol. 2, pp. 690–696). IEEE.
Calla, L. A. R., Perez, L. J. F., & Montenegro, A. A. (2019). A minimalistic approach for fast computation of geodesic distances on triangular meshes. Computers and Graphics, 84, 77–92.
Cao, Y., Wu, Z., & Shen, C. (2017). Estimating depth from monocular images as classification using deep fully convolutional residual networks. IEEE Transactions on Circuits and Systems for Video Technology, 28(11), 3174–3182.
Carlson, D., Haynsworth, E., & Markham, T. (1974). A generalization of the Schur complement by means of the Moore–Penrose inverse. SIAM Journal on Applied Mathematics, 26(1), 169–175.
Casillas-Perez, D., Pizarro, D., Fuentes-Jimenez, D., Mazo, M., & Bartoli, A. (2019). Equiareal shape-from-template. Journal of Mathematical Imaging and Vision, 61, 607–626.
Castellani, U., & Bartoli, A. (2020). 3D shape registration. 3D Imaging Analysis and Applications, 256, 353–411.
Chhatkuli, A., Pizarro, D., & Bartoli, A. (2014). Non-rigid shape-from-motion for isometric surfaces using infinitesimal planarity. In British machine vision conference.
Chhatkuli, A., Pizarro, D., Bartoli, A., & Collins, T. (2016). A stable analytical framework for isometric shape-from-template by surface integration. IEEE Transactions on Pattern Analysis and Machine Intelligence, 39(5), 833–850.
Chhatkuli, A., Pizarro, D., Collins, T., & Bartoli, A. (2017). Inextensible non-rigid structure-from-motion by second-order cone programming. IEEE Transactions on Pattern Analysis and Machine Intelligence, 40(10), 2428–2441.
Dai, Y., Li, H., & He, M. (2014). A simple prior-free method for non-rigid structure-from-motion factorization. International Journal of Computer Vision, 107, 101–122.
d’Aspremont, A., & Boyd, S. (2003). Relaxations and randomized methods for nonconvex QCQPs. EE392o Class Notes Stanford University, 1, 1–16.
Dubrovina, A., & Kimmel, R. (2011). Approximately isometric shape correspondence by matching pointwise spectral features and global geodesic structures. Advances in Adaptive Data Analysis, 3(01n02), 203–228.
Faugeras, O., & Luong, Q.-T. (2001). The geometry of multiple images: The laws that govern the formation of multiple images of a scene and some of their applications. MIT Press.
Golyanik, V., Jonas, A., Stricker, D., & Theobalt, C. (2020). Intrinsic dynamic shape prior for dense non-rigid structure from motion. In 2020 international conference on 3D vision (3DV) (pp. 692–701). IEEE.
Gotardo, P. F., & Martinez, A. M. (2011). Kernel non-rigid structure from motion. In 2011 international conference on computer vision (pp. 802–809). IEEE.
Granshaw, S. (1980). Bundle adjustment methods in engineering photogrammetry. The Photogrammetric Record, 10(56), 181–207.
Hamsici, O. C., Gotardo, P. F., & Martinez, A. M. (2012). Learning spatially-smooth mappings in non-rigid structure from motion. In European conference on computer vision (pp. 260–273). Springer.
Hartley, R. I., & Zisserman, A. (2004). Multiple view geometry in computer vision (2nd ed.). Cambridge University Press.
Hilbert, D., & Cohn-Vossen, S. (2021). Geometry and the imagination (Vol. 87). American Mathematical Society.
Hong, M., Razaviyayn, M., Luo, Z.-Q., & Pang, J.-S. (2015). A unified algorithmic framework for block-structured optimization involving big data: With applications in machine learning and signal processing. IEEE Signal Processing Magazine, 33(1), 57–77.
Horn, B. (1975). Determining shape from shading. The Psychology of Computer Vision.
Horn, B. K., & Weldon, E. (1986). Filtering closed curves. IEEE Transactions on Pattern Analysis and Machine Intelligence, 5, 665–668.
Hu, Y., Zhou, M., & Wu, Z. (2009). A dense point-to-point alignment method for realistic 3D face morphing and animation. International Journal of Computer Games Technology, 2009.
Iske, A. (2004). Multiresolution methods in scattered data modelling (Vol. 37). Springer.
Ji, P., Li, H., Dai, Y., & Reid, I. (2017). Maximizing rigidity "revisited: A convex programming approach for generic 3d shape reconstruction from multiple perspective views. In Proceedings of the IEEE international conference on computer vision (pp. 929–937).
Joshi, P., Meyer, M., DeRose, T., Green, B., & Sanocki, T. (2007). Harmonic coordinates for character articulation. ACM Transactions on Graphics (TOG), 26(3), 71.
Kahl, F., & Henrion, D. (2007). Globally optimal estimates for geometric reconstruction problems. International Journal of Computer Vision, 74, 3–15.
Kazhdan, M., Bolitho, M., & Hoppe, H. (2006). Poisson surface reconstruction. In Proceedings of the fourth Eurographics symposium on geometry processing (Vol. 7).
Kazhdan, M., & Hoppe, H. (2013). Screened Poisson surface reconstruction. ACM Transactions on Graphics (ToG), 32(3), 1–13.
Kelley, C. T. (1999). Iterative methods for optimization. SIAM.
Khan, F., Salahuddin, S., & Javidnia, H. (2020). Deep learning-based monocular depth estimation methods—a state-of-the-art review. Sensors, 20(8), 2272.
Kong, C., & Lucey, S. (2019). Deep interpretable non-rigid structure from motion. arXiv preprint arXiv:1902.10840
Kreyszig, E. (2013). Differential geometry. Courier Corporation.
Kumar, S., & Van Gool, L. (2022). Organic priors in non-rigid structure from motion. In Computer vision—ECCV 2022: 17th European conference, Tel Aviv, Israel, October 23–27, 2022, Proceedings, Part II (pp. 71–88). Springer.
Kurosh, A. G. (2014). Lectures in general algebra. Elsevier.
Li, B., Shen, C., Dai, Y., Van Den Hengel, A., & He, M. (2015a). Depth and surface normal estimation from monocular images using regression on deep features and hierarchical CRFs. In Proceedings of the IEEE conference on computer vision and pattern recognition (pp. 1119–1127).
Li, L., et al. (2015). Selected applications of convex optimization (Vol. 103). Springer.
Liu, Y., Pears, N., Rosin, P. L., & Huber, P. (2020). 3D imaging, analysis and applications. Springer.
Liu, F., Shen, C., Lin, G., & Reid, I. (2015). Learning depth from single monocular images using deep convolutional neural fields. IEEE Transactions on Pattern Analysis and Machine Intelligence, 38(10), 2024–2039.
Low, K.-L. (2004). Linear least-squares optimization for point-to-plane ICP surface registration. Chapel Hill, University of North Carolina, 4(10), 1–3.
Novotny, D., Ravi, N., Graham, B., Neverova, N., & Vedaldi, A. (2019). C3DPO: Canonical 3D pose networks for non-rigid structure from motion. In Proceedings of the IEEE/CVF international conference on computer vision (pp. 7688–7697).
Ortega, J. M., & Rheinboldt, W. C. (2000). Iterative solution of nonlinear equations in several variables. SIAM.
Östlund, J., Varol, A., Ngo, D. T., & Fua, P. (2012). Laplacian meshes for monocular 3D shape recovery. In ECCV, 3, 412–425.
Parashar, S., Pizarro, D., Bartoli, A., & Collins, T. (2015). As-rigid-as-possible volumetric shape-from-template. In Proceedings of the IEEE international conference on computer vision (pp. 891–899).
Parashar, S., Pizarro, D., & Bartoli, A. (2017). Isometric non-rigid shape-from-motion with Riemannian geometry solved in linear time. IEEE Transactions on Pattern Analysis and Machine Intelligence, 40(10), 2442–2454.
Parashar, S., Pizarro, D., & Bartoli, A. (2019). Local deformable 3d reconstruction with Cartan’s connections. IEEE Transactions on Pattern Analysis and Machine Intelligence, 42(12), 3011–3026.
Perriollat, M., & Bartoli, A. (2013). A computational model of bounded developable surfaces with application to image-based three-dimensional reconstruction. Computer Animation and Virtual Worlds, 24(5), 459–476.
Perriollat, M., Hartley, R., & Bartoli, A. (2011). Monocular template-based reconstruction of inextensible surfaces. International Journal of Computer Vision, 95(2), 124–137.
Pressley, A. N. (2010). Elementary differential geometry. Springer.
Probst, T., Paudel, D. P., Chhatkuli, A., & Gool, L. V. (2019). Convex relaxations for consensus and non-minimal problems in 3D vision. In Proceedings of the IEEE/CVF international conference on computer vision (pp. 10233–10242).
Rabbani, N., Calvet, L., Espinel, Y., Le Roy, B., Ribeiro, M., Buc, E., & Bartoli, A. (2022). A methodology and clinical dataset with ground-truth to evaluate registration accuracy quantitatively in computer-assisted laparoscopic liver resection. Computer Methods in Biomechanics and Biomedical Engineering: Imaging and Visualization, 10(4), 441–450.
Russell, C., Fayad, J., & Agapito, L. (2011). Energy based multiple model fitting for non-rigid structure from motion. In CVPR 2011 (pp. 3009–3016). IEEE.
Sabzevari, R., Del Bue, A., & Murino, V. (2012). Multi-view photometric stereo using semi-isometric mappings. In 2012 second international conference on 3D imaging, modeling, processing, visualization & transmission (pp. 547–554). IEEE.
Salzmann, M., & Urtasun, R. (2012). Beyond feature points: Structured prediction for monocular non-rigid 3D reconstruction. In Computer vision—ECCV 2012: 12th European conference on computer vision, Florence, Italy, October 7–13, 2012, Proceedings, Part IV (Vol. 12, pp. 245–259). Springer.
Salzmann, M., & Fua, P. (2010). Linear local models for monocular reconstruction of deformable surfaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(5), 931–944.
Sengupta, A., & Bartoli, A. (2021). Colonoscopic 3D reconstruction by tubular non-rigid structure-from-motion. International Journal of Computer Assisted Radiology and Surgery, 16(7), 1237–1241.
Sheffer, A., Lévy, B., Mogilnitsky, M., & Bogomyakov, A. (2005). ABF++: Fast and robust angle based flattening. ACM Transactions on Graphics (TOG), 24(2), 311–330.
Sheffer, A., & de Sturler, E. (2001). Parameterization of faceted surfaces for meshing using angle-based flattening. Engineering with Computers, 17(3), 326–337.
Takmaz, A., Paudel, D. P., Probst, T., Chhatkuli, A., Oswald, M. R., & Van Gool, L. (2020). Unsupervised monocular depth reconstruction of non-rigid scenes. arXiv preprint arXiv:2012.15680
Torresani, L., & Bregler, C. (2002). Space-time tracking. In European conference on computer vision (pp. 801–812). Springer.
Torresani, L., Yang, D. B., Alexander, E. J., & Bregler, C. (2001). Tracking and modeling non-rigid objects with rank constraints. In Proceedings of the IEEE conference on computer vision and pattern recognition (Vol. 1, p. I). IEEE.
Torresani, L., Hertzmann, A., & Bregler, C. (2008). Nonrigid structure-from-motion: Estimating shape and motion with hierarchical priors. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30(5), 878–892.
Torr, P. H., & Zisserman, A. (2000). MLESAC: A new robust estimator with application to estimating image geometry. Computer Vision and Image Understanding, 78(1), 138–156.
Triggs, B., McLauchlan, P. F., Hartley, R. I., & Fitzgibbon, A. W. (1999). Bundle adjustment: A modern synthesis. In International workshop on vision algorithms (pp. 298–372). Springer.
Varol, A., Salzmann, M., Tola, E., & Fua, P. (2009). Template-free monocular reconstruction of deformable surfaces. In 2009 IEEE 12th international conference on computer vision (pp. 1811–1818). IEEE.
Yang, J., Li, H., Campbell, D., & Jia, Y. (2015). Go-ICP: A globally optimal solution to 3D ICP point-set registration. IEEE Transactions on Pattern Analysis and Machine Intelligence, 38(11), 2241–2254.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Matteo Poggi.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendices
Geometry of the Topological Templates
We describe some basic geometric properties of the parametric shapes in the following paragraphs.
1.1 Planar
We denote the 2D template with \({\textbf{p}} = (x,y) \in \mathbb {R}^2\). Therefore the map \(\Delta :\mathbb {R}^2 \mapsto \mathbb {R}^3\) is trivial and given in table 2. The next warp \(\psi \) is defined as:
and the combined warp is:
Therefore, the derivatives of the warps are:
where for the l-th element of \(\rho \) we have:
and
Proceeding similarly, the second derivatives of the warps are given by:
1.2 Cylindrical
Following the definition of \(\Delta \) from table 2, we obtain \(\psi \) as:
For the case of cylindrical surfaces, we elaborate the computation of the tangent vectors and surface normal of \(\psi _{i}\) with some verbosity. Assuming:
we can compute:
and ignoring \(\upalpha _{14}\) from Eq. (56), we obtain:
where the assumption that the fourth column of \(\check{{\textbf{a}}}\) and \(\check{{\textbf{w}}}\) are all zeros gives us \({\textbf{a}}\) and \({\textbf{w}}\) respectively. Similarly:
where:
since \(\upalpha _{13}\) and \(\upalpha _{15}\) are zeros. Given that \(\textbf{N} = \begin{pmatrix} N^{{X}}&N^{{Y}}&N^{{Z}}\end{pmatrix} = \varphi _r \times \varphi _{\theta } \), we have:
where \(\textbf{N}\) is the un-normalized vector along the direction of the surface normal, evaluated at \((r,\theta )\). Consequently, the unit normal is expressed as \(\hat{\textbf{N}} = \frac{ \varphi _r \times \varphi _{\theta }}{\Vert \varphi _r \times \varphi _{\theta } \Vert }\). We denote the function for unit normal computation as \(\mathcal {N}_i(\cdot )\), which takes the j-th coordinate from the flattened template \((r_j,\theta _j)\) and computes the unit normal, given by \(\mathcal {N}_i(r_j,\theta _j) = \begin{pmatrix} \hat{N}^{{X}}_{i,j}&\hat{N}^{{Y}}_{i,j}&\hat{N}^{{Z}}_{i,j}&1 \end{pmatrix}\) for the i-th image frame.
1.3 Spherical
For spherical objects, beginning from the initial mapping \(\Delta \) described in table 2, the maps \(\psi \) and \(\varphi \) are obtained following the same form as Eqs. (1) and (54) respectively. The normals to the spherical surface, which are the equivalent of Eqs. (56) to (62), are summarised below. The derivatives of \(\varphi \) are given as:
where the l-th element of \(\frac{\partial \rho \big (\Delta (r,\theta ), {\textbf{D}}\big )}{\partial \theta _1}\) and \(\frac{\partial \rho \big (\Delta (r,\theta ), {\textbf{D}}\big )}{\partial \theta _2}\) are given respectively as:
where \(\Delta _{\theta _1} = \frac{\partial \Delta }{\partial \theta _1}\) and \(\Delta _{\theta _2} = \frac{\partial \Delta }{\partial \theta _2}\) following standard convention. Similar to section 2, the unit normals can be obtained as \(\hat{\textbf{N}} = \frac{ \varphi _{\theta _1} \times \varphi _{\theta _2}}{\Vert \varphi _{\theta _1} \times \varphi _{\theta _2} \Vert }\). From Eq. (65), the second derivatives of the warps can be computed as:
where:
1.4 General Shapes
We have a combination of two warps, the first one being:
where the pre-defined warp parameters \(({\textbf{a}}_{\Delta }, {\textbf{w}}_{\Delta } )\) are obtained using conformal flattening of some mesh using the method of Sheffer and de Sturler (2001) and Sheffer et al. (2005). The variables \(({\textbf{a}}_{\Delta }, {\textbf{w}}_{\Delta } )\) are computed offline and only once per object model. This is followed by the second warp for deformation of the canonical model, given by:
We are interested in the derivatives of the warps:
Thereafter, we have:
and:
Following similar geometric properties, the next frame describes an example of the computation of length along geodesic, specifically for the spherical template:
Jacobian Matrices
We now describe the derivation of analytic Jacobian matrices for all cost functions used in sections 6 and 7.
1.1 Initial Parameterised Reconstruction
The minimisation of Eq. (33) is done analytically and the Jacobian matrix relating the change of \(g_{\textrm{data}}\), \(g_{\textrm{def0}}\) and \(g_{\textrm{def1}}\) w.r.t. \(\xi _I \in \mathbb {R}^{1 \times 3l}\), the stacked optimisation parameters, are expressed by the terms:
Expanding the Jacobian matrices for the j-th row of the matrices \(\textbf{J}_{P}\) and \(\textbf{J}_{N}\) (corresponding to the j-th row of the error vectors), we obtain the following expressions:
where:
and \(\frac{\partial \hat{\textbf{N}}_j}{\partial \xi _I}\) can be obtained from:
Thereafter, we are left with the terms \(\frac{\partial N^{X}_j}{\partial \xi _I}\), \(\frac{\partial N^{Y}_j}{\partial \xi _I}\) and \(\frac{\partial N^{Z}_j}{\partial \xi _I}\) which are obtained from Eqs. (56) and (58) by differentiating the expression for the un-normalised normal vector:
From Eq. (56), we have:
Similarly:
Equations (80) and (81) leave us with some more unknown terms in the form of . However, these values can be easily obtained by differentiating Eq. (55) as:
Going back to Eq. (75), the Jacobian matrix \(\textbf{J}_{N}\) can be expressed as:
The final Jacobian matrix \(\textbf{J}_B\) is a straightforward partial differentiation of Eq. (35).
1.2 Global Refinement
We now discuss the details of the Jacobian matrices involved in the global refinement process from Eq. (39), the Jacobian matrices are given for the original problem, not the efficient one, since the accelerated solutions are easy to derive from the full expanded ones. A single row of the first Jacobian matrix relating the change of \(h_{\textrm{rep}}\) to \(\varvec{\xi }\) is given by:
where \(\varvec{\kappa }\) and \(\varvec{\omega }\) are vectorised uv-coordinates and control handles respectively. Considering the first term and the second set of terms separately, we start with the first term of Eq. (39):
assuming the suffix \((\cdot )_x\) or \((\cdot )_y\) gives the x or y coordinate of the 2D point. Given that \({\textbf{Q}}_{i,j} = \varphi _i({\textbf{p}}_j)\) and its homogeneous coordinates are given as \(\tilde{{\textbf{Q}}}_{i,j}\), we differentiate both sides of the perspective projection equation w.r.t. \(\kappa \) to obtain:
Given that \(\frac{\partial }{\partial \kappa }(\frac{f_x}{({\textbf{Q}}_{i,j})_Z} ) = -\frac{f_x}{({\textbf{Q}}_{i,j})_Z^2} \frac{\partial ({\textbf{Q}}_{i,j})_Z}{\partial \kappa }\), to compute Eq. 86), we need the expression for the term \(\frac{\partial ({\textbf{Q}}_{i,j})_Z }{\partial \kappa }\), which can be obtained from:
and the four terms inside the first \(1 \times 2m(l + 4)\) matrix of Eq. (87), for the k-th element of the source points \({\textbf{D}}\), is given by the expressions in the frames below.
Moving to the second set of terms in Eq. 84:
where:
Once again, to compute Eq. (94), we need the expression for the term \(\frac{\partial ({\textbf{Q}}_{i,j})_Z }{\partial \varvec{\omega }_i}\), which can be obtained from:
Obviously, when the indices of \(\tilde{{\textbf{Q}}}\) and \(\varvec{\omega }\) do not match, the rows of the Jacobian matrix are all zeroes, i.e. \(\frac{\partial \tilde{{\textbf{Q}}}_{{i_1},j}^{\top } }{\partial \varvec{\omega }_{i_2}} = \textbf{0}_{1 \times 12\,l}\) when \(i_1 \ne i_2\). Our next objective is to compute the Jacobian matrix relating the change of \(E_I\) to \(\varvec{\xi }\), providing us with:
The two terms on the right most matrix of Eq. (96) are expanded below:
where:
The other term from Eq. (96) is:
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Sengupta, A., Bartoli, A. ToTem NRSfM: Object-Wise Non-rigid Structure-from-Motion with a Topological Template. Int J Comput Vis (2024). https://doi.org/10.1007/s11263-023-01923-6
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11263-023-01923-6