Image segmentation towards new image representation methods

Very low bit-rate video coding has recently become one of the most important areas of image communication and a large variety of applications have already been identified. Since conventional approaches are reaching a saturation point, in terms of coding efficiency, a new generation of video coding techniques, aiming at a deeper “understanding” of the image, is being studied. In this context, image analysis, particularly the identification of objects or regions in images (segmentation), is a very important step. This paper describes a segmentation algorithm based on split and merge. Images are first simplified using mathematical morphology operators, which eliminate perceptually less relevant details. The simplified image is then split according to a quad tree structure and the resulting regions are finally merged in three steps: merge, elimination of small regions and control of the number of regions.     

An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks

Formulating the minimum concave cost capacitated network flow problem as an integer concave minimization problem, we establish finite branch and bound algorithms, in which the branching operation is the so–called integral rectangular partition and the bounding procedure is performed by the classical minimum linear cost flow problem on subnetworks. For the special case that the flow cost function is concave on a fixed number of arcs and linear on the others, an upper bound of the running time is given. Received: 19 July 1996 / Accepted: 8 July 1997     

差分扩频技术在移动水声通信中的应用

提出了基于差分相干解调法的DS/BDPSK水声通信技术,在接收端采用差分相干解调的方法,解决了在水声通信中载波估计较难的问题,可克服传输过程中由于载波漂移产生的频率和相位误差.通过计算机仿真研究、湖试试验,验证了该系统在复杂的水声信道中具有较强的抗多径能力、抗多普勒能力,能实现低误码率通信,具有较好的有效性和鲁棒性.     

An oblivious fragile watermarking scheme for images utilizing edge transitions in BTC bitmaps

As one of the famous block-based image coding schemes,block truncation coding(BTC) has been also applied in digital watermarking.Previous BTC-based watermarking or hiding schemes usually embed secret data by modifying the BTC encoding stage or BTC-compressed data,obtaining the watermarked image with poorer quality than the BTC-compressed version.This paper presents a new oblivious image watermarking scheme by exploiting BTC bitmaps.Unlike the traditional schemes,our approach does not really perform the BTC compression on images during the embedding process but utilizes the parity of the number of horizontal edge transitions in each BTC bitmap to guide the watermark embedding and extraction processes.The embedding process starts by partitioning the original cover image into non-overlapping 4×4 blocks and performing BTC on each block to obtain its BTC bitmap.One watermark bit is embedded in each block by modifying at most three pixel values in the block to make sure that the parity of the number of horizontal edge transitions in the bitmap of the modified block is equal to the embedded watermark bit.In the extraction stage,the suspicious image is first partitioned into non-overlapping 4×4 blocks and BTC is performed on each block to obtain its bitmap.Then,by checking the parity of the number of horizontal edge transitions in the bitmap,we can extract one watermark bit in each block.Experimental results demonstrate that the proposed watermarking scheme is fragile to various image processing operations while keeping the transparency very well.     

DPCM编码在图像压缩中的应用

DPCM编码（差分脉冲编码调制）是一种线性预测编码。在二维图像中,由于相邻像素间的相关性很强,所以图像数据的冗余度都很大。对于瞬时斜率比较大和传输速度要求比较高的信号场合,为了使相邻像素间的相关性减小,通常采用DPCM编码技术对图像进行压缩。通过MATLAB仿真,表明DPCM编码能有效地对图像进行压缩。     

分布式信源编码在视频编码中的应用研究

分布式视频编码对编码器的功耗、复杂度、存储能力和传输能力都有较高的要求,而分布式信源编码理论正好适应了这一需求。为了使人们对这一技术有所了解,首先阐述了分布式视频编码的基本原理与其应用研究现状。并针对多视点分布式视频编码的Wyner—Ziv编解码器设计、虚拟“相关信道”建模、辅助边信息生成等几项关键技术存在的问题及最新研究进展进行分析和实验,最后总结了分布式信源编码理论在多视点视频编码的发展与研究方向。     

基于分形编码和LIC混沌系统的图像压缩加密算法

随着数字图像在网络中的广泛应用,其在安全、传输、存储等方面的问题亟待解决。提出的算法为分形编码提供了新型安全方案,分形图像编码具有压缩比高和重构质量高的特点,而混沌的不可预测性和初值敏感性适用于图像加密,将分形编码和混沌加密有效结合可以充分发挥两者的优势。此外,通过耦合增强构造新的混沌系统,改善了种子映射复杂度低、混沌范围有限等问题,并设计了置乱扩散同时进行的加密结构来提高算法效率。实验表明,提出的算法的密钥空间大、密钥敏感性强、相邻像素相关系数和信息熵都接近理想值,能够抵抗多种常见攻击,且加密速度更快,能满足实际应用的需要。压缩性能方面,在满足重构视觉质量的同时达到了较其他方案更高的压缩比。