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.展开更多
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.展开更多
At present, most lane line detection methods are aimed at simple road surface. There is still no good solution for the situation that the lane line contains arrow, text and other signs. The edge left by markers such a...At present, most lane line detection methods are aimed at simple road surface. There is still no good solution for the situation that the lane line contains arrow, text and other signs. The edge left by markers such as arrow and text will interfere with the detection of lane lines. In view of the situation of arrow mark and text mark interference between lane lines, the paper proposes a new processing algorithm. The algorithm consists of four parts, Gaussian blur, image graying processing, DLD-threshold (Dark-Light-Dark-threshold) algorithm, correlation filter edge extraction and Hough transform. Among them, the DLD-threshold algorithm and related filters are mainly used to remove the identification interference between lane lines. The test results on the Caltech Lanes dataset are given at the end of the article. The result of verification of this algorithm showed a max recognition rate of 97.2%.展开更多
Using the Radon transform and morphological image processing, an algorithm for ship's wake detection in the SAR (synthetic aperture radar) image is developed. Being manipulated in the Radon space to invert the gra...Using the Radon transform and morphological image processing, an algorithm for ship's wake detection in the SAR (synthetic aperture radar) image is developed. Being manipulated in the Radon space to invert the gray-level and binary images, the linear texture of ship wake in oceanic clutter can be well detected. It has been applied to the automatic detection of a moving ship from the SEASAT SAR image. The results show that this algorithm is well robust in a strong noisy background and is not very sensitive to the threshold parameter and the working window size.展开更多
Direct algorithm of wavelet transform (WT) is the numerical algorithmobtained from the integral formula of WT by directly digitization. Some problems on realizing thealgorithm are studied. Some conclusions on the dire...Direct algorithm of wavelet transform (WT) is the numerical algorithmobtained from the integral formula of WT by directly digitization. Some problems on realizing thealgorithm are studied. Some conclusions on the direct algorithm of discrete wavelet transform (DWT),such as discrete convolution operation formula of wavelet coefficients and wavelet components,sampling principle and technology to wavelets, deciding method for scale range of wavelets, measuresto solve edge effect problem, etc, are obtained. The realization of direct algorithm of continuouswavelet transform (CWT) is also studied. The computing cost of direct algorithm and Mallat algorithmof DWT are still studied, and the computing formulae are obtained. These works are beneficial todeeply understand WT and Mallat algorithm. Examples in the end show that direct algorithm can alsobe applied widely.展开更多
The accurate identification and classification of various power quality disturbances are keys to ensuring high-quality electrical energy. In this study, the statistical characteristics of the disturbance signal of wav...The accurate identification and classification of various power quality disturbances are keys to ensuring high-quality electrical energy. In this study, the statistical characteristics of the disturbance signal of wavelet transform coefficients and wavelet transform energy distribution constitute feature vectors. These vectors are then trained and tested using SVM multi-class algorithms. Experimental results demonstrate that the SVM multi-class algorithms, which use the Gaussian radial basis function, exponential radial basis function, and hyperbolic tangent function as basis functions, are suitable methods for power quality disturbance classification.展开更多
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.展开更多
The staggered distribution of joints and fissures in space constitutes the weak part of any rock mass.The identification of rock mass structural planes and the extraction of characteristic parameters are the basis of ...The staggered distribution of joints and fissures in space constitutes the weak part of any rock mass.The identification of rock mass structural planes and the extraction of characteristic parameters are the basis of rock-mass integrity evaluation,which is very important for analysis of slope stability.The laser scanning technique can be used to acquire the coordinate information pertaining to each point of the structural plane,but large amount of point cloud data,uneven density distribution,and noise point interference make the identification efficiency and accuracy of different types of structural planes limited by point cloud data analysis technology.A new point cloud identification and segmentation algorithm for rock mass structural surfaces is proposed.Based on the distribution states of the original point cloud in different neighborhoods in space,the point clouds are characterized by multi-dimensional eigenvalues and calculated by the robust randomized Hough transform(RRHT).The normal vector difference and the final eigenvalue are proposed for characteristic distinction,and the identification of rock mass structural surfaces is completed through regional growth,which strengthens the difference expression of point clouds.In addition,nearest Voxel downsampling is also introduced in the RRHT calculation,which further reduces the number of sources of neighborhood noises,thereby improving the accuracy and stability of the calculation.The advantages of the method have been verified by laboratory models.The results showed that the proposed method can better achieve the segmentation and statistics of structural planes with interfaces and sharp boundaries.The method works well in the identification of joints,fissures,and other structural planes on Mangshezhai slope in the Three Gorges Reservoir area,China.It can provide a stable and effective technique for the identification and segmentation of rock mass structural planes,which is beneficial in engineering practice.展开更多
To address the low-resolution imaging problem in relation to traditional Range Doppler(RD)algorithm,this paper intends to propose a new algorithm based on Fractional Fourier Transform(FrFT),which proves highly advanta...To address the low-resolution imaging problem in relation to traditional Range Doppler(RD)algorithm,this paper intends to propose a new algorithm based on Fractional Fourier Transform(FrFT),which proves highly advantageous in the acquisition of high-resolution Synthetic Aperture Radar(SAR)images.The expression of the optimal order of SAR range signals using FrFT is deduced in detail,and the corresponding expression of the azimuth signal is also given.Theoretical analysis shows that,the optimal order in range(azimuth)direction,which turns out to be very unique,depends on the known imaging parameters of SAR,therefore the engineering practicability of FrFT-RD algorithm can be greatly improved without the need of order iteration.The FrFT-RD algorithm is established after an analysis of the optimal time-frequency transform.Experimental results demonstrate that,compared with traditional RD algorithm,the main-lobe width of the peak-point target of FrFT-RD algorithm is narrow in both range and azimuth directions.While the peak amplitude of the first side-lobe is reduced significantly,those of other side-lobes also drop in various degrees.In this way,the imaging resolution of range and azimuth can be increased considerably.展开更多
In this work, approximate analytical solutions to the lid-driven square cavity flow problem, which satisfied two-dimensional unsteady incompressible Navier-Stokes equations, are presented using the kinetically reduced...In this work, approximate analytical solutions to the lid-driven square cavity flow problem, which satisfied two-dimensional unsteady incompressible Navier-Stokes equations, are presented using the kinetically reduced local Navier-Stokes equations. Reduced differential transform method and perturbation-iteration algorithm are applied to solve this problem. The convergence analysis was discussed for both methods. The numerical results of both methods are given at some Reynolds numbers and low Mach numbers, and compared with results of earlier studies in the review of the literatures. These two methods are easy and fast to implement, and the results are close to each other and other numerical results, so it can be said that these methods are useful in finding approximate analytical solutions to the unsteady incompressible flow problems at low Mach numbers.展开更多
Measurement-based one-way quantum computation, which uses cluster states as resources, provides an efficient model to perforrn computation. However, few of the continuous variable （CV） quantum algorithms and classic...Measurement-based one-way quantum computation, which uses cluster states as resources, provides an efficient model to perforrn computation. However, few of the continuous variable （CV） quantum algorithms and classical algorithms based on one-way quantum computation were proposed. In this work, we propose a method to implement the classical Hadamard transform algorithm utilizing the CV cluster state. Compared with classical computation, only half operations are required when it is operated in the one-way CV quantum computer. As an example, we present a concrete scheme of four-mode classical Hadamard transform algorithm with a four-partite CV cluster state. This method connects the quantum computer and the classical algorithms, which shows the feasibility of running classical algorithms in a quantum computer efficiently.展开更多
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.展开更多
An effective processing method for biomedical images and the Fuzzy C-mean (FCM) algorithm based on the wavelet transform are investigated.By using hierarchical wavelet decomposition, an original image could be decompo...An effective processing method for biomedical images and the Fuzzy C-mean (FCM) algorithm based on the wavelet transform are investigated.By using hierarchical wavelet decomposition, an original image could be decomposed into one lower image and several detail images. The segmentation started at the lowest resolution with the FCM clustering algorithm and the texture feature extracted from various sub-bands. With the improvement of the FCM algorithm, FCM alternation frequency was decreased and the accuracy of segmentation was advanced.展开更多
In this paper, a new algorithm for the fast computation of a 2-D discrete cosine transform (DCT) is presented. It is shown that the N×N DCT, where N = 2m, can be computed using only N 1-D DCT’s and additions, in...In this paper, a new algorithm for the fast computation of a 2-D discrete cosine transform (DCT) is presented. It is shown that the N×N DCT, where N = 2m, can be computed using only N 1-D DCT’s and additions, instead of using 2N 1-D DCT’s as in the conventional row-column approach. Hence the total number of multiplications for the proposed algorithm is only half of that required for the row-column approach, and is also less than that of most of other fast algorithms, while the number of additions is almost comparable to that of others.展开更多
基金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.
基金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.
文摘At present, most lane line detection methods are aimed at simple road surface. There is still no good solution for the situation that the lane line contains arrow, text and other signs. The edge left by markers such as arrow and text will interfere with the detection of lane lines. In view of the situation of arrow mark and text mark interference between lane lines, the paper proposes a new processing algorithm. The algorithm consists of four parts, Gaussian blur, image graying processing, DLD-threshold (Dark-Light-Dark-threshold) algorithm, correlation filter edge extraction and Hough transform. Among them, the DLD-threshold algorithm and related filters are mainly used to remove the identification interference between lane lines. The test results on the Caltech Lanes dataset are given at the end of the article. The result of verification of this algorithm showed a max recognition rate of 97.2%.
基金This project was supported by the National Natural Science Foundation of China (No. 49831060).
文摘Using the Radon transform and morphological image processing, an algorithm for ship's wake detection in the SAR (synthetic aperture radar) image is developed. Being manipulated in the Radon space to invert the gray-level and binary images, the linear texture of ship wake in oceanic clutter can be well detected. It has been applied to the automatic detection of a moving ship from the SEASAT SAR image. The results show that this algorithm is well robust in a strong noisy background and is not very sensitive to the threshold parameter and the working window size.
基金This project is supported by National Natural Science Foundation of China (No.50135050)
文摘Direct algorithm of wavelet transform (WT) is the numerical algorithmobtained from the integral formula of WT by directly digitization. Some problems on realizing thealgorithm are studied. Some conclusions on the direct algorithm of discrete wavelet transform (DWT),such as discrete convolution operation formula of wavelet coefficients and wavelet components,sampling principle and technology to wavelets, deciding method for scale range of wavelets, measuresto solve edge effect problem, etc, are obtained. The realization of direct algorithm of continuouswavelet transform (CWT) is also studied. The computing cost of direct algorithm and Mallat algorithmof DWT are still studied, and the computing formulae are obtained. These works are beneficial todeeply understand WT and Mallat algorithm. Examples in the end show that direct algorithm can alsobe applied widely.
文摘The accurate identification and classification of various power quality disturbances are keys to ensuring high-quality electrical energy. In this study, the statistical characteristics of the disturbance signal of wavelet transform coefficients and wavelet transform energy distribution constitute feature vectors. These vectors are then trained and tested using SVM multi-class algorithms. Experimental results demonstrate that the SVM multi-class algorithms, which use the Gaussian radial basis function, exponential radial basis function, and hyperbolic tangent function as basis functions, are suitable methods for power quality disturbance classification.
文摘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.
基金the National Natural Science Foundation of China(51909136)the Open Research Fund of Key Laboratory of Geological Hazards on Three Gorges Reservoir Area(China Three Gorges University),Ministry of Education,Grant No.2022KDZ21Fund of National Major Water Conservancy Project Construction(0001212022CC60001)。
文摘The staggered distribution of joints and fissures in space constitutes the weak part of any rock mass.The identification of rock mass structural planes and the extraction of characteristic parameters are the basis of rock-mass integrity evaluation,which is very important for analysis of slope stability.The laser scanning technique can be used to acquire the coordinate information pertaining to each point of the structural plane,but large amount of point cloud data,uneven density distribution,and noise point interference make the identification efficiency and accuracy of different types of structural planes limited by point cloud data analysis technology.A new point cloud identification and segmentation algorithm for rock mass structural surfaces is proposed.Based on the distribution states of the original point cloud in different neighborhoods in space,the point clouds are characterized by multi-dimensional eigenvalues and calculated by the robust randomized Hough transform(RRHT).The normal vector difference and the final eigenvalue are proposed for characteristic distinction,and the identification of rock mass structural surfaces is completed through regional growth,which strengthens the difference expression of point clouds.In addition,nearest Voxel downsampling is also introduced in the RRHT calculation,which further reduces the number of sources of neighborhood noises,thereby improving the accuracy and stability of the calculation.The advantages of the method have been verified by laboratory models.The results showed that the proposed method can better achieve the segmentation and statistics of structural planes with interfaces and sharp boundaries.The method works well in the identification of joints,fissures,and other structural planes on Mangshezhai slope in the Three Gorges Reservoir area,China.It can provide a stable and effective technique for the identification and segmentation of rock mass structural planes,which is beneficial in engineering practice.
基金supported by the 13th Five-Year Plan for Jiangsu Education Science(D/2020/01/22)JSPIGKZ(JSPI19GKZL405)Natural Science Research Projects of Colleges and Universities in Jiangsu Province(19KJB510022).
文摘To address the low-resolution imaging problem in relation to traditional Range Doppler(RD)algorithm,this paper intends to propose a new algorithm based on Fractional Fourier Transform(FrFT),which proves highly advantageous in the acquisition of high-resolution Synthetic Aperture Radar(SAR)images.The expression of the optimal order of SAR range signals using FrFT is deduced in detail,and the corresponding expression of the azimuth signal is also given.Theoretical analysis shows that,the optimal order in range(azimuth)direction,which turns out to be very unique,depends on the known imaging parameters of SAR,therefore the engineering practicability of FrFT-RD algorithm can be greatly improved without the need of order iteration.The FrFT-RD algorithm is established after an analysis of the optimal time-frequency transform.Experimental results demonstrate that,compared with traditional RD algorithm,the main-lobe width of the peak-point target of FrFT-RD algorithm is narrow in both range and azimuth directions.While the peak amplitude of the first side-lobe is reduced significantly,those of other side-lobes also drop in various degrees.In this way,the imaging resolution of range and azimuth can be increased considerably.
文摘In this work, approximate analytical solutions to the lid-driven square cavity flow problem, which satisfied two-dimensional unsteady incompressible Navier-Stokes equations, are presented using the kinetically reduced local Navier-Stokes equations. Reduced differential transform method and perturbation-iteration algorithm are applied to solve this problem. The convergence analysis was discussed for both methods. The numerical results of both methods are given at some Reynolds numbers and low Mach numbers, and compared with results of earlier studies in the review of the literatures. These two methods are easy and fast to implement, and the results are close to each other and other numerical results, so it can be said that these methods are useful in finding approximate analytical solutions to the unsteady incompressible flow problems at low Mach numbers.
基金Supported by the National Natural Science Foundation of China under Grant Nos 11504024,61502041,61602045 and 61602046the National Key Research and Development Program of China under Grant No 2016YFA0302600
文摘Measurement-based one-way quantum computation, which uses cluster states as resources, provides an efficient model to perforrn computation. However, few of the continuous variable （CV） quantum algorithms and classical algorithms based on one-way quantum computation were proposed. In this work, we propose a method to implement the classical Hadamard transform algorithm utilizing the CV cluster state. Compared with classical computation, only half operations are required when it is operated in the one-way CV quantum computer. As an example, we present a concrete scheme of four-mode classical Hadamard transform algorithm with a four-partite CV cluster state. This method connects the quantum computer and the classical algorithms, which shows the feasibility of running classical algorithms in a quantum computer efficiently.
基金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.
文摘An effective processing method for biomedical images and the Fuzzy C-mean (FCM) algorithm based on the wavelet transform are investigated.By using hierarchical wavelet decomposition, an original image could be decomposed into one lower image and several detail images. The segmentation started at the lowest resolution with the FCM clustering algorithm and the texture feature extracted from various sub-bands. With the improvement of the FCM algorithm, FCM alternation frequency was decreased and the accuracy of segmentation was advanced.
文摘In this paper, a new algorithm for the fast computation of a 2-D discrete cosine transform (DCT) is presented. It is shown that the N×N DCT, where N = 2m, can be computed using only N 1-D DCT’s and additions, instead of using 2N 1-D DCT’s as in the conventional row-column approach. Hence the total number of multiplications for the proposed algorithm is only half of that required for the row-column approach, and is also less than that of most of other fast algorithms, while the number of additions is almost comparable to that of others.
