March 2018
Beginner to intermediate
306 pages
9h 54m
English
Content preview from OpenCV 3 Computer Vision with Python Cookbook
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
How it works...
The Eckart-Young-Mirsky theorem states that the problem can be solved through computing the SVD (using the cv2.SVDecomp function) and constructing an approximation where the smallest singular values are set to zeros, so the approximation rank is not greater than the required value.
Here's what the output should look like:
Rank before: 10 Rank after: 5 Norm before: 9.923378133354824 Norm after: 9.511025831320431