With respect to the gamma spectrum, the energy resolution improves with increase in energy. The counts of full energy peak change with energy, and this approximately complies with the Gaussian distribution. This study...With respect to the gamma spectrum, the energy resolution improves with increase in energy. The counts of full energy peak change with energy, and this approximately complies with the Gaussian distribution. This study mainly examines a method to deconvolve the LaBr_3:Ce gamma spectrum with a detector response matrix constructing algorithm based on energy resolution calibration.In the algorithm, the full width at half maximum(FWHM)of full energy peak was calculated by the cubic spline interpolation algorithm and calibrated by a square root of a quadratic function that changes with the energy. Additionally, the detector response matrix was constructed to deconvolve the gamma spectrum. Furthermore, an improved SNIP algorithm was proposed to eliminate the background. In the experiment, several independent peaks of ^(152)Eu,^(137)Cs, and ^(60)Co sources were detected by a LaBr_3:Ce scintillator that were selected to calibrate the energy resolution. The Boosted Gold algorithm was applied to deconvolve the gamma spectrum. The results showed that the peak position difference between the experiment and the deconvolution was within ± 2 channels and the relative error of peak area was approximately within 0.96–6.74%. Finally, a ^(133) Ba spectrum was deconvolved to verify the efficiency and accuracy of the algorithm in unfolding the overlapped peaks.展开更多
Orebody-rendering techniques are developed using the marching cubes (MC) algorithm. The shape of an orebody is viv- idly displayed in real time and can be used to guide mining design as well. The MC algorithm has been...Orebody-rendering techniques are developed using the marching cubes (MC) algorithm. The shape of an orebody is viv- idly displayed in real time and can be used to guide mining design as well. The MC algorithm has been improved in two aspects. By analyzing the principles of the MC algorithm, as well as the features of the specific application, improvements were developed to: eliminate ambiguities by using a unified isosurface constructing method in the voxels, and improve the operating efficiency of the MC algorithm by incorporating an octree structure. The analytical results of the examples demonstrate the effectiveness of our proposal.展开更多
Based on some analyses of existing chaotic image encryption frameworks and a new designed three-dimensional improved logistic chaotic map(3D-ILM),an asymmetric image encryption algorithm using public-key Rivest–Shami...Based on some analyses of existing chaotic image encryption frameworks and a new designed three-dimensional improved logistic chaotic map(3D-ILM),an asymmetric image encryption algorithm using public-key Rivest–Shamir–Adleman(RSA)is presented in this paper.In the first stage,a new 3D-ILM is proposed to enhance the chaotic behavior considering analysis of time sequence,Lyapunov exponent,and Shannon entropy.In the second stage,combined with the public key RSA algorithm,a new key acquisition mathematical model(MKA)is constructed to obtain the initial keys for the 3D-ILM.Consequently,the key stream can be produced depending on the plain image for a higher security.Moreover,a novel process model(NPM)for the input of the 3D-ILM is built,which is built to improve the distribution uniformity of the chaotic sequence.In the third stage,to encrypt the plain image,a pre-process by exclusive OR(XOR)operation with a random matrix is applied.Then,the pre-processed image is performed by a permutation for rows,a downward modulo function for adjacent pixels,a permutation for columns,a forward direction XOR addition-modulo diffusion,and a backward direction XOR addition-modulo diffusion to achieve the final cipher image.Moreover,experiments show that the the proposed algorithm has a better performance.Especially,the number of pixels change rate(NPCR)is close to ideal case 99.6094%,with the unified average changing intensity(UACI)close to 33.4634%,and the information entropy(IE)close to 8.展开更多
The ID3 algorithm is a classical learning algorithm of decision tree in data mining.The algorithm trends to choosing the attribute with more values,affect the efficiency of classification and prediction for building a...The ID3 algorithm is a classical learning algorithm of decision tree in data mining.The algorithm trends to choosing the attribute with more values,affect the efficiency of classification and prediction for building a decision tree.This article proposes a new approach based on an improved ID3 algorithm.The new algorithm introduces the importance factor λ when calculating the information entropy.It can strengthen the label of important attributes of a tree and reduce the label of non-important attributes.The algorithm overcomes the flaw of the traditional ID3 algorithm which tends to choose the attributes with more values,and also improves the efficiency and flexibility in the process of generating decision trees.展开更多
This paper describes a novel algorithm for fragile watermarking of 3D models. Fragile watermarking requires detection of even minute intentional changes to the 3D model along with the location of the change. This pose...This paper describes a novel algorithm for fragile watermarking of 3D models. Fragile watermarking requires detection of even minute intentional changes to the 3D model along with the location of the change. This poses a challenge since inserting random amount of watermark in all the vertices of the model would generally introduce perceptible distortion. The proposed algorithm overcomes this challenge by using genetic algorithm to modify every vertex location in the model so that there is no perceptible distortion. Various experimental results are used to justify the choice of the genetic algorithm design parameters. Experimental results also indicate that the proposed algorithm can accurately detect location of any mesh modification.展开更多
基金supported by the National Natural Science Foundation of China(Nos.41374130 and 41604154)
文摘With respect to the gamma spectrum, the energy resolution improves with increase in energy. The counts of full energy peak change with energy, and this approximately complies with the Gaussian distribution. This study mainly examines a method to deconvolve the LaBr_3:Ce gamma spectrum with a detector response matrix constructing algorithm based on energy resolution calibration.In the algorithm, the full width at half maximum(FWHM)of full energy peak was calculated by the cubic spline interpolation algorithm and calibrated by a square root of a quadratic function that changes with the energy. Additionally, the detector response matrix was constructed to deconvolve the gamma spectrum. Furthermore, an improved SNIP algorithm was proposed to eliminate the background. In the experiment, several independent peaks of ^(152)Eu,^(137)Cs, and ^(60)Co sources were detected by a LaBr_3:Ce scintillator that were selected to calibrate the energy resolution. The Boosted Gold algorithm was applied to deconvolve the gamma spectrum. The results showed that the peak position difference between the experiment and the deconvolution was within ± 2 channels and the relative error of peak area was approximately within 0.96–6.74%. Finally, a ^(133) Ba spectrum was deconvolved to verify the efficiency and accuracy of the algorithm in unfolding the overlapped peaks.
基金Projects 20020008006 supported by the Exclusive Research Foundation for Doctoral Programs by Ministry of Education of China2006BAK04B04 by the National Key Project of Scientific and Technical Supporting Programs Funded by Ministry of Science & Technology of China
文摘Orebody-rendering techniques are developed using the marching cubes (MC) algorithm. The shape of an orebody is viv- idly displayed in real time and can be used to guide mining design as well. The MC algorithm has been improved in two aspects. By analyzing the principles of the MC algorithm, as well as the features of the specific application, improvements were developed to: eliminate ambiguities by using a unified isosurface constructing method in the voxels, and improve the operating efficiency of the MC algorithm by incorporating an octree structure. The analytical results of the examples demonstrate the effectiveness of our proposal.
基金the National Natural Science Foundation of China(Grant No.61972103)the Natural Science Foundation of Guangdong Province of China(Grant No.2023A1515011207)+3 种基金the Special Project in Key Area of General University in Guangdong Province of China(Grant No.2020ZDZX3064)the Characteristic Innovation Project of General University in Guangdong Province of China(Grant No.2022KTSCX051)the Postgraduate Education Innovation Project of Guangdong Ocean University of China(Grant No.202263)the Foundation of Guangdong Provincial Engineering and Technology Research Center of Far Sea Fisheries Management and Fishing of South China Sea.
文摘Based on some analyses of existing chaotic image encryption frameworks and a new designed three-dimensional improved logistic chaotic map(3D-ILM),an asymmetric image encryption algorithm using public-key Rivest–Shamir–Adleman(RSA)is presented in this paper.In the first stage,a new 3D-ILM is proposed to enhance the chaotic behavior considering analysis of time sequence,Lyapunov exponent,and Shannon entropy.In the second stage,combined with the public key RSA algorithm,a new key acquisition mathematical model(MKA)is constructed to obtain the initial keys for the 3D-ILM.Consequently,the key stream can be produced depending on the plain image for a higher security.Moreover,a novel process model(NPM)for the input of the 3D-ILM is built,which is built to improve the distribution uniformity of the chaotic sequence.In the third stage,to encrypt the plain image,a pre-process by exclusive OR(XOR)operation with a random matrix is applied.Then,the pre-processed image is performed by a permutation for rows,a downward modulo function for adjacent pixels,a permutation for columns,a forward direction XOR addition-modulo diffusion,and a backward direction XOR addition-modulo diffusion to achieve the final cipher image.Moreover,experiments show that the the proposed algorithm has a better performance.Especially,the number of pixels change rate(NPCR)is close to ideal case 99.6094%,with the unified average changing intensity(UACI)close to 33.4634%,and the information entropy(IE)close to 8.
文摘The ID3 algorithm is a classical learning algorithm of decision tree in data mining.The algorithm trends to choosing the attribute with more values,affect the efficiency of classification and prediction for building a decision tree.This article proposes a new approach based on an improved ID3 algorithm.The new algorithm introduces the importance factor λ when calculating the information entropy.It can strengthen the label of important attributes of a tree and reduce the label of non-important attributes.The algorithm overcomes the flaw of the traditional ID3 algorithm which tends to choose the attributes with more values,and also improves the efficiency and flexibility in the process of generating decision trees.
文摘This paper describes a novel algorithm for fragile watermarking of 3D models. Fragile watermarking requires detection of even minute intentional changes to the 3D model along with the location of the change. This poses a challenge since inserting random amount of watermark in all the vertices of the model would generally introduce perceptible distortion. The proposed algorithm overcomes this challenge by using genetic algorithm to modify every vertex location in the model so that there is no perceptible distortion. Various experimental results are used to justify the choice of the genetic algorithm design parameters. Experimental results also indicate that the proposed algorithm can accurately detect location of any mesh modification.
