Approximate Nearest Subspace Search with applications to pattern recognition. Ronen Basri Tal Hassner Lihi Zelnik-Manor Weizmann Institute Caltech. Basri & Jacobs, PAMI’03. Nayar et al., IUW’96. Subspaces in Computer Vision. Illumination. Faces.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Ronen Basri Tal Hassner Lihi Zelnik-Manor
Weizmann Institute Caltech
Nayar et al., IUW’96Subspaces in Computer Vision
Zelnik-Manor & Irani, PAMI’06
Which is the Nearest Subspace?
Is there a sublinear solution?
There is a sublinear solution!
Existing point-based methods cannot be applied
OurOur Suggested Approach
linear and affine spaces
Monotonic in distance
A linear function of original distance
Apply standard point ANN to u,v
We are lucky !!
Depends on query
Want: minimize /
Lies on a cone
Lies on a sphere
and on a hyper-planeGeometry of Basic Reduction
Additive Constant is Inherent
Linear in n
Log in n
Varying database size
New illuminationFace Recognition (YaleB)
Approx NSFace Recognition Result
A lot more to be done…..