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.

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.

Two-Dimensional Perovskite Single Crystals for High-Performance X-ray Imaging and Exploring MeV X-ray Detection

Scintillation semiconductors play increasingly important medical diagnosis and industrial inspection roles.Recently,two-dimensional(2D)perovskites have been shown to be promising materials for medical X-ray imaging,but they are mostly used in low-energy(≤130 keV)regions.Direct detection of MeV X-rays,which ensure thorough penetration of the thick shell walls of containers,trucks,and aircraft,is also highly desired in practical industrial applications.Unfortunately,scintillation semiconductors for high-energy X-ray detection are currently scarce.Here,This paper reports a 2D(C_(4)H_(9)NH_(3))_(2)PbBr_(4)single crystal with outstanding sensitivity and stability toward X-ray radiation that provides an ultra-wide detectable X-ray range of between 8.20 nGy_(air)s^(-1)(50 keV)and 15.24 mGy_(air)s^(-1)(9 MeV).The(C_(4)H_(9)NH_(3))_(2)PbBr_(4)single-crystal detector with a vertical structure is used for high-performance X-ray imaging,delivering a good spatial resolution of 4.3 Ip mm^(-1)in a plane-scan imaging system.Low ionic migration in the 2D perovskite enables the vertical device to be operated with hundreds of keV to MeV X-ray radiation at high bias voltages,leading to a sensitivity of 46.90μC Gy_(air)-1 cm^(-2)(-1.16 Vμm^(-1))with 9 MeV X-ray radiation,demonstrating that 2D perovskites have enormous potential for high-energy industrial applications.

Using Cross Entropy as a Performance Metric for Quantifying Uncertainty in DNN Image Classifiers: An Application to Classification of Lung Cancer on CT Images

Cross entropy is a measure in machine learning and deep learning that assesses the difference between predicted and actual probability distributions. In this study, we propose cross entropy as a performance evaluation metric for image classifier models and apply it to the CT image classification of lung cancer. A convolutional neural network is employed as the deep neural network (DNN) image classifier, with the residual network (ResNet) 50 chosen as the DNN archi-tecture. The image data used comprise a lung CT image set. Two classification models are built from datasets with varying amounts of data, and lung cancer is categorized into four classes using 10-fold cross-validation. Furthermore, we employ t-distributed stochastic neighbor embedding to visually explain the data distribution after classification. Experimental results demonstrate that cross en-tropy is a highly useful metric for evaluating the reliability of image classifier models. It is noted that for a more comprehensive evaluation of model perfor-mance, combining with other evaluation metrics is considered essential. .

New two-dimensional fuzzy C-means clustering algorithm for image segmentation

To solve the problem of poor anti-noise performance of the traditional fuzzy C-means (FCM) algorithm in image segmentation, a novel two-dimensional FCM clustering algorithm for image segmentation was proposed. In this method, the image segmentation was converted into an optimization problem. The fitness function containing neighbor information was set up based on the gray information and the neighbor relations between the pixels described by the improved two-dimensional histogram. By making use of the global searching ability of the predator-prey particle swarm optimization, the optimal cluster center could be obtained by iterative optimization, and the image segmentation could be accomplished. The simulation results show that the segmentation accuracy ratio of the proposed method is above 99%. The proposed algorithm has strong anti-noise capability, high clustering accuracy and good segment effect, indicating that it is an effective algorithm for image segmentation.

Image encryption technique based on new two-dimensional fractional-order discrete chaotic map and Menezes–Vanstone elliptic curve cryptosystem

We propose a new fractional two-dimensional triangle function combination discrete chaotic map(2D-TFCDM)with the discrete fractional difference.Moreover,the chaos behaviors of the proposed map are observed and the bifurcation diagrams,the largest Lyapunov exponent plot,and the phase portraits are derived,respectively.Finally,with the secret keys generated by Menezes-Vanstone elliptic curve cryptosystem,we apply the discrete fractional map into color image encryption.After that,the image encryption algorithm is analyzed in four aspects and the result indicates that the proposed algorithm is more superior than the other algorithms.

An Analysis of Two-Dimensional Image Data Using a Grouping Estimator

Machine learning methods, one type of methods used in artificial intelligence, are now widely used to analyze two-dimensional (2D) images in various fields. In these analyses, estimating the boundary between two regions is basic but important. If the model contains stochastic factors such as random observation errors, determining the boundary is not easy. When the probability distributions are mis-specified, ordinal methods such as probit and logit maximum likelihood estimators (MLE) have large biases. The grouping estimator is a semiparametric estimator based on the grouping of data that does not require specific probability distributions. For 2D images, the grouping is simple. Monte Carlo experiments show that the grouping estimator clearly improves the probit MLE in many cases. The grouping estimator essentially makes the resolution density lower, and the present findings imply that methods using low-resolution image analyses might not be the proper ones in high-density image analyses. It is necessary to combine and compare the results of high- and low-resolution image analyses. The grouping estimator may provide theoretical justifications for such analysis.

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.

Early prediction of myocardial viability after acute myocardial infarction by two-dimensional speckle tracking imaging

Background Identifying the transmural extent of myocardial necrosis and the degree of myocardial viability in acute myocardial infarction （AMI） is important clinically. The aim of this study was to assess myocardial viability using two-dimensional speckle tracking imaging （2D-STI） in patients with AMI. Methods 2D-STI was performed at initial presentation, three days, and six months after primary percutaneous coronary intervention （PCI） in 30 patients with AMI, who had a left anterior descending coronary artery （LAD） culprit lesion. In addition, 20 patients who had minimal stenotic lesions （〈 30% stenosis） on coronary angiography were also included in the control group. At six months dobutamine echocardiography was performed for viability assessment in seven segments of the LAD territory. According to the recovery of wall motion abnormality, segments were classified as viable or non-viable. Results A total of 131 segments were viable, and 44 were nonviable. Multivariate analysis revealed significant differences between the viable and nonviable segments in the peak systolic strain, the peak systolic strain rate at initial presentation, and peak systolic strain rate three days after primary PCI. Among these, the initial peak systolic strain rate had the highest predictive value for myocardial viability （hazard ratio： 31.22, P 〈 0.01）. Conclusions 2D-STI is feasible for assessing myocardial viability, and the peak systolic strain rate might be the most reliable predictor of myocardial viability in patients with AMI.

Adaptive image enhancement algorithm based on fuzzy entropy and human visual characteristics

To overcome the shortcomings of the Lee image enhancement algorithm and its improvement based on the logarithmic image processing(LIP) model, this paper proposes what we believe to be an effective image enhancement algorithm. This algorithm introduces fuzzy entropy, makes full use of neighborhood information, fuzzy information and human visual characteristics.To enhance an image, this paper first carries out the reasonable fuzzy-3 partition of its histogram into the dark region, intermediate region and bright region. It then extracts the statistical characteristics of the three regions and adaptively selects the parameter αaccording to the statistical characteristics of the image’s gray-scale values. It also adds a useful nonlinear transform, thus increasing the ubiquity of the algorithm. Finally, the causes for the gray-scale value overcorrection that occurs in the traditional image enhancement algorithms are analyzed and their solutions are proposed.The simulation results show that our image enhancement algorithm can effectively suppress the noise of an image, enhance its contrast and visual effect, sharpen its edge and adjust its dynamic range.

MAXIMUM ENTROPY RESTORATION METHOD OF LINEARLY DEGRADED BINARY IMAGE

This paper investigates the maximum entropy restoration of blurred binary image.In concerning with the binary property of image,a new maximum entropy restoration methodwith binary constraint is proposed.The properties of existence and uniqueness of solution arediscussed.The problem of maximum of entropy with two constraints is solved and the corre-sponding algorithm is given.In this paper,the maximum bounded entropy principle is employedconcerning the prior knowledge of binary image,and the maximum bounded entropy restora-tion method with binary constraint is put forward.The proposes methods,Wiener filter(WF)restoration method and maximum entropy restoration method are compared.The experimen-tal results show that the maximum entropy restoration method and maximum bounded entropyrestoration method with binary constraint can improve the quality of restored image.

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.

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.

A color image encryption scheme based on a 2D coupled chaotic system and diagonal scrambling algorithm

A novel color image encryption scheme is developed to enhance the security of encryption without increasing the complexity. Firstly, the plain color image is decomposed into three grayscale plain images, which are converted into the frequency domain coefficient matrices(FDCM) with discrete cosine transform(DCT) operation. After that, a twodimensional(2D) coupled chaotic system is developed and used to generate one group of embedded matrices and another group of encryption matrices, respectively. The embedded matrices are integrated with the FDCM to fulfill the frequency domain encryption, and then the inverse DCT processing is implemented to recover the spatial domain signal. Eventually,under the function of the encryption matrices and the proposed diagonal scrambling algorithm, the final color ciphertext is obtained. The experimental results show that the proposed method can not only ensure efficient encryption but also satisfy various sizes of image encryption. Besides, it has better performance than other similar techniques in statistical feature analysis, such as key space, key sensitivity, anti-differential attack, information entropy, noise attack, etc.

2-D mini mumfuzzy entropy method of image thresholding based on genetic algorithm

A new image thresholding method is introduced, which is based on 2-D histgram and minimizing the measures of fuzziness of an input image. A new definition of fuzzy membership function is proposed, it denotes the characteristic relationship between the gray level of each pixel and the average value of its neighborhood. When the threshold is not located at the obvious and deep valley of the histgram, genetic algorithm is devoted to the problem of selecting the appropriate threshold value. The experimental results indicate that the proposed method has good performance.

Image Splicing Detection Based on Texture Features with Fractal Entropy

Over the past years,image manipulation tools have become widely accessible and easier to use,which made the issue of image tampering far more severe.As a direct result to the development of sophisticated image-editing applications,it has become near impossible to recognize tampered images with naked eyes.Thus,to overcome this issue,computer techniques and algorithms have been developed to help with the identification of tampered images.Research on detection of tampered images still carries great challenges.In the present study,we particularly focus on image splicing forgery,a type of manipulation where a region of an image is transposed onto another image.The proposed study consists of four features extraction stages used to extract the important features from suspicious images,namely,Fractal Entropy(FrEp),local binary patterns(LBP),Skewness,and Kurtosis.The main advantage of FrEp is the ability to extract the texture information contained in the input image.Finally,the“support vector machine”(SVM)classification is used to classify images into either spliced or authentic.Comparative analysis shows that the proposed algorithm performs better than recent state-of-the-art of splicing detection methods.Overall,the proposed algorithm achieves an ideal balance between performance,accuracy,and efficacy,which makes it suitable for real-world applications.

k-NN Based Bypass Entropy and Mutual Information Estimation for Incremental Remote-Sensing Image Compressibility Evaluation

Incremental image compression techniques using priori information are of significance to deal with the explosively increasing remote-sensing image data. However, the potential benefi ts of priori information are still to be evaluated quantitatively for effi cient compression scheme designing. In this paper, we present a k-nearest neighbor(k-NN) based bypass image entropy estimation scheme, together with the corresponding mutual information estimation method. Firstly, we apply the k-NN entropy estimation theory to split image blocks, describing block-wise intra-frame spatial correlation while avoiding the curse of dimensionality. Secondly, we propose the corresponding mutual information estimator based on feature-based image calibration and straight-forward correlation enhancement. The estimator is designed to evaluate the compression performance gain of using priori information. Numerical results on natural and remote-sensing images show that the proposed scheme obtains an estimation accuracy gain by 10% compared with conventional image entropy estimators. Furthermore, experimental results demonstrate both the effectiveness of the proposed mutual information evaluation scheme, and the quantitative incremental compressibility by using the priori remote-sensing frames.

A Method of Using Information Entropy of an Image as an Effective Feature for Com-puter-Aided Diagnostic Applications

Computer-aided detection and diagnosis (CAD) systems are increasingly being used as an aid by clinicians for detection and interpretation of diseases. In general, a CAD system employs a classifier to detect or distinguish between abnormal and normal tissues on images. In the phase of classification, a set of image features and/or texture features extracted from the images are commonly used. In this article, we investigated the characteristic of the output entropy of an image and demonstrated the usefulness of the output entropy acting as a texture feature in CAD systems. In order to validate the effectiveness and superiority of the output-entropy-based texture feature, two well-known texture features, i.e., mean and standard deviation were used for comparison. The database used in this study comprised 50 CT images obtained from 10 patients with pulmonary nodules, and 50 CT images obtained from 5 normal subjects. We used a support vector machine for classification. A leave-one-out method was employed for training and classification. Three combinations of texture features, i.e., mean and entropy, standard deviation and entropy, and standard deviation and mean were used as the inputs to the classifier. Three different regions of interest (ROI) sizes, i.e., 11 × 11, 9 × 9 and 7 × 7 pixels from the database were selected for computation of the feature values. Our experimental results show that the combination of entropy and standard deviation is significantly better than both the combination of mean and entropy and that of standard deviation and mean in the case of the ROI size of 11 × 11 pixels (p < 0.05). These results suggest that information entropy of an image can be used as an effective feature for CAD applications.

The Study of Image Segmentation Based on the Combination of the Wavelet Multi-scale Edge Detection and the Entropy Iterative Threshold Selection

This paper proposes an image segmentation method based on the combination of the wavelet multi-scale edge detection and the entropy iterative threshold selection.Image for segmentation is divided into two parts by high- and low-frequency.In the high-frequency part the wavelet multiscale was used for the edge detection,and the low-frequency part conducted on segmentation using the entropy iterative threshold selection method.Through the consideration of the image edge and region,a CT image of the thorax was chosen to test the proposed method for the segmentation of the lungs.Experimental results show that the method is efficient to segment the interesting region of an image compared with conventional methods.