A joint band prioritization and band-decorrelation approach to bandselection for hyperspectral image classification

Band selection for remotely sensed image data is an effective means to mitigate the curse of dimensionality. Many criteria have been suggested in the past for optimal band selection. In this paper, a joint band-prioritization and band-decorrelation approach to band selection is considered for hyperspectral image classification. The proposed band prioritization is a method based on the eigen (spectral) decomposition of a matrix from which a loading-factors matrix can be constructed for band prioritization via the corresponding eigenvalues and eigenvectors. Two approaches are presented, principal components analysis (PCA)-based criteria and classification-based criteria. The former includes the maximum-variance PCA and maximum SNR PCA, whereas the latter derives the minimum misclassification canonical analysis (MMCA) (i.e., Fisher's discriminant analysis) and subspace projection-based criteria. Since the band prioritization does not take spectral correlation into account, an information-theoretic criterion called divergence is used for band decorrelation. Finally, the band selection can then be done by an eigenanalysis based band prioritization in conjunction with a divergence-based band decorrelation. It is shown that the proposed band-selection method effectively eliminates a great number of insignificant bands. Surprisingly, the experiments show that with a proper band selection, less than 0.1 of the total number of bands can achieve comparable performance using the number of full bands. This further demonstrates that the band selection can significantly reduce data volume so as to achieve data compression     

一种快速的宽带相干源DOA估计算法

在现有的投影子空间正交性测试(TOPS)基础上,提出了一种解决宽带相干信源的快速空间谱估计的新方法。该方法通过将窄带快速子空间算法和能量门限算法相结合运用到频域子空间正交性测试算法中,对每个过门限的窄带信号运用窄带快速子空间算法,将共轭重构运用到TOFS算法对宽带相干信号进行目标达到方向(DOA)估计。该算法不需要角度和参考频率的预估计,且去相关处理简单易实现,运算量降低,是一种快速的宽带相干源DOA估计算法。通过计算机仿真结果,验证了该算法在信噪比6 dB以上有较小的均方根误差及较高的分辨概率。     

采用单次快拍数据实现相干信号DOA估计

该文针对均匀线性阵列的相干信号DOA估计问题,提出了一种基于单次快拍数据的解相干算法,该算法直接利用快拍数据构造一个Toeplitz矩阵,经理论推导,该Toeplitz矩阵的秩不受信号的相干性影响,仅和入射信号的个数有关,因此对该矩阵进行特征值分解可得到正确的信号子空间和噪声子空间,结合MUSIC,ESPRIT等子空间算法,即可实现对相干信号的DOA估计。数值仿真验证了该算法的有效性。     

Fast blind channel estimation for space–time block coded MIMO–OFDM systems

Fast blind subspace channel estimation using circular property of the channel matrix is investigated for space–time block coded (STBC) multiple-input multiple-output orthogonal frequency division multiplexing (MIMO–OFDM) systems in this paper. The noise subspace computed from the correlation matrix of received signals requires a large number of symbols to converge in the subspace channel estimation. Using the circular property of the channel matrix, we propose both the cyclic repetition method (CRM) and the forward–backward method (FBM) to generate N times of equivalent signals for each STBC–OFDM symbol, respectively, where N is the size of FFT operation. With these equivalent symbols, the proposed CRM, FBM and CRM–FBM (CFBM) channel estimations can perform very well within a few OFDM symbols. The CRM, FBM and CFBM schemes are applicable to the CP-OFDM, ZP-OFDM and VC-OFDM systems, respectively. The identifiability of the subspace channel estimation is investigated that the channel matrix is determined up to two ambiguity matrices. Computer simulations demonstrate that the CRM-based, FBM-based and CFBM-based channel estimations have better performances than the conventional ones.     

一种新的正弦波频率估计方法研究

对相关阵的最大特征值所对应的特征矢量按一定规则排列的非对称矩阵，其奇异值／奇异矢量分解（SVD）的右奇异矢量同样存在两个子空间，并因此提出了一种新的谱估计方法，即基于相关阵信号子空间的正交矢量法（Orthogonal Vector spectral estimation based on correlation matrix SignalSubspace),简称OVSS法，OVSS法源于相关阵信号子空间，对噪声和数据长度敏感性较小，同时它又是正交矢量法，且源于高阶模型，具有高阶MUSIC法的分辨率，而且是低阶矩阵SVD，没有伪峰。大量模拟试验显示OVSS法是一种具有高分辨率、高统计稳定性、计算量相对增加较小的高质量谱估计方法。     

The use of contextual information in the reversible compression of medical images

The authors investigate the use of conditioning events (or contexts) in improving the performances of known compression methods by building a source model with multiple contexts to code the decorrelated pixels. Three methods for reversible compression, namely DPCM (differential pulse code modulation), WHT (Walsh-Hadamard transform), and HINT (hierarchical interpolation), employing, respectively, predictive decorrelation, transform decorrelation, and multiresolution decorrelation, are considered. It is shown that the performance of these methods can be enhanced significantly, sometimes even up to 40%, by using contexts. The enhanced DPCM method is found to perform the best for MR and UT (ultrasound) medical images; the enhanced WHT method is found to be the best for X-ray images. The source models used in the enhanced models employ several hundred contexts.     

修正的虚拟空间平滑算法

对虚拟空间平滑方法进行了修正,提出了一种适用于直线信号(如调幅、二进制相移键控信号等)的修正虚拟空间平滑解相干方法.该方法无需对信号初始相位作特别假定,并可在不损失阵列有效孔径和工作阵元的情况下完成信号解相干,经其预处理后的特征子空间分解信号波达方向(DOA)估计方法的性能要优于传统空间平滑方法.     

基于子空间分解的信道阶数估计算法

提出一种新的基于子空间分解的信道阶数估计算法.首先基于子空间分解,将观测向量自相关矩阵的几何子空间按照某一正整数La分解为“信号”子空间和“噪声”子空间,由“噪声”子空间构建了一个特殊矩阵Gv,提出了Gv特征分析定理,该定理表明当且仅当La等于信道阶数时,Gv奇异并有唯一的零特征值,并进行了详细的理论和实验证明;然后根据该定理,不断修正“噪声”子空间的大小,判定Gv的奇异性,完成信道阶数的估计.仿真证明该算法不但在低信噪比条件下具有很好的估计性能,而且当信道具有较小的初始和结尾系数时,也能达到很好的效果.     

多径条件下均匀线阵DOA估计及互耦误差自校正

针对多径信道环境下存在互耦误差的均匀线阵,提出了一种联合波达方向估计及互耦 误差自校正算法。在不改变阵列互耦误差的条件下,首先利用虚拟阵列平移预处理方法,将 相干信源协方差矩阵恢复到满秩。进而利用互耦误差的对称Toeplitz特性,基于子空间原理 构造一代阶函数,采用秩损的方法得到互耦误差条件下的DOA估计及阵列互耦误差。数值仿 真结果表明,该算法具有良好的DOA估计性能与互耦误差自校正性能。     

Blind estimation of a fractionally sampled FIR channel for OFDM transmission using residue polynomials

This paper introduces blind-channel estimation methods using residue polynomials for orthogonal-frequency-division-multiplexing (OFDM) transmission under the assumption that the channel is finite-impulse response (FIR). In terms of z transform, if the received signal is multiplied by the inverse of the transmitted signal, the resulting z transform renders the channel transfer function when additive noise is absent in the channel. For an FIR channel, samples of the recovered impulse response must be zero in the region of zeros of the channel impulse response. Based on this observation, the blind estimation problem is formulated as a solution of linear equations, treating the transmitted symbols as unknown variables. Polynomial residue arithmetic turns out to be very useful for deriving the linear equations. The proposed method is computationally more efficient than subspace methods that are applied for OFDM transmission systems. In addition, unlike subspace methods, the proposed method is deterministic and does not require estimation of the autocorrelation matrix of received signals, which is required in subspace methods.     

Multidimensional multirate DOA estimation in beamspace

This paper presents a beamspace version of ESPRIT for uniform rectangular arrays that supports closed-form 2-D angle estimation, automatically couples the two components of the source directions, and works with any front end beamformer. The proposed algorithm is based on the observation that beamspace noise eigenvectors can be transformed to vectors that are bandpass and have spectral nulls at the inband source locations. This facilitates multirate processing (involving modulation to baseband, filtering, and decimation) and yields a space with dimensionality equal to the number of beams used to probe the subband rather than the number of elements in the sensor array. The MUSIC algorithm can be applied to this noise subspace. Alternatively, a transformation matrix can be computed a priori, which maps the beamspace signal eigenvectors to the corresponding signal subspace that has the ESPRIT structure. The TLS-ESPRIT algorithm is then modified to obtain the two directions for each source from a single eigenvalue-eigenvector pair. Hence, they are automatically coupled     

一种信源个数与波达方向联合估计的新算法

针对多级维纳滤波器(MSWF)用于子空间估计时信号特征矢量泄漏到噪声子空间的问题,提出了一种新的信号子空间估计算法,该算法不需要训练信号和信源个数的先验知识.随后,给出了一种信源个数的后判断方法,最终完成信源个数及方向的同时估计.整个算法不需要协方差矩阵的计算和特征值的分解,具有较低的计算复杂度.在均匀线阵且信号互不相关情况下,改进后的算法用于波达方向估计时拥有与基于特征分解方法近似的性能.仿真结果验证了该方法的有效性.     

一种实用性强的MC-CDMA盲信道估计方法

基于子空间分解的MC-CDMA盲信道估计算法运算量大,实用性差.本文根据在MC-CDMA中信号子空间维数远小于噪声子空间维数的特点提出从信号子空间的角度进行MC-CDMA盲信道估计,并采用PASTd算法对信号子空间及其维数进行动态跟踪.本文还通过对子空间跟踪的结果进行正交化处理的方法,显著提高了盲信道估计的性能.本文的盲信道估计方法运算量低,实用性强,仿真结果表明其盲信道估计性能接近特征值分解法.     

Bilinear approach to multiuser second-order statistics-based blindchannel estimation

We present a bilinear approach to multiple-input multiple-output (MIMO) blind channel estimation where products of the channel parameters are first estimated from the covariance of the received data. The channel parameters are then obtained as the dominant eigenvectors of the outer-product estimate. Necessary and sufficient identifiability conditions are presented for a single channel and extended to the multichannel case. It is found that this technique can identify the channel to within a subspace ambiguity, as long as the basis functions for the channel satisfy certain constraints, regardless of the left invertability of the channel matrix. One important requirement for identifiability is that the number of channel parameters is small compared with the channel length; advantageously, this is exactly the situation in which this algorithm has significantly lower complexity than competing (parametric, multiuser) blind algorithms. Simulations show that the technique is applicable in situations where typical identifiability conditions fail: common nulls, a single symbol-spaced channel, and more users than channels. These simulations are for the “almost flat” faded situation when the propagation delay spread is a fraction of the transmission pulse duration (as might be found in current TDMA systems). Comparisons are made, when possible, to a subspace method incorporating knowledge of the basis functions. The bilinear approach requires significantly less computation but performs better than the subspace method at low SNR, especially for multiple users     

Blind identification of FIR MIMO channels by decorrelating subchannels

We study blind identification and equalization of finite impulse response (FIR) and multi-input and multi-output (MIMO) channels driven by colored signals. We first show a sufficient condition for an FIR MIMO channel to be identifiable up to a scaling and permutation using the second-order statistics of the channel output. This condition is that the channel matrix is irreducible (but not necessarily column-reduced), and the input signals are mutually uncorrelated and of distinct power spectra. We also show that this condition is necessary in the sense that no single part of the condition can be further weakened without another part being strengthened. While the above condition is a strong result that sets a fundamental limit of blind identification, there does not yet exist a working algorithm under that condition. In the second part of this paper, we show that a method called blind identification via decorrelating subchannels (BIDS) can uniquely identify an FIR MIMO channel if a) the channel matrix is nonsingular (almost everywhere) and column-wise coprime and b) the input signals are mutually uncorrelated and of sufficiently diverse power spectra. The BIDS method requires a weaker condition on the channel matrix than that required by most existing methods for the same problem.     

循环平稳信号的联合稀疏表示DOA估计

基于联合稀疏表示的思想,本文提出了一种利用二阶循环统计量的循环平稳信号波达方向（DOA）估计算法。首先,对传统的谱相关信号子空间拟合算法进行分析研究;然后,通过在循环域构造过完备的阵列方向矩阵字典,建立了联合稀疏表示模型,从而将循环平稳信号的DOA估计问题转化为联合稀疏矩阵的恢复问题;最后,利用联合Ι_2,0范数逼近法求出联合稀疏矩阵的优化解,并根据优化矩阵中非零行的位置估计出循环平稳信号的DOA。与传统的SCSSF算法相比,所提算法具有更高的DOA估计精度,同时也适用于信号个数多于阵元个数的场合。理论分析和仿真实验结果都表明了算法的有效性。      

一种互耦和相干源条件下的DOA估计方法

空间平滑算法是一种常用的解相干处理方法,而阵元间互耦的存在会导致空间平滑算法失效,从而无法准确估计相干源DOA。针对这个问题,文中提出了一种新的DOA估计方法。该方法基于信号子空间和噪声子空间的正交性原理,利用入射信号源中的独立信号源可以有效估计出互耦矩阵,再通过估计的互耦矩阵对接收数据协方差矩阵进行互耦补偿,克服了互耦对空间平滑算法的影响,从而保证了相干源DOA能准确估计。计算机仿真实验表明了该方法的有效性。     

互相关矩阵重排获取信号子空间的二维DOA估计算法

本文提出一种L型阵列的二维子空间DOA估计算法,该算法通过重排阵列接收数据的互相关矩阵获取信号子空间,然后根据信号子空间生成一个二维谱函数,最后通过二维搜索估计信号的来波方向。由于该算法采用二维谱峰搜索,所以不需要对俯仰角和方位角进行配对。与二维MUSIC算法相比,该算法的估计精度略有下降,但该算法不需要对矩阵做特征值分解,计算量降低且易于实现。文中给出了该算法的推导过程和具体实现步骤,并进行了实验仿真,仿真结果说明了算法的有效性。      

Computationally Efficient ESPRIT Method for Direction Finding

In this paper,a low complexity ESPRIT algorithm based on power method and Orthogo- nal-triangular (QR) decomposition is presented for direction finding,which does not require a priori knowledge of source number and the predetermined threshold (separates the signal and noise ei- gen-values).Firstly,according to the estimation of noise subspace obtained by the power method,a novel source number detection method without eigen-decomposition is proposed based on QR de- composition.Furthermore,the eigenvectors of signal subspace can be determined according to Q matrix and then the directions of signals could be computed by the ESPRIT algorithm.To determine the source number and subspace,the computation complexity of the proposed algorithm is approximated as (2log_2 n 2.67)M~3,where n is the power of covariance matrix and M is the number of array ele- ments.Compared with the Single Vector Decomposition (SVD) based algorithm,it has a substantial computational saving with the approximation performance.The simulation results demonstrate its effectiveness and robustness.     

迭代子空间跟踪和结构约束的自适应波束形成算法

自适应波束形成(adaptive beam-forming:ABF)方法通过对阵列数据进行加权处理来获得最大的输出信干噪比,对采样协方差矩阵依赖性较大.在小快拍和通道随机响应误差条件下,采样协方差矩阵的估计值与真实值通常存在较大差异,严重恶化了基于线性约束最小均方误差准则的自适应波束形成方法的干扰抑制性能.针对该问题,本文基于子空间投影类波束形成方法的思想,提出采用迭代子空间跟踪和结构约束的自适应波束形成方法.该方法首先利用clearing技术在训练样本集上依次跟踪主特征矢量并构成信号子空间;然后根据子空间投影类波束形成权矢量的结构特性计算自适应加权矢量.仿真结果表明本文方法能有效提高自适应波束算法的输出信干噪比.