In this paper,we propose a new full-Newton step feasible interior-point algorithm for the special weighted linear complementarity problems.The proposed algorithm employs the technique of algebraic equivalent transform...In this paper,we propose a new full-Newton step feasible interior-point algorithm for the special weighted linear complementarity problems.The proposed algorithm employs the technique of algebraic equivalent transformation to derive the search direction.It is shown that the proximity measure reduces quadratically at each iteration.Moreover,the iteration bound of the algorithm is as good as the best-known polynomial complexity for these types of problems.Furthermore,numerical results are presented to show the efficiency of the proposed algorithm.展开更多
Lots of noises and heterogeneous objects with various sizes coexist in a complex image,such as an ore image;the classical image thresholding method cannot effectively distinguish between ores.To segment ore objects wi...Lots of noises and heterogeneous objects with various sizes coexist in a complex image,such as an ore image;the classical image thresholding method cannot effectively distinguish between ores.To segment ore objects with various sizes simultaneously,two adaptive windows in the image were chosen for each pixel;the gray value of windows was calculated by Otsu＇s threshold method.To extract the object skeleton,the definition principle of distance transformation templates was proposed.The ores linked together in a binary image were separated by distance transformation and gray reconstruction.The seed region of each object was picked up from the local maximum gray region of the reconstruction image.Starting from these seed regions,the watershed method was used to segment ore object effectively.The proposed algorithm marks and segments most objects from complex images precisely.展开更多
A new algorithm for clipping line segments by a rectangular window on rectangular coordinate system is presented in this paper. The algorithm is very different to the other line clipping algorithms. For the line segme...A new algorithm for clipping line segments by a rectangular window on rectangular coordinate system is presented in this paper. The algorithm is very different to the other line clipping algorithms. For the line segments that cannot be identified as completely inside or outside the window by simple testings, this algorithm applies affine transformations (the shearing transformations) to the line segments and the window, and changes the slopes of the line segments and the shape of the window. Thus, it is clear for the line segment to be outside or inside of the window. If the line segments intersect the window, the algorithm immediately (no solving equations) gets the intersection points. Having applied the inverse transformations to the intersection points, the algorithm has the final results. The algorithm is successful to avoid the complex classifications and computations. Besides, the algorithm is effective to simplify the processes of finding the intersection points. Comparing to some classical algorithms, the algorithm of this paper is faster for clipping line segments and more efficient for calculations.展开更多
Ensuring digital media security through robust image watermarking is essential to prevent unauthorized distribution,tampering,and copyright infringement.This study introduces a novel hybrid watermarking framework that...Ensuring digital media security through robust image watermarking is essential to prevent unauthorized distribution,tampering,and copyright infringement.This study introduces a novel hybrid watermarking framework that integrates Discrete Wavelet Transform(DWT),Redundant Discrete Wavelet Transform(RDWT),and Möbius Transformations(MT),with optimization of transformation parameters achieved via a Genetic Algorithm(GA).By combining frequency and spatial domain techniques,the proposed method significantly enhances both the imper-ceptibility and robustness of watermark embedding.The approach leverages DWT and RDWT for multi-resolution decomposition,enabling watermark insertion in frequency subbands that balance visibility and resistance to attacks.RDWT,in particular,offers shift-invariance,which improves performance under geometric transformations.Möbius transformations are employed for spatial manipulation,providing conformal mapping and spatial dispersion that fortify watermark resilience against rotation,scaling,and translation.The GA dynamically optimizes the Möbius parameters,selecting configurations that maximize robustness metrics such as Peak Signal-to-Noise Ratio(PSNR),Structural Similarity Index Measure(SSIM),Bit Error Rate(BER),and Normalized Cross-Correlation(NCC).Extensive experiments conducted on medical and standard benchmark images demonstrate the efficacy of the proposed RDWT-MT scheme.Results show that PSNR exceeds 68 dB,SSIM approaches 1.0,and BER remains at 0.0000,indicating excellent imperceptibility and perfect watermark recovery.Moreover,the method exhibits exceptional resilience to a wide range of image processing attacks,including Gaussian noise,JPEG compression,histogram equalization,and cropping,achieving NCC values close to or equal to 1.0.Comparative evaluations with state-of-the-art watermarking techniques highlight the superiority of the proposed method in terms of robustness,fidelity,and computational efficiency.The hybrid framework ensures secure,adaptive watermark embedding,making it highly suitable for applications in digital rights management,content authentication,and medical image protection.The integration of spatial and frequency domain features with evolutionary optimization presents a promising direction for future watermarking technologies.展开更多
The Birkhoff systems are the generalization of the Hamiltonian systems. Generalized canonical transformations are studied. The symplectic algorithm of the Hamiltonian systems is extended into that of the Birkhofflan s...The Birkhoff systems are the generalization of the Hamiltonian systems. Generalized canonical transformations are studied. The symplectic algorithm of the Hamiltonian systems is extended into that of the Birkhofflan systems. Symplectic differential scheme of autonomous Birkhoffian systems vas structured and discussed by introducing the Kailey Transformation.展开更多
The occurrence of microseismic is not random but is related to the physical properties of the underground medium.Due to the low intensity and the influence of noise,microseismic eventually lead to poor signal-to-noise...The occurrence of microseismic is not random but is related to the physical properties of the underground medium.Due to the low intensity and the influence of noise,microseismic eventually lead to poor signal-to-noise ratio.We proposed a method for automatic detection of microseismic events by adoption of multiscale top-hat transformation.The method is based on the difference between the signal and noise in the multiscale top-hat transform section and achieves the detection on a specific section.The microseismic data are decomposed into different scales by multiscale morphology top-hat transformation firstly.Then the potential microseismic events could be detected by picking up the peak value in the multiscale top-hat section,and the characteristic profile obtains the start point with a specific threshold value.Finally,the synthetic data experiences demonstrate the advantages of this method under strong and weak noisy conditions,and the filed data example also shows its reliability and adaptability.展开更多
In this paper, we present a novel and efficient method for the design of a sharp, two dimensional (2D) wideband, circularly symmetric, FIR filter. First of all, a sharp one dimensional (1D) infinite precision FIR filt...In this paper, we present a novel and efficient method for the design of a sharp, two dimensional (2D) wideband, circularly symmetric, FIR filter. First of all, a sharp one dimensional (1D) infinite precision FIR filter is designed using the Frequency Response Masking (FRM) technique. This filter is converted into a multiplier-less filter by representing it in the Canonic Signed Digit (CSD) space. The design of the FRM filter in the CSD space calls for the use of a discrete optimization technique. To this end, a new optimization approach is proposed using a modified Harmony Search Algorithm (HSA). HSA is modified in such a way that, in every exploitation and exploration phase, the candidate solutions turns out to be integers. The 1D FRM multiplier-less filter, is in turn transformed to the 2D equivalent using the recently proposed multiplier-less transformations namely, T1 and T2. These transformations are successful in generating circular contours even for wideband filters. Since multipliers are the most power consuming elements in a 2D filter, the multiplier-less realization calls for reduced power consumption as well as computation time. Significant reduction in the computational complexity and computation time are the highlights of our proposed design technique. Besides, the proposed discrete optimization using modified HSA can be used to solve optimization problems in other engineering disciplines, where the search space consists of integers.展开更多
Low-light image enhancement aims to improve the visibility of severely degraded images captured under insufficient illumination,alleviating the adverse effects of illumination degradation on image quality.Traditional ...Low-light image enhancement aims to improve the visibility of severely degraded images captured under insufficient illumination,alleviating the adverse effects of illumination degradation on image quality.Traditional Retinex-based approaches,inspired by human visual perception of brightness and color,decompose an image into illumination and reflectance components to restore fine details.However,their limited capacity for handling noise and complex lighting conditions often leads to distortions and artifacts in the enhanced results,particularly under extreme low-light scenarios.Although deep learning methods built upon Retinex theory have recently advanced the field,most still suffer frominsufficient interpretability and sub-optimal enhancement performance.This paper presents RetinexWT,a novel framework that tightly integrates classical Retinex theory with modern deep learning.Following Retinex principles,RetinexWT employs wavelet transforms to estimate illumination maps for brightness adjustment.A detail-recovery module that synergistically combines Vision Transformer(ViT)and wavelet transforms is then introduced to guide the restoration of lost details,thereby improving overall image quality.Within the framework,wavelet decomposition splits input features into high-frequency and low-frequency components,enabling scale-specific processing of global illumination/color cues and fine textures.Furthermore,a gating mechanism selectively fuses down-sampled and up-sampled features,while an attention-based fusion strategy enhances model interpretability.Extensive experiments on the LOL dataset demonstrate that RetinexWT surpasses existing Retinex-oriented deeplearning methods,achieving an average Peak Signal-to-Noise Ratio(PSNR)improvement of 0.22 dB over the current StateOfTheArt(SOTA),thereby confirming its superiority in low-light image enhancement.Code is available at https://github.com/CHEN-hJ516/RetinexWT(accessed on 14 October 2025).展开更多
Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting incr...Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting increased interest in swarm intelligence algorithms.Among these,the Cuckoo Search(CS)algorithm stands out for its promising global search capabilities.However,it often suffers from premature convergence when tackling complex problems.To address this limitation,this paper proposes a Grouped Dynamic Adaptive CS(GDACS)algorithm.Theenhancements incorporated intoGDACS can be summarized into two key aspects.Firstly,a chaotic map is employed to generate initial solutions,leveraging the inherent randomness of chaotic sequences to ensure a more uniform distribution across the search space and enhance population diversity from the outset.Secondly,Cauchy and Levy strategies replace the standard CS population update.This strategy involves evaluating the fitness of candidate solutions to dynamically group the population based on performance.Different step-size adaptation strategies are then applied to distinct groups,enabling an adaptive search mechanism that balances exploration and exploitation.Experiments were conducted on six benchmark functions and four constrained engineering design problems,and the results indicate that the proposed GDACS achieves good search efficiency and produces more accurate optimization results compared with other state-of-the-art algorithms.展开更多
To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform （STFT） is brought forward. ...To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform （STFT） is brought forward. First the physical essence of aliasing that occurs is analyzed; second the interpolation algorithm model is setup based on the Hamming window; then the fast implementation of the algorithm using the Newton iteration method is given. Using the numerical simulation the feasibility of algorithm is validated. Finally, the electrical circuit experiment shows the practicality of the algorithm in the electrical engineering.展开更多
A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low freq...A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low frequency image and several high frequency images, and the scale-invariant feature transform is employed to extract feature points from the low frequency im- age. A proximity matrix is constructed for the feature points of two related images. By singular value decomposition of the proximity matrix, a matching matrix （or matching result） reflecting the match- ing degree among feature points is obtained. Experimental results indicate that the proposed algorithm can reduce time complexity and possess a higher accuracy.展开更多
基金Supported by the Optimisation Theory and Algorithm Research Team(Grant No.23kytdzd004)University Science Research Project of Anhui Province(Grant No.2024AH050631)the General Programs for Young Teacher Cultivation of Educational Commission of Anhui Province(Grant No.YQYB2023090).
文摘In this paper,we propose a new full-Newton step feasible interior-point algorithm for the special weighted linear complementarity problems.The proposed algorithm employs the technique of algebraic equivalent transformation to derive the search direction.It is shown that the proximity measure reduces quadratically at each iteration.Moreover,the iteration bound of the algorithm is as good as the best-known polynomial complexity for these types of problems.Furthermore,numerical results are presented to show the efficiency of the proposed algorithm.
基金supported by the National Key Technologies R & D Program of China (No.2009BAB48B02)the National High-Tech Research and Development Program of China (Nos.2010AA060278600 and 2008AA062101)
文摘Lots of noises and heterogeneous objects with various sizes coexist in a complex image,such as an ore image;the classical image thresholding method cannot effectively distinguish between ores.To segment ore objects with various sizes simultaneously,two adaptive windows in the image were chosen for each pixel;the gray value of windows was calculated by Otsu＇s threshold method.To extract the object skeleton,the definition principle of distance transformation templates was proposed.The ores linked together in a binary image were separated by distance transformation and gray reconstruction.The seed region of each object was picked up from the local maximum gray region of the reconstruction image.Starting from these seed regions,the watershed method was used to segment ore object effectively.The proposed algorithm marks and segments most objects from complex images precisely.
文摘A new algorithm for clipping line segments by a rectangular window on rectangular coordinate system is presented in this paper. The algorithm is very different to the other line clipping algorithms. For the line segments that cannot be identified as completely inside or outside the window by simple testings, this algorithm applies affine transformations (the shearing transformations) to the line segments and the window, and changes the slopes of the line segments and the shape of the window. Thus, it is clear for the line segment to be outside or inside of the window. If the line segments intersect the window, the algorithm immediately (no solving equations) gets the intersection points. Having applied the inverse transformations to the intersection points, the algorithm has the final results. The algorithm is successful to avoid the complex classifications and computations. Besides, the algorithm is effective to simplify the processes of finding the intersection points. Comparing to some classical algorithms, the algorithm of this paper is faster for clipping line segments and more efficient for calculations.
文摘Ensuring digital media security through robust image watermarking is essential to prevent unauthorized distribution,tampering,and copyright infringement.This study introduces a novel hybrid watermarking framework that integrates Discrete Wavelet Transform(DWT),Redundant Discrete Wavelet Transform(RDWT),and Möbius Transformations(MT),with optimization of transformation parameters achieved via a Genetic Algorithm(GA).By combining frequency and spatial domain techniques,the proposed method significantly enhances both the imper-ceptibility and robustness of watermark embedding.The approach leverages DWT and RDWT for multi-resolution decomposition,enabling watermark insertion in frequency subbands that balance visibility and resistance to attacks.RDWT,in particular,offers shift-invariance,which improves performance under geometric transformations.Möbius transformations are employed for spatial manipulation,providing conformal mapping and spatial dispersion that fortify watermark resilience against rotation,scaling,and translation.The GA dynamically optimizes the Möbius parameters,selecting configurations that maximize robustness metrics such as Peak Signal-to-Noise Ratio(PSNR),Structural Similarity Index Measure(SSIM),Bit Error Rate(BER),and Normalized Cross-Correlation(NCC).Extensive experiments conducted on medical and standard benchmark images demonstrate the efficacy of the proposed RDWT-MT scheme.Results show that PSNR exceeds 68 dB,SSIM approaches 1.0,and BER remains at 0.0000,indicating excellent imperceptibility and perfect watermark recovery.Moreover,the method exhibits exceptional resilience to a wide range of image processing attacks,including Gaussian noise,JPEG compression,histogram equalization,and cropping,achieving NCC values close to or equal to 1.0.Comparative evaluations with state-of-the-art watermarking techniques highlight the superiority of the proposed method in terms of robustness,fidelity,and computational efficiency.The hybrid framework ensures secure,adaptive watermark embedding,making it highly suitable for applications in digital rights management,content authentication,and medical image protection.The integration of spatial and frequency domain features with evolutionary optimization presents a promising direction for future watermarking technologies.
基金Foundation items:the National Natural Science Foundation of Cina(19990510)Planed item for distinguished teacher invested by Ministry of Education PRC
文摘The Birkhoff systems are the generalization of the Hamiltonian systems. Generalized canonical transformations are studied. The symplectic algorithm of the Hamiltonian systems is extended into that of the Birkhofflan systems. Symplectic differential scheme of autonomous Birkhoffian systems vas structured and discussed by introducing the Kailey Transformation.
基金supported in part by the National Natural Science Foundation of China under Grant 41904098Fundamental Research Funds for the Central Universities,under Grant 2462018YJRC020 and Grant 2462020YXZZ006。
文摘The occurrence of microseismic is not random but is related to the physical properties of the underground medium.Due to the low intensity and the influence of noise,microseismic eventually lead to poor signal-to-noise ratio.We proposed a method for automatic detection of microseismic events by adoption of multiscale top-hat transformation.The method is based on the difference between the signal and noise in the multiscale top-hat transform section and achieves the detection on a specific section.The microseismic data are decomposed into different scales by multiscale morphology top-hat transformation firstly.Then the potential microseismic events could be detected by picking up the peak value in the multiscale top-hat section,and the characteristic profile obtains the start point with a specific threshold value.Finally,the synthetic data experiences demonstrate the advantages of this method under strong and weak noisy conditions,and the filed data example also shows its reliability and adaptability.
文摘In this paper, we present a novel and efficient method for the design of a sharp, two dimensional (2D) wideband, circularly symmetric, FIR filter. First of all, a sharp one dimensional (1D) infinite precision FIR filter is designed using the Frequency Response Masking (FRM) technique. This filter is converted into a multiplier-less filter by representing it in the Canonic Signed Digit (CSD) space. The design of the FRM filter in the CSD space calls for the use of a discrete optimization technique. To this end, a new optimization approach is proposed using a modified Harmony Search Algorithm (HSA). HSA is modified in such a way that, in every exploitation and exploration phase, the candidate solutions turns out to be integers. The 1D FRM multiplier-less filter, is in turn transformed to the 2D equivalent using the recently proposed multiplier-less transformations namely, T1 and T2. These transformations are successful in generating circular contours even for wideband filters. Since multipliers are the most power consuming elements in a 2D filter, the multiplier-less realization calls for reduced power consumption as well as computation time. Significant reduction in the computational complexity and computation time are the highlights of our proposed design technique. Besides, the proposed discrete optimization using modified HSA can be used to solve optimization problems in other engineering disciplines, where the search space consists of integers.
基金supported in part by the National Natural Science Foundation of China[Grant number 62471075]the Major Science and Technology Project Grant of the Chongqing Municipal Education Commission[Grant number KJZD-M202301901].
文摘Low-light image enhancement aims to improve the visibility of severely degraded images captured under insufficient illumination,alleviating the adverse effects of illumination degradation on image quality.Traditional Retinex-based approaches,inspired by human visual perception of brightness and color,decompose an image into illumination and reflectance components to restore fine details.However,their limited capacity for handling noise and complex lighting conditions often leads to distortions and artifacts in the enhanced results,particularly under extreme low-light scenarios.Although deep learning methods built upon Retinex theory have recently advanced the field,most still suffer frominsufficient interpretability and sub-optimal enhancement performance.This paper presents RetinexWT,a novel framework that tightly integrates classical Retinex theory with modern deep learning.Following Retinex principles,RetinexWT employs wavelet transforms to estimate illumination maps for brightness adjustment.A detail-recovery module that synergistically combines Vision Transformer(ViT)and wavelet transforms is then introduced to guide the restoration of lost details,thereby improving overall image quality.Within the framework,wavelet decomposition splits input features into high-frequency and low-frequency components,enabling scale-specific processing of global illumination/color cues and fine textures.Furthermore,a gating mechanism selectively fuses down-sampled and up-sampled features,while an attention-based fusion strategy enhances model interpretability.Extensive experiments on the LOL dataset demonstrate that RetinexWT surpasses existing Retinex-oriented deeplearning methods,achieving an average Peak Signal-to-Noise Ratio(PSNR)improvement of 0.22 dB over the current StateOfTheArt(SOTA),thereby confirming its superiority in low-light image enhancement.Code is available at https://github.com/CHEN-hJ516/RetinexWT(accessed on 14 October 2025).
基金supported in part by the Ministry of Higher Education Malaysia(MOHE)through Fundamental Research Grant Scheme(FRGS)Ref:FRGS/1/2024/ICT02/UTM/02/10,Vot.No:R.J130000.7828.5F748the Scientific Research Project of Education Department of Hunan Province(Nos.22B1046 and 24A0771).
文摘Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting increased interest in swarm intelligence algorithms.Among these,the Cuckoo Search(CS)algorithm stands out for its promising global search capabilities.However,it often suffers from premature convergence when tackling complex problems.To address this limitation,this paper proposes a Grouped Dynamic Adaptive CS(GDACS)algorithm.Theenhancements incorporated intoGDACS can be summarized into two key aspects.Firstly,a chaotic map is employed to generate initial solutions,leveraging the inherent randomness of chaotic sequences to ensure a more uniform distribution across the search space and enhance population diversity from the outset.Secondly,Cauchy and Levy strategies replace the standard CS population update.This strategy involves evaluating the fitness of candidate solutions to dynamically group the population based on performance.Different step-size adaptation strategies are then applied to distinct groups,enabling an adaptive search mechanism that balances exploration and exploitation.Experiments were conducted on six benchmark functions and four constrained engineering design problems,and the results indicate that the proposed GDACS achieves good search efficiency and produces more accurate optimization results compared with other state-of-the-art algorithms.
基金the National Natural Science Foundation of China (90407007 60372001).
文摘To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform （STFT） is brought forward. First the physical essence of aliasing that occurs is analyzed; second the interpolation algorithm model is setup based on the Hamming window; then the fast implementation of the algorithm using the Newton iteration method is given. Using the numerical simulation the feasibility of algorithm is validated. Finally, the electrical circuit experiment shows the practicality of the algorithm in the electrical engineering.
基金supported by the National Natural Science Foundation of China (6117212711071002)+1 种基金the Specialized Research Fund for the Doctoral Program of Higher Education (20113401110006)the Innovative Research Team of 211 Project in Anhui University (KJTD007A)
文摘A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low frequency image and several high frequency images, and the scale-invariant feature transform is employed to extract feature points from the low frequency im- age. A proximity matrix is constructed for the feature points of two related images. By singular value decomposition of the proximity matrix, a matching matrix （or matching result） reflecting the match- ing degree among feature points is obtained. Experimental results indicate that the proposed algorithm can reduce time complexity and possess a higher accuracy.
