In the medical computer tomography （CT） field, total variation （TV）, which is the l1-norm of the discrete gradient transform （DGT）, is widely used as regularization based on the compressive sensing （CS） theory...In the medical computer tomography （CT） field, total variation （TV）, which is the l1-norm of the discrete gradient transform （DGT）, is widely used as regularization based on the compressive sensing （CS） theory. To overcome the TV model＇s disadvantageous tendency of uniformly penalizing the image gradient and over smoothing the low-contrast structures, an iterative algorithm based on the l0-norm optimization of the DGT is proposed. In order to rise to the challenges introduced by the l0-norm DGT, the algorithm uses a pseudo-inverse transform of DGT and adapts an iterative hard thresholding （IHT） algorithm, whose convergence and effective efficiency have been theoretically proven. The simulation demonstrates our conclusions and indicates that the algorithm proposed in this paper can obviously improve the reconstruction quality.展开更多
To improve the identification capability of AP algorithm in time-varying sparse system, we propose a block parallel l_0-SWL-DCD-AP algorithm in this paper. In the proposed algorithm, we first introduce the l_0-norm co...To improve the identification capability of AP algorithm in time-varying sparse system, we propose a block parallel l_0-SWL-DCD-AP algorithm in this paper. In the proposed algorithm, we first introduce the l_0-norm constraint to promote its application for sparse system. Second, we use the shrinkage denoising method to improve its track ability. Third, we adopt the widely linear processing to take advantage of the non-circular properties of communication signals. Last, to reduce the high computational complexity and make it easy to implemented, we utilize the dichotomous coordinate descent(DCD) iterations and the parallel processing to deal with the tapweight update in the proposed algorithm. To verify the convergence condition of the proposed algorithm, we also analyze its steadystate behavior. Several simulation are done and results show that the proposed algorithm can achieve a faster convergence speed and a lower steady-state misalignment than similar APA-type algorithm. When apply the proposed algorithm in the decision feedback equalizer(DFE), the bite error rate(BER) decreases obviously.展开更多
Extending the results of an article published in(Acta Mathematica Sinica(2016,59(4)) by the author, for a sequence of normed spaces {Xi}, the representation problem of conjugate spaces of some l^0({X_i}) type F-normed...Extending the results of an article published in(Acta Mathematica Sinica(2016,59(4)) by the author, for a sequence of normed spaces {Xi}, the representation problem of conjugate spaces of some l^0({X_i}) type F-normed spaces are studied in this paper. The algebraic representation continued equalities l^0({X_i}) * A=c_(00)~0({X_i}) * A= c_(00)({X_i~*}),(l^0(X))~* A=(c^0(X) )~* A=(c_0~0(X))~* A=(c_(00)~0(X))~* A= c_(00)(X~*)are obtained in the first part. Under weak-star topology, the topological representation c_(00)~0({X_i}) ~*, w~* = c_(00)~0({X_i~*}) is obtained in the second part. For the sequence of inner product spaces and number fields with the usual topology, the concrete forms of the basic representation theorems are obtained at last.展开更多
文摘In the medical computer tomography （CT） field, total variation （TV）, which is the l1-norm of the discrete gradient transform （DGT）, is widely used as regularization based on the compressive sensing （CS） theory. To overcome the TV model＇s disadvantageous tendency of uniformly penalizing the image gradient and over smoothing the low-contrast structures, an iterative algorithm based on the l0-norm optimization of the DGT is proposed. In order to rise to the challenges introduced by the l0-norm DGT, the algorithm uses a pseudo-inverse transform of DGT and adapts an iterative hard thresholding （IHT） algorithm, whose convergence and effective efficiency have been theoretically proven. The simulation demonstrates our conclusions and indicates that the algorithm proposed in this paper can obviously improve the reconstruction quality.
基金supported by the National Natural Science Foundation of China (Grant No. 61471138, 50909029 and 61531012)Program of International S\&T Cooperation (Grant No. 2013DFR20050)+1 种基金the Defense Industrial Technology Development Program (Grant No. B2420132004)the Acoustic Science and Technology Laboratory (2014)
文摘To improve the identification capability of AP algorithm in time-varying sparse system, we propose a block parallel l_0-SWL-DCD-AP algorithm in this paper. In the proposed algorithm, we first introduce the l_0-norm constraint to promote its application for sparse system. Second, we use the shrinkage denoising method to improve its track ability. Third, we adopt the widely linear processing to take advantage of the non-circular properties of communication signals. Last, to reduce the high computational complexity and make it easy to implemented, we utilize the dichotomous coordinate descent(DCD) iterations and the parallel processing to deal with the tapweight update in the proposed algorithm. To verify the convergence condition of the proposed algorithm, we also analyze its steadystate behavior. Several simulation are done and results show that the proposed algorithm can achieve a faster convergence speed and a lower steady-state misalignment than similar APA-type algorithm. When apply the proposed algorithm in the decision feedback equalizer(DFE), the bite error rate(BER) decreases obviously.
基金Supported by the National Natural Science Foundation of China（11471236）
文摘Extending the results of an article published in(Acta Mathematica Sinica(2016,59(4)) by the author, for a sequence of normed spaces {Xi}, the representation problem of conjugate spaces of some l^0({X_i}) type F-normed spaces are studied in this paper. The algebraic representation continued equalities l^0({X_i}) * A=c_(00)~0({X_i}) * A= c_(00)({X_i~*}),(l^0(X))~* A=(c^0(X) )~* A=(c_0~0(X))~* A=(c_(00)~0(X))~* A= c_(00)(X~*)are obtained in the first part. Under weak-star topology, the topological representation c_(00)~0({X_i}) ~*, w~* = c_(00)~0({X_i~*}) is obtained in the second part. For the sequence of inner product spaces and number fields with the usual topology, the concrete forms of the basic representation theorems are obtained at last.
