##
**Recovering an algebraic curve using its projections from different points. Applications to static and dynamic computational vision.**
*(English)*
Zbl 1070.14051

Summary: We study some geometric configurations related to projections of an irreducible algebraic curve embedded in \(\mathbb{C}\mathbb{P}^3\) onto embedded projective planes. These configurations are motivated by applications to static and dynamic computational vision. More precisely, we study how an irreducible closed algebraic curve \(X\) embedded in \(\mathbb{C}\mathbb{P}^3\), of degree \(d\) and genus \(g\), can be recovered using its projections from points onto embedded projective planes. The embeddings are unknown. The only input is the defining equation of each projected curve. We show how both the embeddings and the curve in \(\mathbb{C} \mathbb{P}^3\) can be recovered modulo some action of the group of projective transformations of \(\mathbb{C}\mathbb{P}^3\). In particular in the case of two projections, we show how in a generic situation, a characteristic matrix of the pair of embeddings can be recovered. In the process we address dimensional issues and as a result find the minimal number of irreducible algebraic curves required to compute this characteristic matrix up to a finite-fold ambiguity, as a function of their degrees and genus. Then we use this matrix to recover the class of the couple of maps and as a consequence to recover the curve. In a generic situation, two projections define a curve with two irreducible components. One component has degree \(d(d-1)\) and the other has degree \(d\), being the original curve. Then we consider another problem. \(N\) projections, with known projection operators and \(N\gg 1\), are considered as an input and we want to recover the curve. The recovery can be done by linear computations in the dual space and in the Grassmannian of lines in \(\mathbb{C} \mathbb{P}^3\). Those computations are respectively based on the dual variety and on the variety of intersecting lines. In both cases a simple lower bound for the number of necessary projections is given as a function of the degree and the genus. A closely related question is also considered. Each point of a finite closed subset of an irreducible algebraic curve is projected onto a plane from a point. For each point the projection center is different. The projection operators are known. We show when and how the recovery of the algebraic curve is possible, in terms of the degree of the curve, and of the degree of the curve of minimal degree generated by the projection centers.

### MSC:

14N05 | Projective techniques in algebraic geometry |

14H50 | Plane and space curves |

68T45 | Machine vision and scene understanding |

14Q05 | Computational aspects of algebraic curves |

PDFBibTeX
XMLCite

\textit{J. Y. Kaminski} et al., J. Eur. Math. Soc. (JEMS) 7, No. 2, 145--172 (2005; Zbl 1070.14051)

### References:

[1] | Avidan, S., Shashua, A.: Trajectory triangulation: 3D reconstruction of moving points from a monocular image sequence. IEEE Trans. Pattern Anal. Machine Intelligence 22 , 348-357 (2000) |

[2] | Barnabei, M., Brini, A., Rota, G.-C.: On the exterior calculus of invariant theory. J. Algebra 96 , 120-160 (1985) · Zbl 0585.15005 · doi:10.1016/0021-8693(85)90043-2 |

[3] | Berthilsson, R., \ring Aström, K., Heyden, A.: Reconstruction of general curves, using factorization and bundle adjustment. Int. J. Computer Vision 41 , 171-182 (2001) · Zbl 1012.68712 · doi:10.1023/A:1011104020586 |

[4] | Blane, M., Lei, Z., Civi, H., Cooper, D. B.: The 3L algorithm for fitting implicit polynomial curves and surfaces to data. IEEE Trans. Pattern Anal. Machine Intelligence 22 , 298-313 (2000) |

[5] | Chojnacki, W., Brooks, M., van den Hengel, A., Gawley, D.: On the fitting of surfaces to data with covariances. IEEE Trans. Pattern Anal. Machine Intelligence 22 , 1294-1303 (2000) |

[6] | Cox, D., Little, J., O’Shea, D.: Using Algebraic Geometry. Springer (1998) · Zbl 0920.13026 |

[7] | Faugeras, O. D.: Three-Dimensional Computer Vision. A Geometric Approach. MIT Press (1993) |

[8] | Faugeras, O. D., Luong, Q. T.: The Geometry of Multiple Images. MIT Press (2001) · Zbl 1002.68183 |

[9] | Faug‘ere, J.-C.: Computing Gröbner basis without reduction to zero (F5). Technical report, LIP6 (1998) |

[10] | Faug‘ere, J.-C.: A new efficient algorithm for computing Gröbner basis (F4). J. Pure Appl. Algebra 139 , 61-88 (1999) · Zbl 0930.68174 · doi:10.1016/S0022-4049(99)00005-5 |

[11] | Forsyth, D.: Recognizing algebraic surfaces from their outline. Int. J. Computer Vision 18 , 21-40 (1996) |

[12] | Forsyth, D., Ponce, J.: Computer Vision: a Modern Approach. Prentice-Hall (2002) |

[13] | Cross, Zisserman, A.: Quadric reconstruction from dual-space geometry. In: Proc. Internat. Conf. Computer Vision, IEEE Computer Soc., 25-31 (1998) |

[14] | Greuel, G. M., Pfister, G.: A Singular Introduction to Commutative Algebra. Springer (2002) · Zbl 1023.13001 |

[15] | Harris, J.: Algebraic Geometry. A First Course. Springer (1992) · Zbl 0779.14001 |

[16] | Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision. Cambridge Univ. Press (2000) · Zbl 0956.68149 |

[17] | Hartshorne, R.: Algebraic Geometry. Springer (1977) · Zbl 0367.14001 |

[18] | Kaminski, J. Y., Shashua, A.: On calibration and reconstruction from planar curves. In: Proc. European Conf. Computer Vision, Lecture Notes in Comput. Sci. 1842, Springer, 678-694 (2000) |

[19] | Ma, S. D., Chen, X.: Quadric reconstruction from its occluding contours. In: Proc. Internat. Conf. Pattern of Recognition Vol. 1, 27-31 (1994) |

[20] | Matei, B., Meer, P.: A general method for errors-in-variables problems in computer vision. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition Vol. 2, 2018-2025 (2000) |

[21] | Miranda, R.: Algebraic Curves and Riemann Surfaces. Amer. Math. Soc. (1991) · Zbl 0820.14022 |

[22] | Quan, L., Conic reconstruction and correspondence from two views. IEEE Trans. Pattern Anal. Machine Intelligence 18 (1996) |

[23] | Schmid, C., Zisserman, A.: The geometry and matching of curves in multiple views. In: Proc. European Conf. Computer Vision, Lecture Notes in Comput. Sci. 1406, Springer, 394-409 (1998) |

[24] | Sommese, A. J., Verschelde, J., Wampler, C. W.: Numerical irreducible decomposition using projections from points on the components. In: Symbolic Computation: Solving Equations in Algebra, Geometry, and Engineering, E. L. Green et al. (eds.), Contemp. Math. 286, Amer. Math. Soc., 37-51 (2001) · Zbl 1061.68593 |

[25] | Sturmfels, B.: Solving Systems of Polynomial Equations. Amer. Math. Soc. (2002) · Zbl 1101.13040 |

[26] | Taubin, G., Cukierman, F., Sullivan, S., Ponce, J., Kriegman, D. J.: Parameterized families of polynomials for bounded algebraic curve and surface fitting. IEEE Trans. Pattern Anal. Machine Intelligence 16 , 287-303 (1994) · Zbl 0810.68118 · doi:10.1109/34.276128 |

[27] | Tasdizen, T., Tarel, J.-P., Cooper, D. B.: Improving the stability of algebraic curves for appli- cations. IEEE Trans. Image Process. 9 , 405-416 (2000) · Zbl 0962.94001 · doi:10.1109/83.826778 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.