一种新的自适应小波阈值SAR图像滤波算法

为有效降低乘性斑点噪声对合成孔径雷达（SAR）图像的影响,提出了一种新的基于小波系数广义高斯分布（GGD）模型的自适应阈值估计去噪算法。首先分析了经对数变换的SAR图像小波系数的统计分布特性,然后提出了子带自适应阈值估计方法,通过对数变换,将该算法应用于含斑点噪声的SAR图像去噪。仿真图像和真实SAR图像的实验结果表明,该算法同目前流行的其他阈值算法相比,运算复杂度低,算法高效,并且在保留原始图像重要细节特征和图像后向散射特性的同时,显著地减少相干斑噪声。     

高密度椒盐噪声图像开关自适应滤波算法

针对现有算法普遍对高密度椒盐噪声滤波不足的问题,提出一种自适应高密度椒盐噪声滤波算法。该算法首先在分析窗口中确定信号点与可能的信号点分布情况并据此进行噪声检测,然后计算出图像的噪声密度。对于低密度椒盐噪声图像采用邻域信号点均值滤波方法,对于高密度噪声图像（噪声密度大于30%）,则根据窗口中信号点的分布情况采用加权迭代滤波方法。实验结果表明,本文算法比其他算法具备更好的去噪能力,尤其在较高密度（90%）噪声情况下与其他算法相比获得的峰值信噪比（PSNR）仍高出10 dB左右。     

分区均值的自适应噪声图像边缘检测算法

针对边缘检测算法存在的检测精度与抑噪的矛盾,提出一种基于新的图像边缘检测算法。算法将检测窗口按照0o,45o,90o和135o四个不同方向分别划分为两个子区域,先统计每个检测窗口(3×3)内脉冲噪声点的个数,如果超过3个,则扩大检测窗口至5×5。对于检测窗口每个方向划分的两个子区域,分别计算区域内的非噪声点的平均灰度值,利用平均值差的绝对值作为窗口的方向梯度值,进而求得中心点的梯度。然后,对梯度图像采用改进的非极大值抑制方法进行细化,并提取边缘。实验结果表明,该算法检测的图像边缘方向性较强,边缘较细,不仅对不同程度脉冲噪声干扰图像具有较强的抑噪能力,而且对高斯噪声也具有一定程度的抑制效果,算法具有较强的适应性。     

基于类间方差的图像Canny边缘提取改进

到目前为止,在边缘检测方面,Canny算子因为它优良的边缘检测特性,应用在很多方面。然而它也有局限性,传统Canny算子高低阈值是通过人工凭借经验来选取,且低阈值固定是高阈值的一半,这就使得它在一些特殊领域无法应用,且实际中图像易受光照、杂散光以及其他各种噪声的干扰。因此针对传统Canny算子阈值确定的困难性,针对性地提出了利用双重Otsu方法确定高低阈值的方法,此方法利用两次Otsu方法分别确定高阈值和低阈值。     

基于二级检测的椒盐噪声滤除算法

针对目前算法不能适用于含不同密度椒盐噪声的图像去噪,提出了一种基于噪声点极值特性和方向差异性的开关型噪声滤波器。检测阶段,采用极值法检测噪声,并计算噪声密度,当噪声密度低于阈值时进行基于噪声点方向差异性的二次检测,否则直接进行滤波;滤波阶段,根据局部噪声密度选择递归或非递归窗口,进行除去窗内噪声点的加权均值滤波。实验结果表明本文算法滤波性能和细节保护都优于传统中值滤波和一些改进算法。     

A new edge detection algorithm for image corrupted by White-Gaussian noise

Because corruption of image by White-Gaussian noise is a frequently encountered problem in acquisition, transmission and processing of image, and classical edge detection operators such as Roberts, Sobel, Prewitt and LOG operator have the deficiency of being sensitive to White-Gaussian noise, this paper proposes a new edge detection algorithm for Image corrupted by White-Gaussian noise that can reasonably consider White-Gaussian noise reduction and correct location of edge, and provides its specific arithmetic process. Finally, the comparison based on principle of new edge detection algorithm and classical edge detection operator is done, the experimental results indicate that the performance of new edge detection algorithm is better than that of classical edge detection operator.     

基于均值梯度的脉冲噪声图像边缘检测算法

为了有效地检测出受脉冲噪声污染图像的边缘,提出了一种基于均值梯度的图像边缘检测算法。算法将检测窗口根据水平和垂直方向分成上、下、左、右4个不同区域,先计算每个区域内非噪声点的平均灰度值,然后利用这些值的差分计算图像梯度,得出梯度图像,最后对梯度图像采用了改进的非极大值抑制方法对梯度图像进行细化并提取边缘。实验结果表明,该算法能够较好地检测出受较高密度脉冲噪声干扰的图像边缘,而且边缘较细,效果明显优于传统Sobel算法,具有较强的实用性。     

基于数学形态学和LMS滤波的图像边缘检测算法研究

传统的边缘检测算子对灰度图像进行边缘检测时存在图像细节被丢失,边界不连续等问题。针对上述问题,提出一种基于数学形态学和最小均方差滤波相结合的图像边缘检测方法,该算法先利用小均方差滤波的方法可以有效地滤除图像中的噪声,然后利用形态学中的腐蚀运算对图像进行边缘检测处理。实验结果表明：该方法能够有效地去噪,精确地检测图像中的细节,并且边界的连续性好。     

抗噪形态学边缘检测新算子

提出了一种基于抗噪形态学算子的新算法。该算法大大增强抗噪形态学算子的抗噪能力,并且实现对同时混有椒盐噪声和高斯噪声的图像进行噪声滤除。实验过程中使用仅含噪声的图像进行算子的仿真,使结果更清晰、直观。实验结果表明,该算子有良好的抗噪能力,对噪声的大小和浓度要求都比较小,鲁棒性较强。     

A backprojection filtering algorithm for a spatially varying focal length collimator

Fan-beam collimators are used in single photon emission computed tomography to improve the sensitivity for imaging of small organs. The disadvantage of fan-beam collimation is the truncation of projection data surrounding the organ of interest or, in those cases of imaging large patients, of the organ itself producing reconstruction artifacts. A spatially varying focal length fan-beam collimator has been proposed to eliminate the truncation problem and to maintain good sensitivity for the organ of interest. The collimator is constricted so that the focal lengths of the holes vary across the face of the collimator with the shortest focal lengths at the center and the longer focal lengths at the periphery of the collimator. The variation of the focal length can have various functional forms but in the authors' work it is assumed to increase monotonically toward the edge of the collimator. A backprojection filtering reconstruction algorithm is derived for this type of collimation. The algorithm first backprojects the projections, then performs a two-dimensional filtering. The algorithm is efficient and has been tested via computer simulations.     

A recursive least M-estimate algorithm for robust adaptive filtering in impulsive noise: fast algorithm and convergence performance analysis

This paper studies the problem of robust adaptive filtering in impulsive noise environment using a recursive least M-estimate algorithm (RLM). The RLM algorithm minimizes a robust M-estimator-based cost function instead of the conventional mean square error function (MSE). Previous work has showed that the RLM algorithm offers improved robustness to impulses over conventional recursive least squares (RLS) algorithm. In this paper, the mean and mean square convergence behaviors of the RLM algorithm under the contaminated Gaussian impulsive noise model is analyzed. A lattice structure-based fast RLM algorithm, called the Huber Prior Error Feedback-Least Squares Lattice (H-PEF-LSL) algorithm is derived. Part of the H-PEF-LSL algorithm was presented in ICASSP 2001. It has an order O(N) arithmetic complexity, where N is the length of the adaptive filter, and can be viewed as a fast implementation of the RLM algorithm based on the modified Huber M-estimate function and the conventional PEF-LSL adaptive filtering algorithm. Simulation results show that the transversal RLM and the H-PEF-LSL algorithms have better performance than the conventional RLS and other RLS-like robust adaptive algorithms tested when the desired and input signals are corrupted by impulsive noise. Furthermore, the theoretical and simulation results on the convergence behaviors agree very well with each other.     

Sampling adaptive block compressed sensing reconstruction algorithm for images based on edge detection

In this paper, a sampling adaptive for block compressed sensing with smooth projected Landweber based on edge detection （SA-BCS-SPL-ED） image reconstruction algorithm is presented. This algorithm takes full advantage of the characteristics of the block compressed sensing, which assigns a sampling rate depending on its texture complexity of each block. The block complexity is measured by the variance of its texture gradient, big variance with high sampling rates and small variance with low sampling rates. Meanwhile, in order to avoid over-sampling and sub-sampling, we set up the maximum sampling rate and the minimum sampling rate for each block. Through iterative algorithm, the actual sampling rate of the whole image approximately equals to the set up value. In aspects of the directional transforms, discrete cosine transform （DCT）, dual-tree discrete wavelet transform （DDWT）, discrete wavelet transform （DWT） and Contourlet （CT） are used in experiments. Experimental results show that compared to block compressed sensing with smooth projected Landweber （BCS-SPL）, the proposed algorithm is much better with simple texture images and even complicated texture images at the same sampling rate. Besides, SA-BCS-SPL-ED-DDWT is quite good for the most of images while the SA-BCS-SPL-ED-CT is likely better only for more-complicated texture images.     

Activation detection in fMRI using a maximum energy ratio statistic obtained by adaptive spatial filtering

An adaptive spatial filtering method is proposed that takes into account contextual information in fMRI activation detection. This filter replaces the time series of each voxel with a weighted average of time series of a small neighborhood around it. The filter coefficients at each voxel are derived so as to maximize a test statistic designed to indicate the presence of activation. This statistic is the ratio of the energy of the filtered time series in a signal subspace to the energy of the residuals. It is shown that the filter coefficients and the maximum energy ratio can be found through a generalized eigenproblem. This approach equates the filter coefficients to the elements of an eigenvector corresponding to the largest eigenvalue of a specific matrix, while the largest eigenvalue itself becomes the maximum energy ratio that can be used as a statistic for detecting activation. The distribution of this statistic under the null hypothesis is derived by a nonparametric permutation technique in the wavelet domain. Also, in this paper we introduce a new set of basis vectors that define the signal subspace. The space spanned by these basis vectors covers a wide range of possible hemodynamic response functions (HRF) and is applicable to both event related and block design fMRI signal analysis. This approach circumvents the need for a priori assumptions about the exact shape of the HRF. Resting-state experimental fMRI data were used to assess the specificity of the method, showing that the actual false-alarm rate of the proposed method is equal or less than its expected value. Analysis of simulated data and motor task fMRI datasets from six volunteers using the method proposed here showed an improved sensitivity as compared to a conventional test with a similar statistic applied to spatially smoothed data.     

An adaptive spatial diversity receiver for non-Gaussianinterference and noise

Standard linear diversity combining techniques are not effective in combating fading in the presence of non-Gaussian noise. An adaptive spatial diversity receiver is developed for wireless communication channels with slow, flat fading and additive non-Gaussian noise. The noise is modeled as a mixture of Gaussian distributions and the expectation-maximization (EM) algorithm is used to derive estimates for the model parameters. The transmitted signals are detected using a likelihood ratio test based on the parameter estimates. The new adaptive receiver converges rapidly, its bit error rate performance is very close to optimum when relatively short training sequences are used, and it appears to be relatively insensitive to mismatch between the noise model and the actual noise distribution. Simulation results are included that illustrate various aspects of the adaptive receiver performance     

Nonlinear order statistic filters for image filtering and edge detection

A novel class of nonlinear filters for image processing is proposed. This class is a combination of nonlinear mean and order statistic filters. Median, homomorphic, α-trimmed mean, nonlinear mean, order statistic, and linear filters can be considered as special cases of this class. The properties of these filters in the presence of different kinds of noise are investigated. It is shown that these filters can be used for the reduction of additive white noise, signal-dependent noise, and impulse noise. It is also shown that they preserve edges better than linear filters. Such filters can successfully be used as edge detectors, by appropriate adjustment of some of their parameters. Edge information can be used as an input to these filters to perform in an adaptive manner, changing their behaviour near the edges of an image. It is finally shown that many of the filters proposed have a reasonable (and in certain cases small) computational complexity.     

HRLS: a more efficient RLS algorithm for adaptive FIR filtering

The fast convergence rate and its immunity to the eigenvalue spread of the input correlation matrix make the RLS algorithm particularly attractive. However, the computational complexity is high. We propose using a hierarchical approach to reduce the computational complexity and further increase the convergence rate. The results of simulation runs and theoretical justifications confirm our claims     

基于两级检测的全距离维自适应空域滤波方法

目标信号混入训练数据时,自适应空域滤波的权值在距离维实时更新会造成信号自相消的现象。针对这一问题,提出一种基于两级检测处理的全距离维更新计算权值的方法。第一级处理进行样本选择,将强目标信号检测出来,并剔除出训练数据;第二级处理进行自适应波束形成和目标检测。仿真结果说明提出的方法能够在整个距离维更新自适应权值,适合于警戒雷达对抗旁瓣干扰。     

An efficient algorithm and systolic architecture for multiplechannel adaptive filtering

A multiple-input-multiple-output orthogonalization algorithm and its efficient systolic implementation are presented. The processing architecture is developed using a basic two-input-two-output decorrelation processing element as the primitive building block. Its features are discussed and compared to the approach of K. Gerlach and F.A. Studer (see ibid., vol.AP-34, no.3, p.458-462, 1986) which is based on the modified Gram-Schmidt (MGS) orthogonalization procedure. For simplicity of illustration in the development, batch processing is emphasized. The main features of the newly developed multiple-channel orthogonalization architecture are: (1) it requires no broadcasting of data and any given processing node in the structure only communicates with its neighboring nodes in pipelining fashion; (2) in terms of the total number of arithmetic operations, it is at least as efficient as the MGS approach; (3) the new architecture is developed in a systematic and bottom-up fashion; (4) it is an extremely regular and compact processing structure; (5) no unscrambling of the output channels is needed; and (6) the architecture presented places no restriction on the number of input channels     

一种窗口自适应的去椒盐噪声滤波算法

为了有效地去除图像中的椒盐噪声,提出一种窗口自适应的滤波算法。算法先采用3×3窗口进行噪声检测,如果中心点为噪声点,则统计窗口内为非噪声点的数量。当非噪声点的数量大于2时,采用中值均值滤波算法;当非噪声点的数量小于等于2时,将窗口尺寸扩大至5×5,采用中值均值滤波算法。如果中心点为信号点,则保持原值不变直接输出。仿真实验结果证明,这种算法对不同程度椒盐噪声污染的图像具有较强的去噪能力,同时较好地保持了图像的细节。     

A well-balanced flow equation for noise removal and edge detection

An anisotropic nonlinear diffusion equation for image restoration is presented. The model has two terms: the diffusion term and the forcing term. The balance between these terms is made in a selective way, in which boundary points and interior points of the objects that make up the image are treated differently. The optimal smoothing time concept, which allows for finding the ideal stop time for the evolution of the partial differential equation is also proposed. Numerical results show the proposed model's high performance.