首页> 外文期刊>Image Processing, IEEE Transactions on >Least-Squares Luma–Chroma Demultiplexing Algorithm for Bayer Demosaicking
【24h】

Least-Squares Luma–Chroma Demultiplexing Algorithm for Bayer Demosaicking

机译:Bayer Demosaicking的最小二乘亮度-色度解复用算法

获取原文
获取原文并翻译 | 示例

摘要

This paper addresses the problem of interpolating missing color components at the output of a Bayer color filter array (CFA), a process known as demosaicking. A luma–chroma demultiplexing algorithm is presented in detail, using a least-squares design methodology for the required bandpass filters. A systematic study of objective demosaicking performance and system complexity is carried out, and several system configurations are recommended. The method is compared with other benchmark algorithms in terms of CPSNR and S-CIELAB $Delta E^{ast}$ objective quality measures and demosaicking speed. It was found to provide excellent performance and the best quality–speed tradeoff among the methods studied.
机译:本文解决了在拜耳彩色滤光片阵列(CFA)的输出中插值缺失的颜色分量的问题,该过程称为去马赛克。详细介绍了亮度-色度多路分解算法,使用了最小二乘设计方法对所需的带通滤波器进行了设计。对客观去马赛克性能和系统复杂性进行了系统的研究,并推荐了几种系统配置。在CPSNR和S-CIELAB方面,将该方法与其他基准算法进行了比较。 $ Delta E ^ {ast} $ 客观质量措施和去马赛克速度。人们发现,在所研究的方法中,它可以提供出色的性能和最佳的质量-速度折衷。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号