A redundant-subspace-weighting(RSW)-based approach is proposed to enhance the frequency stability on a time scale of a clock ensemble.In this method,multiple overlapping subspaces are constructed in the clock ensemble...A redundant-subspace-weighting(RSW)-based approach is proposed to enhance the frequency stability on a time scale of a clock ensemble.In this method,multiple overlapping subspaces are constructed in the clock ensemble,and the weight of each clock in this ensemble is defined by using the spatial covariance matrix.The superimposition average of covariances in different subspaces reduces the correlations between clocks in the same laboratory to some extent.After optimizing the parameters of this weighting procedure,the frequency stabilities of virtual clock ensembles are significantly improved in most cases.展开更多
Adaptive detection of range-spread targets is considered in the presence of subspace interference plus Gaussian clutter with unknown covariance matrix.The target signal and interference are supposed to lie in two line...Adaptive detection of range-spread targets is considered in the presence of subspace interference plus Gaussian clutter with unknown covariance matrix.The target signal and interference are supposed to lie in two linearly independent subspaces with deterministic but unknown coordinates.Relying on the two-step criteria,two adaptive detectors based on Gradient tests are proposed,in homogeneous and partially homogeneous clutter plus subspace interference,respectively.Both of the proposed detectors exhibit theoretically constant false alarm rate property against unknown clutter covariance matrix as well as the power level.Numerical results show that,the proposed detectors have better performance than their existing counterparts,especially for mismatches in the signal steering vectors.展开更多
This paper focuses on the adaptive detection of range and Doppler dual-spread targets in non-homogeneous and nonGaussian sea clutter.The sea clutter from two polarimetric channels is modeled as a compound-Gaussian mod...This paper focuses on the adaptive detection of range and Doppler dual-spread targets in non-homogeneous and nonGaussian sea clutter.The sea clutter from two polarimetric channels is modeled as a compound-Gaussian model with different parameters,and the target is modeled as a subspace rangespread target model.The persymmetric structure is used to model the clutter covariance matrix,in order to reduce the reliance on secondary data of the designed detectors.Three adaptive polarimetric persymmetric detectors are designed based on the generalized likelihood ratio test(GLRT),Rao test,and Wald test.All the proposed detectors have constant falsealarm rate property with respect to the clutter texture,the speckle covariance matrix.Experimental results on simulated and measured data show that three adaptive detectors outperform the competitors in different clutter environments,and the proposed GLRT detector has the best detection performance under different parameters.展开更多
Deep multi-view subspace clustering (DMVSC) based on self-expression has attracted increasing attention dueto its outstanding performance and nonlinear application. However, most existing methods neglect that viewpriv...Deep multi-view subspace clustering (DMVSC) based on self-expression has attracted increasing attention dueto its outstanding performance and nonlinear application. However, most existing methods neglect that viewprivatemeaningless information or noise may interfere with the learning of self-expression, which may lead to thedegeneration of clustering performance. In this paper, we propose a novel framework of Contrastive Consistencyand Attentive Complementarity (CCAC) for DMVsSC. CCAC aligns all the self-expressions of multiple viewsand fuses them based on their discrimination, so that it can effectively explore consistent and complementaryinformation for achieving precise clustering. Specifically, the view-specific self-expression is learned by a selfexpressionlayer embedded into the auto-encoder network for each view. To guarantee consistency across views andreduce the effect of view-private information or noise, we align all the view-specific self-expressions by contrastivelearning. The aligned self-expressions are assigned adaptive weights by channel attention mechanism according totheir discrimination. Then they are fused by convolution kernel to obtain consensus self-expression withmaximumcomplementarity ofmultiple views. Extensive experimental results on four benchmark datasets and one large-scaledataset of the CCAC method outperformother state-of-the-artmethods, demonstrating its clustering effectiveness.展开更多
Multi-view Subspace Clustering (MVSC) emerges as an advanced clustering method, designed to integrate diverse views to uncover a common subspace, enhancing the accuracy and robustness of clustering results. The signif...Multi-view Subspace Clustering (MVSC) emerges as an advanced clustering method, designed to integrate diverse views to uncover a common subspace, enhancing the accuracy and robustness of clustering results. The significance of low-rank prior in MVSC is emphasized, highlighting its role in capturing the global data structure across views for improved performance. However, it faces challenges with outlier sensitivity due to its reliance on the Frobenius norm for error measurement. Addressing this, our paper proposes a Low-Rank Multi-view Subspace Clustering Based on Sparse Regularization (LMVSC- Sparse) approach. Sparse regularization helps in selecting the most relevant features or views for clustering while ignoring irrelevant or noisy ones. This leads to a more efficient and effective representation of the data, improving the clustering accuracy and robustness, especially in the presence of outliers or noisy data. By incorporating sparse regularization, LMVSC-Sparse can effectively handle outlier sensitivity, which is a common challenge in traditional MVSC methods relying solely on low-rank priors. Then Alternating Direction Method of Multipliers (ADMM) algorithm is employed to solve the proposed optimization problems. Our comprehensive experiments demonstrate the efficiency and effectiveness of LMVSC-Sparse, offering a robust alternative to traditional MVSC methods.展开更多
Clustering high dimensional data is challenging as data dimensionality increases the distance between data points,resulting in sparse regions that degrade clustering performance.Subspace clustering is a common approac...Clustering high dimensional data is challenging as data dimensionality increases the distance between data points,resulting in sparse regions that degrade clustering performance.Subspace clustering is a common approach for processing high-dimensional data by finding relevant features for each cluster in the data space.Subspace clustering methods extend traditional clustering to account for the constraints imposed by data streams.Data streams are not only high-dimensional,but also unbounded and evolving.This necessitates the development of subspace clustering algorithms that can handle high dimensionality and adapt to the unique characteristics of data streams.Although many articles have contributed to the literature review on data stream clustering,there is currently no specific review on subspace clustering algorithms in high-dimensional data streams.Therefore,this article aims to systematically review the existing literature on subspace clustering of data streams in high-dimensional streaming environments.The review follows a systematic methodological approach and includes 18 articles for the final analysis.The analysis focused on two research questions related to the general clustering process and dealing with the unbounded and evolving characteristics of data streams.The main findings relate to six elements:clustering process,cluster search,subspace search,synopsis structure,cluster maintenance,and evaluation measures.Most algorithms use a two-phase clustering approach consisting of an initialization stage,a refinement stage,a cluster maintenance stage,and a final clustering stage.The density-based top-down subspace clustering approach is more widely used than the others because it is able to distinguish true clusters and outliers using projected microclusters.Most algorithms implicitly adapt to the evolving nature of the data stream by using a time fading function that is sensitive to outliers.Future work can focus on the clustering framework,parameter optimization,subspace search techniques,memory-efficient synopsis structures,explicit cluster change detection,and intrinsic performance metrics.This article can serve as a guide for researchers interested in high-dimensional subspace clustering methods for data streams.展开更多
This paper presents a subspace identification method for closed-loop systems with unknown deterministic disturbances.To deal with the unknown deterministic disturbances,two strategies are implemented to construct the ...This paper presents a subspace identification method for closed-loop systems with unknown deterministic disturbances.To deal with the unknown deterministic disturbances,two strategies are implemented to construct the row space that can be used to approximately represent the unknown deterministic disturbances using the trigonometric functions or Bernstein polynomials depending on whether the disturbance frequencies are known.For closed-loop identification,CCF-N4SID is extended to the case with unknown deterministic disturbances using the oblique projection.In addition,a proper Bernstein polynomial order can be determined using the Akaike information criterion(AIC)or the Bayesian information criterion(BIC).Numerical simulation results demonstrate the effectiveness of the proposed identification method for both periodic and aperiodic deterministic disturbances.展开更多
In recent years,the soft subspace clustering algorithm has shown good results for high-dimensional data,which can assign different weights to each cluster class and use weights to measure the contribution of each dime...In recent years,the soft subspace clustering algorithm has shown good results for high-dimensional data,which can assign different weights to each cluster class and use weights to measure the contribution of each dimension in various features.The enhanced soft subspace clustering algorithm combines interclass separation and intraclass tightness information,which has strong results for image segmentation,but the clustering algorithm is vulnerable to noisy data and dependence on the initialized clustering center.However,the clustering algorithmis susceptible to the influence of noisydata and reliance on initializedclustering centers andfalls into a local optimum;the clustering effect is poor for brain MR images with unclear boundaries and noise effects.To address these problems,a soft subspace clustering algorithm for brain MR images based on genetic algorithm optimization is proposed,which combines the generalized noise technique,relaxes the equational weight constraint in the objective function as the boundary constraint,and uses a genetic algorithm as a method to optimize the initialized clustering center.The genetic algorithm finds the best clustering center and reduces the algorithm’s dependence on the initial clustering center.The experiment verifies the robustness of the algorithm,as well as the noise immunity in various ways and shows good results on the common dataset and the brain MR images provided by the Changshu First People’s Hospital with specific high accuracy for clinical medicine.展开更多
A brain tumor occurs when abnormal cells grow, sometimes very rapidly, into an abnormal mass of tissue. The tumor can infect normal tissue, so there is an interaction between healthy and infected cell. The aim of this...A brain tumor occurs when abnormal cells grow, sometimes very rapidly, into an abnormal mass of tissue. The tumor can infect normal tissue, so there is an interaction between healthy and infected cell. The aim of this paper is to propose some efficient and accurate numerical methods for the computational solution of one-dimensional continuous basic models for the growth and control of brain tumors. After computing the analytical solution, we construct approximations of the solution to the problem using a standard second order finite difference method for space discretization and the Crank-Nicolson method for time discretization. Then, we investigate the convergence behavior of Conjugate gradient and generalized minimum residual as Krylov subspace methods to solve the tridiagonal toeplitz matrix system derived.展开更多
This paper proposes the Rice condition numbers for invariant subspace, singular subspaces of a matrix and deflating subspaces of a regular matrix pair. The first-order perturbation estimations for these subspaces are ...This paper proposes the Rice condition numbers for invariant subspace, singular subspaces of a matrix and deflating subspaces of a regular matrix pair. The first-order perturbation estimations for these subspaces are derived by applying perturbation expansions of orthogonal projection operators.展开更多
In this paper, we show that for log(2/3)/2log2≤β≤1/2, suppose S is an invariant subspace of the Hardy-Sobolev spaces H_β~2(D^n) for the n-tuple of multiplication operators(M_(z_1),...,M_(z_n)). If(M_(z_1)|S,..., M...In this paper, we show that for log(2/3)/2log2≤β≤1/2, suppose S is an invariant subspace of the Hardy-Sobolev spaces H_β~2(D^n) for the n-tuple of multiplication operators(M_(z_1),...,M_(z_n)). If(M_(z_1)|S,..., M_(z_n)|S) is doubly commuting, then for any non-empty subset α = {α_1,..., α_k} of {1,..., n}, W_α~S is a generating wandering subspace for M_α|_S =(M_(z_(α_1))|_S,..., M_(z_(α_k))|_S), that is, [W_α~S]_(M_(α |S))= S, where W_α~S=■(S■z_(α_i)S).展开更多
A 2D-direction of arrival estimation(DOAE) for multiinput and multi-output(MIMO) radar using improved multiple temporal-spatial subspaces in estimating signal parameters via rotational invariance techniques method(TS-...A 2D-direction of arrival estimation(DOAE) for multiinput and multi-output(MIMO) radar using improved multiple temporal-spatial subspaces in estimating signal parameters via rotational invariance techniques method(TS-ESPRIT) is introduced. In order to realize the improved TS-ESPRIT, the proposed algorithm divides the planar array into multiple uniform sub-planar arrays with common reference point to get a unified phase shifts measurement point for all sub-arrays. The TS-ESPRIT is applied to each sub-array separately, and in the same time with the others to realize the parallelly temporal and spatial processing, so that it reduces the non-linearity effect of model and decreases the computational time. Then, the time difference of arrival(TDOA)technique is applied to combine the multiple sub-arrays in order to form the improved TS-ESPRIT. It is found that the proposed method achieves high accuracy at a low signal to noise ratio(SNR)with low computational complexity, leading to enhancement of the estimators performance.展开更多
In this paper, a new algorithm for solving multi-modal function optimization problems-two-level subspace evolutionary algorithm is proposed. In the first level, the improved GT algorithm is used to do global recombina...In this paper, a new algorithm for solving multi-modal function optimization problems-two-level subspace evolutionary algorithm is proposed. In the first level, the improved GT algorithm is used to do global recombination search so that the whole population can be separated into several niches according to the position of solutions; then, in the second level, the niche evolutionary strategy is used for local search in the subspaces gotten in the first level till solutions of the problem are found. The new algorithm has been tested on some hard problems and some good results are obtained.展开更多
The performance of conventional similarity measurement methods is affected seriously by the curse of dimensionality of high-dimensional data.The reason is that data difference between sparse and noisy dimensionalities...The performance of conventional similarity measurement methods is affected seriously by the curse of dimensionality of high-dimensional data.The reason is that data difference between sparse and noisy dimensionalities occupies a large proportion of the similarity,leading to the dissimilarities between any results.A similarity measurement method of high-dimensional data based on normalized net lattice subspace is proposed.The data range of each dimension is divided into several intervals,and the components in different dimensions are mapped onto the corresponding interval.Only the component in the same or adjacent interval is used to calculate the similarity.To validate this method,three data types are used,and seven common similarity measurement methods are compared.The experimental result indicates that the relative difference of the method is increasing with the dimensionality and is approximately two or three orders of magnitude higher than the conventional method.In addition,the similarity range of this method in different dimensions is [0,1],which is fit for similarity analysis after dimensionality reduction.展开更多
The following is proved: 1) The linear independence of assumed stress modes is the necessary and sufficient condition for the nonsingular flexibility matrix; 2) The equivalent assumed stress modes lead to the identica...The following is proved: 1) The linear independence of assumed stress modes is the necessary and sufficient condition for the nonsingular flexibility matrix; 2) The equivalent assumed stress modes lead to the identical hybrid element The Hilbert stress subspace of the assumed stress modes is established So, it is easy to derive the equivalent orthogonal normal stress modes by Schmidt’s method Because of the resulting diagonal flexibility matrix, the identical hybrid element is free from the complex matrix inversion so that the hybrid efficiency is improved greatly The numerical examples show that the method is展开更多
A proton exchange membrane fuel cell(PEMFC)is a new type of hydrogen fuel cell that plays an indispensable role in an energy network.However,the multivariable and fractional-order characteristics of PEMFC make it diff...A proton exchange membrane fuel cell(PEMFC)is a new type of hydrogen fuel cell that plays an indispensable role in an energy network.However,the multivariable and fractional-order characteristics of PEMFC make it difficult to establish a practical model.Herein,a fractional-order subspace identification model based on the adaptive monarch butterfly optimization algorithm with opposition-based learning(ALMBO)algorithm is proposed for PEMFC.Introducing the fractional-order theory into the subspace identification method by adopting a Poisson filter for with input and output data,a weight matrix is proposed to improve the identification accuracy.Additionally,the ALMBO algorithm is employed to optimize the parameters of the Poisson filter and fractional order,which introduces an opposition-based learning strategy into the migration operator and incorporates adaptive weights to improve the optimization accuracy and prevent falling into a locally optimal solution.Finally,the PEMFC fractional-order subspace identification model is established,which can accurately describe the dynamic process of PEMFC.展开更多
Aimed at the issue that traditional clustering methods are not appropriate to high-dimensional data, a cuckoo search fuzzy-weighting algorithm for subspace clustering is presented on the basis of the exited soft subsp...Aimed at the issue that traditional clustering methods are not appropriate to high-dimensional data, a cuckoo search fuzzy-weighting algorithm for subspace clustering is presented on the basis of the exited soft subspace clustering algorithm. In the proposed algorithm, a novel objective function is firstly designed by considering the fuzzy weighting within-cluster compactness and the between-cluster separation, and loosening the constraints of dimension weight matrix. Then gradual membership and improved Cuckoo search, a global search strategy, are introduced to optimize the objective function and search subspace clusters, giving novel learning rules for clustering. At last, the performance of the proposed algorithm on the clustering analysis of various low and high dimensional datasets is experimentally compared with that of several competitive subspace clustering algorithms. Experimental studies demonstrate that the proposed algorithm can obtain better performance than most of the existing soft subspace clustering algorithms.展开更多
The robustness of the subspace method for blind signature waveform estimation with respect to channel order is analyzed in asynchronous DS-CDMA systems theoretically. Theoretical analysis and simulation results show t...The robustness of the subspace method for blind signature waveform estimation with respect to channel order is analyzed in asynchronous DS-CDMA systems theoretically. Theoretical analysis and simulation results show that the overestimating of the channel order will lead to the degradation of the quality of the estimated signature waveform. So we should adopt the channel order as small as possible.展开更多
We introduce and develop a novel approach to outlier detection based on adaptation of random subspace learning. Our proposed method handles both high-dimension low-sample size and traditional low-dimensional high-samp...We introduce and develop a novel approach to outlier detection based on adaptation of random subspace learning. Our proposed method handles both high-dimension low-sample size and traditional low-dimensional high-sample size datasets. Essentially, we avoid the computational bottleneck of techniques like Minimum Covariance Determinant (MCD) by computing the needed determinants and associated measures in much lower dimensional subspaces. Both theoretical and computational development of our approach reveal that it is computationally more efficient than the regularized methods in high-dimensional low-sample size, and often competes favorably with existing methods as far as the percentage of correct outlier detection are concerned.展开更多
基金Project supported by the National Key Research and Development Program of China (Grant No.2021YFB3900701)the Science and Technology Plan Project of the State Administration for Market Regulation of China (Grant No.2023MK178)the National Natural Science Foundation of China (Grant No.42227802)。
文摘A redundant-subspace-weighting(RSW)-based approach is proposed to enhance the frequency stability on a time scale of a clock ensemble.In this method,multiple overlapping subspaces are constructed in the clock ensemble,and the weight of each clock in this ensemble is defined by using the spatial covariance matrix.The superimposition average of covariances in different subspaces reduces the correlations between clocks in the same laboratory to some extent.After optimizing the parameters of this weighting procedure,the frequency stabilities of virtual clock ensembles are significantly improved in most cases.
基金supported by the National Natural Science Foundation of China(61971432)Taishan Scholar Project of Shandong Province(tsqn201909156)the Outstanding Youth Innovation Team Program of University in Shandong Province(2019KJN031)。
文摘Adaptive detection of range-spread targets is considered in the presence of subspace interference plus Gaussian clutter with unknown covariance matrix.The target signal and interference are supposed to lie in two linearly independent subspaces with deterministic but unknown coordinates.Relying on the two-step criteria,two adaptive detectors based on Gradient tests are proposed,in homogeneous and partially homogeneous clutter plus subspace interference,respectively.Both of the proposed detectors exhibit theoretically constant false alarm rate property against unknown clutter covariance matrix as well as the power level.Numerical results show that,the proposed detectors have better performance than their existing counterparts,especially for mismatches in the signal steering vectors.
基金supported by the National Natural Science Foundation of China(62371382,62071346)the Science,Technology&Innovation Project of Xiong’an New Area(2022XAGG0181)the Special Funds for Creative Research(2022C61540)。
文摘This paper focuses on the adaptive detection of range and Doppler dual-spread targets in non-homogeneous and nonGaussian sea clutter.The sea clutter from two polarimetric channels is modeled as a compound-Gaussian model with different parameters,and the target is modeled as a subspace rangespread target model.The persymmetric structure is used to model the clutter covariance matrix,in order to reduce the reliance on secondary data of the designed detectors.Three adaptive polarimetric persymmetric detectors are designed based on the generalized likelihood ratio test(GLRT),Rao test,and Wald test.All the proposed detectors have constant falsealarm rate property with respect to the clutter texture,the speckle covariance matrix.Experimental results on simulated and measured data show that three adaptive detectors outperform the competitors in different clutter environments,and the proposed GLRT detector has the best detection performance under different parameters.
文摘Deep multi-view subspace clustering (DMVSC) based on self-expression has attracted increasing attention dueto its outstanding performance and nonlinear application. However, most existing methods neglect that viewprivatemeaningless information or noise may interfere with the learning of self-expression, which may lead to thedegeneration of clustering performance. In this paper, we propose a novel framework of Contrastive Consistencyand Attentive Complementarity (CCAC) for DMVsSC. CCAC aligns all the self-expressions of multiple viewsand fuses them based on their discrimination, so that it can effectively explore consistent and complementaryinformation for achieving precise clustering. Specifically, the view-specific self-expression is learned by a selfexpressionlayer embedded into the auto-encoder network for each view. To guarantee consistency across views andreduce the effect of view-private information or noise, we align all the view-specific self-expressions by contrastivelearning. The aligned self-expressions are assigned adaptive weights by channel attention mechanism according totheir discrimination. Then they are fused by convolution kernel to obtain consensus self-expression withmaximumcomplementarity ofmultiple views. Extensive experimental results on four benchmark datasets and one large-scaledataset of the CCAC method outperformother state-of-the-artmethods, demonstrating its clustering effectiveness.
文摘Multi-view Subspace Clustering (MVSC) emerges as an advanced clustering method, designed to integrate diverse views to uncover a common subspace, enhancing the accuracy and robustness of clustering results. The significance of low-rank prior in MVSC is emphasized, highlighting its role in capturing the global data structure across views for improved performance. However, it faces challenges with outlier sensitivity due to its reliance on the Frobenius norm for error measurement. Addressing this, our paper proposes a Low-Rank Multi-view Subspace Clustering Based on Sparse Regularization (LMVSC- Sparse) approach. Sparse regularization helps in selecting the most relevant features or views for clustering while ignoring irrelevant or noisy ones. This leads to a more efficient and effective representation of the data, improving the clustering accuracy and robustness, especially in the presence of outliers or noisy data. By incorporating sparse regularization, LMVSC-Sparse can effectively handle outlier sensitivity, which is a common challenge in traditional MVSC methods relying solely on low-rank priors. Then Alternating Direction Method of Multipliers (ADMM) algorithm is employed to solve the proposed optimization problems. Our comprehensive experiments demonstrate the efficiency and effectiveness of LMVSC-Sparse, offering a robust alternative to traditional MVSC methods.
文摘Clustering high dimensional data is challenging as data dimensionality increases the distance between data points,resulting in sparse regions that degrade clustering performance.Subspace clustering is a common approach for processing high-dimensional data by finding relevant features for each cluster in the data space.Subspace clustering methods extend traditional clustering to account for the constraints imposed by data streams.Data streams are not only high-dimensional,but also unbounded and evolving.This necessitates the development of subspace clustering algorithms that can handle high dimensionality and adapt to the unique characteristics of data streams.Although many articles have contributed to the literature review on data stream clustering,there is currently no specific review on subspace clustering algorithms in high-dimensional data streams.Therefore,this article aims to systematically review the existing literature on subspace clustering of data streams in high-dimensional streaming environments.The review follows a systematic methodological approach and includes 18 articles for the final analysis.The analysis focused on two research questions related to the general clustering process and dealing with the unbounded and evolving characteristics of data streams.The main findings relate to six elements:clustering process,cluster search,subspace search,synopsis structure,cluster maintenance,and evaluation measures.Most algorithms use a two-phase clustering approach consisting of an initialization stage,a refinement stage,a cluster maintenance stage,and a final clustering stage.The density-based top-down subspace clustering approach is more widely used than the others because it is able to distinguish true clusters and outliers using projected microclusters.Most algorithms implicitly adapt to the evolving nature of the data stream by using a time fading function that is sensitive to outliers.Future work can focus on the clustering framework,parameter optimization,subspace search techniques,memory-efficient synopsis structures,explicit cluster change detection,and intrinsic performance metrics.This article can serve as a guide for researchers interested in high-dimensional subspace clustering methods for data streams.
基金partially supported by National Key Research and Development Program of China(2019YFC1510902)National Natural Science Foundation of China(62073104)+1 种基金Natural Science Foundation of Heilongjiang Province(LH2022F024)China Postdoctoral Science Foundation(2022M710965)。
文摘This paper presents a subspace identification method for closed-loop systems with unknown deterministic disturbances.To deal with the unknown deterministic disturbances,two strategies are implemented to construct the row space that can be used to approximately represent the unknown deterministic disturbances using the trigonometric functions or Bernstein polynomials depending on whether the disturbance frequencies are known.For closed-loop identification,CCF-N4SID is extended to the case with unknown deterministic disturbances using the oblique projection.In addition,a proper Bernstein polynomial order can be determined using the Akaike information criterion(AIC)or the Bayesian information criterion(BIC).Numerical simulation results demonstrate the effectiveness of the proposed identification method for both periodic and aperiodic deterministic disturbances.
基金This work was supported in part by the National Natural Science Foundation of China under Grant 62171203in part by the Suzhou Key Supporting Subjects[Health Informatics(No.SZFCXK202147)]+2 种基金in part by the Changshu Science and Technology Program[No.CS202015,CS202246]in part by the Changshu City Health and Health Committee Science and Technology Program[No.csws201913]in part by the“333 High Level Personnel Training Project of Jiangsu Province”.
文摘In recent years,the soft subspace clustering algorithm has shown good results for high-dimensional data,which can assign different weights to each cluster class and use weights to measure the contribution of each dimension in various features.The enhanced soft subspace clustering algorithm combines interclass separation and intraclass tightness information,which has strong results for image segmentation,but the clustering algorithm is vulnerable to noisy data and dependence on the initialized clustering center.However,the clustering algorithmis susceptible to the influence of noisydata and reliance on initializedclustering centers andfalls into a local optimum;the clustering effect is poor for brain MR images with unclear boundaries and noise effects.To address these problems,a soft subspace clustering algorithm for brain MR images based on genetic algorithm optimization is proposed,which combines the generalized noise technique,relaxes the equational weight constraint in the objective function as the boundary constraint,and uses a genetic algorithm as a method to optimize the initialized clustering center.The genetic algorithm finds the best clustering center and reduces the algorithm’s dependence on the initial clustering center.The experiment verifies the robustness of the algorithm,as well as the noise immunity in various ways and shows good results on the common dataset and the brain MR images provided by the Changshu First People’s Hospital with specific high accuracy for clinical medicine.
文摘A brain tumor occurs when abnormal cells grow, sometimes very rapidly, into an abnormal mass of tissue. The tumor can infect normal tissue, so there is an interaction between healthy and infected cell. The aim of this paper is to propose some efficient and accurate numerical methods for the computational solution of one-dimensional continuous basic models for the growth and control of brain tumors. After computing the analytical solution, we construct approximations of the solution to the problem using a standard second order finite difference method for space discretization and the Crank-Nicolson method for time discretization. Then, we investigate the convergence behavior of Conjugate gradient and generalized minimum residual as Krylov subspace methods to solve the tridiagonal toeplitz matrix system derived.
文摘This paper proposes the Rice condition numbers for invariant subspace, singular subspaces of a matrix and deflating subspaces of a regular matrix pair. The first-order perturbation estimations for these subspaces are derived by applying perturbation expansions of orthogonal projection operators.
基金supported by the Natural Science Foundation of China(11271092,11471143)the key research project of Nanhu College of Jiaxing University(N41472001-18)
文摘In this paper, we show that for log(2/3)/2log2≤β≤1/2, suppose S is an invariant subspace of the Hardy-Sobolev spaces H_β~2(D^n) for the n-tuple of multiplication operators(M_(z_1),...,M_(z_n)). If(M_(z_1)|S,..., M_(z_n)|S) is doubly commuting, then for any non-empty subset α = {α_1,..., α_k} of {1,..., n}, W_α~S is a generating wandering subspace for M_α|_S =(M_(z_(α_1))|_S,..., M_(z_(α_k))|_S), that is, [W_α~S]_(M_(α |S))= S, where W_α~S=■(S■z_(α_i)S).
基金supported by the National Natural Science Foundation of China(61301211)and the Aviation Science Foundation(20131852028)
文摘A 2D-direction of arrival estimation(DOAE) for multiinput and multi-output(MIMO) radar using improved multiple temporal-spatial subspaces in estimating signal parameters via rotational invariance techniques method(TS-ESPRIT) is introduced. In order to realize the improved TS-ESPRIT, the proposed algorithm divides the planar array into multiple uniform sub-planar arrays with common reference point to get a unified phase shifts measurement point for all sub-arrays. The TS-ESPRIT is applied to each sub-array separately, and in the same time with the others to realize the parallelly temporal and spatial processing, so that it reduces the non-linearity effect of model and decreases the computational time. Then, the time difference of arrival(TDOA)technique is applied to combine the multiple sub-arrays in order to form the improved TS-ESPRIT. It is found that the proposed method achieves high accuracy at a low signal to noise ratio(SNR)with low computational complexity, leading to enhancement of the estimators performance.
基金Supported by the National Natural Science Foundation of China (70071042,60073043,60133010)
文摘In this paper, a new algorithm for solving multi-modal function optimization problems-two-level subspace evolutionary algorithm is proposed. In the first level, the improved GT algorithm is used to do global recombination search so that the whole population can be separated into several niches according to the position of solutions; then, in the second level, the niche evolutionary strategy is used for local search in the subspaces gotten in the first level till solutions of the problem are found. The new algorithm has been tested on some hard problems and some good results are obtained.
基金Supported by the National Natural Science Foundation of China(No.61502475)the Importation and Development of High-Caliber Talents Project of the Beijing Municipal Institutions(No.CIT&TCD201504039)
文摘The performance of conventional similarity measurement methods is affected seriously by the curse of dimensionality of high-dimensional data.The reason is that data difference between sparse and noisy dimensionalities occupies a large proportion of the similarity,leading to the dissimilarities between any results.A similarity measurement method of high-dimensional data based on normalized net lattice subspace is proposed.The data range of each dimension is divided into several intervals,and the components in different dimensions are mapped onto the corresponding interval.Only the component in the same or adjacent interval is used to calculate the similarity.To validate this method,three data types are used,and seven common similarity measurement methods are compared.The experimental result indicates that the relative difference of the method is increasing with the dimensionality and is approximately two or three orders of magnitude higher than the conventional method.In addition,the similarity range of this method in different dimensions is [0,1],which is fit for similarity analysis after dimensionality reduction.
文摘The following is proved: 1) The linear independence of assumed stress modes is the necessary and sufficient condition for the nonsingular flexibility matrix; 2) The equivalent assumed stress modes lead to the identical hybrid element The Hilbert stress subspace of the assumed stress modes is established So, it is easy to derive the equivalent orthogonal normal stress modes by Schmidt’s method Because of the resulting diagonal flexibility matrix, the identical hybrid element is free from the complex matrix inversion so that the hybrid efficiency is improved greatly The numerical examples show that the method is
基金supported by the National Natural Science(Grant No.61374153)the Research Innovation Program for College Graduates ofJiangsu Province (No.KYCX21_0293)
文摘A proton exchange membrane fuel cell(PEMFC)is a new type of hydrogen fuel cell that plays an indispensable role in an energy network.However,the multivariable and fractional-order characteristics of PEMFC make it difficult to establish a practical model.Herein,a fractional-order subspace identification model based on the adaptive monarch butterfly optimization algorithm with opposition-based learning(ALMBO)algorithm is proposed for PEMFC.Introducing the fractional-order theory into the subspace identification method by adopting a Poisson filter for with input and output data,a weight matrix is proposed to improve the identification accuracy.Additionally,the ALMBO algorithm is employed to optimize the parameters of the Poisson filter and fractional order,which introduces an opposition-based learning strategy into the migration operator and incorporates adaptive weights to improve the optimization accuracy and prevent falling into a locally optimal solution.Finally,the PEMFC fractional-order subspace identification model is established,which can accurately describe the dynamic process of PEMFC.
基金supported in part by the National Natural Science Foundation of China (Nos. 61303074, 61309013)the Programs for Science, National Key Basic Research and Development Program ("973") of China (No. 2012CB315900)Technology Development of Henan province (Nos.12210231003, 13210231002)
文摘Aimed at the issue that traditional clustering methods are not appropriate to high-dimensional data, a cuckoo search fuzzy-weighting algorithm for subspace clustering is presented on the basis of the exited soft subspace clustering algorithm. In the proposed algorithm, a novel objective function is firstly designed by considering the fuzzy weighting within-cluster compactness and the between-cluster separation, and loosening the constraints of dimension weight matrix. Then gradual membership and improved Cuckoo search, a global search strategy, are introduced to optimize the objective function and search subspace clusters, giving novel learning rules for clustering. At last, the performance of the proposed algorithm on the clustering analysis of various low and high dimensional datasets is experimentally compared with that of several competitive subspace clustering algorithms. Experimental studies demonstrate that the proposed algorithm can obtain better performance than most of the existing soft subspace clustering algorithms.
文摘The robustness of the subspace method for blind signature waveform estimation with respect to channel order is analyzed in asynchronous DS-CDMA systems theoretically. Theoretical analysis and simulation results show that the overestimating of the channel order will lead to the degradation of the quality of the estimated signature waveform. So we should adopt the channel order as small as possible.
文摘We introduce and develop a novel approach to outlier detection based on adaptation of random subspace learning. Our proposed method handles both high-dimension low-sample size and traditional low-dimensional high-sample size datasets. Essentially, we avoid the computational bottleneck of techniques like Minimum Covariance Determinant (MCD) by computing the needed determinants and associated measures in much lower dimensional subspaces. Both theoretical and computational development of our approach reveal that it is computationally more efficient than the regularized methods in high-dimensional low-sample size, and often competes favorably with existing methods as far as the percentage of correct outlier detection are concerned.