Efficient algorithm for very low bit rate embedded image coding

The authors propose an embedded wavelet-based image coding algorithm that exploits both the inter- and intra-subband correlations among the wavelet coefficients. The proposed coding algorithm is based on spatial orientation trees (SOT) in which the basic unit is a block of m times n coefficients in contrast to a single coefficient in the set partitioning in hierarchical trees (SPIHT) algorithm. Each SOT has a root node (a block of m times n coefficients) in the LL-subband with the child and descendent blocks in the high frequency subbands. Thus it fuses the features of both block- and tree-based coding algorithms into a single algorithm. Performance of the proposed method is compared (in terms of rate-distortion performance) with the other state-of-the-art coding algorithms including the JPEG2000 for popular test images. Simulation results show that the proposed algorithm has a better coding efficiency over the other coders at very low bit rates. Also, compared with SPIHT it reduces the elements of the auxiliary lists, thereby reducing the memory requirements. In addition, the encoder of the proposed algorithm is significantly faster than that of the SPIHT, but with a slight increase in its decoder complexity.     

A novel hybrid 3D video service algorithm based on scalable video coding (SVC) technology

A scalable video coding (SVC) server can simultaneously provide a single bitstream with a fixed maximum service layer for different kinds of devices having different memory capacity, network bandwidth, and CPU performance requirements. An efficient hybrid 3D video service scheme is proposed without violation of the SVC standard technology for multiple transmission paths. A dynamic local disparity vector estimation algorithm is used to reflect the motion shift component between stereo views in the inter-layer prediction stage of the SVC encoder. To improve the coding efficiency, an adaptive search scheme based on distortion rates (DRs) between corresponding and reference macroblocks is used. Based on experimental results, up to 1.41 dB of quality improvement using JSVM 9.19 reference software is verified.     

Near lossless compression of hyperspectral images based on distributed source coding

Effective compression technique of on-board hyperspectral images has been an active topic in the field of hyperspectral remote sensintg.In order to solve the effective compression of on-board hyperspectral images,a new distributed near lossless compression algorithm based on multilevel coset codes is proposed.Due to the diverse importance of each band,a new adaptive rate allocation algorithm is proposed,which allocates rational rate for each band according to the size of weight factor defined for hyperspectral images subject to the target rate constraints.Multiband prediction is introduced for Slepian-Wolf lossless coding and an optimal quantization algorithm is presented under the correct reconstruction of Slepian-Wolf decoder,which minimizes the distortion of reconstructed hyperspectral images under the target rate.Then Slepian-Wolf encoder exploits the correlation of the quantized values to generate the final bit streams.Experimental results show that the proposed algorithm has both higher compression efficiency and lower encoder complexity than several existing classical algorithms.     

Efficient multicast schemes for 3-D Networks-on-Chip

3-D Networks-on-Chip (NoCs) have been proposed as a potent solution to address both the interconnection and design complexity problems facing future System-on-Chip (SoC) designs. In this paper, two topology-aware multicast routing algorithms, Multicasting XYZ (MXYZ) and Alternative XYZ (AL + XYZ) algorithms in supporting of 3-D NoC are proposed. In essence, MXYZ is a simple dimension order multicast routing algorithm that targets 3-D NoC systems built upon regular topologies. To support multicast routing in irregular regions, AL + XYZ can be applied, where an alternative output channel is sought to forward/replicate the packets whenever the output channel determined by MXYZ is not available. To evaluate the performance of MXYZ and AL + XYZ, extensive experiments have been conducted by comparing MXYZ and AL + XYZ against a path-based multicast routing algorithm and an irregular region oriented multiple unicast routing algorithm, respectively. The experimental results confirm that the proposed MXYZ and AL + XYZ schemes, respectively, have lower latency and power consumption than the other two routing algorithms, meriting the two proposed algorithms to be more suitable for supporting multicasting in 3-D NoC systems. In addition, the hardware implementation cost of AL + XYZ is shown to be quite modest.     

基于小波变换的空间可分级图像压缩编码算法

图像压缩算法如EZW和SPTHT都具有较高的压缩率,为了能使图像压缩编码算法同时具有较高的压缩率和良好的压缩性能,本文分析了SPTHT算法,在相同压缩效率的情况下,将其进一步改进,使之具有空间可分级性。在编码过程中,单个像素的相关信息按其所在的分辨率层输出到基础层或增强层码流中,而对于集合的测试信息按其最高层像素所在的分辨率层以较大的概率输出到相应的码流中。这样,虽然低频子带与高频子带相关联而编码,但实验结果显示与低频子带单独编码的性能非常接近。同时给出了一种基础层和增强层之间的码率分配方案。实验结果显示,随码率的增大,基础层所占的比率越来越低,同时,对包含边缘较多的图像,其基础层码率所占的比率也较低。     

新一代视频编码标准H．26L及其特性分析

H.26L标准是ITU-T视频编码专家组(VCEG)和ISO/IE MPEG委员会正在制定的用于视频通信的新一代视频编码标准,其设计目的是对多种图象信源实现低比特率、实时和低延迟的视频编码.H.26L采用简单有效的块处理的实现途径,获得的编码效率大大优于现有标准.在继承现有视频标准分块变换、运动估计/补偿、量化和熵编码等成熟技术的基础上,H.26L采用了多种新技术,保证了编码的有效性.在介绍H.26L标准的基础上,对运动补偿中不同的块大小的组合方式、不同的亚像元补偿精度以及两种熵编码方法进行了实验分析.实验结果表明,综合考虑压缩比、PSNR和编、解码器复杂度,对于通常视频内容,选择8×8及更大的分块模式、1/4像素运动补偿精度和通用变长编码,能够获得最经济的压缩效果.     

Continuous blood pressure estimation based on multiple parameters from eletrocardiogram and photoplethysmogram by Back-propagation neural network

The cuff-less continuous blood pressure monitoring provides reliable and invaluable information about the individuals’ health condition. Conventional sphygmomanometer with a cuff measures only the value of the blood pressure intermittently and the measurement process is sometimes inconvenient. In this work, a systematic approach with multi-parameter fusion has been proposed to estimate the non-invasive beat-to-beat systolic and diastolic blood pressure with high accuracy. The methods involve real-time monitoring of the electrocardiogram (ECG) and photoplethysmogram (PPG), and extracting the R peak from the ECG and relevant feature parameters from the synchronous PPG. Also, it covers the creation of the topological model of back-propagation neural network that has fifteen neurons in the input layer, ten neurons in the single interlayer, and two neurons in the output layer, where all the neurons are fully connected. As for the results, the proposed method was validated on the volunteers. The reference blood pressure (BP) is from Finometer (MIDI, Finapres Medical System, Netherlands). The results showed that the mean ± S.D. for the estimated systolic BP (SBP) and diastolic BP (DBP) with the proposed method against reference were −0.41 ± 2.02 mmHg and 0.46 ± 2.21 mmHg, respectively. Thus, the continuous blood pressure algorithm based on Back-Propagation neural network provides a continuous BP with a high accuracy.     

一种无链表零树熵编码算法及其FPGA实现

传统熵编码算法复杂度高,且硬件实现较难。为此,提出一种易于FPGA硬件实现的无链表零树图像编码改进算法,该算法结合LZC和SPIHT算法的特点,增加了对孙子节点的判断,克服SPIHT算法中内存消耗大、复杂度高以及LZC算法中图像重建质量下降等缺点。采用该算法的编码器在对任意尺寸图像进行5层小波变换时,所需缓存固定为1 536 bit,远小于SPIHT算法。在相同比特率的情况下,图像重建质量PSRN值比LZC算法平均提高约0.7 dB。在Xilinx Virtex4 LX100硬件平台上进行实验,结果表明,当时钟频率为100 MHz、压缩率为1/40时,该算法处理1 600×1 200×24 bit图像的速度可达20 f/s。     

基于改进SPIHT的图像无损压缩算法研究

针对应用于图像无损压缩的传统SPIHT算法没有充分利用小波系数低频子带带内的相关性且存在编码冗余的不足之处,提出了基于改进SPIHT的图像无损压缩算法。首先对原始图像进行整数小波变换,然后对小波变换后的低频子带和高频子带分开编码,即对低频子带进行预测编码;对高频子带,当阈值小于等于2时,改变了传统SPIHT算法的编码方式,减少了比特输出。实验结果表明,与传统SPIHT算法相比,比特率平均降低了0.0653bpp。     

一种基于改进SPIHT的图像压缩算法研究

通过引入子带分块编码的思想,提出了一种基于提升小波变换的改进SPIHT算法。该算法不但具有传统SPIHT算法的优点,而且能实现码流多分辨率表示和ROI区域编码。最后,给出了一种有效的基于提升小波变换的图像压缩系统。该系统把图像分割成小块后,单独进行提升小波变换及编码处理,并在解码端恢复后进行重新组合。试验结果表明本方法能取得满意的结果,显示了本方法在图像压缩中的应用前景。     

A 5 GHz LC-VCO frequency synthesizer for unlicensed band of WiMAX

This paper presents a low power and low phase noise CMOS integer-N frequency synthesizer based on the charge-pump Phase Locked Loop (PLL) topology. The frequency synthesizer can be used for IEEE 802.16 unlicensed band of WiMAX (World Interoperability for Microwave Access). The operation frequency of the proposed design is ranged from 5.13 to 5.22 GHz. The proposed Voltage-Controlled Oscillator (VCO) achieves low power consumption and low phase noise. The high speed divider is implemented by an optimal extended true single phase clock (E-TSPC) prescaler. It can achieve higher operating frequency and lower power consumption. A new frequency divider is also proposed to eliminate the hardware overhead of the S counter in the conventional programmable divider. The proposed frequency synthesizer consists of a phase-frequency detector (PFD), a charge pump, a low-pass loop filter, a VCO, and a frequency divider. The simulated phase noise of the proposed VCO is −121.6 dBc/Hz at 1 MHz offset from the carrier frequency. The proposed frequency synthesizer consumes 13.1 mW. The chip with an area of 1.048 × 1.076 mm² is fabricated in a TSMC 0.18 μm CMOS 1P6M technology process.     

一种简单误码检错多分辨率SPIHT算法

由EZW算法演变而来的SPIHT算法是目前为止影响最大的小波压缩算法之一，它通过独特的扫描方式，将小波系数按照能量大小或者重要性程度编码输出。由于引入了小波树，隐藏了扫描路径，SPIHT能获得高压缩比，同时保持较高的图像质量。而后提出的多分辨率SPIHT算法能使解码器根据信道条件，选择图像还原分辨率。然而，SPIHT对路径可靠性要求严苛，任何路径信息的传输错误都会导致剩余所有码元的解码出错。许多学者就路径码元的保护提出了不同改进，却未能从根本上提高算法的抗噪性能。为此，提出了一种改进了的SPIHT算法，该算法在保持较高信噪比和不增加码元数量的基础上，使解码器具有简单误码检错能力。     

一种基于图像纹理分析的分形和SPIHT混合编码

从研究分形图像编码和零树编码各自的优劣点以及它们之间的结合点出发,寻找了一种基于图像纹理分析的分形和SPIHT混合编码,目的在于充分利用景物特征和人眼的视觉特性,提高分形变换和零树在图像编码领域内的协同能力。该方法利用SPIHT算法位平面编码的渐进特性,用基于灰度模型的统计特征分类方法将分形和SPIHT相结合,得到更符合人眼视觉特性的编码方案。实验结果表明,该方法能进行较好的图像块分类,并取得较高的压缩比,而且在人眼视觉允许的范围内且同时又要求高压缩比的情况下具有优势。     

Formal photograph compression algorithm based on object segmentation

Small storage space for photographs in formal documents is increasingly necessary in today＇s needs for huge amounts of data communication and storage. Traditional compression algorithms do not sufficiently utilize the distinctness of formal photographs. That is, the object is an image of the human head, and the background is in unicolor. Therefore, the compression is of low efficiency and the image after compression is still space-consuming. This paper presents an image compression algorithm based on object segmentation for practical high-efficiency applications. To achieve high coding efficiency, shape-adaptive discrete wavelet transforms are used to transformation arbitrarily shaped objects. The areas of the human head and its background are compressed separately to reduce the coding redundancy of the background. Two methods, lossless image contour coding based on differential chain, and modified set partitioning in hierarchical trees （SPIHT） algorithm of arbitrary shape, are discussed in detail. The results of experiments show that when bit per pixel （bpp）is equal to 0.078, peak signal-to-noise ratio （PSNR） of reconstructed photograph will exceed the standard of SPIHT by nearly 4dB.     

基于内嵌块优化等级树(EBOHT)算法的图像编码

该文提出一种图像编码的新算法（EBOHT），该算法先将图像进行小波变换，然后按空间位置对应关系将小波系数分成若干块，每一块数据采用一种新等级树编码，比传统的SPITH方法增加了预测过程，进一步利用了相邻小波系树的相关性，块间进行基于率失真曲线的优化方法，使每一块图像有合理的比特分配，同时由于数据是分块编码的，因此该算法较SPITH有更好的容错能力，且易于实现感兴趣区（ROI）编码。     

Realization strategies of dedicated path protection: A bandwidth cost perspective

Communication networks have to provide a high level of availability and instantaneous recovery after failures in order to ensure sufficient survivability for mission-critical services. Currently, dedicated path protection (or 1 + 1) is implemented in backbone networks to provide the necessary resilience and instantaneous recovery against single link failures with remarkable simplicity. However, in order to satisfy strict availability requirements, connections also have to be resilient against Shared Risk Link Group (SRLG) failures. In addition, switching matrix reconfigurations have to be avoided after a failure in order to guarantee instantaneous recovery. For this purpose, there are several possible realization strategies improving the characteristics of traditional 1 + 1 path protection by lowering reserved bandwidth while conserving all its favorable properties. These methods either utilize diversity coding, network coding, or generalize the disjoint-path constraint of 1 + 1.In this paper, we consider the cost aspect of the traditional and the alternative 1 + 1 realization strategies. We evaluate the bandwidth cost of different schemes both analytically and empirically in realistic network topologies. As the more complex realizations lead to NP-complete problems even in the single link failure case, we propose both Integer Linear Programming (ILP) based optimal methods, as well as heuristic and meta-heuristic approaches to solve them. Our findings provide a tool and guidelines for service providers for selecting the path protection method with the lowest bandwidth cost for their network corresponding to a given level of reliability.     

Improvement of turbo decoding using cross-entropy

In this paper, we present a simple method for normalizing the output information produced by a turbo decoder. The method is devised based on the cross-entropy (CE) concept. Simulations comparing the new method with some widely used normalization techniques show that the proposed approach can achieve about 0.2～0.3 dB coding gain improvement on average while reducing up to about 1/2～2/3 iteration for decoding, but require much fewer and simpler computations.     

A novel two-stage evolutionary optimization method for multiyear expansion planning of distribution systems in presence of distributed generation

In this paper, a new approach for multiyear expansion planning of distribution systems (MEPDS) is presented. The proposed MEPDS model optimally specifies the expansion schedule of distribution systems including reinforcement scheme of distribution feeders as well as sizing and location of distributed generations (DGs) during a certain planning horizon. Moreover, it can determine the optimal timing (i.e. year) of each investment/reinforcement. The objective function of the proposed MEPDS model minimizes the total investment, operation and emission costs while satisfying various technical and operational constraints. In order to solve the presented MEPDS model as a complicated multi-dimensional optimization problem, a new two-stage solution approach composed of binary modified imperialist competitive algorithm (BMICA) and Improved Shark Smell Optimization (ISSO), i.e. BMICA + ISSO, is presented. The performance of the suggested MEPDS model and also two-stage solution approach of BMICA + ISSO is verified by applying them on two distribution systems including a classic 34-bus and a real-world 94-bus distribution system as well as a well-known benchmark function. Additionally, the achieved results of BMICA + ISSO are compared with the obtained results of other two-stage solution methods.     

基于自适应子带分解和内容模型的图像编码

在SPIHT算法基础上引入了两种算法——自适应子带分解算法和基于内容模型的算术编码算法，以改进压缩性能．自适应子带分解算法改变了小波变换后系数的统计分布，在低码率时峰值信噪比(PSNR)得到一定的改善；基于内容模型的算术编码算法进一步开发了子带间以及相邻像素间的相关性，增强了压缩性能．实验结果表明：文中算法和STIHT算法比较，改进了压缩性能，同时保留了零树算法的渐进传输等优点。