Due to the coupling of model parameters, most spatial mixture models for image segmentation can not directly computed by EM algorithm. The paper proposes an evolutional learning algorithm based on weighted likelihood ...Due to the coupling of model parameters, most spatial mixture models for image segmentation can not directly computed by EM algorithm. The paper proposes an evolutional learning algorithm based on weighted likelihood of mixture models for image segmentation. The proposed algorithm consists of multiple generations of learning algorithm, and each stage of learning algorithm corresponds to an EM algorithm of spatially constraint independent mixture model. The smoothed EM result in spatial domain of each stage is considered as the supervision information to guide the next stage clustering. The spatial constraint information is thus incorporated into the independent mixture model. So the coupling problem of the spatial model parameters can be avoided at a lower computational cost. Experiments using synthetic and real images are presented to show the efficiency of the proposed algorithm.展开更多
Variational image segmentation based on the Mumford and Shah model[31],together with implementation by the piecewise constant level-set method(PCLSM)[26],leads to fully nonlinear Total Variation(TV)-Allen-Cahn equatio...Variational image segmentation based on the Mumford and Shah model[31],together with implementation by the piecewise constant level-set method(PCLSM)[26],leads to fully nonlinear Total Variation(TV)-Allen-Cahn equations.The commonlyused numerical approaches usually suffer from the difficulties not only with the nondifferentiability of the TV-term,but also with directly evolving the discontinuous piecewise constant-structured solutions.In this paper,we propose efficient dual algorithms to overcome these drawbacks.The use of a splitting-penalty method results in TVAllen-Cahn type models associated with different"double-well"potentials,which allow for the implementation of the dual algorithm of Chambolle[8].Moreover,we present a new dual algorithm based on an edge-featured penalty of the dual variable,which only requires to solve a vectorial Allen-Cahn type equation with linear∇(div)-diffusion rather than fully nonlinear diffusion in the Chambolle’s approach.Consequently,more efficient numerical algorithms such as time-splitting method and Fast Fourier Transform(FFT)can be implemented.Various numerical tests show that two dual algorithms are much faster and more stable than the primal gradient descent approach,and the new dual algorithm is at least as efficient as the Chambolle’s algorithm but is more accurate.We demonstrate that the new method also provides a viable alternative for image restoration.展开更多
Every day,websites and personal archives create more and more photos.The size of these archives is immeasurable.The comfort of use of these huge digital image gatherings donates to their admiration.However,not all of ...Every day,websites and personal archives create more and more photos.The size of these archives is immeasurable.The comfort of use of these huge digital image gatherings donates to their admiration.However,not all of these folders deliver relevant indexing information.From the outcomes,it is dif-ficult to discover data that the user can be absorbed in.Therefore,in order to determine the significance of the data,it is important to identify the contents in an informative manner.Image annotation can be one of the greatest problematic domains in multimedia research and computer vision.Hence,in this paper,Adap-tive Convolutional Deep Learning Model(ACDLM)is developed for automatic image annotation.Initially,the databases are collected from the open-source system which consists of some labelled images(for training phase)and some unlabeled images{Corel 5 K,MSRC v2}.After that,the images are sent to the pre-processing step such as colour space quantization and texture color class map.The pre-processed images are sent to the segmentation approach for efficient labelling technique using J-image segmentation(JSEG).Thefinal step is an auto-matic annotation using ACDLM which is a combination of Convolutional Neural Network(CNN)and Honey Badger Algorithm(HBA).Based on the proposed classifier,the unlabeled images are labelled.The proposed methodology is imple-mented in MATLAB and performance is evaluated by performance metrics such as accuracy,precision,recall and F1_Measure.With the assistance of the pro-posed methodology,the unlabeled images are labelled.展开更多
Automatic segmentation and recognition of content and element information in color geological map are of great significance for researchers to analyze the distribution of mineral resources and predict disaster informa...Automatic segmentation and recognition of content and element information in color geological map are of great significance for researchers to analyze the distribution of mineral resources and predict disaster information.This article focuses on color planar raster geological map(geological maps include planar geological maps,columnar maps,and profiles).While existing deep learning approaches are often used to segment general images,their performance is limited due to complex elements,diverse regional features,and complicated backgrounds for color geological map in the domain of geoscience.To address the issue,a color geological map segmentation model is proposed that combines the Felz clustering algorithm and an improved SE-UNet deep learning network(named GeoMSeg).Firstly,a symmetrical encoder-decoder structure backbone network based on UNet is constructed,and the channel attention mechanism SENet has been incorporated to augment the network’s capacity for feature representation,enabling the model to purposefully extract map information.The SE-UNet network is employed for feature extraction from the geological map and obtain coarse segmentation results.Secondly,the Felz clustering algorithm is used for super pixel pre-segmentation of geological maps.The coarse segmentation results are refined and modified based on the super pixel pre-segmentation results to obtain the final segmentation results.This study applies GeoMSeg to the constructed dataset,and the experimental results show that the algorithm proposed in this paper has superior performance compared to other mainstream map segmentation models,with an accuracy of 91.89%and a MIoU of 71.91%.展开更多
基金The paper is supported by the National Science Foundation of Heilongjiang province numbered QC2013C060
文摘Due to the coupling of model parameters, most spatial mixture models for image segmentation can not directly computed by EM algorithm. The paper proposes an evolutional learning algorithm based on weighted likelihood of mixture models for image segmentation. The proposed algorithm consists of multiple generations of learning algorithm, and each stage of learning algorithm corresponds to an EM algorithm of spatially constraint independent mixture model. The smoothed EM result in spatial domain of each stage is considered as the supervision information to guide the next stage clustering. The spatial constraint information is thus incorporated into the independent mixture model. So the coupling problem of the spatial model parameters can be avoided at a lower computational cost. Experiments using synthetic and real images are presented to show the efficiency of the proposed algorithm.
基金supported by Singapore AcRF Tier 1 Grant RG58/08,Singapore MOE Grant T207B2202 and Singapore NRF2007IDM-IDM002-010.
文摘Variational image segmentation based on the Mumford and Shah model[31],together with implementation by the piecewise constant level-set method(PCLSM)[26],leads to fully nonlinear Total Variation(TV)-Allen-Cahn equations.The commonlyused numerical approaches usually suffer from the difficulties not only with the nondifferentiability of the TV-term,but also with directly evolving the discontinuous piecewise constant-structured solutions.In this paper,we propose efficient dual algorithms to overcome these drawbacks.The use of a splitting-penalty method results in TVAllen-Cahn type models associated with different"double-well"potentials,which allow for the implementation of the dual algorithm of Chambolle[8].Moreover,we present a new dual algorithm based on an edge-featured penalty of the dual variable,which only requires to solve a vectorial Allen-Cahn type equation with linear∇(div)-diffusion rather than fully nonlinear diffusion in the Chambolle’s approach.Consequently,more efficient numerical algorithms such as time-splitting method and Fast Fourier Transform(FFT)can be implemented.Various numerical tests show that two dual algorithms are much faster and more stable than the primal gradient descent approach,and the new dual algorithm is at least as efficient as the Chambolle’s algorithm but is more accurate.We demonstrate that the new method also provides a viable alternative for image restoration.
文摘Every day,websites and personal archives create more and more photos.The size of these archives is immeasurable.The comfort of use of these huge digital image gatherings donates to their admiration.However,not all of these folders deliver relevant indexing information.From the outcomes,it is dif-ficult to discover data that the user can be absorbed in.Therefore,in order to determine the significance of the data,it is important to identify the contents in an informative manner.Image annotation can be one of the greatest problematic domains in multimedia research and computer vision.Hence,in this paper,Adap-tive Convolutional Deep Learning Model(ACDLM)is developed for automatic image annotation.Initially,the databases are collected from the open-source system which consists of some labelled images(for training phase)and some unlabeled images{Corel 5 K,MSRC v2}.After that,the images are sent to the pre-processing step such as colour space quantization and texture color class map.The pre-processed images are sent to the segmentation approach for efficient labelling technique using J-image segmentation(JSEG).Thefinal step is an auto-matic annotation using ACDLM which is a combination of Convolutional Neural Network(CNN)and Honey Badger Algorithm(HBA).Based on the proposed classifier,the unlabeled images are labelled.The proposed methodology is imple-mented in MATLAB and performance is evaluated by performance metrics such as accuracy,precision,recall and F1_Measure.With the assistance of the pro-posed methodology,the unlabeled images are labelled.
基金financially supported by the Natural Science Foundation of China(42301492)the Open Fund of Hubei Key Laboratory of Intelligent Vision Based Monitoring for Hydroelectric Engineering(2022SDSJ04,2024SDSJ03)+1 种基金the Opening Fund of Key Laboratory of Geological Survey and Evaluation of Ministry of Education(GLAB 2023ZR01,GLAB2024ZR08)the Fundamental Research Funds for the Central Universities.
文摘Automatic segmentation and recognition of content and element information in color geological map are of great significance for researchers to analyze the distribution of mineral resources and predict disaster information.This article focuses on color planar raster geological map(geological maps include planar geological maps,columnar maps,and profiles).While existing deep learning approaches are often used to segment general images,their performance is limited due to complex elements,diverse regional features,and complicated backgrounds for color geological map in the domain of geoscience.To address the issue,a color geological map segmentation model is proposed that combines the Felz clustering algorithm and an improved SE-UNet deep learning network(named GeoMSeg).Firstly,a symmetrical encoder-decoder structure backbone network based on UNet is constructed,and the channel attention mechanism SENet has been incorporated to augment the network’s capacity for feature representation,enabling the model to purposefully extract map information.The SE-UNet network is employed for feature extraction from the geological map and obtain coarse segmentation results.Secondly,the Felz clustering algorithm is used for super pixel pre-segmentation of geological maps.The coarse segmentation results are refined and modified based on the super pixel pre-segmentation results to obtain the final segmentation results.This study applies GeoMSeg to the constructed dataset,and the experimental results show that the algorithm proposed in this paper has superior performance compared to other mainstream map segmentation models,with an accuracy of 91.89%and a MIoU of 71.91%.
