Most existing non-uniform deblurring algorithms model the blurry image as a weighted summation of several sharp images which are warped by one latent image with different homographies. These algorithms usually suffer from high computational cost due to the huge number of homographies to be considered. In order to solve this problem, we introduce a novel single image deblurring algorithm to remove the spatially-varying blur. Since the real motion blur kernel is very sparse, in this paper we first estimate a feasible active set of homographies which may hold large weights in the blur kernel and then compute the corresponding weights on these homographies to reconstruct the blur kernel. Since the size of the active set is quite small, the deblurring algorithm will become much faster. Experiment results show that the proposed algorithm can effectively and efficiently remove the non-uniform blur caused by camera shake.
CITATION STYLE
Xu, Y., Mita, S., & Peng, S. (2017). A fast blind spatially-varying motion deblurring algorithm with camera poses estimation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10113 LNCS, pp. 157–172). Springer Verlag. https://doi.org/10.1007/978-3-319-54187-7_11
Mendeley helps you to discover research relevant for your work.