Low Cost Edge Sensing for High Quality Demosaicking
Digital cameras that use Color Filter Arrays (CFA) entail a demosaicking procedure to form full RGB images. To digital camera industry, demosaicking speed is as important as demosaicking accuracy, because camera users have been accustomed to viewing captured photos instantly. Moreover, the cost asso...
| Publié dans: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - (2018) vom: 28. Nov. |
|---|---|
| Auteur principal: | |
| Autres auteurs: | , , |
| Format: | Article en ligne |
| Langue: | English |
| Publié: |
2018
|
| Accès à la collection: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society |
| Sujets: | Journal Article |
| Résumé: | Digital cameras that use Color Filter Arrays (CFA) entail a demosaicking procedure to form full RGB images. To digital camera industry, demosaicking speed is as important as demosaicking accuracy, because camera users have been accustomed to viewing captured photos instantly. Moreover, the cost associated with demosaicking should not go beyond the cost saved by using CFA. For this purpose, we revisit the classical Hamilton-Adams (HA) algorithm, which outperforms many sophisticated techniques in both speed and accuracy. Our analysis shows that the HA pipeline is highly efficient to exploit the originally captured data, but its oversimplified inter- and intra-channel smoothness formulation hinders its accuracy. We therefore propose a very low cost edge sensing scheme, which guides demosaicking by a logistic functional of the difference between directional variations. We extensively compare our algorithm with 27 demosaicking algorithms by running their open source codes on benchmark datasets. Compared to methods of similar computational cost, our method achieves substantially higher accuracy; Whereas compared to methods of similar accuracy, our method has significantly lower cost. On test images of currently popular resolution, the quality of our algorithm is comparable to top performers, yet our speed is tens of times faster. Source code for this work will be released with paper publication |
|---|---|
| Description: | Date Revised 27.02.2024 published: Print-Electronic Citation Status Publisher |
| ISSN: | 1941-0042 |
| DOI: | 10.1109/TIP.2018.2883815 |