A Fast Algorithm for Inverse Colormap Computation

The inverse colormap operation is the process which allows an image to be displayed with a limited set of colors. In order to obtain a minimal visual distortion between the input image annd the one displayed, inverse colormap algorithms associate each color with its nearest representative. The method presented in this paper is carried out in two steps. First, the 3D Voronoi diagram implicitly used by inverse colormap algorithms is approximated using a Karhunen-Loève transformation. Then, a correcting step is carried out in order to reduce the in uence of the first approximation. The complexity of our algorithm is independent of the size of the colormap. Moreover, its results are equal or quite close to the optimal solution.     

An adjustable algorithm for color quantization

Color quantization is an important technique in digital image processing. Generally it involves two steps. The first step is to choose a proper color palette. The second step is to reconstruct an image by replacing original colors with the most similar palette colors. However a problem exists while choosing palette colors. That is how to choose the colors with different illumination intensities (we call them color layers) as well as the colors that present the essential details of the image. This is an important and difficult problem. In this paper, we propose a novel algorithm for color quantization, which considers both color layers and essential details by assigning weights for pixel numbers and color distances. Also this algorithm can tune the quantization results by choosing proper weights. The experiments show that our algorithm is effective for adjusting quantization results and it also has very good quality of quantization.     

直方图重建图像细节增强算法

针对传统大动态范围图像数据压缩方法易受场景变化影响,量化后的8位显示图像整体模糊、图像细节和弱小目标丢失问题,提出了一种基于直方图重建图像细节增强算法。对图像直方图统计值进行重新赋值,保留图像中出现的细节部分,并缩小相邻灰度级间间隔;采用二维Gabor滤波器来模拟视觉感知系统,将Gabor滤波器与图像进行卷积运算,得到滤波后的平滑图像;采用局部对比度增强方法来增强图像细节部分,并将增强后的中间结果线性映射为8位显示图像。实验结果表明,与其他大动态范围数据压缩方法相比,该算法量化后图像清晰度高,无图像细节和目标丢失现象。     

彩色图件自动分层算法研究

在彩色图件输入识别研究领域中,通常采用颜色分层的方法来降低图件识别的难度,文中基于瘢频数直方图和颜色表,分别提出了两种自动分层算法,结果表明,算法不仅可以处理单颜色背景的图像而且可以处理多颜色背景的图像,前者具有较强的鲁棒性,后者具有较经的实时性,实际应用效果良好。     

基于多混沌系统组合图像置乱加密算法研究

提出一个基于位平面彩色图像Arnold映射置乱和采用Chen系统产生的混沌序列加密算法。首先采用由Logistic系统构造的非线性动力系统产生的混沌序列形成Arnold映射矩阵,在不同的位平面对彩色图像进行置乱,然后用Chen系统产生的混沌序列对置乱后的图像进行加密。该算法实现简单,能够抵御各种攻击,且容易用硬件实现。     

An Algorithm for Dynamic Color Management

Though the problem of color quantization in static images is not completely solved, there are a few algorithms that produce good results. Color quantization with dynamic color requests is an unsolved problem. In this paper we present an algorithm that manages dynamic color allocations without advance knowledge of the sequence of color requests. It uses a dynamic color table that can be used simultaneously in multiple windows from one or more applications. Advance knowledge about color requirements will improve the results of the algorithm.     

一种低码率彩色人脸图像编码方法

提出了一种适合低码率信道传输的嵌入式彩色人脸图像编码方法,不仅把握了人脸图像的特点,而且充分利用了彩色图像小波变换后的多种相关性。该方法将联合色彩分量矢量量化和零块、零树编码方法巧妙结合,把彩色图像的三个色彩分量单独扫描,单独编码的过程简化为联合扫描和联合编码的过程。实验结果表明该算法在低码率下,相比JPEG,获得了在视觉效果和峰值信噪比方面更好的恢复图像质量。     

基于DWT的彩色图像鲁棒盲水印新算法

本文提出了一种基于小波域低频系数量化的彩色图像鲁棒盲水印新算法.首先将RGB彩色宿主图像转换为YCbCr颜色空间,然后对亮度分量Y进行三层小波分解,采用适当的量化间隔对低频逼近子带LL3进行均值量化,根据量化系数的奇偶特性再与二值图像置乱转化后的水印序列进行异或运算,从而把水印嵌入到亮度分量的逼近子带中.仿真实验结果表明,本文提出的算法对JPEG/JPEG2000压缩、添加噪声、滤波、剪切、像素移位等多种攻击有较强的鲁棒性,透明性好,并且能实现水印的盲提取.     

基于KD树和NBS距离的颜色量化算法

针对经典K均值聚类算法需要事先给定量化数目和量化时间长的问题,提出一种基于KD树和NBS距离的颜色量化算法。首先用中位切割算法对原始图像进行初始量化,然后依据NBS距离与人类视觉对颜色差别的定量关系确定出初始聚类中心,最后利用KD树作为数据结构来运行K均值聚类算法从而实现彩色图像的快速量化。测试实验在不需要事先给定量化数目的前提下,获得了较好的量化结果和较快的量化速度,表明所提算法是可行有效的。     

扩散映射置乱与超混沌系统组合图像加密算法

提出一个基于扩散与位平面Arnold映射相结合的彩色图像置乱,以及采用Chen系统产生的混沌序列加密的图像加密算法。先由Logistic系统构造的二维非线性动力系统产生的混沌序列形成扩散矩阵和Arnold映射矩阵,然后在基色上对彩色图像进行扩散,并在不同的位平面对彩色图像进行置乱,最后用Chen系统产生的混沌序列对置乱后的图像进行加密。该算法实现简单,能够抵御多种攻击,且容易用硬件实现。     

基于同态高低通滤波与多尺度Retinex的低照度彩色图像增强

针对低照度条件下彩色图像的细节丢失与视觉效果不佳等问题,提出一种改进的低照度彩色图像增强算法.对三个颜色分量图像分别进行同态高低通滤波处理,在提取高频成分的同时,保留部分低频成分.对其中高频图像进行多尺度Retinex算法、指数变换及量化等处理,加强图像细节;对低频图像进行量化和线性伸缩变换处理,避免图像过度增强.MA...     

窄带宽环境下的动态图像压缩

实现窄带宽环境下的动态图像传输需要对图像数据进行有效压缩。提出采用改进的小波零树编码算法，在零树编码过程中，对连续零树根所采用的游程编码以及对非零小波系数的编码采用了一种新的码扩展算法，与通常的码扩展法相比具有单位比特拥有更大信息量的特点，并且运用图像拼接技术缓解了小波图像压缩在小尺寸图像上不理想的问题。     

一种基于粒子群算法的色彩量化方案

为提高色彩量化算法的效率,基于求解实优化问题时粒子群算法优于遗传算法这一事实,在基于遗传算法的色彩量化算法的基础上,设计了相应的适应度函数,给出了一种基于粒子群算法的色彩量化方案,并通过量化实例对算法的性能进行了比较。实验结果显示,基于粒子群优化算法的色彩量化方法在收敛速度方面明显优于基于遗传算法的色彩量化方法。     

基于聚类分析的色彩量化新算法及其应用

针对针织提花,植绒、印染以及金属表面花纹处理等电脑设计中的要求,研究图像重新量化成仅有几种颜色的色彩量化问题,提出一种基于聚类分析的色彩量化新算法,量化图像较好地兼顾了原图像的总体风貌和设计者希望保留的一些特征,该算法计算量小,容易在微电脑中实现,已成功地应用于电脑提花圆机花型ＣＡＤ系统。该算法对一般的色彩量化具有重要意义。     

Content-based retrieval of logo and trademarks in unconstrained color image databases using Color Edge Gradient Co-occurrence Histograms

In this paper, we present an algorithm that extends the Color Edge Co-occurrence Histogram (CECH) object detection scheme on compound color objects, for the retrieval of logos and trademarks in unconstrained color image databases. We introduce more accurate information to the CECH, by virtue of incorporating color edge detection using vector order statistics. This produces a more accurate representation of edges in color images, as compared to the simple color pixel difference classification of edges seen with the CECH. Our proposed method is thus reliant on edge gradient information, and so we call it the Color Edge Gradient Co-occurrence Histogram (CEGCH). We also introduce a color quantization method based in the hue–saturation–value (HSV) color space, illustrating that it is a more suitable scheme of quantization for image retrieval, compared to the color quantization scheme introduced with the CECH. Experimental results demonstrate that the CEGCH and the HSV color quantization scheme is insensitive to scaling, rotation, and partial deformations, and outperforms the use of the CECH in image retrieval, with higher precision and recall. We also perform experiments on a closely related algorithm based on the Color Co-occurrence Histogram (CCH) and demonstrate that our algorithm is also superior in comparison, with higher precision and recall.     

基于堆叠乘积量化的图像特征反馈性检索仿真

采用当前方法检索图像中存在的特征时,检索特征所用的时间较长,检索得到的特征数量较少,存在检索效率低和召回率低的问题。提出基于堆叠乘积量化的图像特征反馈性检索方法,结合乘积量化算法和加法量化算法得到堆叠乘积量化算法,通过堆叠乘积量化算法对图像进行降维处理,去除图像中存在的冗余信息和无用数据。在亮度、色彩和梯度三个方面对降维处理后的图像进行检索,获得图像的亮度特征、色彩特征和梯度特征,实现图像特征的反馈性检索。仿真结果表明,所提方法的检索效率高、召回率高。     

基于Fisher判据的自适应彩色图像量化算法

提出了一种基于Fisher判据的自适应彩色图像量化算法。首先用八叉树算法把原始图像量化为256种颜色,然后根据人类的视觉特性,参照NBS距离与人类视觉对颜色差别的定量关系,自动确定初始聚类中心及聚类数目,在此基础上,用Fisher判据自动确定出初始类中心的一个同组,从而实现图像的量化。实验结果表明所提算法无需事先给定颜色量化数目,在量化数目相同的情况下,量化效果明显优于八叉树算法和k均值算法。     

真实图形的颜色量化

颜色量是真实图形显示的一个重要环节。它的主要任务是将一幅有Ｎ个象素点的真实图用不超过Ｋ（Ｋ《Ｎ）种颜色近似表示，以使这幅图能在颜色表长为Ｋ的显示设备上输出。本文提出了一种基于编码的颜色量化算法，引算法速度快，所生成的图形效果较好。     

基于颜色量化和密度峰聚类的彩色图像分割

彩色图像分割是簇绒地毯数字化制造的关键技术,图像的分割质量直接影响到后续的图像处理。为解决地毯的彩色图像分割问题,针对人眼在RGB颜色空间中感知不均匀的特性,提出了一种基于颜色量化和密度峰聚类的彩色图像分割算法。基于Lab颜色空间进行颜色量化,在HVC颜色空间中用NBS距离来衡量人眼对颜色差异的感知程度,采用改进的密度峰聚类算法自动确定聚类中心,从而分割地毯图案。实验结果表明,该算法能在不影响人眼感知的前提下得到颜色种类少且边缘清晰的地毯分割图像。     

An efficient k-means clustering algorithm: analysis andimplementation

In k-means clustering, we are given a set of n data points in d-dimensional space R^d and an integer k and the problem is to determine a set of k points in Rd, called centers, so as to minimize the mean squared distance from each data point to its nearest center. A popular heuristic for k-means clustering is Lloyd's (1982) algorithm. We present a simple and efficient implementation of Lloyd's k-means clustering algorithm, which we call the filtering algorithm. This algorithm is easy to implement, requiring a kd-tree as the only major data structure. We establish the practical efficiency of the filtering algorithm in two ways. First, we present a data-sensitive analysis of the algorithm's running time, which shows that the algorithm runs faster as the separation between clusters increases. Second, we present a number of empirical studies both on synthetically generated data and on real data sets from applications in color quantization, data compression, and image segmentation