Stochastic segmentation of severely degraded images using gibbs random fields

This paper deals with segmentation of noisy images using Gibbs random field (GRF) with an emphasis on modeling of the region process. For noisy image segmentation using the multi-level logistic (MLL) model with the second-order neighborhood system, which is commonly used in image processing, the segmentation performance is degraded significantly in case of low signal to noise ratio. By comparison with the Ising model that explains the magnetic properties of ferromagnetic material, it is evident that the characteristics of the region process modeled using the MLL model with the second-order neighborhood system are different in nature from the expected characteristics of a region. To solve this problem we added the term of the magnetic energy associated with the magnetic field of a spin system (or image) to the energy function of GRF. Using the modified model for the region process, the result of image segmentation was improved and did not depend on the cooling schedule in simulated annealing.     

基于高斯混合尺度模型的压缩传感图像重构

在图像处理领域中,压缩传感重构是稀疏表示下的最重要的病态反问题之一。压缩传感图像重构利用图像可稀疏表示的先验知识,从比奈奎斯特采样率低得多的随机投影观测值中重构原始图像。为了克服传统的压缩传感算法中收敛速度慢和未利用变换系数的邻域统计特性的缺点,提出了基于高斯混合尺度模型的压缩传感图像重构算法,证明了独立的高斯混合尺度分布作为压缩传感重构的稀疏先验知识的可行性,结合全变差调整进一步提高算法的性能。实验结果表明,该算法有效地提高了重构图像的主观视觉效果和峰值信噪比,加快了压缩传感图像重构算法的收敛速度。     

Generalized ICM for image segmentation based on Tsallis statistics

In this paper, the iterated conditional modes optimization method of a Markov random field technique for image segmentation is generalized based on Tsallis statistics. It is observed that, for some q$q$ entropic index values the new algorithm performs better segmentation than the classical one. The proposed algorithm also does not have a local minimum problem and reaches a global minimum energy point although the number of iterations remains the same as ICM. Based on the findings of the new algorithm, it can be expressed that the new technique can be used for the image segmentation processes in which the objects are Gaussian or nearly Gaussian distributed.     

采用骨导语音自适应的语句分割方法*

为了解决含噪语句分割问题,也为了解决某些低信噪比环境下传统气导语句分割算法分割效果差、分割准确度低且算法自适应性弱等问题,提出一种基于骨导语音自适应的分段双门限语音分割方法。将骨导语音和气导语音同步采集,获取抗噪性能更好的骨导语音,然后在融合过零率与短时能量中引入随机动态阈值的自适应方法进行端点检测,最后利用分段双门限和语音聚类等手段实现语音分割,提高语音分割算法的鲁棒性。通过实验验证了所提算法的有效性和可行性,同时与其他语音分割算法进行了对比,证明该文所提分割算法精度更高,效果更好。     

基于广义变分正则化的闪光照相图像重建算法

 针对闪光照相图像信噪比低的特点,提出了一种基于广义变分正则化的图像重建算法,该方法采用p-范数取代目前广泛采用的全变分范数作为正则项,构造了用于图像重建的展平泛函,将图像重建问题转化为目标泛函最优化问题,采用固定点迭代法求解图像重建的最优解。数值计算结果表明,该算法在重建过程中能够有效抑制图像噪声,并加大对图像边缘的保持能力,从而提高了图像重建质量,是一种有效且性能优良的闪光照相图像重建算法。     

基于水平集的闪光照相图像分割算法

针对Chan-Vese(CV)模型局部控制能力差的缺点,将基于区域的CV模型和分割曲线的局部信息结合起来,提出了一种新的水平集图像分割算法。该算法以CV法的分割曲线为初始曲线,以获得全局收敛性,在后继分割中引入分割曲线的局部信息,以提高模型对图像中微弱信号的分割能力。对闪光照相图像的数值实验表明,该算法噪声抵抗能力强,对初始轮廓位置不敏感,能实现对含细长拓扑结构和微小孔洞的弱边界闪光图像的自动分割。     

An unmanned aerial vehicle identification and tracking system based on weakly supervised semantic segmentation technology

This paper presents an unmanned aerial vehicle (UAV) identification and tracking system aimed at monitoring UAVs based on weakly supervised semantic segmentation. A camera is equipped with a pan–tilt to collect images for semantic segmentation network in real time. The GrabCut+ algorithm and annotation boxes are employed to generate the UAV “pseudo pixel labels” for supervised model learning and reduce labelling costs. A new loss function combining the focus loss function and dice loss function is designed to balance positive and negative samples and improve the segmentation effect. The Mixup method is introduced for model training to prevent overfitting and enhance the generalization ability of the model. The semantic segmentation network outputs the prediction results by a fully connected conditional random field to smooth the target image. Furthermore, a region-based tracking method is proposed to solve the hysteresis problem of the pan–tilt control system and improve the system tracking performance. Finally, an experiment based on a dataset is carried out to prove the effectiveness of the segmentation algorithm with 66.3% mIoU. Considering that 10% of the central area of view is specified as the view centre, a UAV falling in the centre of the field accounts for more than 80% of this view area, demonstrating the real-time effectiveness of the designed UAV identification and tracking system.     

Automatic knee cartilage segmentation from multi-contrast MR images using support vector machine classification with spatial dependencies

Accurate segmentation of knee cartilage is required to obtain quantitative cartilage measurements, which is crucial for the assessment of knee pathology caused by musculoskeletal diseases or sudden injuries. This paper presents an automatic knee cartilage segmentation technique which exploits a rich set of image features from multi-contrast magnetic resonance (MR) images and the spatial dependencies between neighbouring voxels. The image features and the spatial dependencies are modelled into a support vector machine (SVM)-based association potential and a discriminative random field (DRF)-based interaction potential. Subsequently, both potentials are incorporated into an inference graphical model such that the knee cartilage segmentation is cast into an optimal labelling problem which can be efficiently solved by loopy belief propagation. The effectiveness of the proposed technique is validated on a database of multi-contrast MR images. The experimental results show that using diverse forms of image and anatomical structure information as the features are helpful in improving the segmentation, and the joint SVM-DRF model is superior to the classification models based solely on DRF or SVM in terms of accuracy when the same features are used. The developed segmentation technique achieves good performance compared with gold standard segmentations and obtained higher average DSC values than the state-of-the-art automatic cartilage segmentation studies.     

Weighted Schatten p-Norm Low Rank Error Constraint for Image Denoising

Traditional image denoising algorithms obtain prior information from noisy images that are directly based on low rank matrix restoration, which pays little attention to the nonlocal self-similarity errors between clear images and noisy images. This paper proposes a new image denoising algorithm based on low rank matrix restoration in order to solve this problem. The proposed algorithm introduces the non-local self-similarity error between the clear image and noisy image into the weighted Schatten p-norm minimization model using the non-local self-similarity of the image. In addition, the low rank error is constrained by using Schatten p-norm to obtain a better low rank matrix in order to improve the performance of the image denoising algorithm. The results demonstrate that, on the classic data set, when comparing with block matching 3D filtering (BM3D), weighted nuclear norm minimization (WNNM), weighted Schatten p-norm minimization (WSNM), and FFDNet, the proposed algorithm achieves a higher peak signal-to-noise ratio, better denoising effect, and visual effects with improved robustness and generalization.     

An energy minimization method for MS lesion segmentation from T1-w and FLAIR images

In this paper, we extend the multiplicative intrinsic component optimization (MICO) algorithm to multichannel MR image segmentation, with focus on segmentation of multiple sclerosis (MS) lesions. The MICO algorithm was originally proposed by Li et al. in Ref. [1] for normal brain tissue segmentation and intensity inhomogeneity correction of a single channel MR image, which exhibits desirable advantages over other methods for MR image segmentation and intensity inhomogeneity correction in terms of segmentation accuracy and robustness. In this paper, we extend the MICO algorithm to multi-channel MR image segmentation and enable the segmentation of MS lesions. We assign different weights for different channels to control the impact of each channel. The weighted channels allow the enhancement of the impact of the FLAIR image on the segmentation of MS lesions by assigning a larger weight to the FLAIR image channel than the other channels. With the inherent mechanism of estimation of the bias field, our method is able to deal with the intensity inhomogeneity in the input multi-channel MR images. In the application of our method, we only use T1-w and FLAIR images as the input two channel MR images. Experimental results show promising result of our method.     

Image segmentation using adaptive loopy belief propagation

Loopy belief propagation (LBP) algorithm over pairwise-connected Markov random fields (MRFs) has become widely used for low-level vision problems. However, Pairwise MRF is often insufficient to capture the statistics of natural images well, and LBP is still extremely slow for application on an MRF with large discrete label space. To solve these problems, the present study proposes a new segmentation algorithm based on adaptive LBP. The proposed algorithm utilizes local region information to construct a local region model, as well as a local interaction region MRF model for image segmentation. The adaptive LBP algorithm maximizes the global probability of the proposed MRF model, which employs two very important strategies, namely, “message self-convergence” and “adaptive label pruning”. Message self-convergence can improve the reliability of a pixel in choosing a label in local region, and label pruning can dismiss impossible labels for every pixel. Thus, the most reliable information messages transfer through the LBP algorithm. The experimental results show that the proposed algorithm not only obtains more accurate segmentation results but also greater speed.     

Image-guided regularization level set evolution for MR image segmentation and bias field correction

Magnetic resonance (MR) image segmentation is a crucial step in surgical and treatment planning. In this paper, we propose a level-set-based segmentation method for MR images with intensity inhomogeneous problem. To tackle the initialization sensitivity problem, we propose a new image-guided regularization to restrict the level set function. The maximum a posteriori inference is adopted to unify segmentation and bias field correction within a single framework. Under this framework, both the contour prior and the bias field prior are fully used. As a result, the image intensity inhomogeneity can be well solved. Extensive experiments are provided to evaluate the proposed method, showing significant improvements in both segmentation and bias field correction accuracies as compared with other state-of-the-art approaches.     

基于马尔可夫随机场的闪光图像分割

目标界面位置信息是闪光照相中关注的内容之一,而闪光图像的低信噪比影响了微结构界面位置的准确提取。研究了基于马尔可夫随机场的闪光图像分割算法,在闪光图像分割过程中采用马尔可夫模型描述被分割像素之间的相关性,减少了由噪声所引起的孤立虚假目标,提出利用中空邻域模板内的起伏定义标号场模型中的基团势函数,改进了闪光图像的分割方法,提高了微结构分割精度。数值实验表明,改进后的马尔可夫随机场分割方法能取得更好的分割结果。     

基于全变分正则化的高能闪光照相消模糊图像重建算法

 针对高能闪光照相投影图像消模糊难度大的问题,提出了一种基于全变分正则化的消模糊图像重建算法,该算法根据闪光照相的成像特点,将客体的纵向截面作为一个整体来进行建模,并在重建方程中考虑了模糊因素,然后采用全变分范数作为正则项,构建了用于消模糊图像重建的展平泛函,将消模糊图像重建问题转化为能量泛函极小化问题,通过固定点迭代算法求解图像重建问题的最小化解。数值模拟结果表明：该算法由于考虑了闪光照相成像时的图像模糊因素,在重建时能够较好地消除模糊对重建结果的影响,在抑制噪声的同时能较好地保持图像的边缘信息,有利于提高重建图像的质量。     

红外图像掠海小目标的检测算法研究

针对红外图像掠海小目标信噪比低，且易受到水天线和背景杂波干扰的特点，提出了一种红外掠海小目标的提取与检测算法。该方法的特点是：首先采用中值滤波来减小噪声，并提出了差方和算法，用以抑制背景噪声并对目标增强；再采用了图像行扫描法有效地滤除水天线；最后通过弱化背景边缘和阈值分割等综合算法得到候选小目标。仿真结果表明，该算法达到了较好的效果。     

基于多尺度区域粒度分析的遥感图像分割

针对高分辨率遥感图像中不同地物具有粒度差异的特点,提出了一种多尺度区域粒度分析的图像分割方法。该方法首先使用均值漂移得到图像各尺度上的初始过分割区域,然后通过考虑区域大小和区域间上下文关系进行粒度分析,最后利用马尔科夫随机场模型对图像的粒度信息和光谱信息进行建模,得到分割结果。用平朔地区SPOT5和泰州航拍等遥感图像进行了实验,并与若干考虑光谱特征的分割方法进行了对比,结果表明提出的方法能有效地提高分割精度。     

Stable Atlas-based Mapped Prior (STAMP) machine-learning segmentation for multicenter large-scale MRI data

Machine learning (ML)-based segmentation methods are a common technique in the medical image processing field. In spite of numerous research groups that have investigated ML-based segmentation frameworks, there remains unanswered aspects of performance variability for the choice of two key components: ML algorithm and intensity normalization. This investigation reveals that the choice of those elements plays a major part in determining segmentation accuracy and generalizability. The approach we have used in this study aims to evaluate relative benefits of the two elements within a subcortical MRI segmentation framework. Experiments were conducted to contrast eight machine-learning algorithm configurations and 11 normalization strategies for our brain MR segmentation framework. For the intensity normalization, a Stable Atlas-based Mapped Prior (STAMP) was utilized to take better account of contrast along boundaries of structures. Comparing eight machine learning algorithms on down-sampled segmentation MR data, it was obvious that a significant improvement was obtained using ensemble-based ML algorithms (i.e., random forest) or ANN algorithms. Further investigation between these two algorithms also revealed that the random forest results provided exceptionally good agreement with manual delineations by experts. Additional experiments showed that the effect of STAMP-based intensity normalization also improved the robustness of segmentation for multicenter data sets. The constructed framework obtained good multicenter reliability and was successfully applied on a large multicenter MR data set (n > 3000). Less than 10% of automated segmentations were recommended for minimal expert intervention. These results demonstrate the feasibility of using the ML-based segmentation tools for processing large amount of multicenter MR images. We demonstrated dramatically different result profiles in segmentation accuracy according to the choice of ML algorithm and intensity normalization chosen.     

结合小波融合和深度学习的脑胶质瘤自动分割

针对水肿区域边界模糊和瘤内结构复杂多变导致的脑胶质瘤分割不精确问题，本文提出了一种基于小波融合和3D-UNet网络的脑胶质瘤磁共振图像自动分割算法.首先，对脑胶质瘤磁共振图像的T1、T1ce、T2、Flair四种模态进行小波融合以及偏置场校正；然后，提取待分类的图像块；再利用提取的图像块训练3D-UNet网络以对图像块中的像素进行分类；最后加载损失率较小的网络模型进行分割，并采用基于连通区域的轮廓提取方法，以降低假阳性率.对57组Brats2018（Brain Tumor Segmentation 2018）磁共振图像测试集进行分割的结果显示，肿瘤的整体、核心和水肿部分的平均分割准确率（DSC）分别达到90.64%、80.74%和86.37%，这表明该算法分割脑胶质瘤准确率较高，与金标准相近.相比多模态图像融合前，该算法在减少输入网络数据量和图像冗余信息的同时，还一定程度上解决了胶质瘤边界模糊、分割不精确的问题，提高了分割的准确度和鲁棒性.     

对数似然图像分割的快速主动轮廓跟踪算法

针对跟踪目标尺度变化问题,提出了基于灰度对数似然图像分割的快速主动轮廓跟踪算法。改进的主动轮廓跟踪算法将根据以目标与背景的颜色差异而建立的对数似然图对图像进行阈值分割和数学形态学处理,再将Kalman滤波器结合到主动轮廓跟踪算法进行目标跟踪。改进的主动轮廓跟踪算法对目标分割准确,轮廓特征显著,跟踪效果稳定,算法能很好地适应跟踪目标尺度变化。通过Kalman滤波器对目标位置点的预测减少了主动轮廓跟踪算法收敛的迭代次数,使算法的运算效率提高了33%左右。     

Convergence of the Graph Allen–Cahn Scheme

Journal of Statistical Physics - The graph Laplacian and the graph cut problem are closely related to Markov random fields, and have many applications in clustering and image segmentation. The...