基于Radon变换的多尺度虹膜特征提取算法

系统分析了基于虹膜特征的身份识别系统.针对典型预处理特点,设计了基于Radon变换的新特征提取算法.该算法在保持旋转、平移和尺度缩放不变性的同时,利用标准化方差加权的绝对距离,使识别准确度达到了93%.这种算法对于其它不规则图像的分析也具有启发意义.     

一种基于DSTFT解调2FSK信号的新方法

现有解调２ＦＳＫ信号的方法,大多采用时域解调的方式。本文提出了一种利用离散短时傅里叶变换（ＤＳＴＦＴ）在时频域解调２ＦＳＫ信号的新方法,仿真表明效果良好。     

A fast algorithm for discrete hartley transform of arbitrary length

DHT of length p~lq(p is odd and q is arbitrary) is turned into p~l DHTs of length qand some additional operations, while the additional operations only involves the computation ofcos-DFT and sin-DFT with length p. If the length of a DHT is p_1~(l_1)…P_N~(l_N)2~l(P_1…,P_N are oddprimes), a fast algorithm is obtained by the similar recursive technique. Therefore, the algorithmcan compute DHT of arbitrary length. The paper also Proves that operations for computingDHT of length N by the algorithm are no more than O(Nlog_2N), when the length is N=p~l,operations of the algorithm are fewer than that of other known algorithms.     

Radon变换和全变分相融合的图像复原算法

图像复原的核心是点扩散函数的估计和直接去卷积算法,针对拍照过程中,相机和被拍摄物体由于相对运动而导致的图像退化问题,提出一种基于Radon变换和全变分相融合的图像复原算法。首先利用radon变换对图像退化模型参数进行估计,然后采用全变分算法复原退化图像,最后在Matlab 2012平台进行仿真实验对算法的性能检验。仿真结果表明,相对于其它图像复原算法,本文算法可以准确估计退化模型参数,获得了更加理想的图像复原效果,具有一定的实际利用价值。     

On the discrete cosine transform computation

A generalized signal flow graph for the forward and inverse discrete cosine transform (DCT) based on the Hou's recursive algorithm is described. The regular structure of the generalized signal flow graph enables to realize the DCT and inverse DCT computation for any given N = 2^m, m > 0, and is effectively implementable on a VLSI chip. Computer program for the DCT and inverse DCT computation is also presented.     

NEW FAST ALGORITHM OF 2-D DISCRETE COSINE TRANSFORM

In this paper, a new algorithm for the fast computation of a 2-D discrete cosine transform (DCT) is presented. It is shown that the N×N DCT, where N = 2m, can be computed using only N 1-D DCT's and additions, instead of using 2N 1-D DCT's as in the conventional row-column approach. Hence the total number of multiplications for the proposed algorithm is only half of that required for the row-column approach, and is also less than that of most of other fast algorithms, while the number of additions is almost comparable to that of others.     

一种新的gyrator变换的快速算法

为了研究gyrator变换在光学信息处理中的应用,提出了一种采用两次快速傅里叶变换实现快速计算gyrator变换的新算法.在量纲归一化条件下,研究了gyrator变换离散化过程,获得了空域、傅里叶变换域和gyrator变换域的采样间隔,形成了一种能避免尺度变换的算法.采用该算法进行了数值模拟实验,实验结果与相关文献中报道的计算结果一致.结果表明,该算法可以应用于gyrator变换的研究中.     

A new algorithm to compute the DCT and its inverse

A novel algorithm to convert the discrete cosine transform (DCT) to skew-circular convolutions is presented. The motivation for developing such an algorithm is the fact that VLSI implementation of distributed arithmetic is very efficient for computing convolutions. It is also shown that the inverse DCT (IDCT) can be computed using the same building blocks which are used for computing the DCT. A DCT/IDCT processor can be designed to compute either the DCT or the IDCT depending on a 1-b control signal     

Robust image hash in Radon transform domain for authentication

Image authentication has become an emergency issue in the digital world as it can be easily tampered with the image editing techniques. In this paper, a novel robust hashing method for image authentication is proposed. The reported scheme first performs Radon transform (RT) on the image, and calculates the moment features which are invariant to translation and scaling in the projection space. Then discrete Fourier transform (DFT) is applied on the moment features to resist rotation. Finally, the magnitude of the significant DFT coefficients is normalized and quantized as the image hash bits. Experimental results show that the proposed algorithm can tolerate almost all the typical image processing manipulations, including JPEG compression, geometric distortion, blur, addition of noise, and enhancement. Compared with other approaches in the literature, the reported method is more effective for image authentication in terms of detection performance and the hash size.     

一种基于分数傅立叶变换的图像加密技术

本文基于分数傅立叶变换的多样性,通过不同级次的分数傅立叶变换与谱变换相结合,提出了一种新的光学图像加密算法。经计算机模拟验证,此算法确实可行可靠。     

基于离散Hartley变换的OFDM实现模型

本文研究离散Hartley变换在OFDM系统中的应用,提出一种基于离散Hartley变换的OFDM实现模型.分析了新模型在加性高斯白噪声信道下的传输性能和算法复杂度.新模型与基于离散傅立叶变换(DFT)的OFDM系统具有相同的传输性能,但计算复杂度降低,时效性提高,且调制与解调算法一致.     

基2DFT的最快速算法

本文提出一种FFT新算法,其计算量不大于现有的各种基2DFT算法.然后,与Winograd小DFT(4,8,16点)结合使用,得出一种计算DFT的最快速算法.     

A new optimal digital halftoning technique based on the discrete cosine transform

Digital halftoning is a technique to display a gray-level image with a bilevel device. Conventionally, most halftoning techniques are done in the spatial domain. A new halftoning technique based on the discrete cosine transform is proposed. The method chooses an optimal bilevel image to display the original gray-level image and minimize the weighted mean square error based on the discrete cosine transform domain. The simulation results indicate that our algorithm can produce very good halftoned images without false contours.     

基于冗余小波变换的高频地波雷达目标检测算法

为了从高频地波雷达(High Frequency Surface Wave Radar, HFSWR)信号生成的复杂距离多普勒(Range Doppler, RD)图像中准确提取运动点目标, 提出了一种基于冗余小波变换(Redundant Discrete Wavelet Transformation, RDWT)的RD图像点目标检测算法.该算法根据点目标与海杂波、电离层杂波等特征的差异, 首先在距离方向进行自适应RDWT以去除海杂波和地杂波, 并在多普勒方向进行自适应RDWT以去除电离层杂波; 然后利用图像形态学运算对背景噪声进行了抑制; 最后进行阈值自适应分割以得到点目标.实验结果表明:该算法能有效抑制RD图像中的海杂波、电离层杂波和背景噪声, 能从复杂的RD图像中实现点目标的有效检测, 其检测性能优于改进的恒虚警率(Constant False Alarm Rate, CFAR)算法.     

A fast algorithm for the linear canonical transform

In recent years there has been a renewed interest in finding fast algorithms to compute accurately the linear canonical transform (LCT) of a given function. This is driven by the large number of applications of the LCT in optics and signal processing. The well-known integral transforms: Fourier, fractional Fourier, bilateral Laplace and Fresnel transforms are special cases of the LCT. In this paper we obtain an O(NlogN) algorithm to compute the LCT by using a chirp-FFT-chirp transformation yielded by a convergent quadrature formula for the fractional Fourier transform. This formula gives a unitary discrete LCT in closed form. In the case of the fractional Fourier transform the algorithm computes this transform for arbitrary complex values inside the unitary circle and not only at the boundary. This chirp-FFT-chirp transform approximates the ordinary Fourier transform more precisely than just the FFT, since it comes from a convergent procedure for non-periodic functions.     

Enhanced localized computerized tomography employing the discrete wavelet transform

A new localized computerized tomography technique based on the multiresolution analysis (MRA) implementation of the discrete wavelet transform is proposed. Our technique is based upon viewing the projection data as a set of one-dimensional functions of the space variablet and decomposing each one into an approximation signal and a set of detail signals using MRA. The approximation signal and detiil signals associated with each projection are filtered using the ramp filter || of the standard reconstruction technique filtered back projection to generate the set of filtered projections. It is shown that only a very sparse set of projection data outside of the region of interest (ROI) is required to reconstruct a high-quality image of the ROI and a reasonable image outside of the ROI. Simulation results using the Shepp-Logan head phantom are presented to demonstrate the proposed technique.     

A weighted general discrete fourier transform for the frequency-domain Blind Source Separation of Convolutive Mixtures

This letter deals with the frequency domain Blind Source Separation of Convolutive Mixtures （CMBSS）. From the frequency representation of the ＂overlap and save＂, a Weighted General Discrete Fourier Transform （WGDFT） is derived to replace the traditional Discrete Fourier Transform （DFT）. The mixing matrix on each frequency bin could be estimated more precisely from WGDFT coefficients than from DFT coefficients, which improves separation performance. Simulation results verify the validity of WGDFT for frequency domain blind source separation of convolutive mixtures.     

快速傅里叶变换中逆序数计算的一种快速算法

提出一种基-2快速傅里叶变换中逆序数计算的新算法,该算法较大多数文献上列出的"逢二退一"法及其改进算法,以及生成法均显著减少了运算量,是一种逆序数计算的快速实现方法,从而提高快速傅里叶变换的整体速度。     

二次曝光分数傅里叶变换全息图

提出了二次曝光分数傅里叶变换全息图,分析了它的性质,制作了二次曝光分数傅里叶变换全息图,讨论了其再现条件的特殊性和它的应用.     

一种基于Fourier变换的人脸识别算法

针对现有的多数人脸识别算法在单训练样本时识 别性能并不理想这一问题,提出一种基于Fourier-Mellin变换的频域不 变性以及时域不变性的特征提取算法。首先,采用图像亮度作为原始特征,将对图像亮度标 准化以改善光照变化,通过应用2D小波变换降维来管理频域不变量的复杂度;然后,为进一 步改进识别性能,根据分析的Fourier-Mellien变换(AFMT) 以及正交Fourier-Mellin矩(OFMM)法不变量的特征,将两种算法混合,进行特征提取; 最后,利用分值标准化度量频域不变量与时域不变量,并存储到一个特征向量中用于分类。 通过最近邻分类器(NNC)和相关性系 数法(CCM)进行分类和融合。通过在YALE与ORL人脸数据库上进行了大量实验的结果表明, 本文提出方法的性能要优于传统的人脸识别算法。