Fast Deconvolution with Color Constraints on Gradients
MetadataShow full item record
CitationChakrabarti, Ayan and Todd Zickler. 2012. Fast Deconvolution with Color Constraints on Gradients. Harvard Computer Science Group Technical Report TR-06-12.
AbstractIn this report, we describe a fast deconvolution approach for color images that combines a sparse regularization cost on the magnitudes of gradients with constraints on their direction in color space. We form these color constraints in a way that allows retaining the computationally-efficient optimization strategy introduced in recent deconvolution methods based on half-quadratic splitting. The proposed algorithm is capable of handling a different blur kernel in each color channel, and is used for per-layer deconvolution in our paper: “Depth and Deblurring from a Spectrally-varying Depth-of-Field." A MATLAB implementation of this method is available at http://vision.seas.harvard.edu/ccap, and takes roughly 20 seconds to deconvolve a three-channel 1544 × 1028 color image, on a Linux-based Intel I-3 2.1GHz machine.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:24019780
- FAS Scholarly Articles 
Contact administrator regarding this item (to report mistakes or request changes)