Fast Super‐Resolution Algorithm Based on Dictionary Size Reduction Using k‐Means Clustering

This paper proposes a computationally efficient learning‐based super‐resolution algorithm using k‐means clustering. Conventional learning‐based super‐resolution requires a huge dictionary for reliable performance, which brings about a tremendous memory cost as well as a burdensome matching computation. In order to overcome this problem, the proposed algorithm significantly reduces the size of the trained dictionary by properly clustering similar patches at the learning phase. Experimental results show that the proposed algorithm provides superior visual quality to the conventional algorithms, while needing much less computational complexity.