基于转动惯量的快速分形图像编码算法

针对基本分形编码方法编码时间过长的问题,基于新定义的图像块的转动惯量特征的概念提出一种基于转动惯量的快速算法.算法对码本按转动惯量大小赋序,再对每个需要匹配的Range块在赋序码本中寻找与它的转动惯量最接近的码块,即只在这个码块的邻域内搜索Range块的最佳匹配块.实验结果表明,较之基本分形编码算法,该算法编码时间大大缩短,图像质量没有受到太大影响并且优于形态特征的特征算法.     

基于平方加权质心特征的快速分形图像压缩编码

分形图像压缩利用自身图像具有的相似性,结合压缩仿射变换减少图像数据的冗余来实现图像数据的压缩,具有压缩比高、恢复简单的特点。然而,分形图像压缩编码也具有编码时间长、计算复杂的缺点。为了解决上述的缺点,提出了基于平方加权质心特征的快速分形图像压缩编码算法,利用平方加权质心特征可以将基本分形图像压缩编码过程中的全局搜索转化为局部搜索,限定搜索范围,减少码本数量,在巨大图像信息量传输和存储过程中,在一定程度上缩短了编码时间。将平方加权质心特征快速分形图像压缩编码算法和双交叉和算法、改进叉迹算法、规范五点和算法进行比较,仿真结果表明,所提算法在恢复质量可接受情况下,编码时间具有巨大优势。     

子块均点特征分形快速图像压缩编码

分形图像压缩根据图像特有的自相似性,利用压缩仿射变换消除图像数据冗余度,进而实现图像压缩,实现较高的压缩比。然而,分形图像压缩编码具有计算复杂度高、运行时间过长的致命缺点,对于图像信息量巨大的当今社会来说不具有实用性。为解决基本分形压缩编码耗时过长的问题,提出了子块均点特征分形压缩编码算法,利用该算法将基本分形压缩编码的全搜索转为局部搜索,限定搜索范围,减少定义域块的搜索,在客观质量稍作牺牲的基础上加快了编码速度。将所提算法分别与五点和特征算法、1-范数特征算法、欧式比特征算法以及双交叉算法进行比较,仿真结果表明,在时间稍逊的情况下,所提算法在客观质量（Peak Signal-to-Noise Ratio,PSNR）上更优。     

一种邻域嵌入超分辨率算法北大核心CSCD

邻域嵌入算法是一种基于学习的超分辨率算法,但是存在图像特征计算复杂和分类搜索难度大的问题.本文提出了一种基于二阶梯度比例特征的邻域嵌入超分辨率算法,其图像特征简单,分类和搜索复杂度低,同时图像库存储量小,适合于硬件实现.实验结果表明,与传统超分辨率算法相比,本文算法重建的高分辨率图像具有更丰富的纹理和更锐利的边缘,具有更好的主客观质量.     

一种基于方差的匹配方法

文章就分形图象压缩中搜索与匹配过程的相似性提出了一个经过不同对比度实现快速分形编码算法，基于序列块和主块之间当前最小象差的方差信息，该算法排除不必搜索的主块，这样大大减少了每个序列块进行搜索和匹配的主块数与相应的编码时间，该算法在减少的时间内生成了与常规满搜索近乎一致的分形编码。     

基于块结构稀疏度的自适应图像修复算法

现有基于稀疏性的图像修复算法采用固定大小的待填充块和邻域一致性约束,且在全局搜索待填充块的最优匹配块,既降低了待修复区域的结构连贯性和纹理清晰性,又增加了算法的时间复杂度.针对上述问题,根据破损区域特性和块结构稀疏度间的关系,提出基于块结构稀疏度的自适应图像修复算法.根据最大优先权值点的块结构稀疏度值,设定不同参数以自适应选取待填充块大小、邻域一致性约束权重系数和局部搜索区域大小,并通过仿真实验分析讨论了各参数选取.实验结果表明本文算法较文献算法在峰值信噪比上提高0.3dB ～ 1.2dB,并且提高算法速度3～7倍.     

一种基于邻域搜索的分形图象编码改进算法

文章提出了一种基于邻域搜索匹配的分形编码改进算法.在信噪比相近时,它比Jacqnin的分形块编码的压缩比高,编码速度快.实验结果表明,该分形编码压缩比可达到15.28,峰值信噪比可达30.35dB.在PC586上,编码时间为196秒,解码时间为36秒.     

一种基于K-均值聚类优化的快速分形图像压缩算法

提出了一种基于K-均值聚类的快速分形图像压缩算法，对搜索窗中的父块和子块，根据其方差的不同，用K-均值聚类方法分别对子块和父块进行聚类，子块只对同一类中的父块进行匹配，从而大大缩短了编码时间。实验结果表明，与经典分形压缩算法相比，本文算法编码速度可提高5倍；同基于方差的快速分形压缩算法相比，本文算法也有明显的优势。     

基于多尺度分解的k邻域随机查找快速图像修复

该文提出一种基于多尺度分解的k邻域随机查找快速图像修复方法。基于双边滤波下采样分解图像,从图像最粗糙层开始,对每一粗糙层采用基于最小堆的k邻域随机查找算法快速搜索最佳匹配块,利用鲁棒优先级函数确定下一待修复块。每一粗糙层修复后用双边滤波上采样重建下一粗糙层,迭代得到最终的修复结果。与相关工作比较,所提方法的修复结果能够保持图像的细节和边缘信息,取得更高的修复质量。利用客观指标评价修复结果。实验结果表明该方法有效易行,修复的图像具有良好的可视效果。     

一种快速的图像小目标检测算法

针对图像小目标检测问题进行了研究,在分析现有研究成果的基础上,充分利用了遗传算法动态多点搜索的快速性,以及分形特征应用于目标检测的稳定性,提出一种基于遗传算法与分形特征的快速图像小目标检测算法,并对算法进行了仿真。仿真结果表明该算法有效地提高了图像小目标检测的速度。     

Speed-up in fractal image coding: comparison of methods

Fractal image compression has received much attention from the research community because of some desirable properties like resolution independence, fast decoding, and very competitive rate-distortion curves. Despite the advances made, the long computing times in the encoding phase still remain the main drawback of this technique. So far, several methods have been proposed in order to speed-up fractal image coding. We address the problem of choosing the best speed-up techniques for fractal image coding, comparing some of the most effective classification and feature vector methods-namely Fisher (1994), Hurtgen (1993), and Saupe (1995, 1996)-and a new feature vector coding scheme based on the block's mass center. Furthermore, we introduce two new coding schemes combining Saupe with Fisher, and Saupe with mass center coding scheme. Experimental results demonstrate both the superiority of feature vector techniques on classification and the effectiveness of combining Saupe and the mass center coding scheme, an approach that exhibits the best time-distortion curves.     

A fast encoding algorithm for fractal image compression using theDCT inner product

In this paper, a fast encoding algorithm is developed for fractal image compression. At each search entry in the domain pool, the mean square error (MSE) calculations of the given range block and the eight dihedral symmetries of the domain block are obtained simultaneously in the frequency domain, in which the redundant computations are all eliminated in the new encoding algorithm. It is shown in software simulation that the encoding time is about six times faster than that of the baseline method with almost the same PSNR for the retrieved image. The fast algorithm is performed to deal with the eight dihedral symmetries at each search entry. Therefore, it can be applied to various enhanced algorithms which are equipped with quadtree, classification, and other mechanisms.     

Genetic algorithm based on discrete wavelet transformation for fractal image compression

In this paper, a genetic algorithm (GA) based on discrete wavelet transformation (DWT) is proposed to overcome the drawback of the time-consuming for the fractal encoder. First, for each range block, two wavelet coefficients are used to find the fittest Dihedral block of the domain block. The similar match is done only with the fittest block to save seven eighths redundant MSE computations. Second, embedding the DWT into the GA, a GA based on DWT is built to fast evolutionary speed further and maintain good retrieved quality. Experiments show that, under the same number of MSE computations, the PSNR of the proposed GA method is reduced 0.29 to 0.47 dB in comparison with the SGA method. Moreover, at the encoding time, the proposed GA method is 100 times faster than the full search method, while the penalty of retrieved image quality is relatively acceptable.     

采用尺度不变特征和区域选择的图像配准方法

提出了一种改进的尺度不变特征点的图像配准方法。该方法在SURF算法的基础上使用图像的熵来对匹配图像作特征检测区域选择,建立特征点筛选机制来从初步的特征检测中得到最显著的特征点,以控制特征点的数目来减少后继的计算量和算法性能。同时改进了SURF的特征描述方法的计算过程,提出了一种改进的特征描述方法。实验表明,该方法在提高算法性能的同时,明显改进了特征点的匹配率。     

A fast fractal image coding based on kick-out and zero contrast conditions

A fast algorithm for fractal image coding based on a single kick-out condition and the zero contrast prediction is proposed in this paper. The single kick-out condition can avoid a large number of range-domain block matches when finding the best matched domain block. An efficient method for zero contrast prediction is also proposed, which can determine whether the contrast factor for a domain block is zero or not, and compute the corresponding difference between the range block and the transformed domain block efficiently and exactly. The proposed algorithm can achieve the same reconstructed image quality as the exhaustive search, and can greatly reduce the required computation or runtime. In addition, this algorithm does not need any pre-processing step or additional memory for its implementation, and can combine with other fast fractal algorithms to further improve the speed. Experimental results show that the runtime is reduced by about 50% of that of the exhaustive search method. When combined with the DCT Inner Product algorithm, the required runtime for the algorithm can be further reduced by about 50%. The proposed algorithm was also compared to two other fast fractal algorithms. Experimental results also show that our algorithm achieves a better efficiency and requires a much smaller amount of memory for implementation.     

Combined Kohonen neural networks and discrete cosine transform method for iterated transformation theory

Iterated transformation theory (ITT) coding, also known as fractal coding, in its original form, allows fast decoding but suffers from long encoding times. During the encoding step, a large number of block best-matching searches have to be performed which leads to a computationally expensive process. Because of that, most of the research efforts carried on this field are focused on speeding up the encoding algorithm. Many different methods and algorithms have been proposed, from simple classifying methods to multi-dimensional nearest key search. We present in this paper a new method that significantly reduces the computational load of ITT-based image coding. Both domain and range blocks of the image are transformed into the frequency domain (which has proven to be more appropriate for ITT coding). Domain blocks are then used to train a two-dimensional Kohonen neural network (KNN) forming a codebook similar to vector quantization coding. The property of KNN (and self-organizing feature maps in general) which maintains the input space (transformed domain blocks) topology allows to perform a neighboring search to find the piecewise transformation between domain and range blocks.     

改善分形图像编码视觉效果的有效方法研究

针对当前分形图像编码面临如何改善重建图像视觉效果的问题,利用局部图像的特点,采取自适应的分块方法与缩短编码时间的多种块分类技术相结合设计图像编码算法,该算法明显改善了图像编码视觉效果,编码时间缩短上千倍,具有快速实现分形图像编码之功效。