Name
Abstract | ||
|---|---|---|
We present a complete classification of all minimal problems for generic arrangements of points and lines completely observed by calibrated perspective cameras. We show that there are only 30 minimal problems in total, no problems exist for more than 6 cameras, for more than 5 points, and for more than 6 lines. We present a sequence of tests for detecting minimality starting with counting degrees of freedom and ending with full symbolic and numeric verification of representative examples. For all minimal problems discovered, we present their algebraic degrees, i.e. the number of solutions, which measure their intrinsic difficulty. Our classification shows that there are many interesting new minimal problems. Our results also show how exactly the difficulty of problems grows with the number of views. Importantly, we discovered several new minimal problems with small degrees that might be practical in image matching and 3D reconstruction. |
Year | Venue | Field |
|---|---|---|
2019 | International Conference on Computer Vision | Visibility,Algebraic number,Pattern recognition,Image matching,Computer science,Algorithm,Artificial intelligence,3D reconstruction |
DocType | Volume | Citations |
Journal | abs/1903.10008 | 2 |
PageRank | References | Authors |
0.35 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Timothy Duff | 1 | 6 | 2.85 |
| Kathlén Kohn | 2 | 2 | 0.35 |
| Anton Leykin | 3 | 173 | 18.99 |
| Tomás Pajdla | 4 | 2 | 0.35 |