In this paper, we study the image deblurring problem based on sparse representation over learned dictionary which leads to promising performance in image restoration in recent years. However, the commonly used overcomplete dictionary is not well structured. This shortcoming makes the approximation be unstable and demand much computational time. To overcome this, the structured sparse model selection (SSMS) over a family of learned orthogonal bases was proposed recently. In this paper, We further analyze the properties of SSMS and propose a model for deblurring under Gaussian noise. Numerical experimental results show that the proposed algorithm achieves competitive performance. As a generalization, we give a modified model for deblurring under salt-and-pepper noise. The resulting algorithm also has a good performance.