Color inconsistency between views is an important problem to be solved in multi-view video systems. A multi-view video color correction method using dynamic programming is proposed. Three-dimensional histograms are co...Color inconsistency between views is an important problem to be solved in multi-view video systems. A multi-view video color correction method using dynamic programming is proposed. Three-dimensional histograms are constructed with sequential conditional probability in HSI color space. Then, dynamic programming is used to seek the best color mapping relation with the minimum cost path between target image histogram and source image histogram. Finally, video tracking technique is performed to correct multi-view video. Experimental results show that the proposed method can obtain better subjective and objective performance in color correction.展开更多
An evolutionary programming based algorithm was proposed for color image quantization. A novel hybrid mutation operator was disigned to improve the quantization quality, and a stochastic sampling scheme was also prese...An evolutionary programming based algorithm was proposed for color image quantization. A novel hybrid mutation operator was disigned to improve the quantization quality, and a stochastic sampling scheme was also presented for saving the run time. The experimental results demonstrate the superior performance of the proposed algorithm in comparison with the GA based algorithm.展开更多
In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above...In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above quadratic0-1 programming and its relaxed problem, k-coloring problem is converted intoa class of (continuous) nonconvex quadratic programs, and several theoreticresults are also introduced. Thirdly, linear programming approximate algorithmis quoted and verified for this class of nonconvex quadratic programs. Finally,examining problems which are used to test the algorithm are constructed andsufficient computation experiments are reported.展开更多
彩色点画是一种从视觉上由大量小像素点构建图像的艺术技术,像素个数的多少直接影响着构图的成本。其优化选点构图方法为实现低成本打印提供了一个重要的方式。目前,点画生成存在着多通道采样点难以均匀分布,颜色层次难以兼顾等难点,并...彩色点画是一种从视觉上由大量小像素点构建图像的艺术技术,像素个数的多少直接影响着构图的成本。其优化选点构图方法为实现低成本打印提供了一个重要的方式。目前,点画生成存在着多通道采样点难以均匀分布,颜色层次难以兼顾等难点,并耗费大量的计算成本。对此,提出了一种基于超像素自适应聚类和线性规划最优选点的彩色点画生成方法,该方法在初步超像素划分图像的基础上,使用基于颜色密度峰值的自适应聚类方法得到最佳聚类个数,并进一步划分子聚类,然后根据每个子聚类的颜色均值作为子聚类内部选点的最佳间隔距离,在选点的同时依据SSIM指标,建立目标优化模型,通过数学优化器Gurobi实现模型选点,使点保留最少个数的目标基础上,同时保持聚类内部分布均匀和颜色渐变层次,以提高所生成的点画图像的可视化效果。实验结果表明,本文算法极大地降低了像素个数并在生成的点画的平均结构相似性(mean structural similarity index measure,SSIM)、峰值信噪比(peak signal to noise ratio,PSNR)等评价指标方面均优于当前方法。展开更多
基金supported by the National Natural Science Foundation of China (60672073)the Program for New Century Excellent Talents in University (NCET-06-0537)+1 种基金the Natural Science Foundation of Ningbo (2008A610016)the K.C.Wong Magna Fund in Ningbo University.
文摘Color inconsistency between views is an important problem to be solved in multi-view video systems. A multi-view video color correction method using dynamic programming is proposed. Three-dimensional histograms are constructed with sequential conditional probability in HSI color space. Then, dynamic programming is used to seek the best color mapping relation with the minimum cost path between target image histogram and source image histogram. Finally, video tracking technique is performed to correct multi-view video. Experimental results show that the proposed method can obtain better subjective and objective performance in color correction.
文摘An evolutionary programming based algorithm was proposed for color image quantization. A novel hybrid mutation operator was disigned to improve the quantization quality, and a stochastic sampling scheme was also presented for saving the run time. The experimental results demonstrate the superior performance of the proposed algorithm in comparison with the GA based algorithm.
文摘In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above quadratic0-1 programming and its relaxed problem, k-coloring problem is converted intoa class of (continuous) nonconvex quadratic programs, and several theoreticresults are also introduced. Thirdly, linear programming approximate algorithmis quoted and verified for this class of nonconvex quadratic programs. Finally,examining problems which are used to test the algorithm are constructed andsufficient computation experiments are reported.
文摘彩色点画是一种从视觉上由大量小像素点构建图像的艺术技术,像素个数的多少直接影响着构图的成本。其优化选点构图方法为实现低成本打印提供了一个重要的方式。目前,点画生成存在着多通道采样点难以均匀分布,颜色层次难以兼顾等难点,并耗费大量的计算成本。对此,提出了一种基于超像素自适应聚类和线性规划最优选点的彩色点画生成方法,该方法在初步超像素划分图像的基础上,使用基于颜色密度峰值的自适应聚类方法得到最佳聚类个数,并进一步划分子聚类,然后根据每个子聚类的颜色均值作为子聚类内部选点的最佳间隔距离,在选点的同时依据SSIM指标,建立目标优化模型,通过数学优化器Gurobi实现模型选点,使点保留最少个数的目标基础上,同时保持聚类内部分布均匀和颜色渐变层次,以提高所生成的点画图像的可视化效果。实验结果表明,本文算法极大地降低了像素个数并在生成的点画的平均结构相似性(mean structural similarity index measure,SSIM)、峰值信噪比(peak signal to noise ratio,PSNR)等评价指标方面均优于当前方法。
