Two-dimensional cross entropy multi-threshold image segmentation based on improved BBO algorithm

In order to improve the global search ability of biogeography-based optimization(BBO)algorithm in multi-threshold image segmentation,a multi-threshold image segmentation based on improved BBO algorithm is proposed.When using BBO algorithm to optimize threshold,firstly,the elitist selection operator is used to retain the optimal set of solutions.Secondly,a migration strategy based on fusion of good solution and pending solution is introduced to reduce premature convergence and invalid migration of traditional migration operations.Thirdly,to reduce the blindness of traditional mutation operations,a mutation operation through binary computation is created.Then,it is applied to the multi-threshold image segmentation of two-dimensional cross entropy.Finally,this method is used to segment the typical image and compared with two-dimensional multi-threshold segmentation based on particle swarm optimization algorithm and the two-dimensional multi-threshold image segmentation based on standard BBO algorithm.The experimental results show that the method has good convergence stability,it can effectively shorten the time of iteration,and the optimization performance is better than the standard BBO algorithm.

Foreign Fiber Image Segmentation Based on Maximum Entropy and Genetic Algorithm

In machine-vision-based systems for detecting foreign fibers, due to the background of the cotton layer has the absolute advantage in the whole image, while the foreign fiber only account for a very small part, and what’s more, the brightness and contrast of the image are all poor. Using the traditional image segmentation method, the segmentation results are very poor. By adopting the maximum entropy and genetic algorithm, the maximum entropy function was used as the fitness function of genetic algorithm. Through continuous optimization, the optimal segmentation threshold is determined. Experimental results prove that the image segmentation of this paper not only fast and accurate, but also has strong adaptability.

Defect detection method based on 2D entropy image segmentation

In order to improve the work efficiency of non-destructive testing(NDT)and the reliability of NDT results,an automatic method to detect defects in the ultrasonic image was researched.According to the characterization of ultrasonic D-scan image,clutter wave suppression and de-noising were presented firstly.Then,the image is processed by binaryzation using KSW 2 D entropy based on image segmentation method.The results showed that,the global threshold based segmentation method was somewhat ineffective for D-scan image because of under-segmentation.Especially,when the image is big in size,small targets which are composed by a small amount of pixels are often undetected.Whereas,local threshold based image segmentation method is effective in recognizing small defects because it takes local image character into account.

Fractional Rényi Entropy Image Enhancement for Deep Segmentation of Kidney MRI

Recently,many rapid developments in digital medical imaging have made further contributions to health care systems.The segmentation of regions of interest in medical images plays a vital role in assisting doctors with their medical diagnoses.Many factors like image contrast and quality affect the result of image segmentation.Due to that,image contrast remains a challenging problem for image segmentation.This study presents a new image enhancement model based on fractional Rényi entropy for the segmentation of kidney MRI scans.The proposed work consists of two stages:enhancement by fractional Rényi entropy,and MRI Kidney deep segmentation.The proposed enhancement model exploits the pixel’s probability representations for image enhancement.Since fractional Rényi entropy involves fractional calculus that has the ability to model the non-linear complexity problem to preserve the spatial relationship between pixels,yielding an overall better details of the kidney MRI scans.In the second stage,the deep learning kidney segmentation model is designed to segment kidney regions in MRI scans.The experimental results showed an average of 95.60%dice similarity index coefficient,which indicates best overlap between the segmented bodies with the ground truth.It is therefore concluded that the proposed enhancement model is suitable and effective for improving the kidney segmentation performance.

Gravel Image Segmentation in Noisy Background Based on Partial Entropy Method

Because of wide variation in gray levels and particle dimensions and the presence of many small gravel objects in the background, as well as corrupting the image by noise, it is difficult to segment gravel objects. In this paper, we develop a partial entropy method and succeed to realize gravel objects segmentation. We give entropy principles and fast calculation methods. Moreover, we use minimum entropy error automaticly to select a threshold to segment image. We introduce the filter method using mathematical morphology. The segment experiments are performed by using different window dimensions for a group of gravel image and demonstrates that this method has high segmentation rate and low noise sensitivity.

Video segmentation using Maximum Entropy Model

Detecting objects of interest from a video sequence is a fundamental and critical task in automated visual surveillance. Most current approaches only focus on discriminating moving objects by background subtraction whether or not the objects of interest can be moving or stationary. In this paper, we propose layers segmentation to detect both moving and stationary target objects from surveillance video. We extend the Maximum Entropy (ME) statistical model to segment layers with features, which are collected by constructing a codebook with a set of codewords for each pixel. We also indicate how the training models are used for the discrimination of target objects in surveillance video. Our experimental results are presented in terms of the success rate and the segmenting precision.

Quantum watermarking based on threshold segmentation using quantum informational entropy

We propose a new quantum watermarking scheme based on threshold selection using informational entropy of quantum image.The core idea of this scheme is to embed information into object and background of cover image in different ways.First,a threshold method adopting the quantum informational entropy is employed to determine a threshold value.The threshold value can then be further used for segmenting the cover image to a binary image,which is an authentication key for embedding and extraction information.By a careful analysis of the quantum circuits of the scheme,that is,translating into the basic gate sequences which show the low complexity of the scheme.One of the simulation-based experimental results is entropy difference which measures the similarity of two images by calculating the difference in quantum image informational entropy between watermarked image and cover image.Furthermore,the analyses of peak signal-to-noise ratio,histogram and capacity of the scheme are also provided.

Applying rough sets in word segmentation disambiguation based on maximum entropy model

To solve the complicated feature extraction and long distance dependency problem in Word Segmentation Disambiguation （WSD）, this paper proposes to apply rough sets ill WSD based on the Maximum Entropy model. Firstly, rough set theory is applied to extract the complicated features and long distance features, even frnm noise or inconsistent corpus. Secondly, these features are added into the Maximum Entropy model, and consequently, the feature weights can be assigned according to the performance of the whole disambiguation mnltel. Finally, tile semantic lexicou is adopted to build class-hased rough set teatures to overcome data spareness. The experiment indicated that our method performed better than previous models, which got top rank in WSD in 863 Evaluation in 2003. This system ranked first and second respcetively in MSR and PKU open test in the Second International Chinese Word Segmentation Bankeoff held in 2005.

Generalized <i>α</i>-Entropy Based Medical Image Segmentation

In 1953, Rènyi introduced his pioneering work (known as α-entropies) to generalize the traditional notion of entropy. The functionalities of α-entropies share the major properties of Shannon’s entropy. Moreover, these entropies can be easily estimated using a kernel estimate. This makes their use by many researchers in computer vision community greatly appealing. In this paper, an efficient and fast entropic method for noisy cell image segmentation is presented. The method utilizes generalized α-entropy to measure the maximum structural information of image and to locate the optimal threshold desired by segmentation. To speed up the proposed method, computations are carried out on 1D histograms of image. Experimental results show that the proposed method is efficient and much more tolerant to noise than other state-of-the-art segmentation techniques.

General Entropy Model of Line Segments Uncertainty in GIS

Spatial data uncertainty can directly affect the quality of digital products and GIS-based decision making. On the basis of the characteristics of randomicity of positional data and fuzziness of attribute data, taking entropy as a measure, the stochastic entropy model of positional data uncertainty and fuzzy entropy model of attribute data uncertainty are proposed. As both randomic-ity and fuzziness usually simultaneously exist in linear segments, their omnibus effects are also investigated and quantified. A novel uncertainty measure, general entropy, is presented. The general entropy can be used as a uniform measure to quantify the total un-certainty caused by stochastic uncertainty and fuzzy uncertainty in GIS.

Modified Multiple Scale/Segment Entropy （MMPE） Analysis of Heart Rate Variability of NHH, CHF ＆ AF Subjects

Nonlinear analysis of heart rate variability （HRV） has become important as heart behaves as a complex system. In this work, the approximate entropy （ApEn） has been used as a nonlinear measure. A new concept of estimating the ApEn in different segments of long length of the recorded data called modified multiple scale （segment） entropy （MMPE） is introduced. The idea of estimating the approximate entropy in different segments is useful to detect the nonlinear dynamics of the heart present in the entire length of data. The present work has been carried out for three cases namely the normal healthy heart （NHH） data, congestive heart failure （CHF） data and Atrial fibrillation （AF） data and the data are analyzed using MMPE techniques. It is observed that the mean value of ApEn for NHH data is much higher than the mean values for CHF data and AF data. The ApEn profiles of CHF, AF and NHH data for different segments obtained using MPE profiles measures the heart dynamism for the three different cases. Also the power spectral density is obtained using fast fourier transform （FFT） analysis and the ratio of LF/HF （low frequency/high frequency） power are computed on multiple scales/segments namely MPLH （multiple scale low frequency to high frequency） for the NHH data, CHF data and AF data and analyzed using MPLH techniques. The results are presented and discussed in the paper.

Multi-Threshold Algorithm Based on Havrda and Charvat Entropy for Edge Detection in Satellite Grayscale Images

Automatic edge detection of an image is considered a type of crucial information that can be extracted by applying detectors with different techniques. It is a main tool in pattern recognition, image segmentation, and scene analysis. This paper introduces an edge-detection algorithm, which generates multi-threshold values. It is based on non-Shannon measures such as Havrda & Charvat’s entropy, which is commonly used in gray level image analysis in many types of images such as satellite grayscale images. The proposed edge detection performance is compared to the previous classic methods, such as Roberts, Prewitt, and Sobel methods. Numerical results underline the robustness of the presented approach and different applications are shown.

Two-Dimensional Entropy Method Based on Genetic Algorithm

Two dimensional(2 D) entropy method has to pay the price of time when applied to image segmentation. So the genetic algorithm is introduced to improve the computational efficiency of the 2 D entropy method. The proposed method uses both the gray value of a pixel and the local average gray value of an image. At the same time, the simple genetic algorithm is improved by using better reproduction and crossover operators. Thus the proposed method makes up the 2 D entropy method’s drawback of being time consuming, and yields satisfactory segmentation results. Experimental results show that the proposed method can save computational time when it provides good quality segmentation.

Ground-Based Cloud Using Exponential Entropy/Exponential Gray Entropy and UPSO

Objective and accurate classification model or method of cloud image is a prerequisite for accurate weather monitoring and forecast.Thus safety of aircraft taking off and landing and air flight can be guaranteed.Thresholding is a kind of simple and effective method of cloud classification.It can realize automated ground-based cloud detection and cloudage observation.The existing segmentation methods based on fixed threshold and single threshold cannot achieve good segmentation effect.Thus it is difficult to obtain the accurate result of cloud detection and cloudage observation.In view of the above-mentioned problems,multi-thresholding methods of ground-based cloud based on exponential entropy/exponential gray entropy and uniform searching particle swarm optimization(UPSO)are proposed.Exponential entropy and exponential gray entropy make up for the defects of undefined value and zero value in Shannon entropy.In addition,exponential gray entropy reflects the relative uniformity of gray levels within the cloud cluster and background cluster.Cloud regions and background regions of different gray level ranges can be distinguished more precisely using the multi-thresholding strategy.In order to reduce computational complexity of original exhaustive algorithm for multi-threshold selection,the UPSO algorithm is adopted.It can find the optimal thresholds quickly and accurately.As a result,the real-time processing of segmentation of groundbased cloud image can be realized.The experimental results show that,in comparison with the existing groundbased cloud image segmentation methods and multi-thresholding method based on maximum Shannon entropy,the proposed methods can extract the boundary shape,textures and details feature of cloud more clearly.Therefore,the accuracies of cloudage detection and morphology classification for ground-based cloud are both improved.

Multiscale entropy based study of the pathological time series

This paper studies the multiscale entropy （MSE） of electrocardiogram＇s ST segment and compares the MSE results of ST segment with that of electrocardiogram in the first time. Electrocardiogram complexity changing characteristics has important clinical significance for early diagnosis. Study shows that the average MSE values and the varying scope fluctuation could be more effective to reveal the heart health status. Particularly the multiscale values varying scope fluctuation is a more sensitive parameter for early heart disease detection and has a clinical diagnostic significance.

Fast recursive algorithm for two-dimensional Tsallis entropy thresholding method

Recently, a two-dimensional （2-D） Tsallis entropy thresholding method has been proposed as a new method for image segmentation. But the computation complexity of 2-D Tsallis entropy is very large and becomes an obstacle to real time image processing systems. A fast recursive algorithm for 2-D Tsallis entropy thresholding is proposed. The key variables involved in calculating 2-D Tsallis entropy are written in recursive form. Thus, many repeating calculations are avoided and the computation complexity reduces to O（L2） from O（L4）. The effectiveness of the proposed algorithm is illustrated by experimental results.

Image Thresholding Using Two-Dimensional Tsallis Cross Entropy Based on Either Chaotic Particle Swarm Optimization or Decomposition

The segmentation effect of Tsallis entropy method is superior to that of Shannon entropy method, and the computation speed of two-dimensional Shannon cross entropy method can be further improved by optimization. The existing two-dimensional Tsallis cross entropy method is not the strict two-dimensional extension. Thus two new methods of image thresholding using two-dimensional Tsallis cross entropy based on either Chaotic Particle Swarm Optimization (CPSO) or decomposition are proposed. The former uses CPSO to find the optimal threshold. The recursive algorithm is adopted to avoid the repetitive computation of fitness function in iterative procedure. The computing speed is improved greatly. The latter converts the two-dimensional computation into two one-dimensional spaces, which makes the computational complexity further reduced from O(L2) to O(L). The experimental results show that, compared with the proposed recently two-dimensional Shannon or Tsallis cross entropy method, the two new methods can achieve superior segmentation results and reduce running time greatly.

ENTROPY TOLERANT FUZZY C-MEANS IN MEDICAL IMAGES

Segmenting the Dynamic Contrast-Enhanced Breast Magnetic Resonance Images(DCE-BMRI)is an extremely important task to diagnose the disease because it has the highest specificity when acquired with high temporal and spatial resolution and is also corrupted by heavy noise,outliers,and other imaging artifacts.In this paper,we intend to develop efficient robust segmentation algorithms based on fuzzy clustering approach for segmenting the DCE-BMRs.Our proposed segmentation algorithms have been amalgamated with effective kernel-induced distance measure on standard fuzzy c-means algorithm along with the spatial neighborhood information,entropy term,and tolerance vector into a fuzzy clustering structure for segmenting the DCE-BMRI.The significant feature of our proposed algorithms is its capability tofind the optimal membership grades and obtain effective cluster centers automatically by minimizing the proposed robust objective functions.Also,this article demonstrates the superiority of the proposed algorithms for segmenting DCE-BMRI in comparison with other recent kernel-based fuzzy c-means techniques.Finally the clustering accuracies of the proposed algorithms are validated by using silhouette method in comparison with existed fuzzy clustering algorithms.

Entropy-Based Global and Local Weight Adaptive Image Segmentation Models

This paper proposes a parameter adaptive hybrid model for image segmentation. The hybrid model combines the global and local information in an image, and provides an automated solution for adjusting the selection of the two weight parameters. Firstly, it combines an improved local model with the global Chan-Vese(CV) model, while the image’s local entropy is used to establish the index for measuring the image’s gray-level information. Parameter adjustment is then performed by the real-time acquisition of the ratio of the different functional energy in a self-adapting model responsive to gray-scale distribution in the image segmentation process.Compared with the traditional linear adjustment model, which is based on trial-and-error, this paper presents a more quantitative and intelligent method for achieving the dynamic nonlinear adjustment of global and local terms.Experiments show that the proposed model achieves fast and accurate segmentation for different types of noisy and non-uniform grayscale images and noise images. Moreover, the method demonstrates high stability and is insensitive to the position of the initial contour.

Using Entropy Based Mean Shift Filter and Modified Watershed Transform for Grain Segmentation

Life science research aims to continuously improve the quality and standard of human life. One of the major challenges in this area is to maintain food safety and security. A number of image processing techniques have been used to investigate the quality of food products. In this paper, we propose a new algorithm to effectively segment connected grains so that each of them can be inspected in a later processing stage. One family of the existing segmentation methods is based on the idea of watersheding, and it has shown promising results in practice. However, due to the over-segmentation issue, this technique has experienced poor performance in various applications, such as inhomogeneous background and connected targets. To solve this problem, we present a combination of two classical techniques to handle this issue. In the first step, a mean shift filter is used to eliminate the inhomogeneous background,where entropy is used to be a converging criterion. Secondly, a color gradient algorithm is used in order to detect the most significant edges, and a marked watershed transform is applied to segment cluttered objects out of the previous processing stages. The proposed framework is capable of compromising among execution time, usability, efficiency and segmentation outcome in analyzing ring die pellets. The experimental results demonstrate that the proposed approach is effectiveness and robust.