Code acquisition is the kernel operation for signal synchronization in the spread-spectrum receiver.To reduce the computational complexity and latency of code acquisition,this paper proposes an efficient scheme employ...Code acquisition is the kernel operation for signal synchronization in the spread-spectrum receiver.To reduce the computational complexity and latency of code acquisition,this paper proposes an efficient scheme employing sparse Fourier transform(SFT)and the relevant hardware architecture for field programmable gate array(FPGA)and application-specific integrated circuit(ASIC)implementation.Efforts are made at both the algorithmic level and the implementation level to enable merged searching of code phase and Doppler frequency without incurring massive hardware expenditure.Compared with the existing code acquisition approaches,it is shown from theoretical analysis and experimental results that the proposed design can shorten processing latency and reduce hardware complexity without degrading the acquisition probability.展开更多
Abstract:Sparse coding(SC)based visual tracking(l1-tracker)is gaining increasing attention,and many related algorithms are developed.In these algorithms,each candidate region is sparsely represented as a set of target...Abstract:Sparse coding(SC)based visual tracking(l1-tracker)is gaining increasing attention,and many related algorithms are developed.In these algorithms,each candidate region is sparsely represented as a set of target templates.However,the structure connecting these candidate regions is usually ignored.Lu proposed an NLSSC-tracker with non-local self-similarity sparse coding to address this issue,which has a high computational cost.In this study,we propose an Euclidean local-structure constraint based sparse coding tracker with a smoothed Euclidean local structure.With this tracker,the optimization procedure is transformed to a small-scale l1-optimization problem,significantly reducing the computational cost.Extensive experimental results on visual tracking demonstrate the eectiveness and efficiency of the proposed algorithm.展开更多
Aiming at technical difficulties in feature extraction for the inverse synthetic aperture radar （ISAR） target recognition, this paper imports the concept of visual perception and presents a novel method, which is ba...Aiming at technical difficulties in feature extraction for the inverse synthetic aperture radar （ISAR） target recognition, this paper imports the concept of visual perception and presents a novel method, which is based on the combination of non-negative sparse coding （NNSC） and linear discrimination optimization, to recognize targets in ISAR images. This method implements NNSC on the matrix constituted by the intensities of pixels in ISAR images for training, to obtain non-negative sparse bases which characterize sparse distribution of strong scattering centers. Then this paper chooses sparse bases via optimization criteria and calculates the corresponding non-negative sparse codes of both training and test images as the feature vectors, which are input into k neighbors classifier to realize recognition finally. The feasibility and robustness of the proposed method are proved by comparing with the template matching, principle component analysis （PCA） and non-negative matrix factorization （NMF） via simulations.展开更多
A new method for interaction recognition based on sparse representation of feature covariance matrices was presented.Firstly,the dense trajectories(DT)extracted from the video were clustered into different groups to e...A new method for interaction recognition based on sparse representation of feature covariance matrices was presented.Firstly,the dense trajectories(DT)extracted from the video were clustered into different groups to eliminate the irrelevant trajectories,which could greatly reduce the noise influence on feature extraction.Then,the trajectory tunnels were characterized by means of feature covariance matrices.In this way,the discriminative descriptors could be extracted,which was also an effective solution to the problem that the description of the feature second-order statistics is insufficient.After that,an over-complete dictionary was learned with the descriptors and all the descriptors were encoded using sparse coding(SC).Classification was achieved using multiple instance learning(MIL),which was more suitable for complex environments.The proposed method was tested and evaluated on the WEB Interaction dataset and the UT interaction dataset.The experimental results demonstrated the superior efficiency.展开更多
基金supported by the National Natural Science Foundation of China(61801503).
文摘Code acquisition is the kernel operation for signal synchronization in the spread-spectrum receiver.To reduce the computational complexity and latency of code acquisition,this paper proposes an efficient scheme employing sparse Fourier transform(SFT)and the relevant hardware architecture for field programmable gate array(FPGA)and application-specific integrated circuit(ASIC)implementation.Efforts are made at both the algorithmic level and the implementation level to enable merged searching of code phase and Doppler frequency without incurring massive hardware expenditure.Compared with the existing code acquisition approaches,it is shown from theoretical analysis and experimental results that the proposed design can shorten processing latency and reduce hardware complexity without degrading the acquisition probability.
基金National Natural Foundation of China under Grant(61572085,61502058)
文摘Abstract:Sparse coding(SC)based visual tracking(l1-tracker)is gaining increasing attention,and many related algorithms are developed.In these algorithms,each candidate region is sparsely represented as a set of target templates.However,the structure connecting these candidate regions is usually ignored.Lu proposed an NLSSC-tracker with non-local self-similarity sparse coding to address this issue,which has a high computational cost.In this study,we propose an Euclidean local-structure constraint based sparse coding tracker with a smoothed Euclidean local structure.With this tracker,the optimization procedure is transformed to a small-scale l1-optimization problem,significantly reducing the computational cost.Extensive experimental results on visual tracking demonstrate the eectiveness and efficiency of the proposed algorithm.
基金supported by the Prominent Youth Fund of the National Natural Science Foundation of China (61025006)
文摘Aiming at technical difficulties in feature extraction for the inverse synthetic aperture radar （ISAR） target recognition, this paper imports the concept of visual perception and presents a novel method, which is based on the combination of non-negative sparse coding （NNSC） and linear discrimination optimization, to recognize targets in ISAR images. This method implements NNSC on the matrix constituted by the intensities of pixels in ISAR images for training, to obtain non-negative sparse bases which characterize sparse distribution of strong scattering centers. Then this paper chooses sparse bases via optimization criteria and calculates the corresponding non-negative sparse codes of both training and test images as the feature vectors, which are input into k neighbors classifier to realize recognition finally. The feasibility and robustness of the proposed method are proved by comparing with the template matching, principle component analysis （PCA） and non-negative matrix factorization （NMF） via simulations.
基金Manuscript received February 13, 2016 accepted December 7, 2016. This work was supported by the National Natural Science Foundation of China （61362001, 61661031）, Jiangxi Province Innovation Projects for Postgraduate Funds （YC2016-S006）, the International Postdoctoral Exchange Fellowship Program, and Jiangxi Advanced Project for Post-Doctoral Research Fund （2014KY02）.
基金Project(51678075) supported by the National Natural Science Foundation of ChinaProject(2017GK2271) supported by the Science and Technology Project of Hunan Province,China
文摘A new method for interaction recognition based on sparse representation of feature covariance matrices was presented.Firstly,the dense trajectories(DT)extracted from the video were clustered into different groups to eliminate the irrelevant trajectories,which could greatly reduce the noise influence on feature extraction.Then,the trajectory tunnels were characterized by means of feature covariance matrices.In this way,the discriminative descriptors could be extracted,which was also an effective solution to the problem that the description of the feature second-order statistics is insufficient.After that,an over-complete dictionary was learned with the descriptors and all the descriptors were encoded using sparse coding(SC).Classification was achieved using multiple instance learning(MIL),which was more suitable for complex environments.The proposed method was tested and evaluated on the WEB Interaction dataset and the UT interaction dataset.The experimental results demonstrated the superior efficiency.
