Name
Abstract | ||
|---|---|---|
Image optimization problems encompass many applications such as spectral fusion, deblurring, deconvolution, dehazing, matting, reflection removal and image interpolation, among others. With current image sizes in the order of megabytes, it is extremely expensive to run conventional algorithms such as gradient descent, making them unfavorable especially when closed-form solutions can be derived and computed efficiently. This paper explains in detail the framework for solving convex image optimization and deconvolution in the Fourier domain. We begin by explaining the mathematical background and motivating why the presented setups can be transformed and solved very efficiently in the Fourier domain. We also show how to practically use these solutions, by providing the corresponding implementations. The explanations are aimed at a broad audience with minimal knowledge of convolution and image optimization. The eager reader can jump to Section 3 for a footprint of how to solve and implement a sample optimization function, and Section 5 for the more complex cases. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Computer Vision and Pattern Recognition | Gradient descent,Pattern recognition,Deblurring,Convolution,Computer science,Deconvolution,Algorithm,Image processing,Fourier transform,Artificial intelligence,Optimization problem,Image scaling |
DocType | Volume | Citations |
Journal | abs/1809.04187 | 0 |
PageRank | References | Authors |
0.34 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Majed El Helou | 1 | 7 | 3.22 |
| Frederike Dümbgen | 2 | 2 | 1.73 |
| Radhakrishna Achanta | 3 | 3829 | 119.25 |
| Sabine Süsstrunk | 4 | 4984 | 207.02 |