This paper presents a small perturbation Cramer method for obtaining the large deviation principle of a family of measures (β,ε> 0) on a topological vector space. As an application, we obtain the moderate deviati...This paper presents a small perturbation Cramer method for obtaining the large deviation principle of a family of measures (β,ε> 0) on a topological vector space. As an application, we obtain the moderate deviation estimations for uniformly ergodic Markov processes.展开更多
Detecting moving objects in the stationary background is an important problem in visual surveillance systems.However,the traditional background subtraction method fails when the background is not completely stationary...Detecting moving objects in the stationary background is an important problem in visual surveillance systems.However,the traditional background subtraction method fails when the background is not completely stationary and involves certain dynamic changes.In this paper,according to the basic steps of the background subtraction method,a novel non-parametric moving object detection method is proposed based on an improved ant colony algorithm by using the Markov random field.Concretely,the contributions are as follows:1)A new nonparametric strategy is utilized to model the background,based on an improved kernel density estimation;this approach uses an adaptive bandwidth,and the fused features combine the colours,gradients and positions.2)A Markov random field method based on this adaptive background model via the constraint of the spatial context is proposed to extract objects.3)The posterior function is maximized efficiently by using an improved ant colony system algorithm.Extensive experiments show that the proposed method demonstrates a better performance than many existing state-of-the-art methods.展开更多
This paper addresses the issues of channel estimation in a Multiple-Input/Multiple-Output (MIMO) system. Markov Chain Monte Carlo (MCMC) method is employed to jointly estimate the Channel State Information (CSI) and t...This paper addresses the issues of channel estimation in a Multiple-Input/Multiple-Output (MIMO) system. Markov Chain Monte Carlo (MCMC) method is employed to jointly estimate the Channel State Information (CSI) and the transmitted signals. The deduced algorithms can work well under circumstances of low Signal-to-Noise Ratio (SNR). Simulation results are presented to demonstrate their effectiveness.展开更多
We discuss the incomplete semi-iterative method (ISIM) for an approximate solution of a linear fixed point equations x=Tx+c with a bounded linear operator T acting on a complex Banach space X such that its resolvent h...We discuss the incomplete semi-iterative method (ISIM) for an approximate solution of a linear fixed point equations x=Tx+c with a bounded linear operator T acting on a complex Banach space X such that its resolvent has a pole of order k at the point 1. Sufficient conditions for the convergence of ISIM to a solution of x=Tx+c, where c belongs to the range space of R(I-T) k, are established. We show that the ISIM has an attractive feature that it is usually convergent even when the spectral radius of the operator T is greater than 1 and Ind 1T≥1. Applications in finite Markov chain is considered and illustrative examples are reported, showing the convergence rate of the ISIM is very high.展开更多
文摘This paper presents a small perturbation Cramer method for obtaining the large deviation principle of a family of measures (β,ε> 0) on a topological vector space. As an application, we obtain the moderate deviation estimations for uniformly ergodic Markov processes.
基金supported in part by the National Natural Science Foundation of China under Grants 61841103,61673164,and 61602397in part by the Natural Science Foundation of Hunan Provincial under Grants 2016JJ2041 and 2019JJ50106+1 种基金in part by the Key Project of Education Department of Hunan Provincial under Grant 18B385and in part by the Graduate Research Innovation Projects of Hunan Province under Grants CX2018B805 and CX2018B813.
文摘Detecting moving objects in the stationary background is an important problem in visual surveillance systems.However,the traditional background subtraction method fails when the background is not completely stationary and involves certain dynamic changes.In this paper,according to the basic steps of the background subtraction method,a novel non-parametric moving object detection method is proposed based on an improved ant colony algorithm by using the Markov random field.Concretely,the contributions are as follows:1)A new nonparametric strategy is utilized to model the background,based on an improved kernel density estimation;this approach uses an adaptive bandwidth,and the fused features combine the colours,gradients and positions.2)A Markov random field method based on this adaptive background model via the constraint of the spatial context is proposed to extract objects.3)The posterior function is maximized efficiently by using an improved ant colony system algorithm.Extensive experiments show that the proposed method demonstrates a better performance than many existing state-of-the-art methods.
文摘This paper addresses the issues of channel estimation in a Multiple-Input/Multiple-Output (MIMO) system. Markov Chain Monte Carlo (MCMC) method is employed to jointly estimate the Channel State Information (CSI) and the transmitted signals. The deduced algorithms can work well under circumstances of low Signal-to-Noise Ratio (SNR). Simulation results are presented to demonstrate their effectiveness.
基金Project1 990 1 0 0 6 supported by National Natural Science Foundation of China,Doctoral Foundation of China,Chi-na Scholarship council and Laboratory of Computational Physics in Beijing of Chinathe second author is also supportedby the State Major Key
文摘We discuss the incomplete semi-iterative method (ISIM) for an approximate solution of a linear fixed point equations x=Tx+c with a bounded linear operator T acting on a complex Banach space X such that its resolvent has a pole of order k at the point 1. Sufficient conditions for the convergence of ISIM to a solution of x=Tx+c, where c belongs to the range space of R(I-T) k, are established. We show that the ISIM has an attractive feature that it is usually convergent even when the spectral radius of the operator T is greater than 1 and Ind 1T≥1. Applications in finite Markov chain is considered and illustrative examples are reported, showing the convergence rate of the ISIM is very high.
