Eigendecomposition-Free Training of Deep Networks for Linear Least-Square Problems
Many classical Computer Vision problems, such as essential matrix computation and pose estimation from 3D to 2D correspondences, can be tackled by solving a linear least-square problem, which can be done by finding the eigenvector corresponding to the smallest, or zero, eigenvalue of a matrix repres...
Ausführliche Beschreibung
Bibliographische Detailangaben
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 43(2021), 9 vom: 09. Sept., Seite 3167-3182
|
|---|
| 1. Verfasser: |
Dang, Zheng
(VerfasserIn) |
|---|
| Weitere Verfasser: |
Yi, Kwang Moo,
Hu, Yinlin,
Wang, Fei,
Fua, Pascal,
Salzmann, Mathieu |
|---|
| Format: | Online-Aufsatz
|
|---|
| Sprache: | English |
|---|
| Veröffentlicht: |
2021
|
|---|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence
|
|---|
| Schlagworte: | Journal Article |
|---|