基于傅里叶变换的干涉条纹对比度增强算法

论述了一种干涉条纹对比度增强的算法.将二维离散傅里叶变换后得到的干涉条纹图像频谱分布,应用带通滤波器滤波.滤波过程中,在保持通带内相位谱不变的条件下,增大了通带内幅频谱的值.然后对滤波后的频谱分布进行逆二维离散傅里叶变换,可得到对比度增强后的干涉条纹图像.实验表明,该方法在保持干涉条纹中心线空间位置不变的情况下,可以有效地增强干涉条纹的对比度.     

在纺织图像中傅里叶变换的研究

通过采用不同的图像处理技术手段对具有不同特性的织物数字图像进行处理,为织物密度的自动测量提供最佳质量的图像,利用二维离散傅里叶变换获得图像的频谱,然后对其进行图像增强和图像复原等操作,能有效地改善图像的质量,突出所需要的细节。介绍了二维离散快速傅里叶变换算法,以及在频率域中进行图像增强、图像复原等实验,并对实验结果总结分析。     

基于FTP的二维傅里叶变换的研究

傅里叶变换轮廓术(FTP)是三维物体形貌测量的重要方法,一维傅里叶变换可用于一般曲面相位解调,但对高频干扰和低频背景噪声敏感.连续应用一维傅里叶变换或反傅里叶变换可实现二维傅里叶变换,采用二维傅里叶变换,进行二维频谱分析,可用来分离和提取有用三维信息.具体实验验证表明,二维傅里叶变换能消除沿非栅线方向造成的灰度变化以及高频噪声,减小计算结果沿Y方向的波动,更好反映三维物体细节信息,提高相位解调的精度.     

利用小波变换实现基于结构光投影的S变换轮廓术

S变换是一种集合了窗口傅里叶变换和小波变换优点的时-频分析技术,将一维的信号映射到二维的时-频空间,具有良好的时频分辨能力。由于S变换谱和傅里叶变换频谱之间存在直接联系,且具有类似于小波变换的多分辨率能力,S变换可以通过快速傅里叶变换算法实现,也可以通过小波变换算法实现。研究了基于小波变换算法的S变换在基于结构光投影的三维光学测量中的应用,给出了理论分析,特别讨论了S变换中频率因子的选择,并同基于快速傅里叶变换算法的S变换轮廓术结果进行了比较。完成了计算机模拟和实验研究。     

一种还原图像的新方法

针对常用的用离散傅里叶逆变换把图像的频谱还原出图像的计算机图像处理时,离散傅里叶逆变换又要调用离散傅里叶变换的问题,提出了一种还原图像的新方法,称为“二次傅里叶变换”法。该方法用了两次离散傅里叶变换和频谱的原点向中心移动,该方法和常用的方法相比速度会更快些。并且通过计算机图像处理进行验证,验证结果表明该方法是完全可行的。     

类傅里叶变换的多分量信号分离重构

针对多分量信号重构的问题,该文提出了一种新颖的类傅里叶变换方法,并对其基本性质进行了分析。采用该方法将频域上混叠但在时频二维频谱图上不重叠的多分量信号变换到类傅里叶变换域,使之在频谱上不产生混叠,从而达到信号分离重构的目的。与分数傅里叶域最优滤波的方法进行的对比分析说明,类傅里叶变换方法的适用范围更宽。文中对非线性的多分量调幅信号进行了仿真计算,得到了满意的结果。表明该方法在信号检测和分析方面具有应用价值。     

红外系统MTF狭缝测量法的改进

介绍了应用狭缝结合二维傅里叶变换测量光学系统尤其是红外光学系统的基本原理.由于光电探测器的对图像采集的离散性造成傅里叶变换频谱的混频,以及高频旁瓣过多现象,为了提高MTF测量的精确性,采用MATLAB模拟仿真的方法对狭缝测量法进行两部分改进,分别为倾斜狭缝和平滑照明.倾斜狭缝部分给出了倾斜角度与频谱值的关系曲线,平滑照明部分给出线性和高斯两种平滑方案.两部分改进方案均给出模拟结果,改进的效果显著.     

二维stolt插值解耦合的GEO SAR成像算法

针对地球同步轨道合成孔径雷达(GEO SAR)二维频谱形式复杂、二维空变性处理困难等问题,考虑成像参数随距离和方位的空变性,给出了一种利用二维stolt插值解耦合的GEO SAR成像算法,该算法不需要求解GEO SAR复杂的二维频谱,在距离频域和方位时域利用空变斜距的二阶近似模型和二维stolt插值变换校正了距离和方位的耦合;同时,针对二维插值计算量大和复杂度高的问题,采用非均匀快速傅里叶变换(NUFFT)替代了传统的插值和快速逆傅里叶变换(IFFT)运算。理论分析和仿真结果表明该算法能够补偿回波的二维空变特性,实现GEO SAR聚焦成像,且各成像指标接近理论值。      

二维虚光栅移相莫尔条纹相位提取算法

目前二维干涉图所采用的相位提取算法大多以傅里叶变换法为主,而傅里叶变换法对噪声比较敏感。虚光栅移相莫尔条纹法具有较高的提取精度,而且抗噪性较好。在一维干涉图的基础上,提出了一种适用于二维干涉图相位提取的二维虚光栅移相莫尔条纹法,该方法通过构造一定相移量的二维虚光栅实现相位提取。与傅里叶变换法对比研究的仿真结果表明:对于同一幅二维干涉图,在干涉图不含噪声的情况下,傅里叶变换法与该方法的相对重构误差分别是5.52%和3.46%;在干涉图含噪声的情况下,随着噪声的增加,该方法在抗噪性方面的优势越来越明显。对二维横向剪切干涉仪零位校准装置所采集到的二维干涉图进行处理,实验结果表明,傅里叶变换法和该方法所得到的测量结果均方根值分别为0.0053λ和0.0037λ(λ=632.8 nm)。     

莫尔条纹倾角快速求解算法及应用

为了满足基于泰伯-莫尔条纹长焦距测量技术在测量激光材料热效应等效热焦距时对测量速度的需求，提出了一种莫尔条纹倾角快速求解算法。在对传统频域迭代法测量速度影响因素分析基础上，基于迭代运算坐标值相似性和离散傅里叶变换可分离性，将频谱值求解过程中包含小数值的坐标点进行公共项分离, 公共部分采用傅里叶变换指数项进行滤波，不同部分在提取相似项的基础上进行组合运算，将2维条纹图像傅里叶变换降为1维进行处理；同时相关指数项被限定在极小的可知范围，极大地方便了查表运算和位运算的采用。结果表明，采用相同配置计算机，在保证测量精度的前提下，将完成一次测量的测量时间从15s降低到0.4s，测量速度提高了38倍。该算法很好地满足了激光材料热效应等效热焦距参量快速测量的应用需求。     

An On-Sensor Bit-Serial Column-Parallel Processing Architecture for High-Speed Discrete Fourier Transform

This brief presents a discrete Fourier transform (DFT) processor based on a bit-serial column-parallel processing architecture suitable for integrating it on CMOS image sensors. Using a column-parallel A/D converter (ADC) array, column-line sensor outputs of the two-dimensional image array are digitized. The ADC outputs are sliced to one bit and are given to the bit-serial column-parallel DFT processor from the MSB to the LSB. A high-speed and cost-effective implementation can be expected. In the case of 256$,times,$256-point DFT for 8-b image data, the processing time is estimated to be 2 ms at a clock frequency of 100 MHz, which corresponds to the 500-frames/s real-time processing.     

Real-time restoration of images degraded by uniform motion blur infoveal active vision systems

Foveated, log-polar, or space-variant image architectures provide a high resolution and wide field workspace, while providing a small pixel computation load. These characteristics are ideal for mobile robotic and active vision applications, but have been little used due to the general lack of image processing tools that are applicable to the log-polar coordinate system. Recently, we have described a generalization of the Fourier transform (the fast exponential chirp transform), which allows frame-rate computation of full-field two-dimensional (2-D) frequency transforms directly in log-polar coordinates. In the present work, we show that is possible to achieve full-frame image de-blur at frame rate on a standard "PC" platform, using these methods, we illustrate this idea with a Wiener filter based restoration technique. The main contribution of this note is the implementation of (space-variant) image de-blur directly in log-polar coordinates, using the exponential chirp transform. The results show reasonable quality of de-blur, and suggest that these methods are relevant to applications in mobile image processing platforms in which real-time motion deblur is important, and for which it is not desirable to use extensive or custom fabricated hardware.     

基于FPGA的数字相位展开技术研究

针对相位展开软件算法运算复杂的缺点,通过分析相位展开原理,提出基于FPGA的相位展开技术的硬件实现。采用加/减模块、乘法器以及除法器构成截断相位处理模块,将软件算法查找链表的思路转换成RAM存储器读写操作,利用状态机完成对存储器和截断相位处理模块的控制。采用ALTERA 系列EP4CE115F29C7芯片,针对256*256和512*512的图像实现设计,最高工作频率分别达到80.22MHZ,80.45MHZ;资源消耗分别为792和1436个LE。采用SignalTap II Logic Analyzer工具实时验证了相位展开设计模块的正确性。     

织物图像增强技术的研究

对具有不同特性的织物数字图像利用二维离散傅立叶变换进行图像增强和图像复原等操作,能有效地改善图像的 质量,突出所需要的细节,为织物密度的自动测量提供最佳质量的图像.研究了二维离散快速傅立叶变换算法,以及利用该 算法在频率域中进行图像增强和图像复原的新方法.实验结果分析表明,利用提出的方法可以较好地改善织物图像的质量.     

Memory-efficient architecture for JPEG 2000 coprocessor with large tile image

The experimental results show that using a larger tile size to perform JPEG 2000 coding results in better image quality (i.e., greater than or equal to 256 /spl times/ 256 tile image). However, processing large tile images also requires relatively high memory for the hardware implementation. For example, it would require tile memory of 256 K words to support the process of a 512 /spl times/ 512 tile image in the straightforward architecture. To reduce hardware resources, we have proposed the quad code-block (QCB) -based discrete wavelet transform method to reduce the size of tile memory by a factor of 4. In this paper, the remaining 1/4 tile memory can be further reduced through two approaches: the zero-holding extension with slight image degradation and the QCB-block size extension without any image degradation. That is, it only requires 12 K words tile memory to support the process of 512 /spl times/ 512 tile image by using zero-holding extension, and 13.58 K words memory through QCB-block size extension. The low memory requirement makes the on-chip memory practicable.     

An Efficient VLSI Architecture for Computation of Discrete Fractional Fourier Transform

Since decades, the fractional Fourier transform (FrFT) has attracted researchers from various domains such as signal and image processing applications. These applications have been essentially demanding the requirement of low computational complexity of FrFT. In this paper, FrFT is simplified to reduce the complexity, and further an efficient CORDIC-based architecture for computing discrete fractional Fourier transform (DFrFT) is proposed which brings down the computational complexity and hardware requirements and provides the flexibility to change the user defined fractional angles to compute DFrFT on-the-fly. Architectural design and working method of proposed architecture along with its constituent blocks are discussed. The hardware complexity and throughput of the proposed architecture are illustrated as well. Finally, the architecture of DFrFT of the order sixteen is implemented using Verilog HDL and synthesized targeting an FPGA device ”XLV5LX110T”. The hardware simulation is performed for functional verification, which is compared with the MATLAB simulation results. Further, the physical implementation result of the proposed design shows that the design can be operated at a maximum frequency of 154 MHz with the latency of 63-clock cycles.     

Fast splitting alpha-rooting method of image enhancement: tensor representation.

In the tensor representation, a two-dimensional (2-D) image is represented uniquely by a set of one-dimensional (1-D) signals, so-called splitting-signals, that carry the spectral information of the image at frequency-points of specific sets that cover the whole domain of frequencies. The image enhancement is thus reduced to processing splitting-signals and such process requires a modification of only a few spectral components of the image, for each signal. For instance, the alpha-rooting method of image enhancement can be fulfilled through processing separately a maximum of 3N/2 splitting-signals of an image (N x N), where N is a power of two. In this paper, we propose a fast implementation of the a-rooting method by using one splitting-signal of the tensor representation with respect to the discrete Fourier transform (DFT). The implementation is described in the frequency and spatial domains. As a result, the proposed algorithms for image enhancement use two 1-D N-point DFTs instead of two 2-D N x N-point DFTs in the traditional method of alpha-rooting.     

On using the CAM concept for parametric curve extraction

A parallel algorithm, in order to extract parametric curves from a two-dimensional (2-D) image space, is proposed. It is based on the Hough transform (HT) and uses the content addressable memory (CAM) as the main processor. A set of simulated results for circular shape extraction are presented in order to demonstrate its merit. Hence, voting, thresholding, and three-dimensional (3-D) peak extraction are efficiently performed within the CAM. In addition, and in order to reduce the quantization errors, a weighted AT algorithm (WHT), which uses a weighted voting is proposed. Experimental results indicate that a real-time shape extraction for an image 256/spl times/256 can be achieved within a small amount of hardware. Therefore, CAM-based HT can be considered as a promising attraction for next generation pattern recognition platforms.