An efficient color quantization based on generic roughness measure

Color quantization is a process to compress image color space while minimizing visual distortion. The quantization based on preclustering has low computational complexity but cannot guarantee quantization precision. The quantization based on postclustering can produce high quality quantization results. However, it has to traverse image pixels iteratively and suffers heavy computational burden. Its computational complexity was not reduced although the revised versions have improved the precision. In the work of color quantization, balancing quantization quality and quantization complexity is always a challenging point. In this paper, a two-stage quantization framework is proposed to achieve this balance. In the first stage, high-resolution color space is initially compressed to a condensed color space by thresholding roughness indices. Instead of linear compression, we propose generic roughness measure to generate the delicate segmentation of image color. In this way, it causes less distortion to the image. In the second stage, the initially compressed colors are further clustered to a palette using Weighted Rough K-means to obtain final quantization results. Our objective is to design a postclustering quantization strategy at the color space level rather than the pixel level. Applying the quantization in the precisely compressed color space, the computational cost is greatly reduced; meanwhile, the quantization quality is maintained. The substantial experimental results validate the high efficiency of the proposed quantization method, which produces high quality color quantization while possessing low computational complexity.     

Low bit-rate multi stage vector quantization based on energy clustered training set

In this paper, a new multi stage vector quantization with energy clustered training set is proposed for color image coding. The input image is applied with orthogonal polynomials based transformation and the energy clustered transformed training vectors are obtained with reduced dimension. The stage-by-stage codebook for vector quantization is constructed from the proposed transformed training vectors so as to reduce computational complexity. This method also generates a single codebook for all the three color components, utilizing the inter-correlation property of individual color planes and interactions among the color planes due to the proposed transformation. As a result, the color image encoding time is only slightly higher than that of gray scale image coding time and in contrast to the existing color image coding techniques, whose time is thrice greater than that of gray scale image coding. The experimental results reveal that only 35 % and 10 % of transform coefficients are sufficient for smaller and larger blocks respectively, for the reconstruction of images with good quality. The proposed multi stage vector quantization technique is faster when compared to existing techniques and yields better trade-off between image quality and block size for encoding.     

应用多索引加法量化编码的近邻检索算法

目的 海量图像检索技术是计算机视觉领域研究热点之一,一个基本的思路是对数据库中所有图像提取特征,然后定义特征相似性度量,进行近邻检索。海量图像检索技术,关键的是设计满足存储需求和效率的近邻检索算法。为了提高图像视觉特征的近似表示精度和降低图像视觉特征的存储空间需求,提出了一种多索引加法量化方法。方法 由于线性搜索算法复杂度高,而且为了满足检索的实时性,需把图像描述符存储在内存中,不能满足大规模检索系统的需求。基于非线性检索的优越性,本文对非穷尽搜索的多索引结构和量化编码进行了探索新研究。利用多索引结构将原始数据空间划分成多个子空间,把每个子空间数据项分配到不同的倒排列表中,然后使用压缩编码的加法量化方法编码倒排列表中的残差数据项,进一步减少对原始空间的量化损失。在近邻检索时采用非穷尽搜索的策略,只在少数倒排列表中检索近邻项,可以大大减少检索时间成本,而且检索过程中不用存储原始数据,只需存储数据集中每个数据项在加法量化码书中的码字索引,大大减少内存消耗。结果 为了验证算法的有效性,在3个数据集SIFT、GIST、MNIST上进行测试,召回率相比近几年算法提升4%~15%,平均查准率提高12%左右,检索时间与最快的算法持平。结论 本文提出的多索引加法量化编码算法,有效改善了图像视觉特征的近似表示精度和存储空间需求,并提升了在大规模数据集的检索准确率和召回率。本文算法主要针对特征进行近邻检索,适用于海量图像以及其他多媒体数据的近邻检索。     

Vector-quantization-based video codec for software-only playback on personal computers

This paper discusses a video compression and decompression method based on vector quantization (VQ) for use on general purpose computer systems without specialized hardware. After describing basic VQ coding, we survey common VQ variations and discuss their impediments in light of the target application. We discuss how the proposed video codec was designed to reduce computational complexity in every principal task of the video codec process. We propose a classified VQ scheme that satisfies the data rate, image quality, decoding speed, and encoding speed objectives for software-only video playback. The functional components of the proposed VQ method are covered in detail. The method employs a pseudo-YUV color space and criteria to detect temporal redundancy and low spatial frequency regions. A treestructured-codebook generation algorithm is proposed to reduce encoding execution time while preserving image quality. Two separate vector codebooks, each generated with the treestructured search, are employed for detail and low spatial frequency blocks. Codebook updating and sharing are proposed to further improve encoder speed and compression.     

基于3D-DCT和SVD的鲁棒彩色图像水印算法

在数字图像水印领域,水印算法主要集中于灰度图像,且提出的大部分彩色图像水印算法往往仅在亮度分量或在彩色图像的每一通道中嵌入水印,未能充分利用彩色图像的冗余空间,影响了水印的透明性和鲁棒性。针对此问题,提出了一种新颖的基于三维离散余弦变换和奇异值分解的彩色图像水印算法。算法先对水印图像进行预处理和对彩色图像进行互不重叠的分块;其次对每一分块进行三维离散余弦变换;最后选择对三维离散余弦变换系数的第一分量进行奇异值分解。嵌入水印时,对三维离散余弦变换系数第一分量的最大奇异值和第二分量分别采用量化和关系的嵌入方法嵌入水印。提取水印时,分别采用量化和关系提取算法提取水印并进行比较,选取相似值高的水印图像作为最终提取的水印。实验结果表明,提出的算法具有较好透明性的同时,具有抵抗常规信号处理和模糊、扭曲及锐化等攻击的能力。     

Block-matching algorithm based on harmony search optimization for motion estimation

Motion estimation is one of the major problems in developing video coding applications. Among all motion estimation approaches, Block-matching (BM) algorithms are the most popular methods due to their effectiveness and simplicity for both software and hardware implementations. A BM approach assumes that the movement of pixels within a defined region of the current frame can be modeled as a translation of pixels contained in the previous frame. In this procedure, the motion vector is obtained by minimizing a certain matching metric that is produced for the current frame over a determined search window from the previous frame. Unfortunately, the evaluation of such matching measurement is computationally expensive and represents the most consuming operation in the BM process. Therefore, BM motion estimation can be viewed as an optimization problem whose goal is to find the best-matching block within a search space. The simplest available BM method is the Full Search Algorithm (FSA) which finds the most accurate motion vector through an exhaustive computation of all the elements of the search space. Recently, several fast BM algorithms have been proposed to reduce the search positions by calculating only a fixed subset of motion vectors despite lowering its accuracy. On the other hand, the Harmony Search (HS) algorithm is a population-based optimization method that is inspired by the music improvisation process in which a musician searches for harmony and continues to polish the pitches to obtain a better harmony. In this paper, a new BM algorithm that combines HS with a fitness approximation model is proposed. The approach uses motion vectors belonging to the search window as potential solutions. A fitness function evaluates the matching quality of each motion vector candidate. In order to save computational time, the approach incorporates a fitness calculation strategy to decide which motion vectors can be only estimated or actually evaluated. Guided by the values of such fitness calculation strategy, the set of motion vectors is evolved through HS operators until the best possible motion vector is identified. The proposed method has been compared to other BM algorithms in terms of velocity and coding quality. Experimental results demonstrate that the proposed algorithm exhibits the best balance between coding efficiency and computational complexity.     

色彩量化的模糊粒子群优化技术

把粒子群算法应用到色彩量化中,结合已有的模糊C均值聚类量化方法,提出了一种基于粒子群优化的色彩量化算法。模糊C均值聚类量化算法是一种局部搜索算法,对初始值较为敏感,容易陷入局部极小值而不能得到全局最优解;PSO算法是一种基于群体的具有全局寻优能力的优化方法。将模糊C均值聚类量化算法和PSO算法结合起来,把模糊C均值聚类量化算法的聚类准则函数作为PSO算法中的粒子适应度函数。仿真实验表明,新算法在均方根误差和峰值信噪比评判准则下能够得到最优的量化结果。     

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

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

Color image quantization using flower pollination algorithm

Flower pollination algorithm (FPA) is a swarm-based optimization technique that has attracted the attention of many researchers in several optimization fields due to its impressive characteristics. This paper proposes a new application for FPA in the field of image processing to solve the color quantization problem, which is use the mean square error is selected as the objective function of the optimization color quantization problem to be solved. By comparing with the K-means and other swarm intelligence techniques, the proposed FPA for Color Image Quantization algorithm is verified. Computational results show that the proposed method can generate a quantized image with low computational cost. Moreover, the quality of the image generated is better than that of the images obtained by six well-known color quantization methods.

     

基于RGB模型颜色相似性的彩色图像分割

图像分割是图像处理的重要步骤,由于彩色图像含有的信息比灰度图像还多,因而对彩色图像分割的研究越来越受到人们的关注.提出一种新的基于RGB空间颜色相似性的彩色图像分割方法.首先比较各种颜色模型的优势与不足,然后根据RGB颜色空间的颜色信息和亮度信息提出一种计算在RGB空间下颜色相似性的方法,再结合提出的图像颜色分量计算方法,从而形成颜色分类地图,最后根据颜色分类图进行像素划分,得到分割结果.实验在Matlab平台上进行,结果表明:对于颜色分明的图像,该算法准确性高,有较好的健壮性和较低的计算复杂度,能很好应用在图像前景与背景分割应用上.     

一种新颖的基于哈德码变换的码字搜索算法

针对图像矢量量化编码的复杂性,提出了一种新颖的快速最近邻码字搜索算法。该算法首先计算出每个码字和输入矢量的哈德码变换,然后为输入矢量选取范数距离最近的初始匹配码字,利用多控制点的三角不等式和两条有效的码字排除准则,把不匹配的码字排除,最后选取与输入矢量最匹配的码字。实验结果表明,新算法相比于其他算法,在保证编码质量的前提下,码字搜索时间和计算量均有了明显降低。     

基于自组织特征映射神经网络的矢量量化

近年来,许多学者已经成功地将Ｋｏｈｏｎｅｎ的自组织特征映射（ＳＯＦＭ）神经网络应用于矢量量化（ＶＱ）图象压缩编码,相对于传统的ＫＬＢＧ算法,基于的ＳＯＦＭ算法的两个主要缺点是计算量大和生成的码书性能较差因此为了改善码书性能,对基本的ＳＯＦＭ算法的权值调整方法作了一些改进,同时为了降低计算量,又在决定获得胜神经元的过程中,采用快速搜索算法,在将改进的算法用于矢量量化码书设计后,并把生成的码书用于图象     

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.     

基于wedgelets的快速图像表示方法

针对用wedgelets表示图像存在计算冗余和存储空间大的问题,提出一种快速的基于wedgelets的图像表示方法。采用与传统的自下而上的剪枝策略不同的四叉树剪枝算法,通过基于快速多叉数树搜索及仅用wedgelets表示树叶来实现快速运算和减少存储空间,并且提出了一些提高计算效率的搜索和编码技巧。复杂度分析及实验结果表明,该方法能降低计算复杂度且有理想的率失真性能,并有效地捕获图像的几何结构。     

一种自适应运动估值视频代码转换的新方法

针对窄带网络的视频信号传输问题,分析了传统视频代码转换帧速率转换时,由于运动矢量非最佳化所造成的图象质量下降的原因,并提出了一种基于量化误差的自自动化运动矢量模型,从而减小了搜索域,使最佳化输出运行矢量能进行快速运动估值;同时根据灰度系统理论,提出了一种有效的灰度预测搜索方法,另外,又根据DCT系数理论模型。采用自适应快速视频编码方法,进一步提高了编码速度,实验结果表明：该方法不仅改善了视频图象质量,而且计算复杂度也大大减小。     

基于IC芯片的彩色图像分割方法研究与实现

以IC芯片彩色图像为研究对象,分析了迭代阈值法,松弛迭代算法,颜色空间聚类算法在此类图像分割中的不足,并改进迭代阈值法,对原始图像进行颜色空间转换,由RGB空间转化到CIE Lab空间;同时利用八叉树算法对图像进行8位量化,对得到的灰度图像进行迭代阈值分割得到最佳阈值,从而提出了专门针对彩色图像背景分割的彩色迭代阙值法.最后基于Visual Studio6.0平台实现上述4种方法,并通过对比实验证明本文所采用的方法的可行性和实用性.     

一种局部纹理特征在区域生长中的应用*

为克服现有算法不能自动选择种子且没有很好地利用纹理信息的局限性,提出了一种基于局部纹理特征的区域生长算法。算法分为两个阶段,即颜色量化和区域生长。先利用Mean Shift算法对颜色聚类,对图像预分割,用该局部量化纹理算法提取量化结果的纹理特征,由该纹理特征自动选择种子并分级合并区域。与经典的JSEG算法相比,该算法能够得到相似的分割结果,且计算复杂度低。     

基于混合分类和矩形划分的快速分形编码方法

针对分形图像压缩中矩形划分计算量太大的问题,提出了一种混合分类方法并将其应用于图像的矩不变量,得到了一种基于矩形划分的快速分形编码方法.实验表明,该方法相对于全局搜索,在压缩比和解码质量略有下降的基础上,能极大地提高分形编码速度;与均匀分类方法相比,混合分类法可进一步提高分形编码速度并改善解码图像质量,可以在一定的条件下取得压缩比优势.     

彩色图象的广义分形小波变换压缩算法

基于广义二维分形小波变换,提出了一种新的复合分形小波变换图象编码算法,并将该算法推广到三维彩色空间,实现了彩色图象压缩。同时,提出了一种自适应小波子树分割算法。该算法根据图象局部区域纹理的复杂程度对小波树进行分割,有效地避免了解压缩图象中的分块效应。对彩色图象的实验表明在压缩比相同的情况下。新算法可得到更好的图象效果。