Ten lectures on wavelets
Lossless Image Compression Using Integer to Integer Wavelet Transforms
ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 1 - Volume 1
Non-negative Matrix Factorization with Sparseness Constraints
The Journal of Machine Learning Research
Sparse Image Coding Using a 3D Non-Negative Tensor Factorization
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Non-negative tensor factorization with applications to statistics and computer vision
ICML '05 Proceedings of the 22nd international conference on Machine learning
Controlling sparseness in non-negative tensor factorization
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part I
Projective nonnegative matrix factorization for image compression and feature extraction
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
IEEE Transactions on Image Processing
Fast metadata-driven multiresolution tensor decomposition
Proceedings of the 20th ACM international conference on Information and knowledge management
Hi-index | 0.00 |
The computation of non-negative tensor factorization may become very time-consuming when large datasets are used. This study shows how to accelerate NTF using multiresolution approach. The large dataset is preprocessed with an integer wavelet transform and NTF results from the low resolution dataset are utilized in the higher resolution dataset. The experiments show that the multiresolution based speed-up for NTF computation varies in general from 2 to 10 depending on the dataset size and on the number of required basis functions.