A global planning algorithm for intelligent vehicles is designed based on the A* algorithm, which provides intelligent vehicles with a global path towards their destinations. A distributed real-time multiple vehicle c...A global planning algorithm for intelligent vehicles is designed based on the A* algorithm, which provides intelligent vehicles with a global path towards their destinations. A distributed real-time multiple vehicle collision avoidance(MVCA)algorithm is proposed by extending the reciprocal n-body collision avoidance method. MVCA enables the intelligent vehicles to choose their destinations and control inputs independently,without needing to negotiate with each other or with the coordinator. Compared to the centralized trajectory-planning algorithm, MVCA reduces computation costs and greatly improves the robustness of the system. Because the destination of each intelligent vehicle can be regarded as private, which can be protected by MVCA, at the same time MVCA can provide a real-time trajectory planning for intelligent vehicles. Therefore,MVCA can better improve the safety of intelligent vehicles. The simulation was conducted in MATLAB, including crossroads scene simulation and circular exchange position simulation. The results show that MVCA behaves safely and reliably. The effects of latency and packet loss on MVCA are also statistically investigated through theoretically formulating broadcasting process based on one-dimensional Markov chain. The results uncover that the tolerant delay should not exceed the half of deciding cycle of trajectory planning, and shortening the sending interval could alleviate the negative effects caused by the packet loss to an extent. The cases of short delay(< 100100 ms) and low packet loss(< 5%) can bring little influence to those trajectory planning algorithms that only depend on V2 V to sense the context, but the unpredictable collision may occur if the delay and packet loss are further worsened. The MVCA was also tested by a real intelligent vehicle, the test results prove the operability of MVCA.展开更多
We consider a discrete model that describes a linear chain of particles coupled to an isolated ring composed of N defects. This simple system can be regarded as a generalization of the familiar Fano Anderson model. It...We consider a discrete model that describes a linear chain of particles coupled to an isolated ring composed of N defects. This simple system can be regarded as a generalization of the familiar Fano Anderson model. It can be used to model discrete networks of coupled defect modes in photonic crystals and simple waveguide arrays in two-dimensional lattices. The analytical result of the transmission coefficient is obtained, along with the conditions for perfect reflections and transmissions due to either destructive or constructive interferences. Using a simple example, we further investigate the relationship between the resonant frequencies and the number of defects N, and study how to affect the numbers of perfect reflections and transmissions. In addition, we demonstrate how these resonance transmissions and refections can be tuned by one nonlinear defect of the network that possesses a nonlinear Kerr-like response.展开更多
The main purpose of this paper is to investigate the connection between the Painlev′e property and the integrability of polynomial dynamical systems. We show that if a polynomial dynamical system has Painlev′e prope...The main purpose of this paper is to investigate the connection between the Painlev′e property and the integrability of polynomial dynamical systems. We show that if a polynomial dynamical system has Painlev′e property, then it admits certain class of first integrals. We also present some relationships between the Painlev′e property and the structure of the differential Galois group of the corresponding variational equations along some complex integral curve.展开更多
We study the Nadaraya-Watson estimators for the drift function of two-sided reflected stochastic differential equations.The estimates,based on either the continuously observed process or the discretely observed proces...We study the Nadaraya-Watson estimators for the drift function of two-sided reflected stochastic differential equations.The estimates,based on either the continuously observed process or the discretely observed process,are considered.Under certain conditions,we prove the strong consistency and the asymptotic normality of the two estimators.Our method is also suitable for one-sided reflected stochastic differential equations.Simulation results demonstrate that the performance of our estimator is superior to that of the estimator proposed by Cholaquidis et al.(Stat Sin,2021,31:29-51).Several real data sets of the currency exchange rate are used to illustrate our proposed methodology.展开更多
Locomotor intent classification has become a research hotspot due to its importance to the development of assistive robotics and wearable devices.Previous work have achieved impressive performance in classifying stead...Locomotor intent classification has become a research hotspot due to its importance to the development of assistive robotics and wearable devices.Previous work have achieved impressive performance in classifying steady locomotion states.However,it remains challenging for these methods to attain high accuracy when facing transitions between steady locomotion states.Due to the similarities between the information of the transitions and their adjacent steady states.Furthermore,most of these methods rely solely on data and overlook the objective laws between physical activities,resulting in lower accuracy,particularly when encountering complex locomotion modes such as transitions.To address the existing deficiencies,we propose the locomotion rule embedding long short-term memory(LSTM)network with Attention(LREAL)for human locomotor intent classification,with a particular focus on transitions,using data from fewer sensors(two inertial measurement units and four goniometers).The LREAL network consists of two levels:One responsible for distinguishing between steady states and transitions,and the other for the accurate identification of locomotor intent.Each classifier in these levels is composed of multiple-LSTM layers and an attention mechanism.To introduce real-world motion rules and apply constraints to the network,a prior knowledge was added to the network via a rule-modulating block.The method was tested on the ENABL3S dataset,which contains continuous locomotion date for seven steady and twelve transitions states.Experimental results showed that the LREAL network could recognize locomotor intents with an average accuracy of 99.03%and 96.52%for the steady and transitions states,respectively.It is worth noting that the LREAL network accuracy for transition-state recognition improved by 0.18%compared to other state-of-the-art network,while using data from fewer sensors.展开更多
To satisfy the requirements of real-time and high quality mosaics, a bionic compound eye visual system was designed by simulating the visual mechanism of a fly compound eye. Several CCD cameras were used in this syste...To satisfy the requirements of real-time and high quality mosaics, a bionic compound eye visual system was designed by simulating the visual mechanism of a fly compound eye. Several CCD cameras were used in this system to imitate the small eyes of a compound eye. Based on the optical analysis of this system, a direct panoramic image mosaic algorithm was proposed. Several sub-images were collected by the bionic compound eye visual system, and then the system obtained the overlapping proportions of these sub-images and cut the overlap sections of the neighboring images. Thus, a panoramic image with a large field of view was directly mosaicked, which expanded the field and guaranteed the high resolution. The experimental results show that the time consumed by the direct mosaic algorithm is only 2.2% of that by the traditional image mosaic algorithm while guaranteeing mosaic quality. Furthermore, the proposed method effectively solved the problem of misalignment of the mosaic image and eliminated mosaic cracks as a result of the illumination factor and other factors. This method has better real-time properties compared to other methods.展开更多
In this paper, the generalized extended tanh-function method is used for constructing the traveling wave solutions of nonlinear evolution equations. We choose Fisher＇s equation, the nonlinear schr＆#168;odinger equat...In this paper, the generalized extended tanh-function method is used for constructing the traveling wave solutions of nonlinear evolution equations. We choose Fisher＇s equation, the nonlinear schr＆#168;odinger equation to illustrate the validity and ad-vantages of the method. Many new and more general traveling wave solutions are obtained. Furthermore, this method can also be applied to other nonlinear equations in physics.展开更多
A Bloom filter is a space-efficient data structure used for concisely representing a set as well as membership queries at the expense of introducing false positive. In this paper, we propose the L-priorities Bloom fil...A Bloom filter is a space-efficient data structure used for concisely representing a set as well as membership queries at the expense of introducing false positive. In this paper, we propose the L-priorities Bloom filter （LPBF） as a new member of the Bloom filter （BF） family, it uses a limited multidimensional bit space matrix to replace the bit vector of standard bloom filters in order to support different priorities for the elements of a set. We demonstrate the time and space complexity, especially the false positive rate of LPBF. Furthermore, we also present a detailed practical evaluation of the false positive rate achieved by LPBF. The results show that LPBF performs better than standard BFs with respect to false positive rate.展开更多
Underwater optical imaging produces images with high resolution and abundant information and hence has outstanding advantages in short-distance underwater target detection.However,low-light and high-noise scenarios po...Underwater optical imaging produces images with high resolution and abundant information and hence has outstanding advantages in short-distance underwater target detection.However,low-light and high-noise scenarios pose great challenges in un-derwater image and video analyses.To improve the accuracy and anti-noise performance of underwater target image edge detection,an underwater target edge detection method based on ant colony optimization and reinforcement learning is proposed in this paper.First,the reinforcement learning concept is integrated into artificial ants’movements,and a variable radius sensing strategy is pro-posed to calculate the transition probability of each pixel.These methods aim to avoid undetection and misdetection of some pixels in image edges.Second,a double-population ant colony strategy is proposed,where the search process takes into account global search and local search abilities.Experimental results show that the algorithm can effectively extract the contour information of underwater targets and keep the image texture well and also has ideal anti-interference performance.展开更多
This paper presents an efficient technique for processing of 3D meshed surfaces via spherical wavelets. More specifically, an input 3D mesh is firstly transformed into a spherical vector signal by a fast low distortio...This paper presents an efficient technique for processing of 3D meshed surfaces via spherical wavelets. More specifically, an input 3D mesh is firstly transformed into a spherical vector signal by a fast low distortion spherical parameterization approach based on symmetry analysis of 3D meshes. This signal is then sampled on the sphere with the help of an adaptive sampling scheme. Finally, the sampled signal is transformed into the wavelet domain according to spherical wavelet transform where many 3D mesh processing operations can be implemented such as smoothing, enhancement, compression, and so on. Our main contribution lies in incorporating a fast low distortion spherical parameterization approach and an adaptive sampling scheme into the frame for pro- cessing 3D meshed surfaces by spherical wavelets, which can handle surfaces with complex shapes. A number of experimental ex- amples demonstrate that our algorithm is robust and efficient.展开更多
Meshed surfaces are ubiquitous in digital geometry processing and computer graphics. The set of attributes associated with each vertex such as the vertex locations, curvature, temperature, pressure or saliency, can be...Meshed surfaces are ubiquitous in digital geometry processing and computer graphics. The set of attributes associated with each vertex such as the vertex locations, curvature, temperature, pressure or saliency, can be recognized as data living on mani- fold surfaces. So interpolation and approximation for these data are of general interest. This paper presents two approaches for mani- fold data interpolation and approximation through the properties of Laplace-Beltrami operator （Laplace operator defined on a mani- fold surface）. The first one is to use Laplace operator minimizing the membrane energy of a scalar function defined on a manifold. The second one is to use bi-Laplace operator minimizing the thin plate energy of a scalar function defined on a manifold. These two approaches can process data living on high genus meshed surfaces. The approach based on Laplace operator is more suitable for manifold data approximation and can be applied manifold data smoothing, while the one based on bi-Laplace operator is more suit- able for manifold data interpolation and can be applied image extremal envelope computation. All the application examples demon- strate that our procedures are robust and efficient.展开更多
In this paper,the clustering analysis is applied to the satellite image segmentation,and a cloud-based thunderstorm cloud recognition method is proposed in combination with the strong cloud computing power.The method ...In this paper,the clustering analysis is applied to the satellite image segmentation,and a cloud-based thunderstorm cloud recognition method is proposed in combination with the strong cloud computing power.The method firstly adopts the fuzzy C-means clustering(FCM)to obtain the satellite cloud image segmentation.Secondly,in the cloud image,we dispose the‘high-density connected’pixels in the same cloud clusters and the‘low-density connected’pixels in different cloud clusters.Therefore,we apply the DBSCAN algorithm to the cloud image obtained in the first step to realize cloud cluster knowledge.Finally,using the method of spectral threshold recognition and texture feature recognition in the steps of cloud clusters,thunderstorm cloud clusters are quickly and accurately identified.The experimental results show that cluster analysis has high research and application value in the segmentation processing of meteorological satellite cloud images.展开更多
Adaptive Cross-Generation Differential Evolution(ACGDE)is a recently-introduced algorithm for solving multiobjective problems with remarkable performance compared to other evolutionary algorithms(EAs).However,its conv...Adaptive Cross-Generation Differential Evolution(ACGDE)is a recently-introduced algorithm for solving multiobjective problems with remarkable performance compared to other evolutionary algorithms(EAs).However,its convergence and diversity are not satisfactory compared with the latest algorithms.In order to adapt to the current environment,ACGDE requires improvements in many aspects,such as its initialization and mutant operator.In this paper,an enhanced version is proposed,namely SIACGDE.It incorporates a strengthened initialization strategy and optimized parameters in contrast to its predecessor.These improvements make the direction of crossgeneration mutation more clearly and the ability of searching more efficiently.The experiments show that the new algorithm has better diversity and improves convergence to a certain extent.At the same time,SIACGDE outperforms other state-of-the-art algorithms on four metrics of 24 test problems.展开更多
In this paper, one-dimensional （1D） nonlinear beam equations of the form utt - uxx ＋ uxxxx ＋ mu = f （u） with Dirichlet boundary conditions are considered, where the nonlinearity f is an analytic, odd function an...In this paper, one-dimensional （1D） nonlinear beam equations of the form utt - uxx ＋ uxxxx ＋ mu = f （u） with Dirichlet boundary conditions are considered, where the nonlinearity f is an analytic, odd function and f（u） = O（u3）. It is proved that for all m ∈ （0, M＊] R （M＊ is a fixed large number）, but a set of small Lebesgue measure, the above equations admit small-amplitude quasi-periodic solutions corresponding to finite dimensional invariant tori for an associated infinite dimensional dynamical system. The proof is based on an infinite dimensional KAM theory and a partial Birkhoff normal form technique.展开更多
In this paper, we study the persistence of lower dimensional tori for random Hamiltonian systems, which shows that majority of the unperturbed tori persist as Cantor fragments of lower dimensional ones under small per...In this paper, we study the persistence of lower dimensional tori for random Hamiltonian systems, which shows that majority of the unperturbed tori persist as Cantor fragments of lower dimensional ones under small perturbation. Using this result, we can describe the stability of the non-autonomous dynamic systems.展开更多
Semi-supervised clustering improves learning performance as long as it uses a small number of labeled samples to assist un-tagged samples for learning.This paper implements and compares unsupervised and semi-supervise...Semi-supervised clustering improves learning performance as long as it uses a small number of labeled samples to assist un-tagged samples for learning.This paper implements and compares unsupervised and semi-supervised clustering analysis of BOA-Argo ocean text data.Unsupervised K-Means and Affinity Propagation(AP)are two classical clustering algorithms.The Election-AP algorithm is proposed to handle the final cluster number in AP clustering as it has proved to be difficult to control in a suitable range.Semi-supervised samples thermocline data in the BOA-Argo dataset according to the thermocline standard definition,and use this data for semi-supervised cluster analysis.Several semi-supervised clustering algorithms were chosen for comparison of learning performance:Constrained-K-Means,Seeded-K-Means,SAP(Semi-supervised Affinity Propagation),LSAP(Loose Seed AP)and CSAP(Compact Seed AP).In order to adapt the single label,this paper improves the above algorithms to SCKM(improved Constrained-K-Means),SSKM(improved Seeded-K-Means),and SSAP(improved Semi-supervised Affinity Propagationg)to perform semi-supervised clustering analysis on the data.A DSAP(Double Seed AP)semi-supervised clustering algorithm based on compact seeds is proposed as the experimental data shows that DSAP has a better clustering effect.The unsupervised and semi-supervised clustering results are used to analyze the potential patterns of marine data.展开更多
In real life,a large amount of data describing the same learning task may be stored in different institutions(called participants),and these data cannot be shared among par-ticipants due to privacy protection.The case...In real life,a large amount of data describing the same learning task may be stored in different institutions(called participants),and these data cannot be shared among par-ticipants due to privacy protection.The case that different attributes/features of the same instance are stored in different institutions is called vertically distributed data.The pur-pose of vertical‐federated feature selection(FS)is to reduce the feature dimension of vertical distributed data jointly without sharing local original data so that the feature subset obtained has the same or better performance as the original feature set.To solve this problem,in the paper,an embedded vertical‐federated FS algorithm based on particle swarm optimisation(PSO‐EVFFS)is proposed by incorporating evolutionary FS into the SecureBoost framework for the first time.By optimising both hyper‐parameters of the XGBoost model and feature subsets,PSO‐EVFFS can obtain a feature subset,which makes the XGBoost model more accurate.At the same time,since different participants only share insensitive parameters such as model loss function,PSO‐EVFFS can effec-tively ensure the privacy of participants'data.Moreover,an ensemble ranking strategy of feature importance based on the XGBoost tree model is developed to effectively remove irrelevant features on each participant.Finally,the proposed algorithm is applied to 10 test datasets and compared with three typical vertical‐federated learning frameworks and two variants of the proposed algorithm with different initialisation strategies.Experi-mental results show that the proposed algorithm can significantly improve the classifi-cation performance of selected feature subsets while fully protecting the data privacy of all participants.展开更多
Considering the acoustic source scattering problems,when the sour-ce is non-radiating/invisible,we investigate the geometrical characterization for the underlying sources at polyhedral and conical corner.It is reveale...Considering the acoustic source scattering problems,when the sour-ce is non-radiating/invisible,we investigate the geometrical characterization for the underlying sources at polyhedral and conical corner.It is revealed that the non-radiating source with Holder continuous regularity must vanish at the corner.Using this kind of geometrical characterization of non-radiating sources,we establish local and global unique determination for a source with the polyhedral or corona shape support by a single far field measurement.Uniqueness by a single far field measurement constitutes of a long standing problem in inverse scattering problems.展开更多
基金supported by the National Natural Science Foundation of China(61572229,6171101066)the Key Scientific and Technological Projects for Jilin Province Development Plan(20170204074GX,20180201068GX)Jilin Provincial International Cooperation Foundation(20180414015GH)。
文摘A global planning algorithm for intelligent vehicles is designed based on the A* algorithm, which provides intelligent vehicles with a global path towards their destinations. A distributed real-time multiple vehicle collision avoidance(MVCA)algorithm is proposed by extending the reciprocal n-body collision avoidance method. MVCA enables the intelligent vehicles to choose their destinations and control inputs independently,without needing to negotiate with each other or with the coordinator. Compared to the centralized trajectory-planning algorithm, MVCA reduces computation costs and greatly improves the robustness of the system. Because the destination of each intelligent vehicle can be regarded as private, which can be protected by MVCA, at the same time MVCA can provide a real-time trajectory planning for intelligent vehicles. Therefore,MVCA can better improve the safety of intelligent vehicles. The simulation was conducted in MATLAB, including crossroads scene simulation and circular exchange position simulation. The results show that MVCA behaves safely and reliably. The effects of latency and packet loss on MVCA are also statistically investigated through theoretically formulating broadcasting process based on one-dimensional Markov chain. The results uncover that the tolerant delay should not exceed the half of deciding cycle of trajectory planning, and shortening the sending interval could alleviate the negative effects caused by the packet loss to an extent. The cases of short delay(< 100100 ms) and low packet loss(< 5%) can bring little influence to those trajectory planning algorithms that only depend on V2 V to sense the context, but the unpredictable collision may occur if the delay and packet loss are further worsened. The MVCA was also tested by a real intelligent vehicle, the test results prove the operability of MVCA.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 11147173 and 61106052)the Zhejiang Education Department, China (Grant No. Y201018926 and Y200908466)+2 种基金the Basic Research Foundation of Jilin University,China (Grant No. 93K172011K02)the Basic Research Foundation of Zhejiang Ocean University, the Nature Science Foundation of Zhejiang Province, China (Grant No. 1047172)the Open Foundation from Ocean Fishery Science and Technology in the Most Important Subjects of Zhejiang, China (No. 20110105)
文摘We consider a discrete model that describes a linear chain of particles coupled to an isolated ring composed of N defects. This simple system can be regarded as a generalization of the familiar Fano Anderson model. It can be used to model discrete networks of coupled defect modes in photonic crystals and simple waveguide arrays in two-dimensional lattices. The analytical result of the transmission coefficient is obtained, along with the conditions for perfect reflections and transmissions due to either destructive or constructive interferences. Using a simple example, we further investigate the relationship between the resonant frequencies and the number of defects N, and study how to affect the numbers of perfect reflections and transmissions. In addition, we demonstrate how these resonance transmissions and refections can be tuned by one nonlinear defect of the network that possesses a nonlinear Kerr-like response.
基金The NSF (11371166,11301210)of ChinaNational 973 Project (2012CB821200) of ChinaJilin Province Youth Science Foundation
文摘The main purpose of this paper is to investigate the connection between the Painlev′e property and the integrability of polynomial dynamical systems. We show that if a polynomial dynamical system has Painlev′e property, then it admits certain class of first integrals. We also present some relationships between the Painlev′e property and the structure of the differential Galois group of the corresponding variational equations along some complex integral curve.
基金partially supported by the National Natural Science Foundation of China(11871244)the Fundamental Research Funds for the Central Universities,JLU。
文摘We study the Nadaraya-Watson estimators for the drift function of two-sided reflected stochastic differential equations.The estimates,based on either the continuously observed process or the discretely observed process,are considered.Under certain conditions,we prove the strong consistency and the asymptotic normality of the two estimators.Our method is also suitable for one-sided reflected stochastic differential equations.Simulation results demonstrate that the performance of our estimator is superior to that of the estimator proposed by Cholaquidis et al.(Stat Sin,2021,31:29-51).Several real data sets of the currency exchange rate are used to illustrate our proposed methodology.
基金funded by the National Natural Science Foundation of China(Nos.62072212,62302218)the Development Project of Jilin Province of China(Nos.20220508125RC,20230201065GX,20240101364JC)+1 种基金National Key R&D Program(No.2018YFC2001302)the Jilin Provincial Key Laboratory of Big Data Intelligent Cognition(No.20210504003GH).
文摘Locomotor intent classification has become a research hotspot due to its importance to the development of assistive robotics and wearable devices.Previous work have achieved impressive performance in classifying steady locomotion states.However,it remains challenging for these methods to attain high accuracy when facing transitions between steady locomotion states.Due to the similarities between the information of the transitions and their adjacent steady states.Furthermore,most of these methods rely solely on data and overlook the objective laws between physical activities,resulting in lower accuracy,particularly when encountering complex locomotion modes such as transitions.To address the existing deficiencies,we propose the locomotion rule embedding long short-term memory(LSTM)network with Attention(LREAL)for human locomotor intent classification,with a particular focus on transitions,using data from fewer sensors(two inertial measurement units and four goniometers).The LREAL network consists of two levels:One responsible for distinguishing between steady states and transitions,and the other for the accurate identification of locomotor intent.Each classifier in these levels is composed of multiple-LSTM layers and an attention mechanism.To introduce real-world motion rules and apply constraints to the network,a prior knowledge was added to the network via a rule-modulating block.The method was tested on the ENABL3S dataset,which contains continuous locomotion date for seven steady and twelve transitions states.Experimental results showed that the LREAL network could recognize locomotor intents with an average accuracy of 99.03%and 96.52%for the steady and transitions states,respectively.It is worth noting that the LREAL network accuracy for transition-state recognition improved by 0.18%compared to other state-of-the-art network,while using data from fewer sensors.
文摘To satisfy the requirements of real-time and high quality mosaics, a bionic compound eye visual system was designed by simulating the visual mechanism of a fly compound eye. Several CCD cameras were used in this system to imitate the small eyes of a compound eye. Based on the optical analysis of this system, a direct panoramic image mosaic algorithm was proposed. Several sub-images were collected by the bionic compound eye visual system, and then the system obtained the overlapping proportions of these sub-images and cut the overlap sections of the neighboring images. Thus, a panoramic image with a large field of view was directly mosaicked, which expanded the field and guaranteed the high resolution. The experimental results show that the time consumed by the direct mosaic algorithm is only 2.2% of that by the traditional image mosaic algorithm while guaranteeing mosaic quality. Furthermore, the proposed method effectively solved the problem of misalignment of the mosaic image and eliminated mosaic cracks as a result of the illumination factor and other factors. This method has better real-time properties compared to other methods.
基金The NSF(11001042) of ChinaSRFDP(20100043120001)FRFCU(09QNJJ002)
文摘In this paper, the generalized extended tanh-function method is used for constructing the traveling wave solutions of nonlinear evolution equations. We choose Fisher＇s equation, the nonlinear schr＆#168;odinger equation to illustrate the validity and ad-vantages of the method. Many new and more general traveling wave solutions are obtained. Furthermore, this method can also be applied to other nonlinear equations in physics.
基金supported by Project of Plan for Science and Technology Development of Jilin Province (No. 20101504)Project of Research of Science and Technology for the 11th Five-year Plan of Jilin Education Department (No. 2009604)
文摘A Bloom filter is a space-efficient data structure used for concisely representing a set as well as membership queries at the expense of introducing false positive. In this paper, we propose the L-priorities Bloom filter （LPBF） as a new member of the Bloom filter （BF） family, it uses a limited multidimensional bit space matrix to replace the bit vector of standard bloom filters in order to support different priorities for the elements of a set. We demonstrate the time and space complexity, especially the false positive rate of LPBF. Furthermore, we also present a detailed practical evaluation of the false positive rate achieved by LPBF. The results show that LPBF performs better than standard BFs with respect to false positive rate.
基金supported by the start-up fund for doctoral research of Northeast Electric Power University(No.BS JXM-2020219)the Science and Technology Research Program of the Jilin Provincial Department of Education(No.JJKH20210115KJ).
文摘Underwater optical imaging produces images with high resolution and abundant information and hence has outstanding advantages in short-distance underwater target detection.However,low-light and high-noise scenarios pose great challenges in un-derwater image and video analyses.To improve the accuracy and anti-noise performance of underwater target image edge detection,an underwater target edge detection method based on ant colony optimization and reinforcement learning is proposed in this paper.First,the reinforcement learning concept is integrated into artificial ants’movements,and a variable radius sensing strategy is pro-posed to calculate the transition probability of each pixel.These methods aim to avoid undetection and misdetection of some pixels in image edges.Second,a double-population ant colony strategy is proposed,where the search process takes into account global search and local search abilities.Experimental results show that the algorithm can effectively extract the contour information of underwater targets and keep the image texture well and also has ideal anti-interference performance.
基金Supported by the National Natural Science Foundation of China(No.61173102)the NSFC Guangdong Joint Fund(No.U0935004)+2 种基金the Fundamental Research Funds for the Central Universities(No.DUT11SX08)the Opening Foundation of Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education of China(No.93K172012K02)the Doctor Research Start-up Fund of North East Dian Li university(No.BSJXM-200912)
文摘This paper presents an efficient technique for processing of 3D meshed surfaces via spherical wavelets. More specifically, an input 3D mesh is firstly transformed into a spherical vector signal by a fast low distortion spherical parameterization approach based on symmetry analysis of 3D meshes. This signal is then sampled on the sphere with the help of an adaptive sampling scheme. Finally, the sampled signal is transformed into the wavelet domain according to spherical wavelet transform where many 3D mesh processing operations can be implemented such as smoothing, enhancement, compression, and so on. Our main contribution lies in incorporating a fast low distortion spherical parameterization approach and an adaptive sampling scheme into the frame for pro- cessing 3D meshed surfaces by spherical wavelets, which can handle surfaces with complex shapes. A number of experimental ex- amples demonstrate that our algorithm is robust and efficient.
基金Supported by National Natural Science Foundation of China (No.61202261,No.61173102)NSFC Guangdong Joint Fund(No.U0935004)Opening Foundation of Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education of China(No.93K172012K02)
文摘Meshed surfaces are ubiquitous in digital geometry processing and computer graphics. The set of attributes associated with each vertex such as the vertex locations, curvature, temperature, pressure or saliency, can be recognized as data living on mani- fold surfaces. So interpolation and approximation for these data are of general interest. This paper presents two approaches for mani- fold data interpolation and approximation through the properties of Laplace-Beltrami operator （Laplace operator defined on a mani- fold surface）. The first one is to use Laplace operator minimizing the membrane energy of a scalar function defined on a manifold. The second one is to use bi-Laplace operator minimizing the thin plate energy of a scalar function defined on a manifold. These two approaches can process data living on high genus meshed surfaces. The approach based on Laplace operator is more suitable for manifold data approximation and can be applied manifold data smoothing, while the one based on bi-Laplace operator is more suit- able for manifold data interpolation and can be applied image extremal envelope computation. All the application examples demon- strate that our procedures are robust and efficient.
基金This work was supported in part by the National Natural Science Foundation of China(51679105,61672261,51409117)Jilin Province Department of Education Thirteen Five science and technology research projects[2016]No.432,[2017]No.JJKH20170804KJ.
文摘In this paper,the clustering analysis is applied to the satellite image segmentation,and a cloud-based thunderstorm cloud recognition method is proposed in combination with the strong cloud computing power.The method firstly adopts the fuzzy C-means clustering(FCM)to obtain the satellite cloud image segmentation.Secondly,in the cloud image,we dispose the‘high-density connected’pixels in the same cloud clusters and the‘low-density connected’pixels in different cloud clusters.Therefore,we apply the DBSCAN algorithm to the cloud image obtained in the first step to realize cloud cluster knowledge.Finally,using the method of spectral threshold recognition and texture feature recognition in the steps of cloud clusters,thunderstorm cloud clusters are quickly and accurately identified.The experimental results show that cluster analysis has high research and application value in the segmentation processing of meteorological satellite cloud images.
文摘Adaptive Cross-Generation Differential Evolution(ACGDE)is a recently-introduced algorithm for solving multiobjective problems with remarkable performance compared to other evolutionary algorithms(EAs).However,its convergence and diversity are not satisfactory compared with the latest algorithms.In order to adapt to the current environment,ACGDE requires improvements in many aspects,such as its initialization and mutant operator.In this paper,an enhanced version is proposed,namely SIACGDE.It incorporates a strengthened initialization strategy and optimized parameters in contrast to its predecessor.These improvements make the direction of crossgeneration mutation more clearly and the ability of searching more efficiently.The experiments show that the new algorithm has better diversity and improves convergence to a certain extent.At the same time,SIACGDE outperforms other state-of-the-art algorithms on four metrics of 24 test problems.
基金The NSF (11001042) of Chinathe SRFDP Grant (20100043120001)FRFCU Grant(09QNJJ002)
文摘In this paper, one-dimensional （1D） nonlinear beam equations of the form utt - uxx ＋ uxxxx ＋ mu = f （u） with Dirichlet boundary conditions are considered, where the nonlinearity f is an analytic, odd function and f（u） = O（u3）. It is proved that for all m ∈ （0, M＊] R （M＊ is a fixed large number）, but a set of small Lebesgue measure, the above equations admit small-amplitude quasi-periodic solutions corresponding to finite dimensional invariant tori for an associated infinite dimensional dynamical system. The proof is based on an infinite dimensional KAM theory and a partial Birkhoff normal form technique.
基金Partially supported by the SFC(10531050,10225107)of Chinathe SRFDP(20040183030)the 985 program of Jilin University
文摘In this paper, we study the persistence of lower dimensional tori for random Hamiltonian systems, which shows that majority of the unperturbed tori persist as Cantor fragments of lower dimensional ones under small perturbation. Using this result, we can describe the stability of the non-autonomous dynamic systems.
基金This work was supported in part by the National Natural Science Foundation of China(51679105,61872160,51809112)“Thirteenth Five Plan”Science and Technology Project of Education Department,Jilin Province(JJKH20200990KJ).
文摘Semi-supervised clustering improves learning performance as long as it uses a small number of labeled samples to assist un-tagged samples for learning.This paper implements and compares unsupervised and semi-supervised clustering analysis of BOA-Argo ocean text data.Unsupervised K-Means and Affinity Propagation(AP)are two classical clustering algorithms.The Election-AP algorithm is proposed to handle the final cluster number in AP clustering as it has proved to be difficult to control in a suitable range.Semi-supervised samples thermocline data in the BOA-Argo dataset according to the thermocline standard definition,and use this data for semi-supervised cluster analysis.Several semi-supervised clustering algorithms were chosen for comparison of learning performance:Constrained-K-Means,Seeded-K-Means,SAP(Semi-supervised Affinity Propagation),LSAP(Loose Seed AP)and CSAP(Compact Seed AP).In order to adapt the single label,this paper improves the above algorithms to SCKM(improved Constrained-K-Means),SSKM(improved Seeded-K-Means),and SSAP(improved Semi-supervised Affinity Propagationg)to perform semi-supervised clustering analysis on the data.A DSAP(Double Seed AP)semi-supervised clustering algorithm based on compact seeds is proposed as the experimental data shows that DSAP has a better clustering effect.The unsupervised and semi-supervised clustering results are used to analyze the potential patterns of marine data.
基金Acknowledgements： This work is supported by Youth Foundation of Jilin University （No. 419070100102）, NSFC of China Major Research Program 60496321, Basic Theory and Core Techniques of Non Canonical Knowledge National Natural Science Foundation of China under Grant No. 60373098 and No. 60173006, the National High-Tech Research and Development Plan of China under Grant No.2003AA118020, the Major Program of Science and Technology Development Plan of Jilin Province under Grant No. 20020303, the Science and Technology Development Plan of Jilin Province under Grant No. 20030523.
基金supported by the two funding sources:Scientific Innovation 2030 Major Project for New Generation of AI,Ministry of Science and Technology of the Peoples Republic of China(2020AAA0107300)National Natural Science Foundation of China(62133015).
文摘In real life,a large amount of data describing the same learning task may be stored in different institutions(called participants),and these data cannot be shared among par-ticipants due to privacy protection.The case that different attributes/features of the same instance are stored in different institutions is called vertically distributed data.The pur-pose of vertical‐federated feature selection(FS)is to reduce the feature dimension of vertical distributed data jointly without sharing local original data so that the feature subset obtained has the same or better performance as the original feature set.To solve this problem,in the paper,an embedded vertical‐federated FS algorithm based on particle swarm optimisation(PSO‐EVFFS)is proposed by incorporating evolutionary FS into the SecureBoost framework for the first time.By optimising both hyper‐parameters of the XGBoost model and feature subsets,PSO‐EVFFS can obtain a feature subset,which makes the XGBoost model more accurate.At the same time,since different participants only share insensitive parameters such as model loss function,PSO‐EVFFS can effec-tively ensure the privacy of participants'data.Moreover,an ensemble ranking strategy of feature importance based on the XGBoost tree model is developed to effectively remove irrelevant features on each participant.Finally,the proposed algorithm is applied to 10 test datasets and compared with three typical vertical‐federated learning frameworks and two variants of the proposed algorithm with different initialisation strategies.Experi-mental results show that the proposed algorithm can significantly improve the classifi-cation performance of selected feature subsets while fully protecting the data privacy of all participants.
基金the National Natural Science Foundation of China(Grant No.12371422)the Fundamental Research Funds for the Central Universities,JLU(Grant No.93Z172023Z01)+3 种基金The work of Y.Geng is supported by the Graduate Innovation Fund of Jilin University(Grant No.2023Cx276)the Hong Kong RGC General Research Funds(Projects 12302919,12301420 and 11300821)the NSFC/RGC Joint Research Fund(Project N.City U101/21)the France-Hong Kong ANR/RGCJoint Research(Grant No.A-HKBU 203/19).
文摘Considering the acoustic source scattering problems,when the sour-ce is non-radiating/invisible,we investigate the geometrical characterization for the underlying sources at polyhedral and conical corner.It is revealed that the non-radiating source with Holder continuous regularity must vanish at the corner.Using this kind of geometrical characterization of non-radiating sources,we establish local and global unique determination for a source with the polyhedral or corona shape support by a single far field measurement.Uniqueness by a single far field measurement constitutes of a long standing problem in inverse scattering problems.
