期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
核递推最小二乘辨识算法仿真研究 被引量:2
1
作者 李志农 赵匡 何况 《南昌航空大学学报(自然科学版)》 CAS 2011年第2期1-6,共6页
论述了核递推最小二乘辨识思想和三种典型算法即ALD-KRLS、SW-KRLS,和FB-KRLS,通过仿真研究,比较了传统递推最小二乘(RLS)辨识算法和核递推最小二乘(KRLS)辨识算法对非线性系统的辨识能力。仿真研究表明,不论是在辨识精度,稳定性还是抗... 论述了核递推最小二乘辨识思想和三种典型算法即ALD-KRLS、SW-KRLS,和FB-KRLS,通过仿真研究,比较了传统递推最小二乘(RLS)辨识算法和核递推最小二乘(KRLS)辨识算法对非线性系统的辨识能力。仿真研究表明,不论是在辨识精度,稳定性还是抗干扰性方面,KRLS辨识算法明显优于传统RLS辨识法。在这三种典型的KRLS辨识算法,SW-KRLS法比其他两种KRLS辨识算法获得了更好的辨识效果。SW-KRLS法特别适用于时变非线性系统辨识。 展开更多
关键词 核方法 非线性回归 递推最小二乘 稀化表示
下载PDF
Two-level Bregmanized method for image interpolation with graph regularized sparse coding 被引量:1
2
作者 刘且根 张明辉 梁栋 《Journal of Southeast University(English Edition)》 EI CAS 2013年第4期384-388,共5页
A two-level Bregmanized method with graph regularized sparse coding (TBGSC) is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inne... A two-level Bregmanized method with graph regularized sparse coding (TBGSC) is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inner-level Bregmanized method devotes to dictionary updating and sparse represention of small overlapping image patches. The introduced constraint of graph regularized sparse coding can capture local image features effectively, and consequently enables accurate reconstruction from highly undersampled partial data. Furthermore, modified sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge within a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can effectively reconstruct images and it outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures. 展开更多
关键词 image interpolation Bregman iterative method graph regularized sparse coding alternating direction method
下载PDF
Sparse representation-based color visualization method for hyperspectral imaging
3
作者 王立国 刘丹凤 赵亮 《Applied Geophysics》 SCIE CSCD 2013年第2期210-221,237,共13页
In this paper, we designed a color visualization model for sparse representation of the whole hyperspectral image, in which, not only the spectral information in the sparse representation but also the spatial informat... In this paper, we designed a color visualization model for sparse representation of the whole hyperspectral image, in which, not only the spectral information in the sparse representation but also the spatial information of the whole image is retained. After the sparse representation, the color labels of the effective elements of the sparse coding dictionary are selected according to the sparse coefficient and then the mixed images are displayed. The generated images maintain spectral distance preservation and have good separability. For local ground objects, the proposed single-pixel mixed array and improved oriented sliver textures methods are integrated to display the specific composition of each pixel. This avoids the confusion of the color presentation in the mixed-pixel color display and can also be used to reconstruct the original hyperspectral data. Finally, the model effectiveness was proved using real data. This method is promising and can find use in many fields, such as energy exploration, environmental monitoring, disaster warning, and so on. 展开更多
关键词 HYPERSPECTRAL color visualization sparse representation multilayer visualization
下载PDF
AN ALGORITHM FOR DICTIONARY GENERATION IN SPARSE REPRESENTATION
4
作者 Xie Zongbo Feng Jiuchao 《Journal of Electronics(China)》 2009年第6期836-841,共6页
The K-COD (K-Complete Orthogonal Decomposition) algorithm for generating adaptive dictionary for signals sparse representation in the framework of K-means clustering is proposed in this paper,in which rank one approxi... The K-COD (K-Complete Orthogonal Decomposition) algorithm for generating adaptive dictionary for signals sparse representation in the framework of K-means clustering is proposed in this paper,in which rank one approximation for components assembling signals based on COD and K-means clustering based on chaotic random search are well utilized. The results of synthetic test and empirical experiment for the real data show that the proposed algorithm outperforms recently reported alternatives: K-Singular Value Decomposition (K-SVD) algorithm and Method of Optimal Directions (MOD) algorithm. 展开更多
关键词 Sparse representation K-Complete Orthogonal Decomposition (K-COD) Adaptivedictionary
下载PDF
Sparse time-frequency representation of nonlinear and nonstationary data Dedicated to Professor Shi Zhong-Ci on the Occasion of his 80th Birthday 被引量:7
5
作者 HOU Thomas Yizhao SHI ZuoQiang 《Science China Mathematics》 SCIE 2013年第12期2489-2506,共18页
Adaptive data analysis provides an important tool in extracting hidden physical information from multiscale data that arise from various applications. In this paper, we review two data-driven time-frequency analysis m... Adaptive data analysis provides an important tool in extracting hidden physical information from multiscale data that arise from various applications. In this paper, we review two data-driven time-frequency analysis methods that we introduced recently to study trend and instantaneous frequency of nonlinear and nonstationary data. These methods are inspired by the empirical mode decomposition method (EMD) and the recently developed compressed (compressive) sensing theory. The main idea is to look for the sparsest representation of multiscale data within the largest possible dictionary consisting of intrinsic mode functions of the form {a(t) cos(0(t))}, where a is assumed to be less oscillatory than cos(θ(t)) and θ '≥ 0. This problem can be formulated as a nonlinear ι0 optimization problem. We have proposed two methods to solve this nonlinear optimization problem. The first one is based on nonlinear basis pursuit and the second one is based on nonlinear matching pursuit. Convergence analysis has been carried out for the nonlinear matching pursuit method. Some numerical experiments are given to demonstrate the effectiveness of the proposed methods. 展开更多
关键词 sparse representation time-frequency analysis DATA-DRIVEN
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部