The Chern-Mather class of the multiview variety
Corey Harris, Daniel Lowengrub

TL;DR
This paper computes the Chern-Mather class of the multiview variety, enabling the calculation of the number of critical points for scene reconstruction in multiview geometry, by constructing a resolution and a degree polynomial.
Contribution
It introduces a method to compute the Chern-Mather class of the multiview variety, leading to a polynomial for counting critical points in scene reconstruction.
Findings
Derived a degree 3 polynomial for critical point count as a function of N.
Constructed a resolution of the multiview variety.
Computed the Chern-Mather class of the multiview variety.
Abstract
The multiview variety associated to a collection of cameras records which sequences of image points in can be obtained by taking pictures of a given world point with the cameras. In order to reconstruct a scene from its picture under the different cameras it is important to be able to find the critical points of the function which measures the distance between a general point and the multiview variety. In this paper we calculate a specific degree polynomial that computes the number of critical points as a function of . In order to do this, we construct a resolution of the multiview variety, and use it to compute its Chern-Mather class.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Vision and Imaging · Advanced Numerical Analysis Techniques · Advanced Image Processing Techniques
The Chern-Mather class of the multiview variety
Corey Harris and Daniel Lowengrub
Abstract
The multiview variety associated to a collection of cameras records which sequences of image points in can be obtained by taking pictures of a given world point with the cameras. In order to reconstruct a scene from its picture under the different cameras it is important to be able to find the critical points of the function which measures the distance between a general point and the multiview variety. In this paper we calculate a specific degree polynomial that computes the number of critical points as a function of . In order to do this, we construct a resolution of the multiview variety, and use it to compute its Chern-Mather class.
1 Introduction
Suppose that a collection of cameras are used to generate images of a scene. The problem of triangulation is to deduce the world coordinates of an object from its position in each of the camera images. If we assume that the image points are given with infinite precision, then two cameras suffice to determine the world point. However, due to the many sources of noise in real images such as pixelization and distortion, there typically will not be an exact solution and we will instead try to find a world point whose picture is “as close as possible” to the image points.
More precisely, suppose the cameras are and the image points are . The goal is to find a world point that minimizes the least squares error
[TABLE]
One application is the problem of reconstructing the 3D structure of a tourist attraction based on millions of online pictures. It is difficult to obtain the precise configuration of any single camera, so it would not make sense to use only a small subset of them and disregard the rest. A better approach is to solve an optimization problem which incorporates as many of the cameras as possible. This technique was used in [1] to reconstruct the entire city of Rome from two million online images.
Since the camera function is not linear, the standard method for solving the triangulation problem is to first find the critical points of (e.g, with gradient descent), and then select the one with the smallest error. In order to gauge the difficulty of this problem, it is important to be able to predict the number of critical points that we expect to find for a given configuration of cameras.
The goal of this paper is to give an explicit expression for the number of critical points of as a function of the number of cameras . In fact, we compute this expression for a variation of the problem in which we allow the world points to take complex values, and we allow these points to be in the projective space as opposed to the affine space . Our main result is that the number of critical points of is polynomial in the number of cameras.
Theorem 1**.**
The number of critical points of on is equal to
[TABLE]
where is the number of cameras.
Note that our reformulation of the problem only increases the number of possible critical points. One can solve the original problem by first finding these points, and then discarding the ones that are not in .
For a similar reason, the polynomial is an upper bound on the number of critical points in the classical triangulation problem. In [10], a detailed investigation of the Lagrange multiplier equations which define the critical points is used to compute the number of such points for . Based on these results, it was conjectured in [4, Conjecture 3.4] that the number of points should grow as the following polynomial:
[TABLE]
We note that our upper bound is fairly close.
In order to compute the number , we take a slightly different perspective on the function . By combining the cameras we obtain a rational map
[TABLE]
After passing to the complex numbers and taking the projective closure we obtain a rational map
[TABLE]
The image of this map is a three-dimensional variety which is known as the multiview variety. We can now interpret the error function as measuring the distance between a point and . With this formulation, the number of critical points is known as the Euclidean distance degree of the variety . The notion of ED degree was introduced in [4], and the authors remark in [4, ex 3.3] that the triangulation problem was their original motivation for this concept.
In particular, by using results from [4] we prove in section 5 that this number can be computed in terms of the Chern-Mather class . In general, the Chern-Mather class only provides an upper bound on the ED degree, but in the proof of theorem 4 we show that this inequality can be promoted to an equality for reasons specific to the multiview variety. One advantage of this approach is that it depends only on the geometric properties of , and not on the specific features of the defining equations. Another advantage is that it reduces most of the difficulty to local calculations on .
One common way of calculating the Chern-Mather class of a singular variety is to first find a resolution
[TABLE]
and then analyze the singularities of in order to compare the Chern class to the Chern-Mather class
In our situation, it is natural to build a resolution of by resolving the rational map . In section 3, we construct such a resolution
[TABLE]
and calculate its Chow ring and Chern class.
In order to compare the Chern class of to the Chern-Mather class of , we use the theory of higher discriminants which was introduced in [9]. One aspect of this theory is that it specifies which parts of the singular locus of we need to understand in order to relate to . A precise statement is given in proposition 5.
As we show in proposition 6, the higher discriminants of are surprisingly nice. Specifically, it turns out that in order to calculate , we only have to compute the Euler obstruction of a single point .
Moreover, in section 5.2 we show that after intersecting with a hyperplane at , the resulting surface singularity is taut. In particular, the Euler obstruction is determined by the resolution graph of in . This allows us to use the enumerative properties of that are worked out in section 3 to compute .
In the final section, we put these pieces together and obtain the polynomial .
2 Definitions and notation
Let be a matrix with values in . We consider each row as an affine function on . Explicitly, sends a vector to the dot product of and . We denote these functions by , and .
The matrix defines a rational map :
[TABLE]
which corresponds to the operation of mapping the “world coordinates” to the “image coordinates” . In other words, it describes the process of taking a picture of the world with a camera whose parameters are encoded in .
It is not hard to prove that this description of a camera is equivalent to the pinhole camera model. In particular, the camera has a position called the camera center and is pointing in a certain direction. The plane defined by the camera center and direction is called the camera plane. It turns out that with the above notation, the camera plane is the plane defined by the ideal , and the camera center is the point defined by . For the purposes of this paper, this observation will be taken as a definition.
Now, suppose that we have a collection of cameras . By taking a picture of the world with each of the cameras, we obtain a rational map:
[TABLE]
This map clearly extends to the complex numbers, giving us a rational map from . Furthermore, by clearing the denominators in the definition of the maps we obtain a rational map
[TABLE]
defined by
[TABLE]
The scheme theoretic image of this map is called the multiview variety associated to the cameras .
Example 1*.*
Consider the following three cameras:
[TABLE]
The associated rational map is
[TABLE]
We say that a collection of cameras is in general position if the hyperplanes defined by the linear functions associated to the rows of the camera matrices are in general position.
Finally, we will use the following notation throughout the paper (see figure 1). The camera plane of the -th camera will be denoted by and the center of the -th camera will be denoted by . Also, we define for all , and for all .
3 A resolution of the multiview variety
In this section we describe a resolution of the multiview variety associated to cameras in general position. It is obtained as an iterated blow up along smooth centers. We then apply standard theorems to compute a presentation of the Chow ring of the resolution, and identify a couple of important ring elements.
Let be camera matrices for a collection of cameras in general position, and let
[TABLE]
be the corresponding rational map. We denote the associated multiview variety by .
Proposition 1**.**
The base locus of is the reduced scheme supported on the union of the camera centers and the lines for all .
Proof.
It can be seen directly from the equations of (equation 1) that is supported on the camera centers union the lines . We will show that the scheme structure of is the reduced structure on this set. By a strategic choice of coordinates on , we can assume that , and .
We now analyze the scheme structure of in a neighborhood of the point . First of all, recall that the -th camera contributes the two equations and to the ideal of .
By our genericity assumptions, all of the ’s, all of the ’s, and for are invertible in some Zariski neighborhood of . This implies that in a neighborhood of , the ideal of has the form:
[TABLE]
Thus, the ideal defined by this scheme is reduced and supported on the coordinate axes. The same argument shows that all of the lines in the base locus have the reduced scheme structure. A similar argument implies the points are reduced. ∎
3.1 Constructing a resolution of
In this section we construct a resolution of in two stages. First, we blow up at the points and at the points for all . This gives us a map
[TABLE]
Let denote the proper transform of . Note that these proper transforms are disjoint lines in .
For the second step, we blow up each of the lines and obtain a resolution
[TABLE]
Let us denote by , and denote the composition by . Since the pullback of the base locus is a Cartier divisor on , there exists a canonical map which fits into the following diagram:
[TABLE]
were is the blowup map and is the resolution of the rational map .
Finally, we define . Since is smooth, we thus obtain the following resolution of :
[TABLE]
By an abuse of notation, we will sometimes think of as a map to , and other times as a map to .
3.2 The Chow ring of
Since is an iterated blowup of along smooth centers, we can use standard theorems to compute its Chow ring. We will use a statement in [6] which we state here for convenience.
Theorem 2**.**
[6, Appendix, Thm. 1]** Let be a closed embedding of smooth schemes. Let be the blowup of along and let denote the exceptional divisor. Suppose the map is surjective. Then, is isomorphic to
[TABLE]
where is a degree polynomial whose constant term is , and whose restriction to is the Chern polynomial of . In other words,
[TABLE]
The isomorphism is induced by the map , and by sending to the class of the exceptional divisor.
The polynomial is called the Poincaré polynomial of in .
By applying theorem 2 first to and then to we find that is a quotient of the polynomial algebra
[TABLE]
The meaning of the generators is as follows. Let denote the exceptional divisor of the camera center , the exceptional divisor of the point , and the exceptional divisor of the line .
Then, we have the following identities in :
[TABLE]
In the next section, we will need to evaluate the degree map
[TABLE]
Since is irreducible, has rank one. In addition, . This means that calculating the degree map is equivalent to expressing every monomial as a multiple of :
[TABLE]
To simplify the calculation, note that product of two generators that correspond to disjoint subschemes of is zero. For example, for all , , and .
Thus, the main difficulty is dealing with self intersections such as . In order to deal with these, we will calculate the Poincaré polynomials of , and . By theorem 2, this will give us relations involving the self intersections, which in this case turn out to suffice for the degree calculation.
Since is a point, its Poincaré polynomial is
[TABLE]
and similarly,
[TABLE]
Finally, note that is a line that passes through blown up points. We deduce from this that
[TABLE]
3.3 The Chern class of the resolution
In this section we compute as an element of and find its pushforward to (proposition 4). Our main tool will be the following proposition.
Proposition 2**.**
[5, Example 15.4.2]** Let be a smooth scheme and be a closed smooth subscheme with codimension . Consider the following blowup diagram.
[TABLE]
Suppose that for some , and that for some . Let . Then,
[TABLE]
where
[TABLE]
One takeaway of this proposition is that the Chern class of the blowup along a disjoint union of subvarieties is obtained by summing over contributions from the individual components.
Proposition 3**.**
The Chern class of the resolution is equal to
[TABLE]
where
[TABLE]
Proof.
Our strategy will be to use proposition 2 to compute the contributions to the Chern class of each of the varieties that are blown up during the construction of .
We first apply proposition 2 to the situation where and for some . In this case, we can take , for and . By proposition 2 the blowup at will contribute
[TABLE]
Similarly, represents the contribution from the blowup of the point .
Finally, we compute the contribution from the blowup along a line . Since passes through of the blown up points in , a quick calculation shows that we can take , , and the rest to be zero. In addition, since , we can take . This implies that the contribution coming from is
[TABLE]
∎
We now compute the pullback of in along the map .
Lemma 1**.**
The pullback of to is
[TABLE]
Proof.
It is well known (e.g [5, 4.4]) that if is a line bundle on , is a linear system and
[TABLE]
is the induced resolution, then
[TABLE]
where is the exceptional divisor.
In our case, one can show by a local calculation that the preimage of the base locus of the camera map to has class
[TABLE]
so that gives the stated expression. ∎
We can now compute the pushforward as an element of the Chow ring of .
Proposition 4**.**
The pushforward to of is
[TABLE]
Proof.
Since we have already calculated and , the calculation of is reduced to calculating the degrees of the intersections
[TABLE]
for . Using the relations in that we described in section 3.2, the result follows by a direct calculation. ∎
4 Higher discriminants
Higher discriminants, introduced in [9], provide a framework in which to study the singularities of a map. In particular, we will use them to understand how the Chern class of computed above pushes forward along . We now recall the definitions from [9], and phrase them in a way that will be easiest to use in our context.
Definition 1**.**
Let be a map of smooth manifolds. The -th higher discriminant of the map is the locus of points such that for every dimensional subspace , there exists a point such that:
[TABLE]
We denote the -th higher discriminant by .
For example, a point is in if and only if it is a critical value of . Indeed, according to the definition this happens exactly when there is a point whose Jacobian
[TABLE]
is not surjective.
On the other extreme, if and only if for every codimension one subspace , there exists a point that satisfies:
[TABLE]
It is instructive to consider the blow down map: . For every point , is one dimensional. This means that . In addition, it is not hard to see that for every one dimensional subspace , there is a point such that . This implies that .
Lemma 2**.**
[9, Rem. 3]** Let be a proper map of smooth schemes. Then all of the higher discriminants of are closed, and we have the following stratification of :
[TABLE]
Furthermore,
[TABLE]
The significance of the higher discriminants is that they tell us which strata appear when writing in the basis of Euler obstruction functions on . For background on Euler obstructions we recommend [8].
Proposition 5**.**
[9, Cor. 3.3]** Let be a proper map of complex varieties. Let be the codimension components of . Then,
[TABLE]
for some integers .
4.1 Higher discriminants of the resolution
In this section we describe the higher discriminants of the map
[TABLE]
Since the definition of higher discriminants assumes that the source and target are smooth, in this section we consider as a map to .
Let denote the image of the proper transform of the camera plane of the -th camera. The restriction of to the complement of the preimage of the ’s is an isomorphism, which means that the set theoretic singular locus of is contained in the disjoint union .
The following proposition describes the higher discriminants of .
Proposition 6**.**
The higher discriminants of are given as follows:
- •
**
- •
**
- •
**
To prove this proposition, we use the following lemma, which follows almost immediately from the definition of the higher discriminants.
Lemma 3**.**
Let be a map of smooth complex algebraic varieties. Let be a smooth curve. Suppose that the restriction of to has no critical values. Then .
Proof.
Since has no critical values, for every point and every point the one dimensional space is contained in . Therefore, if is the orthogonal complement to , then is not contained in . By definition, this implies that . ∎
We apply this lemma to each of the ’s . Let denote the restriction of to . Then is isomorphic to the blowup of at points: and for .
The map is obtained as follows. First, let
[TABLE]
be the resolution of the projection away from . Then, let
[TABLE]
be the blowup along all of the points for .
Finally, we claim that . In particular, has no critical values. According to the lemma, this proves proposition 6.
5 The Chern-Mather class of the multiview variety
In this section we compute the Chern-Mather class of using the theory of higher discriminants. We then use the result to determine the ED degree of .
5.1 The basic setup
By propositions 5 and 6, there exists and integer such that
[TABLE]
At a general point , and . This implies that
[TABLE]
For the moment, suppose we knew the Euler obstruction . Then, by taking the Chern-Schwartz-MacPherson class (see [8]) of both sides of equation 2 and recalling that we obtain
[TABLE]
Since we have already calculated for all , this would give us the Chern-Mather class of the multiview variety .
5.2 Calculating
To compute , first note that we can intersect with a general hypersurface passing through . As a result, we obtain a surface singularity:
[TABLE]
By a well known theorem about Euler obstructions (see [3, Sec. 3]),
[TABLE]
Now, suppose we restrict the resolution to .
Lemma 4**.**
* is a resolution of such that the preimage of is a rational curve normal with self intersection .*
Proof.
Let be the preimage of . Note that is the proper transform of a line in the camera plane of the -th camera. To compute the self intersection of in consider the following embeddings:
[TABLE]
By the Whitney sum formula, we have
[TABLE]
As we have already computed , we just have to calculate . By intersecting with the generators of we find
[TABLE]
Using this identity together with our presentation of gives
[TABLE]
Plugging everything into the Whitney sum formula shows that the degree of is , which completes the proof. ∎
We now show that this self intersection number determines the Euler obstruction .
Lemma 5**.**
With the isolated singularity as above, .
Proof.
Recall ([7]) that a singularity germ (X,x) is taut if the analytic type of is determined by the resolution graph of some resolution of singularities. By [7, 2.2] the vertex of the cone over the rational normal curve with degree is taut. Let us denote this singularity by . Since this singularity has a resolution in which the exceptional divisor is a with self intersection , the resolution graph is a single vertex with weight . It follows that any singularity with this resolution graph is analytically equivalent to .
In particular, by lemma 4, is analytically equivalent to so the Euler obstruction is equal to the Euler obstruction . By [2, 3.17], the latter is equal to . ∎
In conclusion, , so equation 3 becomes
[TABLE]
By plugging in our calculation of we obtain .
Theorem 3**.**
The Chern-Mather class of the multiview variety of cameras in general position is where
- •
**
- •
**
- •
**
- •
**
and .
5.3 The ED degree of the multiview variety
As a corollary of theorem 3, we can compute the Euclidean distance degree of .
Theorem 4**.**
The ED degree of the multiview variety of cameras in general position is equal to
[TABLE]
Proof.
We can use the formula in [2] to express the sum of the polar degrees of in terms of the Chern-Mather classes. Using this formula gives:
[TABLE]
Now, by the proof of [4, 6.11], if is an affine cone, then the ED degree of is equal to the sum of the polar classes of for a general translate of .
Suppose is the multiview variety associated to the camera matrices . Recall that is the projective closure of a subvariety of which we will call . Let be a vector. We will now show that is multiview variety associated to a different collection of cameras. Indeed, let be the matrix
[TABLE]
for . Then, the variety is the multiview variety associated to the cameras for .
In conclusion, there exists a general configuration of cameras such that the ED degree of the associated multiview variety is equal to the sum of the polar classes of . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Sameer Agarwal, Noah Snavely, Ian Simon, Steven M. Seitz, and Richard Szeliski. Building rome in a day. In 2009 IEEE 12th International Conference on Computer Vision , pages 72–79, Sept 2009.
- 2[2] Paolo Aluffi. Projective duality and a Chern-Mather involution. Trans. Amer. Math. Soc. , to appear.
- 3[3] Jean-Paul Brasselet, José Seade, and Tatsuo Suwa. Euler obstruction and indices of vector fields. 39(6):1193–1208, 2000.
- 4[4] Jan Draisma, Emil Horobeţ, Giorgio Ottaviani, Bernd Sturmfels, and Rekha R. Thomas. The Euclidean distance degree of an algebraic variety. Found. Comput. Math. , 16(1):99–149, 2016.
- 5[5] William Fulton. Intersection theory . Springer-Verlag, Berlin, 1984.
- 6[6] Sean Keel. Intersection theory of moduli space of stable n 𝑛 n -pointed curves of genus zero. Trans. Amer. Math. Soc. , 330(2):545–574, 1992.
- 7[7] Henry Laufer. Taut two-dimensional singularities. Math. Ann. , 205(2):131–164, 1973.
- 8[8] Robert Mac Pherson. Chern classes for singular algebraic varieties. Ann. of Math. , 100(2):423–432, 1974.
