Several problems in imaging acquire multiple measurement vectors(MMVs)of Fourier samples for the same underlying scene.Image recovery techniques from MMVs aim to exploit the joint sparsity across the measurements in t...Several problems in imaging acquire multiple measurement vectors(MMVs)of Fourier samples for the same underlying scene.Image recovery techniques from MMVs aim to exploit the joint sparsity across the measurements in the sparse domain.This is typically accomplished by extending the use of`1 regularization of the sparse domain in the single measurement vector(SMV)case to using`2,1 regularization so that the“jointness”can be accounted for.Although effective,the approach is inherently coupled and therefore computationally inefficient.The method also does not consider current approaches in the SMV case that use spatially varying weighted`1 regularization term.The recently introduced variance based joint sparsity(VBJS)recovery method uses the variance across the measurements in the sparse domain to produce a weighted MMV method that is more accurate and more efficient than the standard`2,1 approach.The efficiency is due to the decoupling of the measurement vectors,with the increased accuracy resulting from the spatially varying weight.Motivated by these results,this paper introduces a new technique to even further reduce computational cost by eliminating the requirement to first approximate the underlying image in order to construct the weights.Eliminating this preprocessing step moreover reduces the amount of information lost from the data,so that our method is more accurate.Numerical examples provided in the paper verify these benefits.展开更多
Robust PCA has found important applications in many areas,such as video surveillance,face recognition,latent semantic indexing and so on.In this paper,we study its application in ground moving target indication(GMTI)i...Robust PCA has found important applications in many areas,such as video surveillance,face recognition,latent semantic indexing and so on.In this paper,we study its application in ground moving target indication(GMTI)in wide-area surveillance radar system.MTI is the key task in wide-area surveillance radar system.Due to its great importance in future reconnaissance systems,it attracts great interest from scientists.In(Yan et al.in IEEE Geosci.Remote Sens.Lett.,10:617–621,2013),the authors first introduced robust PCA to model the GMTI problem,and demonstrate promising simulation results to verify the advantages over other models.However,the robust PCA model can not fully describe the problem.As pointed out in(Yan et al.in IEEE Geosci.Remote Sens.Lett.,10:617–621,2013),due to the special structure of the sparse matrix(which includes the moving target information),there will be difficulties for the exact extraction of moving targets.This motivates our work in this paper where we will detail the GMTI problem,explore the mathematical properties and discuss how to set up better models to solve the problem.We propose two models,the structured RPCA model and the row-modulus RPCA model,both of which will better fit the problem and take more use of the special structure of the sparse matrix.Simulation results confirm the improvement of the proposed models over the one in(Yan et al.in IEEE Geosci.Remote Sens.Lett.,10:617–621,2013).展开更多
文摘Several problems in imaging acquire multiple measurement vectors(MMVs)of Fourier samples for the same underlying scene.Image recovery techniques from MMVs aim to exploit the joint sparsity across the measurements in the sparse domain.This is typically accomplished by extending the use of`1 regularization of the sparse domain in the single measurement vector(SMV)case to using`2,1 regularization so that the“jointness”can be accounted for.Although effective,the approach is inherently coupled and therefore computationally inefficient.The method also does not consider current approaches in the SMV case that use spatially varying weighted`1 regularization term.The recently introduced variance based joint sparsity(VBJS)recovery method uses the variance across the measurements in the sparse domain to produce a weighted MMV method that is more accurate and more efficient than the standard`2,1 approach.The efficiency is due to the decoupling of the measurement vectors,with the increased accuracy resulting from the spatially varying weight.Motivated by these results,this paper introduces a new technique to even further reduce computational cost by eliminating the requirement to first approximate the underlying image in order to construct the weights.Eliminating this preprocessing step moreover reduces the amount of information lost from the data,so that our method is more accurate.Numerical examples provided in the paper verify these benefits.
基金supported by the National Science Foundation of China(No.11101410)China Postdoctoral Science Foundation(No.2011M500416).
文摘Robust PCA has found important applications in many areas,such as video surveillance,face recognition,latent semantic indexing and so on.In this paper,we study its application in ground moving target indication(GMTI)in wide-area surveillance radar system.MTI is the key task in wide-area surveillance radar system.Due to its great importance in future reconnaissance systems,it attracts great interest from scientists.In(Yan et al.in IEEE Geosci.Remote Sens.Lett.,10:617–621,2013),the authors first introduced robust PCA to model the GMTI problem,and demonstrate promising simulation results to verify the advantages over other models.However,the robust PCA model can not fully describe the problem.As pointed out in(Yan et al.in IEEE Geosci.Remote Sens.Lett.,10:617–621,2013),due to the special structure of the sparse matrix(which includes the moving target information),there will be difficulties for the exact extraction of moving targets.This motivates our work in this paper where we will detail the GMTI problem,explore the mathematical properties and discuss how to set up better models to solve the problem.We propose two models,the structured RPCA model and the row-modulus RPCA model,both of which will better fit the problem and take more use of the special structure of the sparse matrix.Simulation results confirm the improvement of the proposed models over the one in(Yan et al.in IEEE Geosci.Remote Sens.Lett.,10:617–621,2013).