基于全散度的C-V模型阈值法

为了提高传统C-V模型的收敛速度并降低其对噪声的敏感性,提出基于全散度的C-V模型及其快速阈值分割算法。将Bregman散度与全散度统一获得新的全散度,并将其引入C-V模型的拟合偏差项,提高图像灰度值与分割区域平均灰度偏差值计算的鲁棒性。同时,采用变分水平集理论获得基于直方图的快速阈值计算方法。实验结果表明,该方法分割效果及收敛速度得到提高,且具有较好的鲁棒性和抗噪性。     

Data-driven hair segmentation with isomorphic manifold inference

Hair segmentation is challenging due to the diverse appearance, irregular region boundary and the influence of complex background. To deal with this problem, we propose a novel data-driven method, named Isomorphic Manifold Inference (IMI). The IMI method assumes the coarse probability map and the binary segmentation map as a couple of isomorphic manifolds and tries to learn hair specific priors from manually labeled training images. For an input image, firstly, the method calculates a coarse probability map. Then it exploits regression techniques to obtain the relationship between the coarse probability map of the test image and those of training images. Finally, this relationship, i.e., a coefficient set, is transferred to the binary segmentation maps and a soft segmentation of the test image will be achieved by a linear combination of those binary maps. Further, we employ this soft segmentation as a shape cue and integrate it with color and texture cues into a unified segmentation framework. A better segmentation is achieved by the Graph Cuts optimization. Extensive experiments are conducted to validate effectiveness of the IMI method, compare contributions of different cues and investigate the generalization of IMI method. The results strongly encourage our method.     

Automatic moment segmentation and peak detection analysis of heart sound pattern via short-time modified Hilbert transform

This paper proposes a novel automatic method for the moment segmentation and peak detection analysis of heart sound (HS) pattern, with special attention to the characteristics of the envelopes of HS and considering the properties of the Hilbert transform (HT). The moment segmentation and peak location are accomplished in two steps. First, by applying the Viola integral waveform method in the time domain, the envelope (E_T) of the HS signal is obtained with an emphasis on the first heart sound (S1) and the second heart sound (S2). Then, based on the characteristics of the E_T and the properties of the HT of the convex and concave functions, a novel method, the short-time modified Hilbert transform (STMHT), is proposed to automatically locate the moment segmentation and peak points for the HS by the zero crossing points of the STMHT. A fast algorithm for calculating the STMHT of E_T can be expressed by multiplying the E_T by an equivalent window (W_E). According to the range of heart beats and based on the numerical experiments and the important parameters of the STMHT, a moving window width of N = 1 s is validated for locating the moment segmentation and peak points for HS. The proposed moment segmentation and peak location procedure method is validated by sounds from Michigan HS database and sounds from clinical heart diseases, such as a ventricular septal defect (VSD), an aortic septal defect (ASD), Tetralogy of Fallot (TOF), rheumatic heart disease (RHD), and so on. As a result, for the sounds where S2 can be separated from S1, the average accuracies achieved for the peak of S1 (AP₁), the peak of S2 (AP₂), the moment segmentation points from S1 to S2 (AT₁₂) and the cardiac cycle (ACC) are 98.53%, 98.31% and 98.36% and 97.37%, respectively. For the sounds where S1 cannot be separated from S2, the average accuracies achieved for the peak of S1 and S2 (AP₁₂) and the cardiac cycle ACC are 100% and 96.69%.     

Teeth segmentation of dental periapical radiographs based on local singularity analysis

Teeth segmentation for periapical raidographs is one of the most critical tasks for effective periapical lesion or periodontitis detection, as both types of anomalies usually occur around tooth boundaries and dental radiographs are often subject to noise, low contrast, and uneven illumination. In this paper, we propose an effective scheme to segment each tooth in periapical radiographs. The method consists of four stages: image enhancement using adaptive power law transformation, local singularity analysis using Hölder exponent, tooth recognition using Otsu's thresholding and connected component analysis, and tooth delineation using snake boundary tracking and morphological operations. Experimental results of 28 periapical radiographs containing 106 teeth in total and 75 useful for dental examination demonstrate that 105 teeth are successfully isolated and segmented, and the overall mean segmentation accuracy of all 75 useful teeth in terms of (TP, FP) is (0.8959, 0.0093) with standard deviation (0.0737, 0.0096), respectively.     

基于Potts模型的隐式曲面上的图像分割方法

针对隐式曲面上多相图像分割的问题,基于曲面的隐式表达、隐式曲面上的内蕴梯度等概念,将用于平面图像分割的Potts模型推广.首先对于隐式封闭曲面和隐式开放曲面,分别给出Potts模型的推广形式.然后对于传统梯度降方法计算效率低的问题,为曲面上的Potts模型设计了Split Bregman算法和对偶方法,并在对偶方法的基础上提出了一种改进的快速算法.多个数值实验结果表明,所提出的曲面上的Potts模型能有效地分割闭/开曲面上的分段常值图像,并且新的改进对偶方法在计算效率方面优于其他两种方法.     

基于各向异性滤波和空间FCM的MRI图像分割方法

针对具复杂目标和边界模糊的MRI图像中多感兴趣区域的分割中分割MRI图像软组织难的问题, 提出了一种基于各向异性滤波和空间模糊C-均值聚类(SFCM)的MRI图像分割方法; 用新型各向异性滤波对图像进行预处理, 解决去噪平滑的同时弱化图像细节的问题; 用邻域空间信息设计空间函数, 改进传统FCM的目标函数; 用图像的空间信息实现图像各目标准确分类、有效解决孤立区域的正确归类问题, 进而使分割区域完整; 用直方图拟合曲线初始化分类数和初始聚类中心, 加快算法迭代到最优解, 进而减少运行时间。通过实验证实了各向异性滤波和空间FCM的MRI图像分割方法的综合应用显著提高了分割灰度重叠、目标不连续和目标边界模糊的MRI图像的分割效果。     

基于条件随机场的低图像质量车牌字符分割

提出一种基于条件随机场的车牌字符分割算法,能够对光照不均、相机拍摄角度造成的低图像质量的车牌图像,特别是日益增多的车牌边框与字符相连接车牌图像进行有效的字符分割。算法首先进行车牌图像校正,然后利用标注车牌数据进行模型学习,对车牌图像像素列进行分类识别,最后组合成车牌字符分割结果。理论分析与实验结果验证了算法的有效性。     

增强现实中基于自然特征的实时跟踪方法

在增强现实系统的复杂场景中,对目标的实时跟踪受到场景中诸多因素的制约,导致实时跟踪方法效率低且不准确,为此提出一种基于自然特征的实时跟踪方法。设计了一种螺旋分割模型,对捕获的图像进行螺旋分割,利用SURF算法在分割子块中提取特征点,并进行匹配。在对目标进行跟踪定位时,利用前一帧来预测当前帧目标出现的位置,以减少SURF算法的扫描区域,加速系统运算效率。实验中分别对场景光线强弱、视点和仿射变化以及目标被部分遮挡等不同情况进行测试,该方法均表现出较高的跟踪效率。     

印刷哈萨克斯拉夫粘连字符的切分方法

哈萨克斯拉夫图像文本经过行切分和列切分后,存在水平方向接触和垂直方向重叠的粘连字符。为提高字符识别率,依据字符连通域的最小外接矩形切分开垂直方向重叠的粘连字符图像块;利用判决条件:字符宽度概率密度分布图、字符图像块垂直投影的波峰数目和字符图像块垂直投影波峰的对称性,分离初始粘连字符图像块中正确的单个字符图像块和实际接触的粘连字符图像块;在允许的字符宽度范围内,寻找粘连字符图像垂直投影图的极小值点,以切分实际接触的粘连字符。实验结果表明,该方法泛化能力较好且识别率有明显提高。     

融合多颜色空间分量的自适应彩色图像分割

提出了一种新的简单有效的融合多颜色分量的分割方法,首先在六个不同的颜色空间中选择最佳的待分割颜色分量,然后应用直方图和空间模糊C均值（SFCM）技术对不同颜色分量进行自适应初始分割,最后融合分割结果并进行区域合并。利用该算法在Berkeley图像库上进行了大量实验,实验结果表明,与当前一些经典分割算法Mean-shift、FCR、CTM等相比,利用该方法能够获得更好的分割结果以及更优的性能指标。