原书出处
Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)
The linear equation can be solved with the singular value decomposition (SVD) and the result is the eigenvector with the smallest eigenvalue. Once we have W, we can find K by using the Cholesky factorization, which decomposes a matrix as the product of an upper triangular matrix and its transpose. The last step is to normalize the result by normalizing all the matrix values so
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)/_epub-src/OPS/xhtml/c042.xhtml
EPUB SHA-256:60a7eebc43f5d9a675d776fed3736fbdaa791e55877023f2f8cba016a9b384f8