Efficient implementation of 3D filter for moving object extraction

In this paper the design and implementation of Multi-Dimensional (MD) filter, particularly 3-Dimensional (3D) filter, are presented. Digital (discrete domain) filters applied to image and video signal processing using the novel 3D multirate algorithms for efficient implementation of moving object extraction are engineered with an example. The multirate (decimation and/or interpolation) signal processing algorithms can achieve significant savings in computation and memory usage. The proposed algorithm uses the mapping relations of z-transfer functions between non-multirate and multirate mathematical expressions in terms of time-varying coefficient instead of traditional polyphase de- composition counterparts. The mapping properties can be readily used to efficiently analyze and synthesize MD multirate filters.     

Simplified square to hexagonal lattice conversion based on 1-D multirate processing

Hexagonal image sampling and processing are theoretically superior to the most commonly used square lattice based sampling and processing, but due to the lack of commercial image sensors, current research mainly relies on virtually hexagonally sampled data through square to hexagonal lattice conversion, which is a typical 2-D interpolation problem. This paper presents a simplified and efficient square to hexagonal lattice conversion method. The method firstly utilizes the separable nature of the interpolation kernel to simplify the original 2-D interpolation into 1-D interpolation along the horizontal direction only, and then it applies the 1-D multirate technique to further simplify the shift-variant 1-D interpolation into shift-invariant 1-D convolutions. Compared with the original 2-D interpolation version, the proposed method becomes both simple and computationally efficient, and it is also suitable for implementation with parallel processing and hardware. Finally, experiments are performed and the results are consistent with the analysis.     

A Fast FIR filtering technique for multirate filters

This paper presents a technique for applying Fast FIR Algorithms (FFAs) to interpolation and decimation filters. In the event that the prototype filter has a symmetric impulse response, it is shown that the subfilters which result from the application of the FFA will be jointly symmetric. This fact may be exploited in order to further reduce the computational complexity of the system. The effect of transposition upon the proposed structure is discussed, and it is shown that transposition yields a more economical structure in the case of a decimation filter. The computational complexity of the proposed schemes is shown to compare favorably with that of the standard parallel filtering approach.     

Optimal design of nonuniform multirate filter banks

The design of general nonuniform filter banks is studied. Contrary to uniform filter banks, in nonuniform filter banks, it may not be possible to achieve perfect reconstruction, but in some cases by using optimization techniques, we can design acceptable filter banks. Here, the initial finite impulse response (FIR) analysis filters are designed according to the characteristics of the input. By the design procedure, the FIR synthesis filters are found so that theH-norm of an error system is minimized over all synthesis filters that have a prespecified order. Then, the synthesis filters obtained in the previous step are fixed, and the analysis filters are found similarly. By iteration, theH-norm of the error system decreases until it converges to its final value. At each iteration, the coefficients of the analysis or synthesis filters are obtained by finding the least squares solution of a system of linear equations. If necessary, the frequency characteristics of the filters can be altered by adding penalty terms to the objective function.This research was supported by the Natural Sciences and Engineering Research Council of Canada.     

A novel real-time resource efficient implementation of Sobel operator-based edge detection on FPGA

A new resource efficient FPGA-based hardware architecture for real-time edge detection using Sobel operator for video surveillance applications has been proposed. The choice of Sobel operator is due to its property to counteract the noise sensitivity of the simple gradient operator. FPGA is chosen for this implementation due to its flexibility to provide the possibility to perform algorithmic changes in later stage of the system development and its capability to provide real-time performance, hard to achieve with general purpose processor or digital signal processor, while limiting the extensive design work, time and cost required for application specific integrated circuit. The proposed architecture uses single processing element for both horizontal and vertical gradient computation for Sobel operator and utilised approximately 38% less FPGA resources as compared to standard Sobel edge detection architecture while maintaining real-time frame rates for high definition videos (1920 × 1080 image sizes). The complete system is implemented on Xilinx ML510 (Virtex-5 FX130T) FPGA board.     

几种边缘检测算法的比较研究

边缘检测在图像处理中有着重要的作用。介绍了5种常用的图像边缘检测算子,并且通过一个图像边缘检测的例子比较了它们的检测效果,分析了它们各自的特点,对学习边缘检测和具体工程应用具有很好的参考价值。     

图像边缘检测算法的比较分析

随着社会的快速发展,图像边缘检测的方法也逐步的多样化,为了能够全面提升其图像边缘检测的效率,需要对整体的检测方法进行全面的创新.但在实际的检测过程中,其检测环境还相对复杂,导致边缘检测的难度相对较大.所以,对检测法进行优化十分关键.本文主要针对图像边缘检测法进行比较分析.并提出了相应的优化措施.     

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.     

DESIGN OF VIRTUAL UNIFORM LINEAR ARRAYS FOR EFFICIENT DIRECTION FINDING

The problem considered in this paper is to interpolate a virtual uniform array froma real two-dimensional array with arbitrary geometry via an interpolation matrix. The key to thisproblem is how to arrange these virtual sensors. It is shown that the virtual uniform linear arrayshould have the same main-lobe beam-pattern as the real array over an angular sector of interest.Simulation results are presented to illustrate the application of virtual array in direction finding.     

OSGO-CFAR在K分布杂波边缘中的性能分析

研究有序统计选大（OSGO）恒虚警检测器在K分布杂波边缘中的性能。文中推导出了该检测器在K分布杂波边缘中虚警概率的解析表达式，分析了它抗干扰边缘的性能，并与OS、CA、OSSO等检测器进行了比较，结果表明OSGO-CFAR具有最好的抗K分布杂波边缘的性能。     

基于FPGA的实时彩色图像边缘检测算法的实现

针对传统的基于灰度图像的边缘检测算法抗噪能力弱、对方向敏感、获取边缘细节信息较粗等不足,本文通过分析彩色图像的特点,提出一种改进的Sobel算子与快速中值滤波相结合的彩色图像边缘检测算法,通过扩展边缘检测算子的方向模板,提高Sobel算子对纹理复杂图像的适应能力及抵抗噪声的能力。该改进算法在Altera DE2-70FPGA硬件开发平台上,应用Verilog HDL语言与Quartus II中的可编程宏功能模块实现。实验结果表明,该算法的处理只占用了约2%的系统硬件资源,资源占用相对合理,且图像边缘定位准确,抗噪能力强,能够实时有效地提取出彩色图像的边缘。     

边缘检测算法在医学超声液性病变图像中的应用

医学超声液性病变图像多见数个无回声区,呈"蜂窝状",边界不清晰,为了清晰地提取医学超声液性病变图像的边缘,进一步为临床诊断提供可靠依据,在此将几种不同的边缘检测算法应用于医学超声液态病变图像中,经实验结果得出,经典的边缘检测算法不能很好地提取图像的边缘,而基于Snake模型的边缘检测算法,人为设定边缘控制点,智能动态调整曲线,获得了很好的边缘提取效果,具有很高的临床应用价值。     

FPGA在边缘检测中的应用

主要探讨FPGA在边缘检测中的运用,分析两种不同边缘检测算子对图像处理的效果。由于FPGA算法硬件处理速度快、可编程、可重配置等特性,使其在图像处理方面占有很大的优势。为此文章提出了运用FPGA实现边缘检测的方法,并且根据FPGA的并行流水线性,对Sobel、Prewitt边缘检测算子分别进行了FPGA设计与实现以及仿真,并且对两种边缘检测算子对图像处理的效果进行了比较。通过仿真分析得出,Sobel和Prewitt边缘检测算子都有平滑噪声的作用,Sobel边缘检测算子可以提供较为准确的边缘方向信息,Prewitt边缘检测算子,其边缘性较Sobel边缘检测算子完整,但它们的边缘定位精度有待提高,仿真中通过改变程序中的阈值可以得到不同的处理效果,这也是利用FPGA的优点,方便容易、速度也得到了提高,并且可编程、可重配置,使得FPGA在数字图像处理方面显得非常优越。     

基于非圆信号的二维测向算法

提出了一种基于窄带非圆信号的二维测向算法,利用非圆信号的椭圆协方差矩阵非零特性将阵列有效阵元数和孔径同时扩展,提高多信号检测的能力。进一步通过利用L阵的几何性质和两子阵间的互相关来滤除噪声,提高角度估计精度,并采用快速算法获得信号方位角和俯仰角。最后计算机仿真结果验证了该方法由于利用非圆信号特性比传统测向算法的估计性能更高。     

A new algorithm for 2-D DOA estimation

In this paper we present a new algorithm to estimate the 2-D direction of arrival (DOA) of narrowband sources lying in the far field of the array. The array consists of matched co-directional triplets, and can be considered as an extension of the 1-D ESPRIT scenario to 2-D. The proposed approach is simple and direct and does not require a search procedure or initialization. Existing algorithms require a search to match the correct elevation and azimuth angles and are computationally more expensive. This technique automatically pairs the azimuth and elevation angles by marking them. The computational complexity is twice that of 1-D ESPRIT. Simulation results and comparisons with other existing algorithms are presented to demonstrate the performance of the proposed technique.     

二维模糊划分最大熵图像分割算法

该文提出了一种通过最大化二维直方图模糊划分熵分割灰度图像的新算法。首先介绍了模糊划分的原理,提出用条件概率与条件熵定义模糊划分熵。随后利用多维三角模定义了非相关模糊子集的广义直积,给出构造多维模糊划分的方法,并根据最大熵原理设计了一种基于二维直方图模糊划分熵分割灰度图像的新算法。对几例真实目标图像的对比分割实验结果表明该文方法性能优越。     

A family of computationally efficient algorithms for multichannel signal processing—A tutorial review

This paper is concerned with the solution of block linear systems arising in multichannel digital signal processing. First the general problem of block matrix inversion and linear system solution is considered and a corresponding algorithm, recursive in nature, is developed, together with a block form of triangularization theorem. Subsequently these general schemes are specialized to block Toeplitz structures yielding most existing efficient algorithms. To this respect, matrices related to multichannel Wiener filtering, AR and ARMA modelling as well as s+1 steps ahead prediction are examined and related algorithms are described. Finally block banded Toeplitz systems are considered and two new efficient algorithms are presented, one recursive in nature and the other FFT based. They constitute natural extensions of methods already available for the single channel case and their derivation is simple due to the unified approach introduced in this paper.     

A practical method of coefficient computation for a microprocessor-controlled variable recursive digital filter

The synthesis of general-type recursive digital filters from analog prototypes may require complicated computations not suitable for filter structures where the coefficients are to be evaluated by a microprocessor control unit. A general synthesis procedure suitable for the application to such structures is described and some design examples are reported.     

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.