基于静脉灰度值特征的图像分割算法研究

手背静脉图像的采集过程中,由于图像采集设备、光照、皮下脂肪厚度等因素的影响,手背静脉图像的对比度比较低,同时图像噪声严重影响静脉提取。针对此问题,本文提出了一种基于静脉灰度值特征的图像分割与对比度增强算法。首先提取ROI(有效的感兴趣区域)和对ROI进行维纳滤波;然后采用新的图像分割算法对静脉图像进行静脉提取,利用8-邻接内边界跟踪方法和形态学处理方法对静脉二值图像进行去噪;最后将ROI与去噪后的图像进行加权叠加得到对比度增强的静脉图像。实验结果表明,通过采用基于静脉灰度值特征的图像分割算法可以很好地获取到静脉脉络,最终可以获得高对比度的静脉图像。     

Binocular self-calibration performed via adaptive genetic algorithm based on laser line imaging

Abstract

An accurate technique to perform binocular self-calibration by means of an adaptive genetic algorithm based on a laser line is presented. In this calibration, the genetic algorithm computes the vision parameters through simulated binary crossover (SBX). To carry it out, the genetic algorithm constructs an objective function from the binocular geometry of the laser line projection. Then, the SBX minimizes the objective function via chromosomes recombination. In this algorithm, the adaptive procedure determines the search space via line position to obtain the minimum convergence. Thus, the chromosomes of vision parameters provide the minimization. The approach of the proposed adaptive genetic algorithm is to calibrate and recalibrate the binocular setup without references and physical measurements. This procedure leads to improve the traditional genetic algorithms, which calibrate the vision parameters by means of references and an unknown search space. It is because the proposed adaptive algorithm avoids errors produced by the missing of references. Additionally, the three-dimensional vision is carried out based on the laser line position and vision parameters. The contribution of the proposed algorithm is corroborated by an evaluation of accuracy of binocular calibration, which is performed via traditional genetic algorithms.     

字形轮廓的精确表示及其在文字向量化中的应用

从二进制图像中提取轮廓是许多图像处理应用中的重要内容,例如:扫描文档图像的向量化、对象分割、模式识别、手写文档和AutoCAD绘图中的内容解释、手绘卡通动画等。本文提出的轮廓跟踪算法能够生成具有以下特性的精确轮廓描述:首先,它能够有效地处理单像素宽度以及自相交的字形轮廓;其次,在轮廓跟踪的过程中,该算法可以将内、外轮廓与相应的对象区域相关联(例如字母‘B’由一个外轮廓与两个内轮廓组成),这将有利于对象的后续处理过程;第三,与传统的8-邻域或4-邻域连通轮廓跟踪算法相比,本文的方法能够精确地捕捉到字符的形状和尺度信息,这对于提高对象的保真度是十分重要的;最后,本文的算法简明,易于实现。     

Electrical Tree Image Segmentation Using Hybrid Multi Scale Line TrackingAlgorithm

Electrical trees are an aging mechanism most associated with partial discharge (PD) activities in crosslinked polyethylene (XLPE) insulation of high-voltage (HV) cables. Characterization of electrical tree structures gained considerable attention from researchers since a deep understanding of the tree morphology is required to develop new insulation material. Two-dimensional (2D) optical microscopy is primarily used to examine tree structures and propagation shapes with image segmentation methods. However, since electrical trees can emerge in different shapes such as bush-type or branch-type, treeing images are complicated to segment due to manifestation of convoluted tree branches, leading to a high misclassification rate during segmentation. Therefore, this study proposed a new method for segmenting 2D electrical tree images based on the multi-scale line tracking algorithm (MSLTA) by integrating batch processing method. The proposed method, h-MSLTA aims to provide accurate segmentation of electrical tree images obtained over a period of tree propagation observation under optical microscopy. The initial phase involves XLPE sample preparation and treeing image acquisition under real-time microscopy observation. The treeing images are then sampled and binarized in pre-processing. In the next phase, segmentation of tree structures is performed using the h-MSLTA by utilizing batch processing in multiple instances of treeing duration. Finally, the comparative investigation has been conducted using standard performance assessment metrics, including accuracy, sensitivity, specificity, Dice coefficient and Matthew’s correlation coefficient (MCC). Based on segmentation performance evaluation against several established segmentation methods, h-MSLTA achieved better results of 95.43% accuracy, 97.28% specificity, 69.43% sensitivity rate with 23.38% and 24.16% average improvement in Dice coefficient and MCC score respectively over the original algorithm. In addition, h-MSLTA produced accurate measurement results of global tree parameters of length and width in comparison with the ground truth image. These results indicated that the proposed method had a solid performance in terms of segmenting electrical tree branches in 2D treeing images compared to other established techniques.     

电视制导序列图像快速分割及目标特征提取

针对电视制导系统需从包含多个干扰目标的序列图像中快速识别和跟踪导弹目标的要求,提出了一种基于二值图像索引图的序列图像快速分割及目标特征提取算法,在序列图像二值化后,只需由FPGA对其遍历一次就可得到一张含有目标信息的索引图表,再由DSP对该索引图表边遍历边计算就可得到图像所含目标的数量.面积,质心坐标,二阶矩不变量等特征.实验结果表明,该算法并行处理效率高,实时性好,完全可满足电视制导系统的要求.     

Human Behavior Classification Using Geometrical Features of Skeleton and Support Vector Machines

Classification of human actions under video surveillance is gaining a lot of attention from computer vision researchers. In this paper, we have presented methodology to recognize human behavior in thin crowd which may be very helpful in surveillance. Research have mostly focused the problem of human detection in thin crowd, overall behavior of the crowd and actions of individuals in video sequences. Vision based Human behavior modeling is a complex task as it involves human detection, tracking, classifying normal and abnormal behavior. The proposed methodology takes input video and applies Gaussian based segmentation technique followed by post processing through presenting hole filling algorithm i.e., fill hole inside objects algorithm. Human detection is performed by presenting human detection algorithm and then geometrical features from human skeleton are extracted using feature extraction algorithm. The classification task is achieved using binary and multi class support vector machines. The proposed technique is validated through accuracy, precision, recall and F-measure metrics.     

基于压缩量化与邻域空间LBP算子的图像哈希算法

目的为了解决哈希算法的感知鲁棒性与伪造检测能力不高的问题,提出基于特征压缩机制与邻域空间局部二值模式的紧凑图像哈希算法。方法首先利用2D线性插值技术,对输入图像进行预处理;嵌入Ring分割技术,将其变为二次图像;再利用Gabor滤波技术对其完成过滤;考虑到图像的颜色特征与其内在的空间关系,基于局部二值模式LBP设计邻域空间LBP算子,提取滤波图像的特征;构建特征压缩量化准则,输出紧凑的哈希二值数组;迭代Logistic映射,输出随机序列,通过量化每个序列值输出密钥流,通过构建动态引擎设计分段异加密模型,实现紧凑哈希序列的加密,获取图像哈希;最后计算原始哈希序列与待检测哈希序列的Hamming距离,实现图像信息的安全认证。结果与已有的哈希生成机制相比,文中算法所输出的哈希序列更紧凑,对旋转、伽马校正等篡改操作具有更好的感知鲁棒。结论所提哈希技术具备较高的安全性,在包装图标检索、信息检测等领域具有较好的价值。     

Fuzzy entropy‐based MR brain image segmentation using modified particle swarm optimization

This article presents an image segmentation technique based on fuzzy entropy, which is applied to magnetic resonance (MR) brain images in order to detect brain tumors. The proposed method performs image segmentation based on adaptive thresholding of the input MR images. The image is classified into two membership functions (MFs) of the fuzzy region: Z‐function and S‐function. The optimal parameters of these fuzzy MFs are obtained using modified particle swarm optimization (MPSO) algorithm. The objective function for obtaining the optimal fuzzy MF parameters is considered to be the maximum fuzzy entropy. Through a number of examples, The performance is compared with existing entropy based object segmentation approaches and the superiority of the proposed method is demonstrated. The experimental results are compared with the exhaustive search method and Otsu's segmentation technique. The result shows the proposed fuzzy entropy‐based segmentation method optimized using MPSO achieves maximum entropy with proper segmentation of infected areas and with minimum computational time. © 2013 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 23, 281–288, 2013     

Brain image segmentation using a combination of expectation‐maximization algorithm and watershed transform

Watershed transformation is an effective segmentation algorithm that originates from the mathematical morphology field. This algorithm is widely used in medical image segmentation because it produces complete division even under poor contrast. However, over‐segmentation is its most significant limitation. Therefore, this article proposes a combination of watershed transformation and the expectation‐maximization (EM) algorithm to segment MR brain images efficiently. The EM algorithm is used to form clusters. Then, the brightest cluster is considered and converted into a binary image. A Sobel operator applied on the binary image generates the initial gradient image. Morphological reconstruction is applied to find the foreground and background markers. The final gradient image is obtained using the minima imposition technique on the initial gradient magnitude along with markers. In addition, watershed segmentation applied on the final gradient magnitude generates effective gray matter and cerebrospinal fluid segmentation. The results are compared with simple marker controlled watershed segmentation, watershed segmentation combined with Otsu multilevel thresholding, and local binary fitting energy model for validation. © 2016 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 26, 225–232, 2016     

HSI空间和改进 C-means的彩色人民币号码分割方法

针对采集到的人民币号码图像都是彩色图像并携带有噪声这一现象,本文提出基于 HSI空间和改进的 C-means算法的人民币彩色号码图像分割方法。选用 HSI颜色空间作为彩色分割空间,在 HSI空间内,将 HSI的 3-D搜索问题转化为 3个 1-D的搜索问题,求取图像在 3个 1-D方向上的灰度直方图,该方法根据图像当前点 3×3邻域内每个像素灰度值与当前点灰度值差值的大小情况,确定聚类算法中当前点的灰度值 p(m)的值,采用 C-means聚类算法分别确定文字和非文字的聚类中心,利用欧式距离进行人民币号码前景和背景的聚类判断。该方法直接对彩色人民币号码图像进行分割,考虑了当前点与邻域像素点之间的相互关系,具有一定的自适应性。实验结果表明,提出的号码图像分割方法不受图像噪声和局部边缘变化的影响,且变换后数据量减少,易于计算,该方法对字母和数字的分割都有效,鲁棒性较强。     

High-speed MRF-based segmentation algorithm using pixonal images

Abstract

Segmentation is one of the most complicated procedures in the image processing that has important role in the image analysis. In this paper, an improved pixon-based method for image segmentation is proposed. In proposed algorithm, complex partial differential equations (PDEs) is used as a kernel function to make pixonal image. Using this kernel function causes noise on images to reduce and an image not to be over-segment when the pixon-based method is used. Utilising the PDE-based method leads to elimination of some unnecessary details and results in a fewer pixon number, faster performance and more robustness against unwanted environmental noises. As the next step, the appropriate pixons are extracted and eventually, we segment the image with the use of a Markov random field. The experimental results indicate that the proposed pixon-based approach has a reduced computational load and a better accuracy compared to the other existing pixon-image segmentation techniques. To evaluate the proposed algorithm and compare it with the last best algorithms, many experiments on standard images were performed. The results indicate that the proposed algorithm is faster than other methods, with the most segmentation accuracy.     

A pioneering video-to-video super-resolution reconstruction algorithm based on segmentation and space–time regularisation

In view of the common existing problems in present video-to-video super-resolution reconstruction, this paper proposes a pioneering video-to-video super-resolution reconstruction algorithm based on segmentation and space–time regularisation to solve these problems. First, a video-to-video super-resolution reconstruction algorithm based on segmentation is proposed to eliminate reconstructed temporal ringing and to improve the times of reconstruction. Second, considering that image mosaic is involved in our proposed reconstruction algorithm, an improved fade-in and fade-out method is proposed to make the mosaic image looks more natural. At last, an improved space–time regularisation algorithm is put forward to remove noise and preserve image edge at the same time. Using several experiments, we prove that the proposed algorithm can achieve state-of-the -art reconstruction effect.     

A new images segmentation method based on modified particle swarm optimization algorithm

The partitioning of an image into several constituent components is called image segmentation. Many approaches have been developed; one of them is the particle swarm optimization (PSO) algorithm, which is widely used. PSO algorithm is one of the most recent stochastic optimization strategies. In this article, a new efficient technique for the magnetic resonance imaging (MRI) brain images segmentation thematic based on PSO is proposed. The proposed algorithm presents an improved variant of PSO, which is particularly designed for optimal segmentation and it is called modified particle swarm optimization. The fitness function is used to evaluate all the particle swarm in order to arrange them in a descending order. The algorithm is evaluated by performance measures such as run time execution and the quality of the image after segmentation. The performance of the segmentation process is demonstrated by using a defined set of benchmark images and compared against conventional PSO, genetic algorithm, and PSO with Mahalanobis distance based segmentation methods. Then we applied our method on MRI brain image to determinate normal and pathological tissues. © 2013 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 23, 265–271, 2013     

基于标记的多尺度分水岭视频目标分割算法

针对视频目标提取的问题,提出了基于标记的多尺度分水岭视频目标分割算法.该算法以帧间变化检测为基础,通过改进的最小Tsallis交叉熵进行去噪、滤波,经形态学处理后得到运动目标初始二值掩模,并利用初始二值掩模得到用于分水岭算法的前景与背景标记,用该标记修正当前帧的多尺度形态学梯度图像,最后进行分水岭分割,得到具有精确边界的视频对象.实验结果表明,该算法能有效地分割和提取视频序列中的单个、多个以及快速运动的目标,继承了变化检测和分水岭算法速度快的优点,克服了分水岭容易产生过分割的缺点,具有较强的适用性.     

基于背景抑制与改进多尺度LSD的声呐小目标检测算法

针对声呐小目标检测由于水下环境复杂、目标回波信号弱等因素造成虚警率和误检率较高的问题,文章提出基于背景抑制和改进直线分割检测(Line Segment Detection, LSD)的检测算法。首先对原始声呐数据截取序列片段,构建多周期累积历程图,凸显运动目标轨迹线特征;其次设计边缘滤波算子,有效滤除部分背景噪声,并结合投影变换进行线特征增强,不仅实现了断裂直线重连,还抑制了剩余噪声;然后基于图像金字塔改进了多尺度LSD直线分割检测算法,有效缓解了过检测问题,大幅增加了直线平均长度;最后为了合并冗余检测信息,利用运动轨迹时空一致性特征设计后处理模块,提高了检测定位精度。通过多组无人遥控潜水器(Remotely Operated Vehicle, ROV)、潜水员、空心球靶小目标序列的湖试、海试数据的定量与可视化结果定性分析,实验结果显示,文中算法与传统LSD相比,误检率和漏检率分别降低了11.2和3.9个百分点,定位误差下降了1.495个像素。结果表明,文中所提算法大幅提高了声呐小目标检测精度,为后续水下目标识别、跟踪等任务奠定重要基础。     

用于彩色图像分割的改进遗传FCM算法

本文提出了一种适用于彩色图像分割的遗传模糊C均值聚类(GAFCM)算法.该算法使用Ohta等人提出的彩色特征集中的第一个分量作为图像像素的一维特征向量,并利用由像素空间到特征空间的映射来改进目标函数,从而大大降低了运算量;使用对特征空间结构没有特殊要求的特征距离代替欧氏距离,从而克服了特征空间结构对聚类结果的影响;使用引入FCM优化的遗传算法来搜索最优解,从而提高了搜索速度.实验表明,该算法不但能很好地分割彩色图像,而且具有运算量小、收敛速度快的优点.     

结合显著性的GrabCut及在骨髓细胞图像分割中的应用

针对传统GrabCut算法需要用户交互缺点,提出一种基于上下文感知显著性的GrabCut的改进的图像分割算法.首先用上下文感知得到待分割图像的显著图,然后由二值化的显著图确定GrabCut算法的初始化区域,再通过迭代使能量函数最小化分割出目标,算法应用于骨髓细胞图像分割上.实验结果表明,此算法能避免以往细胞分割算法如支持向量机、K-Means等参数调整问题,总体误差率较低,自动化程度高,鲁棒性强.     

印刷网点微观图像阈值分割算法研究

目的 通过阈值处理方法, 准确获取网点微观图像的特征参数, 将其与仪器测量值相结合, 综合评价印刷品复制质量。方法 提出一种基于高斯函数模型拟合网点图像灰度直方图数据的阈值分割算法, 寻找网点类图像最佳分割阈值, 对图像进行二值化处理, 得到准确的网点参数。结果 得到的印刷品网点面积率在全阶调范围内更接近于测量值, 分割效果明显优于传统的阈值分割算法。结论 提出的高斯拟合阈值分割算法更有利于提取网点类图像的微观参数, 精度高, 稳定性好,为获取准确的网点图像微观参数提供了理论与实践参考。     

A locally adaptive region growing algorithm for vascular segmentation

To segment vascular structures in 3‐D CTA/MRA images, this article presents a new region growing algorithm based on local cube tracking. In the proposed algorithm, a small local cube is segmented to detect a vessel segment, and the following local cube(s) is determined based on the segmentation result. This procedure is repeated until the segmentation is completed. By confining the segmentation inside each local cube, a robust result can be obtained even in a tubular structure of steadily changing intensity. For segmentation, a locally adaptive and competitive region growing scheme is adopted to obtain well‐defined vessel boundaries. It should be emphasized that the proposed algorithm can detect all branches with practically acceptable computational complexity. In addition, its segmentation result is represented as a tree structure having many branches so that a user may easily correct the result branch‐by‐branch, if necessary. Experimental results from real images prove that the proposed algorithm produces prospective vessel segmentation results for 3‐D CTA/MRA images and segments vessels of various sizes well, including stenoses and aneurysms. © 2003 Wiley Periodicals, Inc. Int J Imaging Syst Technol 13, 208–214, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ima.10059     

Contrast enhancement using real coded genetic algorithm based modified histogram equalization for gray scale images

Histogram equalization is a well‐known technique used for contrast enhancement. The global HE usually results in excessive contrast enhancement because of lack of control on the level of contrast enhancement. A new technique named modified histogram equalization using real coded genetic algorithm (MHERCGA) is aimed to sweep over this drawback. The primary aim of this paper is to obtain an enhanced method which keeps the original brightness. This method incorporates a provision to have a control over the level of contrast enhancement and applicable for all types of image including low contrast MRI brain images. The basic idea of this technique is to partition the input image histogram into two subhistograms based on a threshold which is obtained using Otsu's optimality principle. Then, bicriteria optimization problem is formulated to satisfy the aforementioned requirements. The subhistograms are modified by selecting optimal contrast enhancement parameters. Finally, the union of the modified subhistograms produce a contrast enhanced and details preserved output image. While developing an optimization problem, real coded genetic algorithm is applied to determine the optimal value of contrast enhancement parameters. This mechanism enhances the contrast of the input image better than the existing contemporary HE methods. The quality of the enhanced brain image indicates that the image obtained after this method can be useful for efficient detection of brain cancer in further process like segmentation, classification, etc. The performance of the proposed method is well supported by the contrast enhancement quantitative metrics such as discrete entropy and natural image quality evaluator. © 2015 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 25, 24–32, 2015