This paper considers approximately sparse signal and low-rank matrix’s recovery via truncated norm minimization minx∥xT∥q and minX∥XT∥Sq from noisy measurements.We first introduce truncated sparse approximation p...This paper considers approximately sparse signal and low-rank matrix’s recovery via truncated norm minimization minx∥xT∥q and minX∥XT∥Sq from noisy measurements.We first introduce truncated sparse approximation property,a more general robust null space property,and establish the stable recovery of signals and matrices under the truncated sparse approximation property.We also explore the relationship between the restricted isometry property and truncated sparse approximation property.And we also prove that if a measurement matrix A or linear map A satisfies truncated sparse approximation property of order k,then the first inequality in restricted isometry property of order k and of order 2k can hold for certain different constantsδk andδ2k,respectively.Last,we show that ifδs(k+|T^c|)<√(s-1)/s for some s≥4/3,then measurement matrix A and linear map A satisfy truncated sparse approximation property of order k.It should be pointed out that when Tc=Ф,our conclusion implies that sparse approximation property of order k is weaker than restricted isometry property of order sk.展开更多
Given a symmetric matrix X, we consider the problem of finding a low-rank positive approximant of X. That is, a symmetric positive semidefinite matrix, S, whose rank is smaller than a given positive integer, , which i...Given a symmetric matrix X, we consider the problem of finding a low-rank positive approximant of X. That is, a symmetric positive semidefinite matrix, S, whose rank is smaller than a given positive integer, , which is nearest to X in a certain matrix norm. The problem is first solved with regard to four common norms: The Frobenius norm, the Schatten p-norm, the trace norm, and the spectral norm. Then the solution is extended to any unitarily invariant matrix norm. The proof is based on a subtle combination of Ky Fan dominance theorem, a modified pinching principle, and Mirsky minimum-norm theorem.展开更多
In recent years,utilizing the low-rank prior information to construct a signal from a small amount of measures has attracted much attention.In this paper,a generalized nonconvex low-rank(GNLR) algorithm for magnetic r...In recent years,utilizing the low-rank prior information to construct a signal from a small amount of measures has attracted much attention.In this paper,a generalized nonconvex low-rank(GNLR) algorithm for magnetic resonance imaging(MRI)reconstruction is proposed,which reconstructs the image from highly under-sampled k-space data.In the algorithm,the nonconvex surrogate function replacing the conventional nuclear norm is utilized to enhance the low-rank property inherent in the reconstructed image.An alternative direction multiplier method(ADMM) is applied to solving the resulting non-convex model.Extensive experimental results have demonstrated that the proposed method can consistently recover MRIs efficiently,and outperforms the current state-of-the-art approaches in terms of higher peak signal-to-noise ratio(PSNR) and lower high-frequency error norm(HFEN) values.展开更多
Least squares projection twin support vector machine(LSPTSVM)has faster computing speed than classical least squares support vector machine(LSSVM).However,LSPTSVM is sensitive to outliers and its solution lacks sparsi...Least squares projection twin support vector machine(LSPTSVM)has faster computing speed than classical least squares support vector machine(LSSVM).However,LSPTSVM is sensitive to outliers and its solution lacks sparsity.Therefore,it is difficult for LSPTSVM to process large-scale datasets with outliers.In this paper,we propose a robust LSPTSVM model(called R-LSPTSVM)by applying truncated least squares loss function.The robustness of R-LSPTSVM is proved from a weighted perspective.Furthermore,we obtain the sparse solution of R-LSPTSVM by using the pivoting Cholesky factorization method in primal space.Finally,the sparse R-LSPTSVM algorithm(SR-LSPTSVM)is proposed.Experimental results show that SR-LSPTSVM is insensitive to outliers and can deal with large-scale datasets fastly.展开更多
We present our recent work on both linear and nonlinear data reduction methods and algorithms: for the linear case we discuss results on structure analysis of SVD of columnpartitioned matrices and sparse low-rank appr...We present our recent work on both linear and nonlinear data reduction methods and algorithms: for the linear case we discuss results on structure analysis of SVD of columnpartitioned matrices and sparse low-rank approximation; for the nonlinear case we investigate methods for nonlinear dimensionality reduction and manifold learning. The problems we address have attracted great deal of interest in data mining and machine learning.展开更多
This paper proposes a low-rank spectral estimation algorithm of learning Markov model.First,an approximate projection algorithm for the rank-constrained frequency matrix set is proposed,and thereafter its local Lipsch...This paper proposes a low-rank spectral estimation algorithm of learning Markov model.First,an approximate projection algorithm for the rank-constrained frequency matrix set is proposed,and thereafter its local Lipschitzian error bound established.Then,we propose a low-rank spectral estimation algorithm for estimating the state transition frequency matrix and the probability matrix of Markov model by applying the approximate projection algorithm to correct the maximum likelihood estimation of the frequency matrix,and prove that there is only a multiplying constant difference in estimation errors between the low-rank spectral estimation and the maximum likelihood estimation under appropriate conditions.Finally,numerical comparisons with the prevailing maximum likelihood estimation,spectral estimation,and rank-constrained maxi-mum likelihood estimation show that the low-rank spectral estimation algorithm is effective.展开更多
Nonnegative tensor ring(NTR) decomposition is a powerful tool for capturing the significant features of tensor objects while preserving the multi-linear structure of tensor data. The existing algorithms rely on freque...Nonnegative tensor ring(NTR) decomposition is a powerful tool for capturing the significant features of tensor objects while preserving the multi-linear structure of tensor data. The existing algorithms rely on frequent reshaping and permutation operations in the optimization process and use a shrinking step size or projection techniques to ensure core tensor nonnegativity, which leads to a slow convergence rate, especially for large-scale problems. In this paper, we first propose an NTR algorithm based on the modulus method(NTR-MM), which constrains core tensor nonnegativity by modulus transformation. Second, a low-rank approximation(LRA) is introduced to NTR-MM(named LRA-NTR-MM), which not only reduces the computational complexity of NTR-MM significantly but also suppresses the noise. The simulation results demonstrate that the proposed LRA-NTR-MM algorithm achieves higher computational efficiency than the state-of-the-art algorithms while preserving the effectiveness of feature extraction.展开更多
Seismic data reconstruction is an essential and yet fundamental step in seismic data processing workflow,which is of profound significance to improve migration imaging quality,multiple suppression effect,and seismic i...Seismic data reconstruction is an essential and yet fundamental step in seismic data processing workflow,which is of profound significance to improve migration imaging quality,multiple suppression effect,and seismic inversion accuracy.Regularization methods play a central role in solving the underdetermined inverse problem of seismic data reconstruction.In this paper,a novel regularization approach is proposed,the low dimensional manifold model(LDMM),for reconstructing the missing seismic data.Our work relies on the fact that seismic patches always occupy a low dimensional manifold.Specifically,we exploit the dimension of the seismic patches manifold as a regularization term in the reconstruction problem,and reconstruct the missing seismic data by enforcing low dimensionality on this manifold.The crucial procedure of the proposed method is to solve the dimension of the patches manifold.Toward this,we adopt an efficient dimensionality calculation method based on low-rank approximation,which provides a reliable safeguard to enforce the constraints in the reconstruction process.Numerical experiments performed on synthetic and field seismic data demonstrate that,compared with the curvelet-based sparsity-promoting L1-norm minimization method and the multichannel singular spectrum analysis method,the proposed method obtains state-of-the-art reconstruction results.展开更多
The generalized singular value decomposition(GSVD)of two matrices with the same number of columns is a very useful tool in many practical applications.However,the GSVD may suffer from heavy computational time and memo...The generalized singular value decomposition(GSVD)of two matrices with the same number of columns is a very useful tool in many practical applications.However,the GSVD may suffer from heavy computational time and memory requirement when the scale of the matrices is quite large.In this paper,we use random projections to capture the most of the action of the matrices and propose randomized algorithms for computing a low-rank approximation of the GSVD.Serval error bounds of the approximation are also presented for the proposed randomized algorithms.Finally,some experimental results show that the proposed randomized algorithms can achieve a good accuracy with less computational cost and storage requirement.展开更多
This note explores the relations between two different methods. The first one is the Alternating Least Squares (ALS) method for calculating a rank<em>-k</em> approximation of a real <em>m</em>&...This note explores the relations between two different methods. The first one is the Alternating Least Squares (ALS) method for calculating a rank<em>-k</em> approximation of a real <em>m</em>×<em>n</em> matrix, <em>A</em>. This method has important applications in nonnegative matrix factorizations, in matrix completion problems, and in tensor approximations. The second method is called Orthogonal Iterations. Other names of this method are Subspace Iterations, Simultaneous Iterations, and block-Power method. Given a real symmetric matrix, <em>G</em>, this method computes<em> k</em> dominant eigenvectors of <em>G</em>. To see the relation between these methods we assume that <em>G </em>=<em> A</em><sup>T</sup> <em>A</em>. It is shown that in this case the two methods generate the same sequence of subspaces, and the same sequence of low-rank approximations. This equivalence provides new insight into the convergence properties of both methods.展开更多
The concept of structured sparse coding noise is introduced to exploit the spatial correlations and nonlocal constraint of the local structure. Then the model of nonlocally centralized simultaneous sparse coding(NCSSC...The concept of structured sparse coding noise is introduced to exploit the spatial correlations and nonlocal constraint of the local structure. Then the model of nonlocally centralized simultaneous sparse coding(NCSSC)is proposed for reconstructing the original image, and an algorithm is proposed to transform the simultaneous sparse coding into reweighted low-rank approximation. Experimental results on image denoisng, deblurring and super-resolution demonstrate the advantage of the proposed NC-SSC method over the state-of-the-art image restoration methods.展开更多
In this article, the computation of μ-values known as Structured Singular Values SSV for the companion matrices is presented. The comparison of lower bounds with the well-known MATLAB routine mussv is investigated. T...In this article, the computation of μ-values known as Structured Singular Values SSV for the companion matrices is presented. The comparison of lower bounds with the well-known MATLAB routine mussv is investigated. The Structured Singular Values provides important tools to analyze the stability and instability analysis of closed loop time invariant systems in the linear control theory as well as in structured eigenvalue perturbation theory.展开更多
In this article the computation of the Structured Singular Values (SSV) for the delay eigenvalue problems and polynomial eigenvalue problems is presented and investigated. The comparison of bounds of SSV with the well...In this article the computation of the Structured Singular Values (SSV) for the delay eigenvalue problems and polynomial eigenvalue problems is presented and investigated. The comparison of bounds of SSV with the well-known MATLAB routine mussv is investigated.展开更多
Hybrid precoding is a cost-effective approach to support directional transmissions for millimeter-wave(mmWave)communications,but its precoder design is highly complicated.In this paper,we propose a new hybrid precoder...Hybrid precoding is a cost-effective approach to support directional transmissions for millimeter-wave(mmWave)communications,but its precoder design is highly complicated.In this paper,we propose a new hybrid precoder implementation,namely the double phase shifter(DPS)implementation,which enables highly tractable hybrid precoder design.Efficient algorithms are then developed for two popular hybrid precoder structures,i.e.,the fully-and partially-connected structures.For the fully-connected one,the RF-only precoding and hybrid precoding problems are formulated as a least absolute shrinkage and selection operator problem and a low-rank matrix approximation problem,respectively.In this way,computationally efficient algorithms are provided to approach the performance of the fully digital one with a small number of radio frequency(RF)chains.On the other hand,the hybrid precoder design in the partially-connected structure is identified as an eigenvalue problem.To enhance the performance of this cost-effective structure,dynamic mapping from RF chains to antennas is further proposed,for which a greedy algorithm and a modified K-means algorithm are developed.Simulation results demonstrate the performance gains of the proposed hybrid precoding algorithms over existing ones.It shows that,with the proposed DPS implementation,the fully-connected structure enjoys both satisfactory performance and low design complexity while the partially-connected one serves as an economic solution with low hardware complexity.展开更多
This article introduces a novel low rank approximation (LRA)-based model to detect the functional regions with the data from about 15 million social media check-in records during a year-long period in Shanghai, China....This article introduces a novel low rank approximation (LRA)-based model to detect the functional regions with the data from about 15 million social media check-in records during a year-long period in Shanghai, China. We identified a series of latent structures, named latent spatio-temporal activity structures. While interpreting these structures, we can obtain a series of underlying associations between the spatial and temporal activity patterns. Moreover, we can not only reproduce the observed data with a lower dimensional representative, but also project spatio-temporal activity patterns in the same coordinate system. With the K-means clustering algorithm, five significant types of clusters that are directly annotated with a combination of temporal activities can be obtained, providing a clear picture of the correlation between the groups of regions and different activities at different times during a day. Besides the commercial and transportation dominant areas, we also detected two kinds of residential areas, the developed residential areas and the developing residential areas.We further interpret the spatial distribution of these clusters using urban form analytics. The results are highly consistent with the government planning in the same periods, indicating that our model is applicable to infer the functional regions from social media check-in data and can benefit a wide range of fields, such as urban planning, public services, and location-based recommender systems.展开更多
This study aimed to specialise a directional H^(2)(DH^(2))compression to matrices arising from the discontinuous Galerkin(DG)discretisation of the hypersingular equation in acoustics.The significantfinding is an algor...This study aimed to specialise a directional H^(2)(DH^(2))compression to matrices arising from the discontinuous Galerkin(DG)discretisation of the hypersingular equation in acoustics.The significantfinding is an algorithm that takes a DG stiffness matrix andfinds a near-optimal DH^(2) approximation for low and high-frequency problems.We introduced the necessary special optimisations to make this algorithm more efficient in the case of a DG stiffness matrix.Moreover,an automatic parameter tuning strategy makes it easy to use and versatile.Numerical comparisons with a classical Boundary Element Method(BEM)show that a DG scheme combined with a DH^(2) gives better computational efficiency than a classical BEM in the case of high-order finite elements and hp heterogeneous meshes.The results indicate that DG is suitable for an auto-adaptive context in integral equations.展开更多
基金supported by the National Natural Science Foundation of China(11871109)NSAF(U1830107)the Science Challenge Project(TZ2018001)
文摘This paper considers approximately sparse signal and low-rank matrix’s recovery via truncated norm minimization minx∥xT∥q and minX∥XT∥Sq from noisy measurements.We first introduce truncated sparse approximation property,a more general robust null space property,and establish the stable recovery of signals and matrices under the truncated sparse approximation property.We also explore the relationship between the restricted isometry property and truncated sparse approximation property.And we also prove that if a measurement matrix A or linear map A satisfies truncated sparse approximation property of order k,then the first inequality in restricted isometry property of order k and of order 2k can hold for certain different constantsδk andδ2k,respectively.Last,we show that ifδs(k+|T^c|)<√(s-1)/s for some s≥4/3,then measurement matrix A and linear map A satisfy truncated sparse approximation property of order k.It should be pointed out that when Tc=Ф,our conclusion implies that sparse approximation property of order k is weaker than restricted isometry property of order sk.
文摘Given a symmetric matrix X, we consider the problem of finding a low-rank positive approximant of X. That is, a symmetric positive semidefinite matrix, S, whose rank is smaller than a given positive integer, , which is nearest to X in a certain matrix norm. The problem is first solved with regard to four common norms: The Frobenius norm, the Schatten p-norm, the trace norm, and the spectral norm. Then the solution is extended to any unitarily invariant matrix norm. The proof is based on a subtle combination of Ky Fan dominance theorem, a modified pinching principle, and Mirsky minimum-norm theorem.
基金National Natural Science Foundations of China(Nos.61362001,61365013,51165033)the Science and Technology Department of Jiangxi Province of China(Nos.20132BAB211030,20122BAB211015)+1 种基金the Jiangxi Advanced Projects for Postdoctoral Research Funds,China(o.2014KY02)the Innovation Special Fund Project of Nanchang University,China(o.cx2015136)
文摘In recent years,utilizing the low-rank prior information to construct a signal from a small amount of measures has attracted much attention.In this paper,a generalized nonconvex low-rank(GNLR) algorithm for magnetic resonance imaging(MRI)reconstruction is proposed,which reconstructs the image from highly under-sampled k-space data.In the algorithm,the nonconvex surrogate function replacing the conventional nuclear norm is utilized to enhance the low-rank property inherent in the reconstructed image.An alternative direction multiplier method(ADMM) is applied to solving the resulting non-convex model.Extensive experimental results have demonstrated that the proposed method can consistently recover MRIs efficiently,and outperforms the current state-of-the-art approaches in terms of higher peak signal-to-noise ratio(PSNR) and lower high-frequency error norm(HFEN) values.
基金supported by the National Natural Science Foundation of China(6177202062202433+4 种基金621723716227242262036010)the Natural Science Foundation of Henan Province(22100002)the Postdoctoral Research Grant in Henan Province(202103111)。
文摘Least squares projection twin support vector machine(LSPTSVM)has faster computing speed than classical least squares support vector machine(LSSVM).However,LSPTSVM is sensitive to outliers and its solution lacks sparsity.Therefore,it is difficult for LSPTSVM to process large-scale datasets with outliers.In this paper,we propose a robust LSPTSVM model(called R-LSPTSVM)by applying truncated least squares loss function.The robustness of R-LSPTSVM is proved from a weighted perspective.Furthermore,we obtain the sparse solution of R-LSPTSVM by using the pivoting Cholesky factorization method in primal space.Finally,the sparse R-LSPTSVM algorithm(SR-LSPTSVM)is proposed.Experimental results show that SR-LSPTSVM is insensitive to outliers and can deal with large-scale datasets fastly.
基金This work was supported in part by the Special Funds for Major State Basic Research Projectsthe National Natural Science Foundation of China(Grants No.60372033 and 9901936)NSF CCR9901986,DMS 0311800.
文摘We present our recent work on both linear and nonlinear data reduction methods and algorithms: for the linear case we discuss results on structure analysis of SVD of columnpartitioned matrices and sparse low-rank approximation; for the nonlinear case we investigate methods for nonlinear dimensionality reduction and manifold learning. The problems we address have attracted great deal of interest in data mining and machine learning.
文摘This paper proposes a low-rank spectral estimation algorithm of learning Markov model.First,an approximate projection algorithm for the rank-constrained frequency matrix set is proposed,and thereafter its local Lipschitzian error bound established.Then,we propose a low-rank spectral estimation algorithm for estimating the state transition frequency matrix and the probability matrix of Markov model by applying the approximate projection algorithm to correct the maximum likelihood estimation of the frequency matrix,and prove that there is only a multiplying constant difference in estimation errors between the low-rank spectral estimation and the maximum likelihood estimation under appropriate conditions.Finally,numerical comparisons with the prevailing maximum likelihood estimation,spectral estimation,and rank-constrained maxi-mum likelihood estimation show that the low-rank spectral estimation algorithm is effective.
基金This work was supported by the National Natural Science Foundation of China(Grant Nos.62073087,61973087 and 61973090)the Key-Area Research and Development Program of Guangdong Province(Grant No.2019B010154002)。
文摘Nonnegative tensor ring(NTR) decomposition is a powerful tool for capturing the significant features of tensor objects while preserving the multi-linear structure of tensor data. The existing algorithms rely on frequent reshaping and permutation operations in the optimization process and use a shrinking step size or projection techniques to ensure core tensor nonnegativity, which leads to a slow convergence rate, especially for large-scale problems. In this paper, we first propose an NTR algorithm based on the modulus method(NTR-MM), which constrains core tensor nonnegativity by modulus transformation. Second, a low-rank approximation(LRA) is introduced to NTR-MM(named LRA-NTR-MM), which not only reduces the computational complexity of NTR-MM significantly but also suppresses the noise. The simulation results demonstrate that the proposed LRA-NTR-MM algorithm achieves higher computational efficiency than the state-of-the-art algorithms while preserving the effectiveness of feature extraction.
基金supported by National Natural Science Foundation of China(Grant No.41874146 and No.42030103)Postgraduate Innovation Project of China University of Petroleum(East China)(No.YCX2021012)
文摘Seismic data reconstruction is an essential and yet fundamental step in seismic data processing workflow,which is of profound significance to improve migration imaging quality,multiple suppression effect,and seismic inversion accuracy.Regularization methods play a central role in solving the underdetermined inverse problem of seismic data reconstruction.In this paper,a novel regularization approach is proposed,the low dimensional manifold model(LDMM),for reconstructing the missing seismic data.Our work relies on the fact that seismic patches always occupy a low dimensional manifold.Specifically,we exploit the dimension of the seismic patches manifold as a regularization term in the reconstruction problem,and reconstruct the missing seismic data by enforcing low dimensionality on this manifold.The crucial procedure of the proposed method is to solve the dimension of the patches manifold.Toward this,we adopt an efficient dimensionality calculation method based on low-rank approximation,which provides a reliable safeguard to enforce the constraints in the reconstruction process.Numerical experiments performed on synthetic and field seismic data demonstrate that,compared with the curvelet-based sparsity-promoting L1-norm minimization method and the multichannel singular spectrum analysis method,the proposed method obtains state-of-the-art reconstruction results.
基金The research is supported by the National Natural Science Foundation of China under Grant nos.11701409 and 11571171the Natural Science Foundation of Jiangsu Province of China under Grant BK20170591the Natural Science Foundation of Jiangsu Higher Education Institutions of China under Grant 17KJB110018.
文摘The generalized singular value decomposition(GSVD)of two matrices with the same number of columns is a very useful tool in many practical applications.However,the GSVD may suffer from heavy computational time and memory requirement when the scale of the matrices is quite large.In this paper,we use random projections to capture the most of the action of the matrices and propose randomized algorithms for computing a low-rank approximation of the GSVD.Serval error bounds of the approximation are also presented for the proposed randomized algorithms.Finally,some experimental results show that the proposed randomized algorithms can achieve a good accuracy with less computational cost and storage requirement.
文摘This note explores the relations between two different methods. The first one is the Alternating Least Squares (ALS) method for calculating a rank<em>-k</em> approximation of a real <em>m</em>×<em>n</em> matrix, <em>A</em>. This method has important applications in nonnegative matrix factorizations, in matrix completion problems, and in tensor approximations. The second method is called Orthogonal Iterations. Other names of this method are Subspace Iterations, Simultaneous Iterations, and block-Power method. Given a real symmetric matrix, <em>G</em>, this method computes<em> k</em> dominant eigenvectors of <em>G</em>. To see the relation between these methods we assume that <em>G </em>=<em> A</em><sup>T</sup> <em>A</em>. It is shown that in this case the two methods generate the same sequence of subspaces, and the same sequence of low-rank approximations. This equivalence provides new insight into the convergence properties of both methods.
基金Supported by the National Natural Science Foundation of China(No.61379014)
文摘The concept of structured sparse coding noise is introduced to exploit the spatial correlations and nonlocal constraint of the local structure. Then the model of nonlocally centralized simultaneous sparse coding(NCSSC)is proposed for reconstructing the original image, and an algorithm is proposed to transform the simultaneous sparse coding into reweighted low-rank approximation. Experimental results on image denoisng, deblurring and super-resolution demonstrate the advantage of the proposed NC-SSC method over the state-of-the-art image restoration methods.
文摘In this article, the computation of μ-values known as Structured Singular Values SSV for the companion matrices is presented. The comparison of lower bounds with the well-known MATLAB routine mussv is investigated. The Structured Singular Values provides important tools to analyze the stability and instability analysis of closed loop time invariant systems in the linear control theory as well as in structured eigenvalue perturbation theory.
文摘In this article the computation of the Structured Singular Values (SSV) for the delay eigenvalue problems and polynomial eigenvalue problems is presented and investigated. The comparison of bounds of SSV with the well-known MATLAB routine mussv is investigated.
基金supported in part by the Hong Kong Research Grants Council under Grant No.16210216 and in part by the Alexander von Humboldt Foundation.
文摘Hybrid precoding is a cost-effective approach to support directional transmissions for millimeter-wave(mmWave)communications,but its precoder design is highly complicated.In this paper,we propose a new hybrid precoder implementation,namely the double phase shifter(DPS)implementation,which enables highly tractable hybrid precoder design.Efficient algorithms are then developed for two popular hybrid precoder structures,i.e.,the fully-and partially-connected structures.For the fully-connected one,the RF-only precoding and hybrid precoding problems are formulated as a least absolute shrinkage and selection operator problem and a low-rank matrix approximation problem,respectively.In this way,computationally efficient algorithms are provided to approach the performance of the fully digital one with a small number of radio frequency(RF)chains.On the other hand,the hybrid precoder design in the partially-connected structure is identified as an eigenvalue problem.To enhance the performance of this cost-effective structure,dynamic mapping from RF chains to antennas is further proposed,for which a greedy algorithm and a modified K-means algorithm are developed.Simulation results demonstrate the performance gains of the proposed hybrid precoding algorithms over existing ones.It shows that,with the proposed DPS implementation,the fully-connected structure enjoys both satisfactory performance and low design complexity while the partially-connected one serves as an economic solution with low hardware complexity.
基金the Open Research Fund Program of Shenzhen Key Laboratory of Spatial Smart Sensing and Services%sponsored by the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry(grant number 50-20150618)%National Natural Science Foundation of China (grant numbers 41001220, 51378512, 41571397, and 41501442)This work was also supported by the Special Program for Applied Research on Super Computation of the NSFC-Guangdong Joint Fund
文摘This article introduces a novel low rank approximation (LRA)-based model to detect the functional regions with the data from about 15 million social media check-in records during a year-long period in Shanghai, China. We identified a series of latent structures, named latent spatio-temporal activity structures. While interpreting these structures, we can obtain a series of underlying associations between the spatial and temporal activity patterns. Moreover, we can not only reproduce the observed data with a lower dimensional representative, but also project spatio-temporal activity patterns in the same coordinate system. With the K-means clustering algorithm, five significant types of clusters that are directly annotated with a combination of temporal activities can be obtained, providing a clear picture of the correlation between the groups of regions and different activities at different times during a day. Besides the commercial and transportation dominant areas, we also detected two kinds of residential areas, the developed residential areas and the developing residential areas.We further interpret the spatial distribution of these clusters using urban form analytics. The results are highly consistent with the government planning in the same periods, indicating that our model is applicable to infer the functional regions from social media check-in data and can benefit a wide range of fields, such as urban planning, public services, and location-based recommender systems.
文摘This study aimed to specialise a directional H^(2)(DH^(2))compression to matrices arising from the discontinuous Galerkin(DG)discretisation of the hypersingular equation in acoustics.The significantfinding is an algorithm that takes a DG stiffness matrix andfinds a near-optimal DH^(2) approximation for low and high-frequency problems.We introduced the necessary special optimisations to make this algorithm more efficient in the case of a DG stiffness matrix.Moreover,an automatic parameter tuning strategy makes it easy to use and versatile.Numerical comparisons with a classical Boundary Element Method(BEM)show that a DG scheme combined with a DH^(2) gives better computational efficiency than a classical BEM in the case of high-order finite elements and hp heterogeneous meshes.The results indicate that DG is suitable for an auto-adaptive context in integral equations.
