低信噪比中MUSIC算法研究

MUSIC（Multiple Signal ClaSSification）是一种超分辨率的DOA（Direction of hrrival）估计算法,其分辨率随着天线接收信号的信噪比的增大而增大。在低信噪比条件TMUSIC算法的分辨率快速下降,为解决此问题提出了一种改进的MUSIC算法,使它在低信噪比条件下有较高的分辨率。通过计算机仿真验证了改进后的算法在低信噪比条件下具有很高的分辨率,在信噪比高的条件下其分辨率也大于基本的MUSIC算法。     

超分辨率重建算法综述

随着高分辨率移动设备和超高清电视的发展,对已有的低分辨率视频进行超分辨率上采样成为最近的一个研究热点.对已有的超分辨率重建算法根据输入输出方式的不同,分为多图像超分辨率重建、单图像超分辨率重建、视频超分辨率重建三大类,综述了其中每类算法的发展情况及常用算法,并对不同算法的特点分析比较.随后讨论了多图像超分辨率重建和单图像超分辨率重建方法对视频超分辨率重建方法的影响,最后展望了超分辨率重建算法的进一步发展.     

无源毫米波成像改进POCS超分辨率算法

在无源毫米波成像中,因为受天线孔径大小的限制而导致获取的图像分辨率低,所以必须采取有效后处理措施增强分辨率.提出了一种改进的POCS超分辨率算法,该算法结合了Wiener滤波器复原算法和凸集投影(POCS)算法的优点,使用Wiener滤波复原算法恢复图像通带内的低频分量,运用POCS算法作为主迭代过程实现频谱外推,同时保证低频分量不被破坏.实验结果表明,该算法增强了图像的分辨率,改善了收敛速度,减少了计算量,有利于无源毫米波成像超分辨率的实时实现.     

基于图像分辨率增强算法的场景生成技术

针对高分辨率真实感的虚拟环境及场景浏览时变焦观察的需要,研究了基于图像的高分辨率场景生成技术。图像分辨率增强技术是指利用已采样的信息来重新构建分辨率更高的场景图像,包含单帧图像的分辨率增强和多帧图像序列的分辨率增强两种技术。对于单帧图像的分辨率增强技术,提出了一种基于熵变分的图像分辨率增强算法。该算法在贝叶斯估计和最大熵原理的基础上,将图像像素点梯度信息应用到图像分辨率增强中,从而建立起一种基于图像梯度信息的各向异性自适应分辨率增强算法。对于多帧图像序列的超分辨率复原技术,在单帧熵变分模型的基础上,将双边滤波技术引入到图像超分辨率复原中,建立了一种基于广义熵变分的图像超分辨率复原模型,提出了一种基于几何距离和梯度信息的双重加权各向异性分辨率增强算法。实验结果表明:使用本文算法得到的高分辨率复原图像具有较高的峰值信噪比和视觉质量,与传统图像分辨率增强算法相比具有一定的优势。     

基于广义递归反演的超分辨率图像恢复研究

超分辨率图像恢复在安全监控、遥感监测、军事侦察等领域有着广泛的应用.文中提出了一种基于广义递归反演的超分辨率图像恢复算法,该算法引入正则化因子,将超分辨率图像恢复的欠定问题转化为适定问题,然后通过递归的方式来恢复超分辨率图像.仿真结果表明,该算法能从多帧低分辨率图像来恢复所需要的超分辨率图像,而且算法是稳健的和有效的.     

基于FPGA的图像超分辨率算法的实现

为了能够在硬件上实现高质量、高效果的视频图像超分辨率,本文提出了一种基于FPGA的自相似性超分辨率算法的实现。首先介绍了基于自相似性的超分辨率算法的基本原理和算法流程,接着提出了视频超分辨率引擎硬件设计的系统结构,并详细叙述了超分辨率引擎系统的各个模块的设计及实现,分析了系统的速度、带宽及资源。最终,在Xilinx K7 FPGA上实现了该视频超分辨率引擎。结果表明,本设计可以实时处理1080p@25Hz视频放大为4K@25Hz视频并在图像质量上取得明显的效果。     

一种新的毫米波辐射图像分辨率增强方法

针对毫米波辐射图像分辨率的增强问题,提出一种新的分辨率增强方法,该方法将双三次插值与非线性外推算法相结合。在空间域,通过双三次插值提高原始低分辨率图像的分辨率;在频率域,通过非线性外推算法增加图像的高频分量,最终实现毫米波辐射图像的分辨率增强。实验表明,新方法有效提高了图像的分辨率,并且分辨率增强后的图像具有良好的视觉效果。     

图像超分辨率重建算法综述

介绍了超分辨率重建的基本原理与数学模型,对现有的图像超分辨率重建算法进行了总结。将当前的超分辨率算法分为基于重建约束的方法和基于学习的方法两大类,分别阐述了超分辨率重建技术的经典方法,最后指出了低质量图像超分辨率技术进一步的研究方向。     

基于改进K-SVD字典学习的超分辨率图像重构

 针对已有算法中字典训练的时间消耗巨大的问题,提出了一种改进的基于字典学习的超分辨率图像重构算法.本文将K-SVD字典算法和高低分辨率联合生成的思想结合起来,形成新的字典训练方法,并将由该算法生成的高低分辨率字典应用于基于稀疏表示的超分辨率重构.重构仿真实验证明算法不仅有效降低了字典训练所消耗的时间,而且能够改善重构高分辨图像的质量.     

基于光频域反射原理的分布式光纤应变传感解调算法改进

利用光纤中的背向瑞利散射通过光频域反射原理实现整段光纤上的分布式应变测量.对应变解调算法进行了改进,采用二次互相关的方法实现了光纤的波长分辨率为5 pm,空间分辨率为2 cm.搭建了一套基于光频域反射原理的分布式光纤应变传感系统,对应变系数进行了标定,并实现了5m长光纤上的分布式应变测量,应变测量范围为50～500 με,应变分辨率为4.2με.改进后的算法克服了传统算法中波长分辨率和空间分辨率相互制约的缺点,能在保证波长分辨率的前提下提高空间分辨率,对该应变传感技术的后续研究具有一定借鉴意义.     

Tandem transcoding without distortion accumulation for vectorquantization

Transcoding algorithms that eliminate distortion accumulation due to tandem transcodings between memoryless, finite-state, and predictive vector quantization and pulse code modulation (PCM) are presented. The algorithms can be implemented using table lookups for memoryless and finite-state vector quantization, whereas predictive vector quantization requires online calculations. Computer simulations indicate a 6 dB improvement in the case of 16 kb/s predictive vector quantizers, 48 kb/s PCM, and four tandems for speech     

Image compression based on fuzzy algorithms for learning vectorquantization and wavelet image decomposition

This paper evaluates the performance of an image compression system based on wavelet-based subband decomposition and vector quantization. The images are decomposed using wavelet filters into a set of subbands with different resolutions corresponding to different frequency bands. The resulting subbands are vector quantized using the Linde-Buzo-Gray (1980) algorithm and various fuzzy algorithms for learning vector quantization (FALVQ). These algorithms perform vector quantization by updating all prototypes of a competitive neural network through an unsupervised learning process. The quality of the multiresolution codebooks designed by these algorithms is measured on the reconstructed images belonging to the training set used for multiresolution codebook design and the reconstructed images from a testing set.     

Segmentation of magnetic resonance images using fuzzy algorithms for learning vector quantization

This paper evaluates a segmentation technique for magnetic resonance (MR) images of the brain based on fuzzy algorithms for learning vector quantization (FALVQ). These algorithms perform vector quantization by updating all prototypes of a competitive network through an unsupervised learning process. Segmentation of MR images is formulated as an unsupervised vector quantization process, where the local values of different relaxation parameters form the feature vectors which are represented by a relatively small set of prototypes. The experiments evaluate a variety of FALVQ algorithms in terms of their ability to identify different tissues and discriminate between normal tissues and abnormalities.     

Using vector quantization for image processing

A review is presented of vector quantization, the mapping of pixel intensity vectors into binary vectors indexing a limited number of possible reproductions, which is a popular image compression algorithm. Compression has traditionally been done with little regard for image processing operations that may precede or follow the compression step. Recent work has used vector quantization both to simplify image processing tasks, such as enhancement classification, halftoning, and edge detection, and to reduce the computational complexity by performing the tasks simultaneously with the compression. The fundamental ideas of vector quantization are explained, and vector quantization algorithms that perform image processing are surveyed     

Trellis-coded vector quantization

Trellis-coded quantization is generalized to allow a vector reproduction alphabet. Three encoding structures are described, several encoder design rules are presented, and two design algorithms are developed. It is shown that for a stationary ergodic vector source, if the optimized trellis-coded vector quantization reproduction process is jointly stationary and ergodic with the source, then the quantization noise is zero-mean and of a variance equal to the difference between the source variance and the variance of the reproduction sequence. Several examples illustrate the encoder design procedure and performance     

Fast methods for split codebooks

This paper presents a fast method for building and searching split codebooks for vector quantization. The proposed method is evaluated in near transparent quality vector quantization of Line Spectral Frequencies (LSF) at 24-bit per frame. The method is based on a family of fractals called Space-Filling Curves (SFC). The SF curves achieve a significant saving in the complexity of vector quantization by reducing the problem to quantization in one-dimensional space. The paper presents algorithms for the generation of the SFC mapping utilizing the self-replication feature of the curves, and a number of simulation experiments to demonstrate the effectiveness of the method. It is shown that the SFC can reduce the search complexity of split codebooks by a factor of 8–32 times with a slight degradation in the vector quantization performance.     

一种新的矢量量化索引值分配算法

借鉴于生物免疫系统强大的防御能力,本文提出了一种免疫克隆(MCIAA)算法.该算法能更好地在群体的收敛性和个体的多样性之间保持动态平衡,有效地克服了局部收敛和早期收敛问题.将该算法应用于噪声信道矢量量化索引值分配寻优中,在存在信道噪声时,可较好地提高矢量量化器的性能.模拟试验表明该算法比其他算法有更好的增益和收敛速度.     

基于大数逻辑可译LDPC码的译码算法研究

本文提出两种基于可靠度的迭代大数逻辑译码算法,从以下两个方面降低译码复杂度:(1)校验节点使用伴随式信息处理,可节省外信息的计算操作;(2)变量节点使用伴随信息进行总信息的投票计数过程.结合非均匀量化技术,接收信号在判决门限附近获得更加精细的处理.此外,本文利用量化参数和列重比例信息对可靠度偏移方向和幅度进行了设计.仿真实验表明,本文提出的算法能够在很低的量化比特(3~4 bits)下有效工作,具有优良的译码性能和快速的收敛速度.     

Comparison between adaptive search and bit allocation algorithmsfor image compression using vector quantization

This article discusses bit allocation and adaptive search algorithms for mean-residual vector quantization (MRVQ) and multistage vector quantization (MSVQ). The adaptive search algorithm uses a buffer and a distortion threshold function to control the bit rate that is assigned to each input vector. It achieves a constant rate for the entire image but variable bit rate for each vector in the image. For a given codebook and several bit rates, we compare the performance between the optimal bit allocation and adaptive search algorithms. The results show that the performance of the adaptive search algorithm is only 0.20-0.53 dB worse than that of the optimal bit allocation algorithm, but the complexity of the adaptive search algorithm is much less than that of the optimal bit allocation algorithm.     

An algorithm for uniform vector quantizer design

A vector quantizer maps ak-dimensional vector into one of a finite set of output vectors or "points". Although certain lattices have been shown to have desirable properties for vector quantization applications, there are as yet no algorithms available in the quantization literature for building quantizers based on these lattices. An algorithm for designing vector quantizers based on the root latticesA_{n}, D_{n}, andE_{n}and their duals is presented. Also, a coding scheme that has general applicability to all vector quantizers is presented. A four-dimensional uniform vector quantizer is used to encode Laplacian and gamma-distributed sources at entropy rates of one and two bits/sample and is demonstrated to achieve performance that compares favorably with the rate distortion bound and other scalar and vector quantizers. Finally, an application using uniform four- and eight-dimensional vector quantizers for encoding the discrete cosine transform coefficients of an image at0.5bit/pel is presented, which visibly illustrates the performance advantage of vector quantization over scalar quantization.