Contour-Constrained Image Smoothing Preserving Its Structure

Structure-preserving image smoothing is used in solving many problems of video information processing and analysis. Most smoothing methods are based on indirect information about the characteristics of a local image area, for example, the distribution of signal values, rather than on direct data of the image spatial structure. In reality, a criterion for constraining the smoothing area should not be the distribution of signal values or the difference in brightness of the objective and surrounding points, but their belonging to the same spatial area of an image. A criterion sufficient for the connectivity of points in an area is the absence of contour lines between them. An approach to image smoothing is proposed, which is based on preliminary detection of contour edges between image areas and subsequent contour-constrained smoothing inside each area. A concept of “affinity” of image points is introduced, on the basis of which the smoothing algorithm is built. The proposed algorithm is experimentally compared with other available smoothing algorithms.

     

一种虚拟波束形成自适应加权空间平滑算法

该文提出了一种用于自适应阵列的自适应加权空间平滑算法。通过构造虚拟自适应波束形成问题求取用于子阵协方差矩阵加权的加权向量,然后进行加权空间平滑自适应波束形成。理论分析与仿真结果表明,新算法能更有效地降低期望信号和干扰之间的相关性,使得用于空间平滑的子阵数减少,以降低阵列孔径损失。     

Polyline线的抽稀与圆滑

在GIS基础数据的采集过程中，地理信息数据总量非常大，是海量数据，这就要求我们在数据处理的初级阶段采取合理有效的手段控制数据质量。针对这种情况，需要对数据进行圆滑或抽稀处理，这里介绍了对自动生成的等高线进行圆滑和抽稀处理的一种算法。     

Space-time interpolation of oceanic fronts

Oceanic temperature fronts observed through composite infrared images from the AVHRR satellite data are fragmented due mostly to cloud occlusion. The sampling frequency of such frontal position observations tends to be insufficiently high to resolve dynamics of the meandering features associated with the frontal contour, so that contour reconstruction using a standard space-time smoothing often leads to introduction of spurious features. Augmenting space-time smoothing with a simple point-feature detection/matching scheme, however, can dramatically improve the reconstruction product. This paper presents such a motion-compensated interpolation algorithm, for reconstruction of open contours evolving in time given fragmented position data. The reconstruction task is formulated as an optimization problem, and a time-sequential solution which adaptively estimates feature motion is provided. The resulting algorithm reliably interpolates position measurements of the surface temperature fronts associated with the highly convoluted portions of strong ocean currents such as the Gulf Stream and Kuroshio     

一种基于Wedgelet的图像轮廓编码算法

基于wedgelet理论提出了一种图像轮廓编码算法.该算法给出了一种率失真意义下的图像自适应多尺度wedgelet分析方法,用以抽取并表示图像中的边缘轮廓,然后基于四叉树结构编码图像最优多尺度wedgelet表示的参数,从而编码抽取出的图像轮廓.实验结果表明,本算法能以较大压缩比编码图像的边缘轮廓,并且压缩比可调.     

自适应组合型盲源分离算法及其优化方案

该文通过引入滑动参数来自适应地组合两个不同步长的盲源分离系统,提出了一种自适应组合型盲源分离算法,其可在两个系统并向运行的同时,自适应地选取最优的分离系统进行在线分离。文中推导了滑动参数的自适应更新规则,并针对算法存有的问题,提出了具体优化方案。平稳和非平稳环境下的仿真实验表明了算法的优良性能。     

Fast and accurate edge-based segmentation with no contour smoothingin 2-D real images

We propose an edge-based segmentation algorithm built on a new type of active contour which is fast, has a low computational complexity and does not introduce unwanted smoothing on the retrieved contours. The contours are always returned as closed chains of points, resulting in a very useful base for subsequent shape representation techniques.     

复杂背景下的人脸分割

针对复杂背景下人脸位置的不确定性和人脸轮廓边缘点的不连续性,本文提出一种新的人脸分割算法,能够在复杂背景下将人脸快速分割出来。本文算法包括三部分:首先设计了特征与模板相结合的人脸定位算法,在复杂背景中以双眼和嘴的坐标为基准确定人脸位置;其次,设计了自适应搜索算法,提取真正的人脸轮廓点,去除“假”轮廓点;最后利用人脸轮廓的平滑性通过曲线拟合来补充不确定轮廓点,完成人脸分割。本文算法综合利用了人脸的肤色、表面结构、轮廓边缘以及轮廓的平滑性等特征完成人脸分割,实验结果证明了算法的有效性。     

角膜细胞轮廓抽取

角膜细胞图旬轮廓提取的关键是分隔出细胞区域与背影,生成二值图像。由于角膜细胞图像光照不均匀,采用传统的单一域值法无法兼顾亮区与暗区,不能正确地提取出角膜细胞区域。为此本文提出了一种基于动态域值选择和细化算法的角膜细胞轮廓抽取算法。首先对被处理图像进行灰度平均和中值滤波平滑处理,消除细胞内部的不均匀性并保持细胞之间的边界;然后应用动态域值选择算法分割出细胞和背景;最后采用细化算法得到角膜细胞的粗轮廓     

含旋转部件的动态目标特征提取方法研究

针对含有活动部件的空中动态目标成像方法进行研究，分析活动部件对空中动态目标成像的干扰，通过自适应小波变换分离活动部件及目标，剔除活动部件对成像结果的影响；提取清晰的散射中心，然后基于逆合成孔径雷达（inverse synthetic aperture radar，ISAR）图像灰度级不连续点寻找区域边界，将目标点和背景分离，采用自适应边界收敛方法对目标区域进行轮廓特征提取，得到了良好的目标轮廓特征.所提算法不仅可剔除旋转部件对散射中心的干扰，同时可提取良好的目标ISAR特征.采用实测数据对方法进行了验证.     

Bayesian estimation of ventricular contours in angiographic images

A method for left ventricular contour determination in digital angiographic images is presented. The problem is formulated in a Bayesian framework, adopting as the estimation criterion the maximum a posterior probability (MAP). The true contour is modeled as a one-dimensional noncausal Gauss-Markov random field and the observed image is described as the superposition of an ideal image (deterministic function of the real contour) with white Gaussian noise. The proposed algorithm estimates simultaneously the contour and the model parameters by implementing an adaptive version of the iterated conditional modes algorithm. The convergence of this scheme is proved and its performance evaluated on both synthetic and real angiographic images. The method exhibits robustness against image artifacts and the contours obtained are considered good by expert clinicians. Being completely data-driven and fast, the proposed algorithm is suitable for routine clinical use.     

Spectral-spatial adaptive and well-balanced flow-based anisotropic diffusion for multispectral image denoising

Anisotropic diffusion can provide better compromise between noise reduction and edge preservation. In multispectral images, there exist different spatial local structures in the same band. Therefore, the levels of smoothing of anisotropic diffusion process should conform to both of image spectral and spatial features. In this paper, we present an effective denoising algorithm by integrating the spectral-spatial adaptive mechanism into a well-balanced flow (WBF) based anisotropic diffusion model, in which an adjustable weighted function is introduced to perform the appropriate levels of smoothing and enhancing according to different feature scales. Moreover, we make the fidelity term in the model to be adaptive by replacing the original noisy signal with the last evolution of the smoothed image. Consequently, the proposed algorithm can better control the diffusion behavior than traditional multispectral diffusion-based algorithms. The experimental results verify that our algorithm can improve visual quality of the image and obtain better quality indices.     

基于视觉神经元双拮抗机制的汽车外轮廓提取

为降低噪音影响、改善汽车车身反光造成虚假轮廓的现象,提出了一种视觉神经元双拮抗机制和自适应双阈值相结合的轮廓提取算法.双拮抗机制算法依据视觉神经元双拮抗原理处理图像得到亮度特征的轮廓,用扩展的大津法(Otsu)根据轮廓亮度分布自动选取高低阈值,对初步提取的轮廓进行双阈值处理,得到最终的汽车轮廓.利用客观性能指标对实验结果进行评价,结果表明提出的算法提升了汽车轮廓的完整性.与经典的轮廓提取算法相比,其计算复杂度低,对图像背景的适应性较强.     

遥感图像斑点噪声的局部统计滤波算法比较

分析了Kuan滤波和σ滤波两种基于局部统计滤波的斑点噪声平滑算法的原理,以实际的激光遥感图像为例进行了滤波实验,并对滤波性能进行了比较,结果表明Kuan滤波是有一定自适应能力的局部统计滤波方法,而σ滤波是简单而高效率的平滑算法.     

相干环境下LCMV自适应阵列抗干扰问题研究

相干干扰环境下,自适应阵列性能会急剧下降,常用的处理方法是空间平滑。然而,采用常规均匀空间平滑的自适应阵列对相干干扰的抑制能力较差,而且会损失阵列孔径。该文提出一种改进的相干干扰抑制方案:首先,提出了一种自适应的加权空间平滑(Weighted Spatial Smoothing, WSS)算法,它将各子阵的相关矩阵进行加权平均,可以最大程度地解相干;然后,在WSS基础上,利用线性约束最小方差(LCMV)准则得到子阵波束形成器最佳权矢量;最后,提出了一种利用子阵间的相位关系对全阵做波束形成的方法。该方案大大提高了阵列对抗相干干扰的能力,同时避免了一般空间平滑后阵列的孔径损失。理论分析和仿真结果说明了方法的有效性和稳健性。     

一种基于Non-Local Means的地基差分干涉雷达相位滤波改进方法

地基差分干涉雷达相位图中,往往含有大量相位噪声,严重影响相位解缠和形变测量结果.有鉴于此,本文提出一种改进的自适应非局部均值(Non-Local Means)组合滤波算法.该算法首先利用相干系数构造出可自适应的平滑参数模型,有效改善了Non-Local Means算法在滤波参数选择上的固定性.其次,利用维纳滤波可对空变...     

基于边缘特征的自动运动对象分割

为了准确分割出视频场景中的运动对象,该文提出了一种基于边缘特征的运动对象分割及跟踪算法。首先对相邻帧进行自适应变化检测,得到相邻帧二值差分图像。结合当前帧Canny算子检测的边缘图像,获得运动对象的初始边缘模板。其次对运动对象的运动分为快变和慢变两部分进行跟踪并更新运动对象的边缘模板。最后对运动对象的边缘模板进行数学形态学处理得到运动对象的外轮廓,使用梯度向量流场作为外力的改进活动轮廓算法收缩获得运动对象准确的闭合轮廓曲线。该算法对运动对象的整体运动和局部形变都有很强的鲁棒性, 能够得到运动对象准确的轮廓,并且对复杂背景有很好的适应性。     

The performance of the least mean squares algorithm combined withspatial smoothing

Many practical signal environments involve correlation between desired and undesired signals, causing narrowband adaptive array beamformers to exhibit signal cancellation. Spatial smoothing is a technique that can perform beamforming in such environments. This method can be incorporated into an adaptive algorithm, such as least mean squares (LMS), possibly altering the well-known performance characteristics of the algorithm. We discuss methods for combining spatial smoothing with the LMS algorithm in an array with a generalized side-lobe canceler (GSC) structure. The first of these methods is an electronic version of mechanically dithering the array. We show that this well-known method obeys a set of nonhomogeneous dynamical equations, resulting in a limit cycle that increases the misadjustment of the algorithm. The previously reported parallel spatial processing algorithm is also shown to have this increased misadjustment. We then introduce two methods that do not suffer from this misadjustment increase. We compare the methods' computational complexity and performance, in terms of stability and steady-state behavior, including weight misadjustment, GSC output power, and signal-to-noise ratio (SNR). In conclusion, we find that the limit cycle of the first method can be avoided without any increase in complexity by using one of the new methods     

基于模糊阈值和水平集的红外图像分割方法

针对阈值法分割红外图像易产生误分割和水平集分割方法受初始曲线限制大,提出了一种结合模糊阈值与水平集的自适应红外图像分割方法。该方法首先采用二维Otsu方法计算阈值,利用该阈值获取模糊阈值分割法中的窗口宽度,使模糊阈值分割法具有自适应性;然后采用此自适应模糊阈值分割法预分割红外图像,利用预分割结果自动获取水平集初始曲线;最后将Chan-Vese方法与Shi方法结合提出改进的水平集方法,并用此方法分割红外图像。实验结果表明,本文方法具有较好的分割效果和较强的鲁棒性。     

Adaptive blind channel estimation by least squares smoothing

A least squares smoothing (LSS) approach is presented for the blind estimation of single-input multiple-output (SIMO) finite impulse response systems. By exploiting the isomorphic relation between the input and output subspaces, this geometrical approach identifies the channel from a specially formed least squares smoothing error of the channel output. LSS has the finite sample convergence property, i.e., in the absence of noise, the channel is estimated perfectly with only a finite number of data samples. Referred to as the adaptive least squares smoothing (A-LSS) algorithm, the adaptive implementation has a high convergence rate and low computation cost with no matrix operations. A-LSS is order recursive and is implemented in part using a lattice filter. It has the advantage that when the channel order varies, channel estimates can be obtained without structural change of the implementation. For uncorrelated input sequence, the proposed algorithm performs direct deconvolution as a by-product