基于边缘特征和像素结构相似度的图像修复算法

针对Criminisi算法的块匹配准则仅采取单一颜色判断因子导致无法合理选择最佳样本块,且其在修复过程中使用单一修复模板易出现填充裂纹和错误像素的问题,提出基于边缘特征和像素结构相似度的图像修复算法.首先提出一种局部特征与边缘纹理分辨相结合的分段修复算法以增强边缘纹理分辨能力;其次采用样本相似度和信息熵相似度确定最佳样本块集合,并依据颜色和特征项的欧氏几何距离及结构相似性确立块匹配准则;再通过基于信息熵的自适应修复模板解决Criminisi算法的填充裂纹和错误像素问题;最后引入果蝇优化算法以减少图像修复时间.实验结果证明,对于不同的图像,文中算法能取得较为满意的修复效果和修复效率.     

结合SIFT和Delaunay三角网的遥感图像配准算法

针对高分辨率遥感图像中提取的特征点数目过大且易存在误匹配点的问题,提出了一种粗配准和精配准相结合的高分辨率遥感图像配准算法.首先对图像降采样处理后,提取大尺度空间下的SIFT特征点,求得仿射变换模型完成图像粗配准;然后对图像进行分块,利用SIFT方法对每幅子块图像提取特征点,并找到对应子块图像之间的匹配点对;之后利用特征点构建Delaunay三角网,计算每对子块图像之间的三角形相似度,构成相似矩阵,从中挑选相似度大的三角形对以构成精确匹配点对;最后利用得到的精确匹配点对实现最终的图像配准.该算法能够减少提取的特征点数且剔除更多的错误匹配点,从而进一步提高精确匹配点率.实验结果表明了算法的有效性.     

多相机网络中行人的全局最优匹配

针对多相机视域下行人目标匹配正确率不高的问题,基于无监督显著性学习和局部特征匹配提出一种全局最优匹配模型。将不同视域间的目标匹配进行关联,每对相机的直接匹配受制于其间接匹配的监督,同时修正直接匹配中发生的误配。将经过亮度补偿后的图像帧分成若干局部块,通过无监督显著学习得到图像块的显著性得分,并结合目标图像块特征匹配的相似度得分,利用双向相似度计算目标间的相似度得分,并将其作为模型输入。基于标准数据库WARD和Shinpuhkan2014进行实验,结果表明,该模型能有效提高多相机监控网络下目标匹配的正确率。     

一种改进的非局部均值去噪算法*

针对非局部均值去噪算法在图像块相似度计算方面存在的不足,提出计入图像旋转对相似度贡献的、效果更好的图像块匹配算法.为了获得与给定像素点邻域相似的图像子块,首先对给定像素点周边的相关邻域子块按灰度值大小排序,计算其与同样按灰度值大小排序的给定像素点邻域子块之间的距离,据此筛选出灰度分布相似的图像子块作为候选集,更进一步在候选集中选出结构上更为相似的图像子块.同时为了克服噪声影响,在计算子块相似度之前对输入图像进行预滤波处理.实验表明,与原始的非局部均值去噪算法相比,文中算法在峰值信噪比、平均结构相似性及主观视觉效果等方面均具有一定优势,特别是在噪声较大时,文中算法的去噪效果更好.     

基于特征块匹配的图像检索技术

提出了一种基于特征块匹配的图像检索算法.首先,利用小波变换的多尺度特性检测出图像的特征点,特征点比较全面地反映了图像中的视觉兴趣点;用以特征点为中心的特征块的前三阶颜色矩来描述特征块的特征;进一步统计出两个图像中匹配的特征块数目,计算图像间的相似距离.实验表明,算法中所使用的特征块更全面、更精确地描述了图像的视觉信息,实现相似度计算的方法简单、高效.该检索算法不仅检索精度高,还具有较好的旋转、尺度及视觉角度不变性.     

基于熵和块匹配的图像检索技术

提出了一种图像熵和特征块匹配相结合的图像检索方法.为了提高图像的检索精度和效率,首先用计算图像熵并与设定的闭值比较实现对图像库的预分类;然后利用Harris算子检测出图像的特征点,用以特征点为中心的特征块的前三阶颜色矩来描述特征块的特征;进一步统计出两个图像中匹配的特征块数目,计算图像间的相似距离并进行仿真.仿真结果表明,算法中所使用的特征块更全面、更精确地描述了图像的视觉信息,实现相似度计算的方法简单和高效,证明分级检索方法在保证图像检索效率的前提下,极大地缩短了检索时间.     

一类完备正交函数系下的轮廓曲线匹配算法

轮廓曲线包含了图像中大量的关键信息,主要用于探讨基于轮廓曲线的图像匹配问题.在假定图像间具有相似关系的前提下,借助于一种完备正交函数系V系统,提出一种新的曲线匹配算法.首先由V描述子评估曲线间的相似度,以此确定匹配曲线段,然后求得曲线间的变换参数,最后进行了图像拼接测试.该算法着眼于轮廓线的整体特征且不需要提取曲线的局部特征,避免了特征选取这一难点.大量的模拟及真实图像实验结果表明,从图像中提取的2条曲线间即使不严格满足相似变换关系,依然可取得比较满意的结果,从而验证了文中算法的可行性.     

一种柱面全景图像自动拼接算法

提出了一种基于特征块匹配的柱面全景图像拼接算法.首先将360度环绕拍摄的序列图像投影到柱面坐标系下;然后以一幅图像为基准图像,选择基准图像中边缘信息丰富的块作为基准块,利用特征块匹配法在待配准图像中找出与基准块匹配的配准块,进而实现两幅图像的配准;再根据配准结果计算出图像间的变换参数;最后采用平滑因子对两幅图像的重叠区域进行图像无缝拼接.实验证明,算法可以快速自动地生成柱面全景图像,具有良好的鲁棒性.     

水平集曲线演化快速提取足迹轮廓

提出空间多分辨分析方法,通过分析图像行列方向能量投影的分布,将图像划分为大小不均匀的子块,根据图像的总体结构特征和局部细节特征自适应地调整子块大小,并以各子块的灰度均值作为新图像基元像素的灰度值,实现图像压缩.水平集曲线演化方法在压缩图像上进行,使得被处理的数据量大大减少,从而缩短了轮廓提取的时间,提高了算法的实用性.与边缘检测方法或直接水平集曲线演化方法相比较表明,该方法能够以较少的运算量获取较高的足迹轮廓提取准确度.     

基于邻域特征与聚类的图像分割方法

提出一种基于邻域特征和聚类的图像分割方法。该方法提取像素点的5维邻域特征,利用渐进聚类方法使同类元素具有较高的相似度、不同类元素相似度差别较大,从而对图像中的像素进行归类划分,实现目标图像的正确分割。实验结果表明,该方法能准确定位图像边缘,具有较强的抗噪性和较高的分割精度。     

基于视觉特性的图象分割编码算法

提出了一种考虑人眼视觉系统特点的不树分割编码算法,在分析视觉系统对比度特性的基础上,首先提出了一个基于视觉敏感的四叉树分割标准。     

An FPGA based cascaded CBC block cipher through RPSPNC and TE

Security system can be enhanced by cascading approach where two or more cryptographic algorithms are applied serially or parallel. In this paper the plaintext is first divided into number of blocks and each block are first encrypted by Recursive Positional Substitution on Prime-Nonprime of Cluster (RPSPNC) and then the resultant blocks are encrypted by Triangular Encryption (TE). In RPSPNC source stream is divided into blocks and a generating function is applied on each block to generate a same size of intermediate block t, repetition of this generating function for finite number of time regenerates the original block. In TE, source stream is broken into blocks of size n, and then XNOR operation is performed from MSB to LSB generating a block of size n − 1 and continues to form a triangle. Encryption is done in any of four types and decryption is done in similar method. Lastly combining all the encrypted blocks the ciphertext is generated. Thus applying cascaded approach much better result has been generated as compared to separate RPSPNC and TE. The results are also compared with State-of-art technique from literature, RCT, RMRO and much known RSA.

     

图象块编码—分类的方法

提出了一个基于ＤＣＴ和二维多项式近似的块分类编码算法。在该算法中，原始图象被分割成互不覆盖的８×８子块。通过依次地利用灰度局部方差、二维多项式近似误差和图象信号的空间频率分布，把图象块分为均匀、平滑、粗糙和细节４类。均匀块和平滑块分别采用零阶和一阶多项式近似。粗糙和细节块先进行ＤＣＴ变换，然后对其ＤＣＴ系数量化后采用改进的游程编码表示。实验结果表明该算法具有良好的性能。在未采用熵编码为编码码流作后处理的情况下，性能仍优于ＪＰＥＧ标准。     

Secure variable-capacity self-recovery watermarking scheme

Since existing watermarking schemes usually cannot recover the tampered position, a secure variable-capacity self-recovery watermarking scheme is proposed. Both watermark embedding capacity and security are taken into account. The original image is divided into texture blocks and smooth blocks, and the texture blocks not only save traditional information, and save the “details” information. The so-called “details” information refers to the texture information, which not only can effectively resist mean attack, but also help to improve the quality of the recovered image to meet the needs of practical work. And then according to the characteristics of different blocks, the different length compound watermarks are produced. The so-called “compound watermarks” include the authentication watermarks and information watermarks. Authentication watermarks are used to detect the tampered region, and the information watermarks which include basic watermark and additional watermark are used to recover image. Then the compound watermarks are inserted into the other blocks based on the new proposed scheme called three level secret-key embedding scheme (TLSES). And then detect the tamper blocks and recover them by the three level tamper detection scheme (TLTDS). The experimental results show that the paper can not only accurately detect the tamper region and recover image, but also can effectively resist mean attack and collage attack.

     

Indexing and querying segmented web pages: the BlockWeb Model

We present in this paper a model for indexing and querying web pages, based on the hierarchical decomposition of pages into blocks. Splitting up a page into blocks has several advantages in terms of page design, indexing and querying such as (i) blocks of a page most similar to a query may be returned instead of the page as a whole (ii) the importance of a block can be taken into account, as well as (iii) the permeability of the blocks to neighbor blocks: a block b is said to be permeable to a block b?? in the same page if b?? content (text, image, etc.) can be (partially) inherited by b upon indexing. An engine implementing this model is described including: the transformation of web pages into blocks hierarchies, the definition of a dedicated language to express indexing rules and the storage of indexed blocks into an XML repository. The model is assessed on a dataset of electronic news, and a dataset drawn from web pages of the ImagEval campaign where it improves by 16% the mean average precision of the baseline.     

一种基于小波变换与自适应混合量化的新图象压缩算法

本文提出了基于小波变换与自适应混合量化的图象压缩算法，该算法首先将小波变换后的图象高频子带划分为扫描块，然后依据图象的纹理复杂度和重要性程度将这些扫描块划分为4类（平坦，过渡，弱纹理和强纹理）；最后对各类扫描块分别进行向量和标量量化混合编码，实验结果表明，试图象压缩算法在压缩速度，图象复原质量等方面均优于FVQ编码算法和JPEG方法。     

Quantum Partial Search of a Database with Several Target Items

We consider unstructured database separated into blocks of equal size. Blocks containing target items are called target blocks. Blocks without target items are called non-target blocks. We present a fast quantum algorithm, which finds one of the target blocks. The algorithm uses the same oracle, which the main Grover algorithm does. We study the simplest case, when each target block has the same number of target items. Our algorithm is based on Boyer, Brassard, Hoyer, and Tapp algorithm of searching database with several target items and on Grover–Radhakrishnan algorithm of partial search. We minimize the number of queries to the oracle. We analyze the algorithm for blocks of large size. In next publications we shall consider more general case when the number of target items is different in different target blocks.      

结合分块DCT系数及其统计特征的人脸识别

提出了一种基于分块DCT系数及其统计特征的人脸识别算法。对图像进行分块,对每一块进行DCT变换,选择低频部分的系数作为识别的特征,将每一块分解为一幅低通滤波图和一个包含DCT高频系数的反L型块;分别对这两块求其均值、方差和熵这三个统计特征;利用支持向量机(SVM)和最近邻分类器对这些特征进行分类识别。在ORL、Yale人脸数据库上的仿真实验表明,使用基于分块DCT系数及其统计特征可达到较高的识别率。     

An efficient scheme for simulating large,passive microstrip layouts

An efficient algorithm is presented here for simulating large, passive, microstrip layouts using a circle of influence approach with a full-wave/integral-equation-based numerical solver. The procedure involves dividing the circuit into standard subcomponents or blocks and assigning a circle of influence for each block. Reiving on physical intuition, the computation of the couplings between blocks is then limited to those that fall within the circle. By adjusting the circle size, different orders of parasitic coupling can be included in the simulation process. Local junction effects from the individual blocks and the parasitic couplings between blocks that are in close physical proximity can always be taken into account. Aided by a newly developed graphical user interface, the tradeoff between computational efficiency and accuracy is examined by varying the diameter of the circle of influence. Data are presented to illustrate the effectiveness of this new approach. © 1992 John Wiley & Sons, Inc.     

An adaptive data hiding scheme with high embedding capacity and visual image quality based on SMVQ prediction through classification codebooks

This study exploits the characteristics of image blocks to develop an adaptive data hiding scheme that is based on SMVQ prediction. Since human beings’ eyes are highly sensitive to smooth images, changes in smooth cause great distortion and attract the attention of interceptors. Hence, this study proposes a data embedding scheme for embedding secret data into edge blocks and non-sufficiently smooth blocks. The experimental results show that the proposed scheme improves the quality of the stego-image and the embedding capacity.