No description available.

Denna uppsats syftar till att undersöka användbarheten av metoden Independent Component Analysis (ICA) för brusreducering av bilder tagna av infraröda kameror. Speciellt fokus ligger på att reducera additivt brus. Bruset delas upp i två delar, det Gaussiska bruset samt det sensorspecifika mönsterbruset. För att reducera det Gaussiska bruset används en populär metod kallad sparse code shrinkage som bygger på ICA. En ny metod, även den byggandes på ICA, utvecklas för att reducera mönsterbrus. För varje sensor utförs, i den nya metoden, en analys av bilddata för att manuellt identifiera typiska mönsterbruskomponenter. Dessa komponenter används därefter för att reducera mönsterbruset i bilder tagna av den aktuella sensorn. Det visas att metoderna ger goda resultat på infraröda bilder. Algoritmerna testas både på syntetiska såväl som på verkliga bilder och resultat presenteras och jämförs med andra algoritmer. / The purpose of this thesis is to evaluate the applicability of the method Independent Component Analysis (ICA) for noise reduction of infrared images. The focus lies on reducing the additive uncorrelated noise and the sensor specific additive Fixed Pattern Noise (FPN). The well known method sparse code shrinkage, in combination with ICA, is applied to reduce the uncorrelated noise degrading infrared images. The result is compared to an adaptive Wiener filter. A novel method, also based on ICA, for reducing FPN is developed. An independent component analysis is made on images from an infrared sensor and typical fixed pattern noise components are manually identified. The identified components are used to fast and effectively reduce the FPN in images taken by the specific sensor. It is shown that both the FPN reduction algorithm and the sparse code shrinkage method work well for infrared images. The algorithms are tested on synthetic as well as on real images and the performance is measured.

Financial time-series forecasting has long been discussed because of its vitality for making informed investment decisions. This kind of problem, however, is intrinsically challenging due to the data dynamics in nature. Most of the research works in the past focus on artificial neural network (ANN)-based approaches. It has been pointed out that such approaches suffer from explanatory power and generalized prediction ability though. The objective of this research is thus to propose a hybrid approach for stock price forecasting. Independent component analysis (ICA) is employed to reveal the latent structure of the observed time-series and remove noise and redundancy in the structure. It further assists clustering analysis. Support vector regression (SVR) models are then applied to enhance the generalization ability with separate models built based on the time-series data of companies in each individual cluster. Two experiments are conducted accordingly. The results show that SVR has robust accuracy performance. More importantly, SVR models with ICA-based clustered data perform better than the single SVR model with all data involved. Our proposed approach does enhance the generalization ability of the forecasting models, which justifies the feasibility of its applications.

Magnetic Resonance Imaging (MRI) can obtain the tissues of in vivo non-invasively. Proton MR Spectroscopy uses the resonance principle to collect the signals of proton and transforms them to spectrums. It provides information of metabolites in patient¡¦s brain for doctors to observe the change of pathology. Observing the metabolites of brain abscess patients is most important process in clinical diagnosis and treatment. Then, doctors use different spectrums of echo time (TE) to enhance the accuracy in the diagnosis. In our study, we use independent component analysis (ICA) to analyze MR spectroscopy. After analyzing, the independent components represent the elements which compose the input data. Then, we use the projection which is mentioned by Ssu-Ying Lu¡¦s Thesis to help us observe the relationship between independent components and spectrums of patients. We also discuss the result of spectrums with using ICA and PCA and discover some questions (whether it need to do scale normalization before inputting data or not, the result of scale normalization doesn¡¦t expect, and the peak in some independent components confuse us by locating in indistinct place) to discuss and to find possible reason after experiments.

No description available.

Στην παρούσα διπλωματική εργασία μελετώνται μέθοδοι διαχωρισμού σημάτων σε ανεξάρτητες συνιστώσες. Αφού δοθεί ο ορισμός του προβλήματος και μια αναφορά στις κυριότερες μεθόδους για την αντιμετώπισή του, γίνεται σαφές ότι δεν μπορούν να σχεδιαστούν γενικές μέθοδοι διαχωρισμού σημάτων. Παρά την πληθώρα των πρακτικών προβλημάτων στα οποία βρίσκει εφαρμογή το μαθηματικό πρότυπο, δεν είναι δυνατός ο σχεδιασμός μιας ενιαίας μεθόδου που να αντιμετωπίζει αποτελεσματικά όλες τις περιπτώσεις διαχωρισμού σημάτων. Ο αναγνώστης πληροφορείται για τις περιοχές έρευνας και ανάπτυξης των διαφόρων μεθόδων καθώς και για τις εφαρμογές τους σε διάφορους τομείς της σύγχρονης επιστήμης. Στη συνέχεια, υλοποιούνται κάποιες από αυτές τις μεθόδους και παρουσιάζονται τα αποτελέσματα προσομοίωσης πραγματικών πειραματικών δεδομένων που λήφθηκαν για την εκπόνηση της συγκεκριμένης διπλωματικής εργασίας. Τα αποτελέσματα εξάγονται με την χρήση και υλοποίηση αλγόριθμου επεξεργασίας των δεδομένων στο πρόγραμμα Matlab και μελετώνται εκτενέστερα με το πρόγραμμα Adobe Audition 1.5. Τέλος, παρουσιάζονται τα συμπεράσματα από την εφαρμογή του αλγόριθμου στα πραγματικά δεδομένα και δίνεται μια μαθηματική- θεωρητική βάση για την βελτιστοποίηση των μεθόδων διαχωρισμού σημάτων. / -

The recent decade has witnessed great advances in microarray and genotyping technologies which allow genome-wide single nucleotide polymorphism (SNP) data to be captured on a single chip. As a consequence, genome-wide association studies require the development of algorithms capable of manipulating ultra-large-scale SNP datasets. Towards this goal, this thesis proposes two SNP selection methods; the first using Independent Component Analysis (ICA) and the second based on a modified version of Fast Orthogonal Search. The first proposed technique, based on ICA, is a filtering technique; it reduces the number of SNPs in a dataset, without the need for any class labels. The second proposed technique, orthogonal search based SNP selection, is a multivariate regression approach; it selects the most informative features in SNP data to accurately model the entire dataset. The proposed methods are evaluated by applying them to publicly available gene SNP datasets, and comparing the accuracies of each method in reconstructing the datasets. In addition, the selection results are compared with those of another SNP selection method based on Principal Component Analysis (PCA), which was also applied to the same datasets. The results demonstrate the ability of orthogonal search to capture a higher amount of information than ICA SNP selection approach, all while using a smaller number of SNPs. Furthermore, SNP reconstruction accuracies using the proposed ICA methodology demonstrated the ability to summarize a greater or equivalent amount of information in comparison with the amount of information captured by the PCA-based technique reported in the literature. The execution time of the second developed methodology, mFOS, has paved the way for its application to large-scale genome wide datasets. / Thesis (Master, Computing) -- Queen's University, 2010-12-15 18:03:00.208

Separating unknown signal mixtures into their constituent parts is a difficult problem in signal processing called blind source separation. One of the benchmark problems in this area is the extraction of the fetal heartbeat from an electrocardiogram in which it is overshadowed by a strong maternal heartbeat. This thesis presents a study of a signal separation technique called independent component analysis (ICA), in order to assess its suitability for the maternal-fetal ECG separation problem. This includes an analysis of ICA on deterministic, stochastic, simulated and recorded ECG signals. The experiments presented in this thesis demonstrate that ICA is effective on linear mixtures of known simulated or recorded ECGs. The performance of ICA was measured using visual comparison, heart rate extraction, and energy, information theoretic, and fractal-based measures. ICA extraction of clinically recorded maternal-fetal ECGs mixtures, in which the source signals were unknown, were successful at recovering the fetal heart rate.

This report intends to verify the possibility that the FastICA algorithm could be applied to the GPS system to eliminate the impulsive noise from the receiver end. As the impulsive noise is so unpredictable in its pattern and of great energy level to swallow the signal we need, traditional signal selection methods exhibit no much use in dealing with this problem. Blind Source Separation seems to be a good way to solve this, but most of the other BSS algorithms beside FastICA showed more or less degrees of dependency on the pattern of the noise. In this thesis, the basic mathematic modelling of this advanced algorithm, along with the principles of the commonly used fast independent component analysis (fastICA) based on fixed-point algorithm are discussed. To verify that this method is useful under industrial use environment to remove the impulsive noises from digital BPSK modulated signals, an observation signal mixed with additive impulsive noise is generated and separated by fastICA method. And in the last part of the thesis, the fastICA algorithm is applied to the GPS receiver modeled in the SoftGNSS project and verified to be effective in industrial applications. The results have been analyzed. / 6

In an unsupervised learning problem, one is given an unlabelled dataset and hopes to find some hidden structure; the prototypical example is clustering similar data. Such problems often arise in machine learning and statistics, but also in signal processing, theoretical computer science, and any number of quantitative scientific fields. The distinguishing feature of unsupervised learning is that there are no privileged variables or labels which are particularly informative, and thus the greatest challenge is often to differentiate between what is relevant or irrelevant in any particular dataset or problem. In the course of this thesis, we study a number of problems which span the breadth of unsupervised learning. We make progress in Gaussian mixtures, independent component analysis (where we solve the open problem of underdetermined ICA), and we formulate and solve a feature selection/dimension reduction model. Throughout, our goal is to give finite sample complexity bounds for our algorithms -- these are essentially the strongest type of quantitative bound that one can prove for such algorithms. Some of our algorithmic techniques turn out to be very efficient in practice as well. Our major technical tool is tensor spectral decomposition: tensors are generalisations of matrices, and often allow access to the "fine structure" of data. Thus, they are often the right tools for unravelling the hidden structure in an unsupervised learning setting. However, naive generalisations of matrix algorithms to tensors run into NP-hardness results almost immediately, and thus to solve our problems, we are obliged to develop two new tensor decompositions (with robust analyses) from scratch. Both of these decompositions are polynomial time, and can be viewed as efficient generalisations of PCA extended to tensors.