Single-channel speech enhancement in variable noise-level environment

Discusses the problem of single-channel speech enhancement in variable noise-level environment. Commonly used, single-channel subtractive-type speech enhancement algorithms always assume that the background noise level is fixed or slowly varying. In fact, the background noise level may vary quickly. This condition usually results in wrong speech/noise detection and wrong speech enhancement process. In order to solve this problem, we propose a subtractive-type speech enhancement scheme. This new enhancement scheme uses the RTF (refined time-frequency parameter)-based RSONFIN (recurrent self-organizing neural fuzzy inference network) algorithm we developed previously to detect the word boundaries in the condition of variable background noise level. In addition, a new parameter (MiFre) is proposed to estimate the varying background noise level. Based on this parameter, the noise level information used for subtractive-type speech enhancement can be estimated not only during speech pauses, but also during speech segments. This new subtractive-type enhancement scheme has been tested and found to perform well, not only in variable background noise level condition, but also in fixed background noise level condition.     

Texture boundary detection based on the long correlation model

The problem of detecting texture boundaries without assuming any knowledge on the number of regions or the types of textures is considered. Texture boundaries are often regarded as better features than intensity edges, because a large class of images can be considered a composite of several different texture regions. An algorithm is developed that detects texture boundaries at reasonably high resolution without assuming any prior knowledge on the texture composition of the image. The algorithm utilizes the long correlation texture model with a small number of parameters to characterize textures. The parameters of the model are estimated by a least-squares method in the frequency domain. The existence and the location of texture boundary is estimated by the maximum-likelihood method. The algorithm is applied to several different images, and its performance is shown by examples. Experimental results show that the algorithm successfully detects texture boundaries without knowing the number of types of textures in the image     

A recurrent neural fuzzy network for word boundary detection invariable noise-level environments

This paper discusses the problem of automatic word boundary detection in the presence of variable-level background noise. Commonly used robust word boundary detection algorithms always assume that the background noise level is fixed. In fact, the background noise level may vary during the procedure of recording. This is the major reason that most robust word boundary detection algorithms cannot work well in the condition of variable background noise level. In order to solve this problem, we first propose a refined time-frequency (RTF) parameter for extracting both the time and frequency features of noisy speech signals. The RTF parameter extends the (time-frequency) TF parameter proposed by Junqua et al. from single band to multiband spectrum analysis, where the frequency bands help to make the distinction between speech signal and noise clear. The RTF parameter can extract useful frequency information. Based on this RTF parameter, we further propose a new word boundary detection algorithm by using a recurrent self-organizing neural fuzzy inference network (RSONFIN). Since RSONPIN can process the temporal relations, the proposed RTF-based RSONFIN algorithm can find the variation of the background noise level and detect correct word boundaries in the condition of variable background noise level. As compared to normal neural networks, the RSONFIN can always find itself an economic network size with high-learning speed. Due to the self-learning ability of RSONFIN, this RTF-based RSONFIN algorithm avoids the need for empirically determining ambiguous decision rules in normal word boundary detection algorithms. Experimental results show that this new algorithm achieves higher recognition rate than the TF-based algorithm which has been shown to outperform several commonly used word boundary detection algorithms by about 12% in variable background noise level condition, It also reduces the recognition error rate due to endpoint detection to about 23%, compared to an average of 47% obtained by the TF-based algorithm in the same condition.     

基于云台摄像的实时车速检测算法

针对采用固定摄像的路况监视系统无法观看自如的缺点,提出了基于云台摄像的实时车速检测算法．建立了简化的摄像机参数模型,提取了线性拟合后的车道图像特征参数,并利用Kluge曲线模型和随机霍夫变换实现了像平面车道分割线的二维重建和云台摄像机的标定;应用自适应背景减除、扩展Kalman滤波器等方法,提取了帧运动域及域中目标轮廓,从而实现了车辆的精确定位、跟踪,以至实时速度检测．该算法已试用于工程实践,具有较好的鲁棒性．     

基于目标轮廓增强的GrabCut图像分割方法

针对传统GrabCut算法需要人工初始化而引起图像分割效率低的问题,结合目标轮廓增强技术,提出一种自动GrabCut算法。首先对图像进行谱残差计算,以获取目标轮廓增强的视觉显著图;其次,对显著图进行预分割并通过快速连通区域分析进行前景估计并获取掩膜,将获取的掩膜代替人工交互初始化GrabCut算法,最后实现自动分割。实验结果表明,该方法克服了手动的缺点,并在处理前后景颜色相似的图像时,分割结果要优于传统方法。     

Recovering Occlusion Boundaries from an Image

Occlusion reasoning is a fundamental problem in computer vision. In this paper, we propose an algorithm to recover the occlusion boundaries and depth ordering of free-standing structures in the scene. Rather than viewing the problem as one of pure image processing, our approach employs cues from an estimated surface layout and applies Gestalt grouping principles using a conditional random field (CRF) model. We propose a hierarchical segmentation process, based on agglomerative merging, that re-estimates boundary strength as the segmentation progresses. Our experiments on the Geometric Context dataset validate our choices for features, our iterative refinement of classifiers, and our CRF model. In experiments on the Berkeley Segmentation Dataset, PASCAL VOC 2008, and LabelMe, we also show that the trained algorithm generalizes to other datasets and can be used as an object boundary predictor with figure/ground labels.     

Robust artifact-free high dynamic range imaging of dynamic scenes

The irradiance range of the real-world scene is often beyond the capability of digital cameras. Therefore, High Dynamic Range (HDR) images can be generated by fusing images with different exposure of the same scene. However, moving objects pose the most severe problem in the HDR imaging, leading to the annoying ghost artifacts in the fused image. In this paper, we present a novel HDR technique to address the moving objects problem. Since the input low dynamic range (LDR) images captured by a camera act as static linear related backgrounds with moving objects during each individual exposures, we formulate the detection of foreground moving objects as a rank minimization problem. Meanwhile, in order to eliminate the image blurring caused by background slightly change of LDR images, we further rectify the background by employing the irradiances alignment. Experiments on image sequences show that the proposed algorithm performs significant gains in synthesized HDR image quality compare to state-of-the-art methods.

     

基于Chan-Vese模型的目标多层次分割算法

由于单一水平集只能通过其符号表达目标和背景两个区域,因此采用单水平集的Chan和Vese（C-V）模型无法分割出目标内部的子目标.为此,提出了基于C-V模型的目标多层次算法.首先给出了目标多层次分割策略;然后,提出了实现本策略的关键技术--背景填充技术,并从其视觉原理、技术实现和理论证明3个方面详细进行了论述;最后,将该技术与C-V模型相结合,提出了目标多层次分割算法;实验结果表明,本文算法能够实现目标多层次分割,并对目标内部含有弱目标的图像特别有效.     

Classification through incremental max–min separability

Piecewise linear functions can be used to approximate non-linear decision boundaries between pattern classes. Piecewise linear boundaries are known to provide efficient real-time classifiers. However, they require a long training time. Finding piecewise linear boundaries between sets is a difficult optimization problem. Most approaches use heuristics to avoid solving this problem, which may lead to suboptimal piecewise linear boundaries. In this paper, we propose an algorithm for globally training hyperplanes using an incremental approach. Such an approach allows one to find a near global minimizer of the classification error function and to compute as few hyperplanes as needed for separating sets. We apply this algorithm for solving supervised data classification problems and report the results of numerical experiments on real-world data sets. These results demonstrate that the new algorithm requires a reasonable training time and its test set accuracy is consistently good on most data sets compared with mainstream classifiers.     

基于误差补偿的复杂场景下背景建模方法

在基于子空间学习的背景建模方法中,利用背景信息对前景误差进行补偿有助于建立准确的背景模型.然而,当动态背景（摇曳的树枝、波动的水面等）和复杂前景等干扰因素存在时,补偿过程的准确性和稳定性会受到一定的影响.针对这些问题,本文提出了一种基于误差补偿的增量子空间背景建模方法.该方法可以实现复杂场景下的背景建模.首先,本文在误差补偿的过程中考虑了前景的空间连续性约束,在补偿前景信息的同时减少了动态背景的干扰,提高了背景建模的准确性.其次,本文将误差估计过程归结为一个凸优化问题,并根据不同的应用场合设计了相应的精确求解算法和快速求解方法.再次,本文设计了一种基于Alpha通道的误差补偿策略,提高了算法对复杂前景的抗干扰能力.最后,本文构建了不依赖于子空间模型的背景模板,减少了由前景信息反馈引起的背景更新失效,提高了算法的鲁棒性.多项对比实验表明,本文算法在干扰因素存在的情况下仍然可以实现对背景的准确建模,表现出较强的抗扰性和鲁棒性.     

Underwater image enhancement by maximum-likelihood based adaptive color correction and robust scattering removal

Underwater images often exhibit severe color deviations and degraded visibility, which limits many practical applications in ocean engineering. Although extensive research has been conducted into underwater image enhancement, little of which demonstrates the significant robustness and generalization for diverse real-world underwater scenes. In this paper, we propose an adaptive color correction algorithm based on the maximum likelihood estimation of Gaussian parameters, which effectively removes color casts of a variety of underwater images. A novel algorithm using weighted combination of gradient maps in HSV color space and absolute difference of intensity for accurate background light estimation is proposed, which circumvents the influence of white or bright regions that challenges existing physical model-based methods. To enhance contrast of resultant images, a piece-wise affine transform is applied to the transmission map estimated via background light differential. Finally, with the estimated background light and transmission map, the scene radiance is recovered by addressing an inverse problem of image formation model. Extensive experiments reveal that our results are characterized by natural appearance and genuine color, and our method achieves competitive performance with the state-of-the-art methods in terms of objective evaluation metrics, which further validates the better robustness and higher generalization ability of our enhancement model.     

A new graph cut-based multiple active contour algorithm without initial contours and seed points

This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of multiple active contours is framed as a partitioning problem by assuming that image data are generated from a finite mixture model with unknown number of components. Then, the partitioning problem is solved within a divisive graph cut framework where multi-way minimum cuts for multiple contours are efficiently computed in a top-down way through a swap move of binary labels. A split move is integrated into the swap move within that framework to estimate the model parameters associated with regions without the use of initial contours and seed points. The number of regions is also estimated as a part of the algorithm. Experimental results of boundary and region detection of natural images are presented and analyzed with precision and recall measures to demonstrate the effectiveness of the proposed algorithm.     

多颜色空间融合的人体检测算法研究

对运动人体颜色与背景颜色近似时,单个颜色空间不能很好地刻画人体与背景之间的差别这一问题,本文提出一种多颜色空间不同颜色分量融合的策略,即对多个颜色空间的各个分量进行单独的人体检测,统计人体检测性能最好的若干个通道,对这些通道的前景进行融合,得到最终的人体检测结果。另外,为了处理动态背景问题,设计一种基于帧间差分法和定时刷新的背景更新算法。实验结果表明,在复杂场景中,该算法的检测结果要好于基于单颜色空间的人体检测结果,并且该算法能够有效地处理动态背景问题。     

一种新的视频镜头分割算法

镜头是视频分析和索引的基础，但是自动的镜头分割，尤其是渐变切换的检测还是一个很有挑战性的课题。本文提出了一种利用直方图与模板匹配相结合来进行视频镜头切变检测的算法和一种利用图象灰度级平均(MGL)来进行渐变检测的算法，该渐变检测算法能有效区分摄象机镜头的运动和渐变。实际测试证明，利用本文算法进行视频镜头检测
能取得比较好的效果。     

Real-time Object Recognition in Sparse Range Images Using Error Surface Embedding

This article formulates a near-lighting shape-from-shading problem with a pinhole camera (perspective projection) and presents a solution to reconstruct the Lambertian surface of bones using a sequence of overlapped endoscopic images, with partial boundaries in each image. First we extend the shape-from-shading problem to deal with perspective projection and near point light sources that are not co-located with the camera center. Secondly we propose a multi-image framework which can align partial shapes obtained from different images in the world coordinates by tracking the endoscope. An iterative closest point (ICP) algorithm is used to improve the matching and recover complete occluding boundaries of the bone. Finally, a complete and consistent shape is obtained by simultaneously re-growing the surface normals and depths in all views. In order to fulfill our shape-from-shading algorithm, we also calibrate both geometry and photometry for an oblique-viewing endoscope that are not well addressed before in the previous literatures. We demonstrate the accuracy of our technique using simulations and experiments with artificial bones.     

Regularized CDWT optical flow applied to moving-target detection in IR imagery

A modified version of the CDWT optical flow algorithm developed by Magarey and Kingsbury is applied to the problem of moving-target detection in noisy infrared image sequences, in the case where the sensor is also moving. Frame differencing is used to detect pixel-size targets moving in strongly cluttered backgrounds. To compensate for sensor motion, prior to differencing, the background is registered spatially using the estimated motion field between the frames. Results of applying the method to three image sequences show that the target SNR is higher when the estimated motion field for the whole scene is explicitly regularized. A comparison with another optical flow algorithm is also presented.     

基于RWR的自然图像抠图

提出了一种基于图论的自然图像抠图方法。该算法首先在图像上建立图的模型,并用不同颜色标记目标种子点和背景种子点;接着采用有重启概率的随机游走方法计算像素点之间的相似性,进而提出一个线性概率模型;最后求解模型并分别估计前景和背景物体。与目前的抠图方法相比,该算法具有以下特点：将RWR方法结合图论用于自然图像抠图中;减小了RWR算法在图像分割中迭代求逆的高复杂度,大大提高了抠图速度;解决了“弱”边界的问题。     

基于随机游走的医学超声图像分割

医学超声图像不可避免地存在斑点噪声、弱边界等问题,很难达到满意的分割效果。随机游走算法对噪声具有鲁棒性,对弱边界有良好的提取能力。将此算法应用于医学超声图像分割,通过融合区域信息与用户指定的种子点信息,借助于电路模拟以及组合Dirichlet问题,可以得到每个非种子点到标记了目标点或者背景点的概率,并对其赋予概率中最大的种子点所对应的标记,从而实现图像的分割。实验结果表明,该方法对医学超声图像的分割是有效的。此算法通过求解稀疏的、对称的、正定的线性方程的系统来获得Dirichlet问题的解,使计算速度大为提高。     

Unsupervised speaker segmentation and tracking in real-time audio content analysis

This paper addresses the problem of real-time speaker segmentation and speaker tracking in audio content analysis in which no prior knowledge of the number of speakers and the identities of speakers is available. Speaker segmentation is to detect the speaker change boundaries in a speech stream. It is performed by a two-step algorithm, which includes potential change detection and refinement. Speaker tracking is then performed based on the results of speaker segmentation by identifying the speaker of each segment. In our approach, incremental speaker model updating and segmental clustering is proposed, which makes the unsupervised speaker segmentation and tracking feasible in real-time processing. A Bayesian fusion method is also proposed to fuse multiple audio features to obtain a more reliable result, and different noise levels are utilized to compensate for background mismatch. Experiments show that the proposed algorithm can recall 89% of speaker change boundaries with 15% false alarms, and 76% of speakers can be unsupervised identified with 20% false alarms. Compared with previous works, the algorithm also has low computation complexity and can perform in 15% of real time with a very limited delay in analysis. Published online: 12 January 2005 Part of the work presented in this paper was published in the 10th ACM International Conference on Multimedia, 1-6 December 2002     

一种改进的背景提取算法

背景提取,是利用背景差分法获取目标的重要步骤。针对传统背景提取算法需要处理大数据量的问题,本文算法在传统背景提取算法的基础上,利用一段时间内,相邻图像相同位置的灰度值基本处在同一平稳区间的原理和思路,通过对小数据量的多次操作来获取背景图像。实验结果证明,这种做法可以在使用较少内存使用量的基础上获得比较好的效果,并可快速有效地对背景进行更新。