Screen image sequence compression method utilizing adaptive block size coding and hierarchical GOP structure

To compress screen image sequence in real-time remote and interactive applications,a novel compression method is proposed.The proposed method is named as CABHG.CABHG employs hybrid coding schemes that consist of intra-frame and inter-frame coding modes.The intra-frame coding is a rate-distortion optimized adaptive block size that can be also used for the compression of a single screen image.The inter-frame coding utilizes hierarchical group of pictures(GOP) structure to improve system performance during random accesses and fast-backward scans.Experimental results demonstrate that the proposed CABHG method has approximately 47%-48% higher compression ratio and 46%-53% lower CPU utilization than professional screen image sequence codecs such as TechSmith Ensharpen codec and Sorenson 3 codec.Compared with general video codecs such as H.264 codec,XviD MPEG-4 codec and Apple's Animation codec,CABHG also shows 87%-88% higher compression ratio and 64%-81% lower CPU utilization than these general video codecs.

Use of Delayed Channel Estimation Results in Adaptive Modulation

In this paper,potential use of perfect but delayed channel estimates for variable-power discrete-rate adaptive modulation is explored.Research is concentrated on block by block adaptation.At first,a new quantity-TAUD(Tolerable Average Use Delay)is defined,it quantifies the performance of an adaptation scheme in tolerating the delay of channel estimates.Then,the research on TAUD shows that the delay tolerating performance declines with the increase in average power,the scheme working with more modulation modes can tolerate a longer delay,and such improvement will be more significant with the increase of average power.Finally,it shows that,as the delay tolerating performance determines the maximum block length,it has a great effect on the maximum spectral efficiency.The criterion for determining the block length appropriate for the target BER is described and a simple method of calculating the maximum block length is presented.

MAKING FULL USE OF OUTDATED CHANNEL ESTIMATES FOR BLOCK BY BLOCK ADAPTIVE MODULATIONS

This paper explores the potential to use accurate but outdated channel estimates for adaptive modulation. The work is novel in that the research is conditioned on block by block adaptation. First,we define a new quantity,the Tolerable Average Use Delay (TAUD),which can indicate the ability of an adaptation scheme to tolerate the delay of channel estimation results. We find that for the variable-power schemes,TAUD is a constant and dependent on the target Bit Error Rate (BER),average power and Doppler frequency; while for the constant-power schemes,it depends on the ad-aptation block length as well. At last,we investigate the relation between the delay tolerating per-formance and the spectral efficiency and give the system design criterion. The delay tolerating per-formance is improved at the price of lower data rate.

Metaheuristic Based Noise Identification and Image Denoising Using Adaptive Block Selection Based Filtering

Image denoising has become one of the major forms of image enhancement methods that form the basis of image processing. Due to the inconsistencies in the machinery producing these signals, medical images tend to require these techniques. In real time, images do not contain a single noise, and instead they contain multiple types of noise distributions in several indistinct regions. This paper presents an image denoising method that uses Metaheuristics to perform noise identification. Adaptive block selection is used to identify and correct the noise contained in these blocks. Though the system uses a block selection scheme, modifications are performed on pixel- to-pixel basis and not on the entire blocks;hence the image accuracy is preserved. PSO is used to identify the noise distribution, and appropriate noise correction techniques are applied to denoise the images. Experiments were conducted using salt and pepper noise, Gaussian noise and a combination of both the noise in the same image. It was observed that the proposed method performed effectively on noise levels up-to 0.5 and was able to produce results with PSNR values ranging from 20 to 30 in most of the cases. Excellent reduction rates were observed on salt and pepper noise and moderate reduction rates were observed on Gaussian noise. Experimental results show that our proposed system has a wide range of applicability in any domain specific image denoising scenario, such as medical imaging, mammogram etc.

Fractal Block Coding:A New Method

Fractal image compression is a completely new method to compress images by searching and exploiting the self similarity of the whole image . Fractal Block Coding (FBC) is a practicable fractal coding scheme with annoying slow encoding speed . In this paper, we classify the image blocks by Classified Vector Quantization (CVQ) technique and present an Adaptive Block Truncation Coding (ABTC) scheme to process the midrange blocks in the image. By this method , we reduce the encoding time to one forty fifth comparing to ordinary FBC method with little change in compression ratio and a little decreased coded image quality.

TACFN:Transformer-Based Adaptive Cross-Modal Fusion Network for Multimodal Emotion Recognition

The fusion technique is the key to the multimodal emotion recognition task.Recently,cross-modal attention-based fusion methods have demonstrated high performance and strong robustness.However,cross-modal attention suffers from redundant features and does not capture complementary features well.We find that it is not necessary to use the entire information of one modality to reinforce the other during cross-modal interaction,and the features that can reinforce a modality may contain only a part of it.To this end,we design an innovative Transformer-based Adaptive Cross-modal Fusion Network(TACFN).Specifically,for the redundant features,we make one modality perform intra-modal feature selection through a self-attention mechanism,so that the selected features can adaptively and efficiently interact with another modality.To better capture the complementary information between the modalities,we obtain the fused weight vector by splicing and use the weight vector to achieve feature reinforcement of the modalities.We apply TCAFN to the RAVDESS and IEMOCAP datasets.For fair comparison,we use the same unimodal representations to validate the effectiveness of the proposed fusion method.The experimental results show that TACFN brings a significant performance improvement compared to other methods and reaches the state-of-the-art performance.All code and models could be accessed from https://github.com/shuzihuaiyu/TACFN.

A Data Deduplication Framework of Disk Images with Adaptive Block Skipping

We describe an efficient and easily applicable data deduplication framework with heuristic prediction based adaptive block skipping for the real-world dataset such as disk images to save deduplication related overheads and improve deduplication throughput with good deduplication efficiency maintained. Under the framework, deduplication operations are skipped for data chunks determined as likely non-duplicates via heuristic prediction, in conjunction with a hit and matching extension process for duplication identification within skipped blocks and a hysteresis mechanism based hash indexing process to update the hash indices for the re-encountered skipped chunks. For performance evaluation, the proposed framework was integrated and implemented in the existing data domain and sparse indexing deduplication algorithms. The experimental results based on a real-world dataset of 1.0 TB disk images showed that the deduplication related overheads were significantly reduced with adaptive block skipping, leading to a 30%-80% improvement in deduplication throughput when deduplieation mctadata were stored on the disk for data domain, and 25%-40% RAM space saving with a 15%-20% improvement in deduplication throughput when an in-RAM sparse index was used in sparse indexing. In both cases, the corresponding deduplication ratios reduced were below 5%.

Adaptive Densely Residual Network for Image Super-Resolution

Many networks are designed to stack a large number of residual blocks,deepen the network and improve network performance through short residual connec-tion,long residual connection,and dense connection.However,without consider-ing different contributions of different depth features to the network,these de-signs have the problem of evaluating the importance of different depth features.To solve this problem,this paper proposes an adaptive densely residual net-work(ADRNet)for the single image super resolution.ADRN realizes the evalua-tion of distributions of different depth features and learns more representative features.An adaptive densely residual block(ADRB)was designed,combining 3 residual blocks(RB)and dense connection was added.It learned the attention score of each dense connection through adaptive dense connections,and the at-tention score reflected the importance of the features of each RB.To further en-hance the performance of ADRB,a multi-direction attention block(MDAB)was introduced to obtain multidirectional context information.Through comparative experiments,it is proved that theproposed ADRNet is superior to the existing methods.Through ablation experiments,it is proved that evaluating features of different depths helps to improve network performance.

Piecewise linear mapping algorithm for SAR raw data compression

When the saturation degree （SD） of space-borne SAR raw data is high, the performance of conventional block adaptive quantization （BAQ） deteriorates obviously. In order to overcome the drawback, this paper studies the mapping between the average signal magnitude （ASM） and the standard deviation of the input signal （SDIS） to the A/D from the original reference. Then, it points out the mistake of the mapping and introduces the concept of the standard deviation of the output signal （SDOS） from the A/D. After that, this paper educes the mapping between the ASM and SDOS from the A/D. Monte-Carlo experiment shows that none of the above two mappings is the optimal in the whole set of SD. Thus, this paper proposes the concept of piecewise linear mapping and the searching algorithm in the whole set of SD. According to the linear part, this paper gives the certification and analytical value of k and for nonlinear part, and utilizes the searching algorithm mentioned above to search the corresponding value of k. Experimental results based on simulated data and real data show that the performance of new algorithm is better than conventional BAQ when raw data is in heavy SD.