loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1
Sparse Image Coding Using a 3D Non-Negative Tensor Factorization
Beijing, China
October 17-October 20
ISBN: 0-7695-2334-X
Tamir Hazan, The Hebrew University
Simon Polak, The Hebrew University
Amnon Shashua, The Hebrew University
We introduce an algorithm for a non-negative 3D tensor factorization for the purpose of establishing a local parts feature decomposition from an object class of images. In the past such a decomposition was obtained using non-negative matrix factorization (NMF) where images were vectorized before being factored by NMF. A tensor factorization (NTF) on the other hand preserves the 2D representations of images and provides a unique factorization (unlike NMF which is not unique). The resulting "factors" from the NTF factorization are both sparse (like with NMF) but also separable allowing efficient convolution with the test image. Results show a superior decomposition to what an NMF can provide on all fronts — degree of sparsity, lack of ghost residue due to invariant parts and efficiency of coding of around an order of magnitude better. Experiments on using the local parts decomposition for face detection using SVM and Adaboost classifiers demonstrate that the recovered features are discriminatory and highly effective for classification.
Citation:
Tamir Hazan, Simon Polak, Amnon Shashua, "Sparse Image Coding Using a 3D Non-Negative Tensor Factorization," iccv, vol. 1, pp.50-57, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1, 2005
Usage of this product signifies your acceptance of the Terms of Use.