Non-coherent space-time code based on full diversity space-time block coding

A non-unitary non-coherent space-time code which is capable of achieving full algebraic diversity is proposed based on full diversity space-time block coding, The error performance is optimized by transforming the non-unitary space-time code into unitary space-time code, By exploiting the desired structure of the proposed code, a grouped generalized likelihood ratio test decoding algorithm is presented to overcome the high complexity of the optimal algorithm, Simulation results show that the proposed code possesses high spectrum efficiency in contrast to the unitary space-time code despite slight loss in the SNR, and besides, the proposed grouped decoding algorithm provides good tradeoff between performance and complexity,     

Efficient detection methods for amplify-and-forward relay-aided device-to-device systems with full-rate space-time block code

Relay-aided device-to-device (D2D) communication is a promising technology for the next-generation cellular network. We study the transmission schemes for an amplify-and-forward relay-aided D2D system which has multiple antennas. To circumvent the prohibitive complexity problem of traditional maximum likelihood (ML) detection for full-rate space-time block code (FSTBC) transmission, two low-complexity detection methods are proposed, i.e., the detection methods with the ML-combining (MLC) algorithm and the joint conditional ML (JCML) detector. Particularly, the method with the JCML detector reduces detection delay at the cost of more storage and performs well with parallel implementation. Simulation results indicate that the proposed detection methods achieve a symbol error probability similar to that of the traditional ML detector for FSTBC transmission but with less complexity, and the performance of FSTBC transmission is significantly better than that of spatial multiplexing transmission. Diversity analysis for the proposed detection methods is also demonstrated by simulations.     

Encrypted gray image transmission over OFDM channel for TV cloud computing

One of the most important issues which attract the researcher is to provide a secure channel to transfer data between many points. Television cloud has many contents which are needed to be transferred to authorized groups (AuthGs). Also, the transfer rate is an aspect to be considered. In this work, orthogonal frequency division multiplexing is investigated to be sure it is acceptable for the cloud and use many transforms to choose the perfect one for the cloud. The investigation is done under fading channel condition. Peak signal-to-noise ratio is used to differentiate between cases. Many tests are also suggested to confirm the high quality of performance for the cloud.     

Robust image hashing using progressive feature selection for tampering detection

The main problem addressed in this paper is the robust tamper detection of the image received in a transmission under various content-preserving attacks. To this aim the progressive feature point selection method is proposed to extract the feature points of high robustness; with which, the local feature and color feature are then generated for each feature point. Afterwards, the robust image hashing construction method is proposed by using the location-context information of the features. The constructed hash is attached to the image before transmission and it can be used for analyzing at destination to filter out the geometric transformations occurred in the received image. After image restoration, the similarity of the global hashes between the source image and restored image is calculated to determine whether the received image has the same contents as the trusted one or has been maliciously tampered. When the received image being judged as a tampered image, the hashes calculated with the proposed Horizontal Location-Context Hashing (HLCH) and Vertical Location-Context Hashing (VLCH) methods will be used to locate the tampered regions. Experimental results on different images with tampering of arbitrary size and location demonstrate that our image authentication and tampering localization scheme are superior to the state-of-the-art methods under various attacks.     

Robust image and video transmission over spectrally shaped channelsusing multicarrier modulation

This paper presents a new parallel transmission framework for reliable multimedia data transmission over spectrally shaped channels using multicarrier modulation. We propose to transmit source data layers of different perceptual importance in parallel, each occupying a number of subchannels. New loading algorithms are developed to efficiently allocate the available resources, e.g., transmitted power and bit rate, to the subchannels according to the source layers they transmit. Instead of making the bit error rate of all the subchannels equal as in most existing loading algorithms, the proposed algorithm assigns different error performance to the subchannels to achieve unequal error protection for different layers. The channel induced distortion in mean-square sense is minimized. We show that the proposed system can be applied nicely to both fixed length coding and variable-length coding. Asymptotic gains with respect to channel distortion are also derived. Numerical examples show that the proposed algorithm achieves significant performance improvement compared to the existing work, especially for spectrally shaped channels commonly used in in ADSL systems     

ABBA码的两种改进方案及其性能仿真

ABBA码是一种可用于三个以上发送天线系统的准正交空时分组编码。该方案能获得最大传输速率．但不能提供最大的分集增益。为了改进这一不足．本文介绍了它的两种改进方案。这两种方案分别利用了星座旋转的方法和发射端已知的信道状态信息来增加ABBA码的分集增益．仿真结果表明这两种改进方案的误码率性能较原有的ABBA码性能均有一定程度的改善。     

Robust hierarchical image representation using non-negative matrix factorisation with sparse code shrinkage preprocessing

When analysing patterns, our goals are (i) to find structure in the presence of noise, (ii) to decompose the observed structure into sub-components, and (iii) to use the components for pattern completion. Here, a novel loop architecture is introduced to perform these tasks in an unsupervised manner. The architecture combines sparse code shrinkage with non-negative matrix factorisation, and blends their favourable properties: sparse code shrinkage aims to remove Gaussian noise in a robust fashion; non-negative matrix factorisation extracts substructures from the noise filtered inputs. The loop architecture performs robust pattern completion when organised into a two-layered hierarchy. We demonstrate the power of the proposed architecture on the so-called bar-problem and on the FERET facial database.     

空时网格编码和OFDM相结合的通信系统性能仿真分析

简单研究了空时网格编码和OFDM相结合的理论基础,详细介绍了空时编码和OFDM相结合的通信系统,通过仿真分析了该系统在高斯白噪声信道和频率选择性衰落信道下的系统性能。     

发射天线选择正交空时码系统的性能分析

分别针对瑞利衰落信道和Nakagami衰落信道,研究了使用发射天线选择(TAS)和正交空时分组码(STBC)的多输入多输出系统的平均符号误码率(ASEP)性能。基于标量加性高斯白噪声(AWGN)信道的方法,推导出了采用脉冲幅度调制(PAM)、相移键控(PSK)和正交幅度调制(QAM)的精确和近似的ASEP闭合表达式。然后对不同条件下的系统性能做了数值仿真,验证了分析结果的正确性。     

Cyclic delay transmission for unique word OFDM systems

In this article, we propose a cyclic delay diversity （CDD） transmission scheme for unique word （UW） OFDM system, which is denoted as CDD-UW-OFDM. In our proposed CDD-UW-OFDM system, the first transmit antenna transmits a UW-OFDM and then, for every UW-OFDM block, the i-th transmit antenna transmits a cyclically delayed version of the symbols transmitted at the first transmit antenna. With this proposed CDD-OFDM system, each antenna transmission is a UW-OFDM. Also, at the receiver under a certain condition on the cyclic delay amounts, the received signal is equivMent to that of a single transmit antenna UW-OFDM transmission with a longer multipath channel. We design the lengths of UW and cyclic delays to achieve the full multipath and spatial diversities for the CDD-UW-OFDM system when the linear MMSE receiver is used. We then present some simulation results to illustrate the claimed performance of the proposed system.     

Low-complexity progressive image transmission scheme based on quadtree segmentation

A novel progressive image transmission scheme based on the quadtree segmentation technique is introduced in this paper. A 3-level quadtree is used in the quadtree segmentation technique to partition the original image into blocks of different sizes. Image blocks of different sizes are encoded by their block mean values. The relatively addressing technique is employed to cut down the storage cost of block mean values.In the proposed scheme, the number of image hierarchies can be adaptively selected according to the specific applications. By exploiting inter-pixel correlation and differently sized blocks for segmentation, the proposed scheme provides good image qualities at low bit rates and consumes very little computational cost in both image encoding and decoding procedures. It is quite suitable for real-time progressive image transmission.     

Cyclic-delay time-reversal space-time block codes for single-carrier transmission with frequency-domain decision-feedback equalization

Transmit diversity is an important multiple-input multiple-output (MIMO) approach to improve the transmission reliability;however,it is usually designed with maximum-likelihood detection.In this paper,we investigate a simple transceiver structure for single-carrier MIMO systems,in which the cyclic-delay time-reversal space-time block code (CDTR-STBC) is employed at the transmitter,and the frequency-domain decision-feedback equalization (FD-DFE) is used at the receiver.We separate the transmit antennas into ...     

Robust image watermarking using sample area quantization

Digital watermarking is a way to protect the intellectual property of digital media. Among different algorithms, Quantization Index Modulation (QIM) is one of the popular methods in designing a watermark system. In this paper, a sample area quantization method is proposed for robust watermarking of digital images. First, the samples of the host signal form a polygon and low frequency wavelet coefficients of the carrier image is considered as the host sample. A watermark digit is embedded by quantizing the area of the polygon. Then, in order to minimize the distortion, the watermarked samples are obtained as close as possible to the host samples by solving an optimization problem while maintaining the quantized area at its fixed value. The optimization problem is solved using the gradient descend method. Finally, a maximum likelihood detector is designed to extract the watermark digits, assuming a Gaussian distribution for the host signal samples. The performance of the proposed method is theoretically obtained in terms of error probability in the presence of additive white Gaussian noise. Theoretical results are verified using simulation with artificial signals. The proposed method is compared to the state-of-the-art method under different attacks including: noise addition, JPEG compression, filtering, and geometrical attacks. The results confirm that the proposed method outperforms the other ones in terms of error probability against different attacks. The results also show that in the trade-off between robustness, distortion and capacity, by decreasing capacity the two other factors could be improved simultaneously.

     

Robust image authentication using content based compression

Image authentication is becoming very important for certifying data integrity. A key issue in image authentication is the design of a compact signature that contains sufficient information to detect illegal tampering yet is robust under allowable manipulations. In this paper, we recognize that most permissible operations on images are global distortions like low-pass filtering and JPEG compression, whereas illegal data manipulations tend to be localized distortions. To exploit this observation, we propose an image authentication scheme where the signature is the result of an extremely low-bit-rate content-based compression. The content-based compression is guided by a space-variant weighting function whose values are higher in the more important and sensitive region. This spatially dependent weighting function determines a weighted norm that is particularly sensitive to the localized distortions induced by illegal tampering. It also gives a better compactness compared to the usual compression schemes that treat every spatial region as being equally important. In our implementation, the weighting function is a multifovea weighted function that resembles the biological foveated vision system. The foveae are salient points determined in the scale-space representation of the image. The desirable properties of multifovea weighted function in the wavelet domains fit nicely into our scheme. We have implemented our technique and tested its robustness and sensitivity for several manipulations.     

一种基于非负矩阵分解的鲁棒零水印算法

为了解决现有数字水印中鲁棒性和不可感知性之间的矛盾,设计了一种基于非负矩阵分解和离散小波变换的图像零水印算法。原始图像进行不重叠分块,分别对每子块图像进行3级小波分解得到低频近似分量;对细节分量作非负矩阵分解得到可近似表示子块图像的基矩阵和系数矩阵;将系数矩阵量化得到特征向量,通过特征向量和水印的运算得到原始图像的版权信息。实验结果表明该方案对常见信号处理具有很强的鲁棒性,同时密钥的使用保障了算法的安全性。     

Robust interactive image segmentation using structure-aware labeling

Interactive image segmentation has remained an active research topic in image processing and graphics, since the user intention can be incorporated to enhance the performance. It can be employed to mobile devices which now allow user interaction as an input, enabling various applications. Most interactive segmentation methods assume that the initial labels are correctly and carefully assigned to some parts of regions to segment. Inaccurate labels, such as foreground labels in background regions for example, lead to incorrect segments, even by a small number of inaccurate labels, which is not appropriate for practical usage such as mobile application. In this paper, we present an interactive segmentation method that is robust to inaccurate initial labels (scribbles). To address this problem, we propose a structure-aware labeling method using occurrence and co-occurrence probability (OCP) of color values for each initial label in a unified framework. Occurrence probability captures a global distribution of all color values within each label, while co-occurrence one encodes a local distribution of color values around the label. We show that nonlocal regularization together with the OCP enables robust image segmentation to inaccurately assigned labels and alleviates a small-cut problem. We analyze theoretic relations of our approach to other segmentation methods. Intensive experiments with synthetic and manual labels show that our approach outperforms the state of the art.     

基于特殊导频码的OFDM系统盲帧同步算法

提出了基于特殊导频码的OFDM系统的盲帧同步算法。该算法不需要数据辅助,首先利用FFT窗跨界时产生的能量泄露实现了对符号定时参数的估计,然后对同步后的OFDM信号进行解调得到信息序列,最后利用3阶相关函数(TCF)对序列进行处理从而提取出同步码以实现帧同步。仿真结果表明,该算法在低信噪比下具有较好的同步能力和较高的同步精度。     

Robust and distortion control dual watermarking in LWT domain using DCT and error correction code for color medical image

Multimedia Tools and Applications - This paper presents lifting wavelet transform (LWT) and discrete cosine transform (DCT) based robust watermarking approach for tele-health applications. For...     

Automatic image authentication and recovery using fractal code embedding and image inpainting

In this paper, we propose a novel scheme of automatic image authentication and recovery, in which the altered region of the image can be detected and recovered in a fully automated fashion. To achieve high-quality image recovery, we choose the region of importance (ROI) in the image and perform fractal encoding for the blocks of ROI. And then we insert the fractal codes of ROI and the watermark into the original image to obtain the watermarked image. By watermark extraction, we can determine whether the watermarked image has been tampered or not. If the watermarked image has been tampered, we can automatically localize the altered region, and apply either fractal decoding or image inpainting for image recovery. Finally, experimental results are given to show the effectiveness of the proposed scheme.