Minimum BER Criterion Based Robust Blind Separation for MIMO Systems

In this paper, a robust blind source separation (BSS) algorithm is investigated based on a new cost function for noise suppression. This new cost function is established according to the criterion of minimum bit error rate (BER) incorporated into maximum likelihood (ML) principle based independent component analysis (ICA). With the help of natural gradient search, the blind separation work is carried out through optimizing this constructed cost function. Simulation results and analysis corroborate that the proposed blind separation algorithm can realize better performance in speed of convergence and separation accuracy as opposed to the conventional ML-based BSS

A Novel Blind Separation Method in Magnetic Resonance Images

A novel global search algorithm based method is proposed to separate MR images blindly in this paper. The key point of the method is the formulation of the new matrix which forms a generalized permutation of the original mixing matrix. Since the lowest entropy is closely associated with the smooth degree of source images, blind image separation can be formulated to an entropy minimization problem by using the property that most of neighbor pixels are smooth. A new dataset can be obtained by multiplying the mixed matrix by the inverse of the new matrix. Thus, the search technique is used to searching for the lowest entropy values of the new data. Accordingly, the separation weight vector associated with the lowest entropy values can be obtained. Compared with the conventional independent component analysis (ICA), the original signals in the proposed algorithm are not required to be independent. Simulation results on MR images are employed to further show the advantages of the proposed method

Sunyaev-Zel'dovich clusters reconstruction in multiband bolometer camera surveys

We present a new method for the reconstruction of Sunyaev-Zel'dovich (SZ) galaxy clusters in future SZ-survey experiments using multiband bolometer cameras such as Olimpo, APEX, or Planck. Our goal is to optimise SZ-Cluster extraction from our observed noisy maps. We wish to emphasize that none of the algorithms used in the detection chain is tuned on prior knowledge on the SZ -Cluster signal, or other astrophysical sources (Optical Spectrum, Noise Covariance Matrix, or covariance of SZ Cluster wavelet coefficients). First, a blind separation of the different astrophysical components which contribute to the observations is conducted using an Independent Component Analysis (ICA) method. Then, a recent non linear filtering technique in the wavelet domain, based on multiscale entropy and the False Discovery Rate (FDR) method, is used to detect and reconstruct the galaxy clusters. Finally, we use the Source Extractor software to identify the detected clusters. The proposed method was applied on realistic simulations of observations. As for global detection efficiency, this new method is impressive as it provides comparable results to Pierpaoli et al. method being however a blind algorithm. Preprint with full resolution figures is available at the URL: w10-dapnia.saclay.cea.fr/Phocea/Vie_des_labos/Ast/ast_visu.php?id_ast=728Comment: Submitted to A&A. 32 Pages, text onl

Application of Blind Source Separation Algorithms and Ambient Vibration Testing to the Health Monitoring of Concrete Dams

In this work, using AVT data, a health monitoring method for concrete dams based on two different blind source separation (BSS) methods, that is, second-order blind identification (SOBI) and independent component analysis (ICA), is proposed. A modal identification procedure, which integrates the SOBI algorithm and modal contribution, is first adopted to extract structural modal features using AVT data. The method to calculate the modal contribution index for SOBI-based modal identification methods is studied, and the calculated modal contribution index is used to determine the system order. The selected modes are then used to calculate modal features and are analysed using ICA to extract some independent components (ICs). The square prediction error (SPE) index and its control limits are then calculated to construct a control chart for the structural dynamic features. For new AVT data of a dam in an unknown health state, the newly calculated SPE is compared with the control limits to judge whether the dam is normal. With the simulated AVT data of the numerical model for a concrete gravity dam and the measured AVT data of a practical engineering project, the performance of the dam health monitoring method proposed in this paper is validated

Multiuser detection in CDMA using blind techniques

Thesis (Master)--Izmir Institute of Technology, Electronics and Communication Engineering, Izmir, 2004Includes bibliographical references (leaves: 63-65)Text in English; Abstract: Turkish and Englishxiv, 69 leavesIn code division multiple access (CDMA) systems, blind multiuser detection (MUD) techniques are of great importance, especially for downlinks, since in practice, it may be unrealistic for a mobile user to know the spreading codes of other active users in the channel. Furthermore, blind methods remove the need for training sequences which leads to a gain in the channel bandwidth. Subspace concept in blind MUD is an alternative process to classical and batch blind MUD techniques based on principle component analysis, or independent component analysis (ICA) and ICA-like algorithms, such as joint approximate diagonalization of eigen-matrices (JADE), blind source separation algorithm with reference system, etc. Briefly, the desired signal is searched in the signal subspace instead of the whole space, in this type of detectors. A variation of the subspace-based MUD is reduced-rank MUD in which a smaller subspace of the signal subspace is tracked where the desired signal is contained in. This latter method leads to a performance gain compared to a standard subspace method. In this thesis, blind signal subspace and reduced-rank MUD techniques are investigated, and applied to minimum mean square error (MMSE) detectors with two different iterative subspace tracking algorithms. The performances of these detectors are compared in different scenarios for additive white Gaussian noise and for multipath fading channels as well. With simulation results the superiority of the reduced-rank detector to the signal subspace detector is shown. Additionally, as a new remark for both detectors, it is shown that, using minimum description length criterion in subspace tracking algorithm results in an increase in rank-tracking ability and correspondingly in the final performance. Finally, the performances of these two detectors are compared with MMSE, adaptive MMSE and JADE detectors