首页> 外文期刊>Advances in multimedia >Global Distribution Adjustment and Nonlinear Feature Transformation for Automatic Colorization
【24h】

Global Distribution Adjustment and Nonlinear Feature Transformation for Automatic Colorization

机译:用于自动着色的全局分布调整和非线性特征变换

获取原文
           

摘要

Automatic colorization is generally classified into two groups propagation-based methods and reference-based methods. In reference-based automatic colorization methods, color image(s) are used as reference(s) to reconstruct original color of a gray target image. The most important task here is to find the best matching pairs for all pixels between reference and target images in order to transfer color information from reference to target pixels. A lot of attractive local feature-based image matching methods have already been developed for the last two decades. Unfortunately, as far as we know, there are no optimal matching methods for automatic colorization because the requirements for pixel matching in automatic colorization are wholly different from those for traditional image matching. To design an efficient matching algorithm for automatic colorization, clustering pixel with low computational cost and generating descriptive feature vector are the most important challenges to be solved. In this paper, we present a novel method to address these two problems. In particular, our work concentrates on solving the second problem (designing a descriptive feature vector); namely, we will discuss how to learn a descriptive texture feature using scaled sparse texture feature combining with a nonlinear transformation to construct an optimal feature descriptor. Our experimental results show our proposed method outperforms the state-of-the-art methods in terms of robustness for color reconstruction for automatic colorization applications.
机译:自动着色通常分为基于传播的方法和基于参考的方法两类。在基于参考的自动着色方法中,彩色图像被用作参考以重构灰色目标图像的原始颜色。这里最重要的任务是为参考图像和目标图像之间的所有像素找到最佳匹配对,以便将颜色信息从参考图像传输到目标像素。在过去的二十年中,已经开发出许多基于局部特征的有吸引力的图像匹配方法。不幸的是,据我们所知,没有自动着色的最佳匹配方法,因为自动着色中像素匹配的要求与传统图像匹配完全不同。为了设计一种有效的自动着色匹配算法,以较低的计算量对像素进行聚类并生成描述性特征向量是需要解决的最重要的挑战。在本文中,我们提出了一种解决这两个问题的新颖方法。特别是,我们的工作集中在解决第二个问题(设计描述性特征向量)上。即,我们将讨论如何使用缩放的稀疏纹理特征结合非线性变换来学习描述性纹理特征,以构造最佳特征描述符。我们的实验结果表明,我们提出的方法在用于自动着色应用程序的颜色重建的鲁棒性方面优于最新方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号