Please use this identifier to cite or link to this item:
|Title:||Fast sparsity-based orthogonal dictionary learning for image restoration|
|Citation:||Bao, C., Cai, J.-F., Ji, H. (2013). Fast sparsity-based orthogonal dictionary learning for image restoration. Proceedings of the IEEE International Conference on Computer Vision : 3384-3391. ScholarBank@NUS Repository. https://doi.org/10.1109/ICCV.2013.420|
|Abstract:||In recent years, how to learn a dictionary from input images for sparse modelling has been one very active topic in image processing and recognition. Most existing dictionary learning methods consider an over-complete dictionary, e.g. the K-SVD method. Often they require solving some minimization problem that is very challenging in terms of computational feasibility and efficiency. However, if the correlations among dictionary atoms are not well constrained, the redundancy of the dictionary does not necessarily improve the performance of sparse coding. This paper proposed a fast orthogonal dictionary learning method for sparse image representation. With comparable performance on several image restoration tasks, the proposed method is much more computationally efficient than the over-complete dictionary based learning methods. © 2013 IEEE.|
|Source Title:||Proceedings of the IEEE International Conference on Computer Vision|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2018
WEB OF SCIENCETM
checked on Nov 27, 2018
checked on Dec 14, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.