Traditional image segmentation methods based on MRF converge slowly and require pre-defined weight. These disadvantages are addressed, and a fast segmentation approach based on simple Markov random field （MRF） for S...Traditional image segmentation methods based on MRF converge slowly and require pre-defined weight. These disadvantages are addressed, and a fast segmentation approach based on simple Markov random field （MRF） for SAR image is proposed. The approach is firstly used to perform coarse segmentation in blocks. Then the image is modeled with simple MRF and adaptive variable weighting forms are applied in homogeneous and heterogeneous regions. As a result, the convergent speed is accelerated while the segmentation results in homogeneous regions and boarders are improved. Simulations with synthetic and real SAR images demonstrate the effectiveness of the proposed approach.展开更多
In this paper an efficient compressed domain moving object segmentation algorithm is proposed, in which the motion vector （MV） field parsed from the compressed video is the only cue used for moving object segmentati...In this paper an efficient compressed domain moving object segmentation algorithm is proposed, in which the motion vector （MV） field parsed from the compressed video is the only cue used for moving object segmentation. First the MV field is temporally and spatially normalized, and then accumulated by an iterative backward projection to enhance salient motions and alleviate noisy MVs. The accumulated MV field is then segmented into motion-homogenous regions using a modified statistical region growing approach. Finally, moving object regions are extracted in turn based on minimization of the joint prediction error using the estimated motion models of two region sets containing the candidate object region and other remaining regions, respectively. Experimental results on several H.264 compressed video sequences demonstrate good segmentation performance.展开更多
In this paper, elitist reconstruction genetic algorithm （ERGA） based on Markov random field （MRF） is introduced for image segmentation. In this algorithm, a population of possible solutions is maintained at every ...In this paper, elitist reconstruction genetic algorithm （ERGA） based on Markov random field （MRF） is introduced for image segmentation. In this algorithm, a population of possible solutions is maintained at every generation, and for each solution a fitness value is calculated according to a fitness function, which is constructed based on the MRF potential function according to Metropolis function and Bayesian framework. After the improved selection, crossover and mutation, an elitist individual is restructured based on the strategy of restructuring elitist. This procedure is processed to select the location that denotes the largest MRF potential function value in the same location of all individuals. The algorithm is stopped when the change of fitness functions between two sequent generations is less than a specified value. Experiments show that the performance of the hybrid algorithm is better than that of some traditional algorithms.展开更多
To reduce the computation cost of a combined probabilistic graphical model and a deep neural network in semantic segmentation, the local region condition random field (LRCRF) model is investigated which selectively ap...To reduce the computation cost of a combined probabilistic graphical model and a deep neural network in semantic segmentation, the local region condition random field (LRCRF) model is investigated which selectively applies the condition random field (CRF) to the most active region in the image. The full convolutional network structure is optimized with the ResNet-18 structure and dilated convolution to expand the receptive field. The tracking networks are also improved based on SiameseFC by considering the frame relations in consecutive-frame traffic scene maps. Moreover, the segmentation results of the greyscale input data sets are more stable and effective than using the RGB images for deep neural network feature extraction. The experimental results show that the proposed method takes advantage of the image features directly and achieves good real-time performance and high segmentation accuracy.展开更多
针对金属涂层缺陷图像分割中存在特征提取能力弱和分割精度低的问题,提出了一种改进的U^(2)-Net分割模型。首先,在U型残差块(RSU)中嵌入改进的增大感受野模块(receptive field block light,RFB_l),组成新的特征提取层,增强对细节特征的...针对金属涂层缺陷图像分割中存在特征提取能力弱和分割精度低的问题,提出了一种改进的U^(2)-Net分割模型。首先,在U型残差块(RSU)中嵌入改进的增大感受野模块(receptive field block light,RFB_l),组成新的特征提取层,增强对细节特征的学习能力,解决了网络由于感受野受限造成分割精度低的问题;其次,在U^(2)-Net分割模型的解码阶段引入有效的边缘增强注意力机制(contour enhanced attention,CEA),抑制网络中的冗余特征,获取具有详细位置信息的特征注意力图,增强了边界与背景信息的差异性,从而达到更精确的分割效果。实验结果表明,该模型在两个金属涂层剥落与腐蚀数据集上的平均交并比、准确率、查准率、召回率和F_1-measure分别达到80.36%、96.29%、87.43%、84.61%和86.00%,相比于常用的SegNet、U-Net以及U^(2)-Net分割网络的性能都有较大提升。展开更多
Markov random field(MRF) models for segmentation of noisy images are discussed. According to the maximum a posteriori criterion, a configuration of an image field is regarded as an optimal estimate of the original sce...Markov random field(MRF) models for segmentation of noisy images are discussed. According to the maximum a posteriori criterion, a configuration of an image field is regarded as an optimal estimate of the original scene when its energy is minimized. However, the minimum energy configuration does not correspond to the scene on edges of a given image, which results in errors of segmentation. Improvements of the model are made and a relaxation algorithm based on the improved model is presented using the edge information obtained by a coarse-to-fine procedure. Some examples are presented to illustrate the applicability of the algorithm to segmentation of noisy images.展开更多
This paper presented a method that incorporates Markov Random Field(MRF), watershed segmentation and merging techniques for performing image segmentation and edge detection tasks. MRF is used to obtain an initial esti...This paper presented a method that incorporates Markov Random Field(MRF), watershed segmentation and merging techniques for performing image segmentation and edge detection tasks. MRF is used to obtain an initial estimate of x regions in the image under process where in MRF model, gray level x , at pixel location i , in an image X , depends on the gray levels of neighboring pixels. The process needs an initial segmented result. An initial segmentation is got based on K means clustering technique and the minimum distance, then the region process in modeled by MRF to obtain an image contains different intensity regions. Starting from this we calculate the gradient values of that image and then employ a watershed technique. When using MRF method it obtains an image that has different intensity regions and has all the edge and region information, then it improves the segmentation result by superimpose closed and an accurate boundary of each region using watershed algorithm. After all pixels of the segmented regions have been processed, a map of primitive region with edges is generated. Finally, a merge process based on averaged mean values is employed. The final segmentation and edge detection result is one closed boundary per actual region in the image.展开更多
基金supported by the Specialized Research Found for the Doctoral Program of Higher Education (20070699013)the Natural Science Foundation of Shaanxi Province (2006F05)the Aeronautical Science Foundation (05I53076)
文摘Traditional image segmentation methods based on MRF converge slowly and require pre-defined weight. These disadvantages are addressed, and a fast segmentation approach based on simple Markov random field （MRF） for SAR image is proposed. The approach is firstly used to perform coarse segmentation in blocks. Then the image is modeled with simple MRF and adaptive variable weighting forms are applied in homogeneous and heterogeneous regions. As a result, the convergent speed is accelerated while the segmentation results in homogeneous regions and boarders are improved. Simulations with synthetic and real SAR images demonstrate the effectiveness of the proposed approach.
基金Project supported by the National Natural Science Foundation of China （Grant No.60572127）, the Development Foundation of Shanghai Municipal Commission of Education （Grant No.05AZ43）, and the Shanghai Leading Academic Discipline Project （Grant No.T0102）
文摘In this paper an efficient compressed domain moving object segmentation algorithm is proposed, in which the motion vector （MV） field parsed from the compressed video is the only cue used for moving object segmentation. First the MV field is temporally and spatially normalized, and then accumulated by an iterative backward projection to enhance salient motions and alleviate noisy MVs. The accumulated MV field is then segmented into motion-homogenous regions using a modified statistical region growing approach. Finally, moving object regions are extracted in turn based on minimization of the joint prediction error using the estimated motion models of two region sets containing the candidate object region and other remaining regions, respectively. Experimental results on several H.264 compressed video sequences demonstrate good segmentation performance.
文摘In this paper, elitist reconstruction genetic algorithm （ERGA） based on Markov random field （MRF） is introduced for image segmentation. In this algorithm, a population of possible solutions is maintained at every generation, and for each solution a fitness value is calculated according to a fitness function, which is constructed based on the MRF potential function according to Metropolis function and Bayesian framework. After the improved selection, crossover and mutation, an elitist individual is restructured based on the strategy of restructuring elitist. This procedure is processed to select the location that denotes the largest MRF potential function value in the same location of all individuals. The algorithm is stopped when the change of fitness functions between two sequent generations is less than a specified value. Experiments show that the performance of the hybrid algorithm is better than that of some traditional algorithms.
文摘To reduce the computation cost of a combined probabilistic graphical model and a deep neural network in semantic segmentation, the local region condition random field (LRCRF) model is investigated which selectively applies the condition random field (CRF) to the most active region in the image. The full convolutional network structure is optimized with the ResNet-18 structure and dilated convolution to expand the receptive field. The tracking networks are also improved based on SiameseFC by considering the frame relations in consecutive-frame traffic scene maps. Moreover, the segmentation results of the greyscale input data sets are more stable and effective than using the RGB images for deep neural network feature extraction. The experimental results show that the proposed method takes advantage of the image features directly and achieves good real-time performance and high segmentation accuracy.
基金Supported by the National Natural Science Foundation of China
文摘Markov random field(MRF) models for segmentation of noisy images are discussed. According to the maximum a posteriori criterion, a configuration of an image field is regarded as an optimal estimate of the original scene when its energy is minimized. However, the minimum energy configuration does not correspond to the scene on edges of a given image, which results in errors of segmentation. Improvements of the model are made and a relaxation algorithm based on the improved model is presented using the edge information obtained by a coarse-to-fine procedure. Some examples are presented to illustrate the applicability of the algorithm to segmentation of noisy images.
文摘This paper presented a method that incorporates Markov Random Field(MRF), watershed segmentation and merging techniques for performing image segmentation and edge detection tasks. MRF is used to obtain an initial estimate of x regions in the image under process where in MRF model, gray level x , at pixel location i , in an image X , depends on the gray levels of neighboring pixels. The process needs an initial segmented result. An initial segmentation is got based on K means clustering technique and the minimum distance, then the region process in modeled by MRF to obtain an image contains different intensity regions. Starting from this we calculate the gradient values of that image and then employ a watershed technique. When using MRF method it obtains an image that has different intensity regions and has all the edge and region information, then it improves the segmentation result by superimpose closed and an accurate boundary of each region using watershed algorithm. After all pixels of the segmented regions have been processed, a map of primitive region with edges is generated. Finally, a merge process based on averaged mean values is employed. The final segmentation and edge detection result is one closed boundary per actual region in the image.
