优化式着色算法的混色机制  

Blending Mechanism of Optimization-based Colorization

作　　者：张可为[1,2] 申群太[1] 

机构地区：[1]中南大学信息科学与工程学院,长沙410008 [2]湖南工程学院电气信息学院,湘潭411101

出　　处：《电子与信息学报》2013年第7期1612-1618,共7页Journal of Electronics & Information Technology

基　　金：湖南省教育厅科研基金(08C220)资助课题

摘　　要：基于局部关系模型的优化式着色方式,难以定量描述其全局特性信息诸如着色结果与用户输入间关系。该文首先提出一种优化式着色框架,证明两种常用算法为其特例而且等价,然后将每个像素的着色结果转化为各涂抹颜色的组合形式,并通过数学分析推导出组合系数非负且归一化,从而证明优化着色具有混色机制,其结果由涂抹颜色混色而成,并推导出混色权重与首达概率的等价性,最后基于混色机制对现有算法提出改进。实验结果表明混色机制的引入既有助于提高着色效果对涂抹数量与位置的鲁棒性,也便于实时挑选涂抹颜色。Optimization colorization methods base on a specific local relation model,it can not afford to describe global characteristics such as direct connection between visual result and user-provided scribbles.Hence a general frame is put forward,and then it is proved that two seemingly different methods are the same case of it,therefore they are equivalent.Next,it is derived that colorization result can be synthesized a weighted sum of chrominance of all kinds of scribbles where coefficients are all nonnegative and normalized and it leads to the conclusion that optimization-based colorization is an exact process of chrominance blending,and moreover,equivalence between individual chrominance blending weight and the pixel＇s first-reach probability to relevant scribble is determined.The mechanism inspires some improvement to existing algorithm.Experiment results indicate that introduction of blending mechanism benefits visual result to user＇s scribbles not only in robustness to amount and position but convenience in selecting desirable colors in-time.

关 键 词：图像处理 优化式着色 数学分析 算法等价 混色 

分 类 号：TN911.73[电子电信—通信与信息系统]