AR-PCA-HMM approach for sensorimotor task classification in EEG-based brain-computer interfaces

We propose an approach based on Hidden Markov models (HMMs) combined with principal component analysis (PCA) for classification of four-class single trial motor imagery EEG data for brain computer interfacing (BCI) purposes. We extract autoregressive (AR) parameters from EEG data and use PCA to decrease the number of features for better training of HMMs. We present experimental results demonstrating the improvements provided by our approach over an existing HMM-based EEG single trial classification approach as well as over state-of-the-art classification methods

Sparse representation-based SAR imaging

There is increasing interest in using synthetic aperture radar (SAR) images in automated target recognition and decision-making tasks. The success of such tasks depends on how well the reconstructed SAR images exhibit certain features of the underlying scene. Based on the observation that typical underlying scenes usually exhibit sparsity in terms of such features, we develop an image formation method which formulates the SAR imaging problem as a sparse signal representation problem. Sparse signal representation, which has mostly been exploited in real-valued problems, has many capabilities such as superresolution and feature enhancement for various reconstruction and recognition tasks. However, for problems of complex-valued nature, such as SAR, a key challenge is how to choose the dictionary and the representation scheme for effective sparse representation. Since we are usually interested in features of the magnitude of the SAR reflectivity field, our new approach is designed to sparsely represent the magnitude of the complex-valued scattered field. This turns the image reconstruction problem into a joint optimization problem over the representation of magnitude and phase of the underlying field reflectivities. We develop the mathematical framework for this method and propose an iterative solution for the corresponding joint optimization problem. Our experimental results demonstrate the superiority of this method over previous approaches in terms of both producing high quality SAR images as well as exhibiting robustness to uncertain or limited data

Sparse signal representation for complex-valued imaging

We propose a sparse signal representation-based method for complex-valued imaging. Many coherent imaging systems such as synthetic aperture radar (SAR) have an inherent random phase, complex-valued nature. On the other hand sparse signal representation, which has mostly been exploited in real-valued problems, has many capabilities such as superresolution and feature enhancement for various reconstruction and recognition tasks. For complex-valued problems, the key challenge is how to choose the dictionary and the representation scheme for effective sparse representation. We propose a mathematical framework and an associated optimization algorithm for a sparse signal representation-based imaging method that can deal with these issues. Simulation results show that this method offers improved results compared to existing powerful imaging techniques

Multiple feature-enhanced synthetic aperture radar imaging

Non-quadratic regularization based image formation is a recently proposed framework for feature-enhanced radar imaging. Specific image formation techniques in this framework have so far focused on enhancing one type of feature, such as strong point scatterers, or smooth regions. However, many scenes contain a number of such features. We develop an image formation technique that simultaneously enhances multiple types of features by posing the problem as one of sparse signal representation based on overcomplete dictionaries. Due to the complex-valued nature of the reflectivities in SAR, our new approach is designed to sparsely represent the magnitude of the complex-valued scattered field in terms of multiple features, which turns the image reconstruction problem into a joint optimization problem over the representation of the magnitude and the phase of the underlying field reflectivities. We formulate the mathematical framework needed for this method and propose an iterative solution for the corresponding joint optimization problem. We demonstrate the effectiveness of this approach on various SAR images

Sparse representation-based synthetic aperture radar imaging

There is increasing interest in using synthetic aperture radar (SAR) images in automated target recognition and decision-making tasks. The success of such tasks depends on how well the reconstructed SAR images exhibit certain features of the underlying scene. Based on the observation that typical underlying scenes usually exhibit sparsity in terms of such features, we develop an image formation method which formulates the SAR imaging problem as a sparse signal representation problem. Sparse signal representation, which has mostly been exploited in real-valued problems, has many capabilities such as superresolution and feature enhancement for various reconstruction and recognition tasks. However, for problems of complex-valued nature, such as SAR, a key challenge is how to choose the dictionary and the representation scheme for effective sparse representation. Since we are usually interested in features of the magnitude of the SAR reflectivity field, our new approach is designed to sparsely represent the magnitude of the complex-valued scattered field. This turns the image reconstruction problem into a joint optimization problem over the representation of magnitude and phase of the underlying field reflectivities. We develop the mathematical framework for this method and propose an iterative solution for the corresponding joint optimization problem. Our experimental results demonstrate the superiority of this method over previous approaches in terms of both producing high quality SAR images as well as exhibiting robustness to uncertain or limited data

Multiple feature-enhanced SAR imaging using sparsity in combined dictionaries

Nonquadratic regularization-based image formation is a recently proposed framework for feature-enhanced radar imaging. Specific image formation techniques in this framework have so far focused on enhancing one type of feature, such as strong point scatterers, or smooth regions. However, many scenes contain a number of such feature types. We develop an image formation technique that simultaneously enhances multiple types of features by posing the problem as one of sparse representation based on combined dictionaries. This method is developed based on the sparse representation of the magnitude of the scattered complex-valued field, composed of appropriate dictionaries associated with different types of features. The multiple feature-enhanced reconstructed image is then obtained through a joint optimization problem over the combined representation of the magnitude and the phase of the underlying field reflectivities

Fatigue life prediction for large threaded components

AbstractA reasonable practice is to apply conventional fatigue life assessment methods to components with large threads when component S-N curves do not exist. Most recommended practices promote the use of the peak stress method. However, this method is bound to give conservative results for threaded components due to the high stress gradient. In this paper a case study of a typical threaded connection found in subsea risers is done. A range of fatigue life assessment methods were applied and their relative predicted fatigue lives were compared. Methods more sophisticated than the peak stress method seems to predict significantly longer lives than the ones obtained by following the recommended practices

Railway crew capacity planning problem with connectivity of schedules

We study a tactical level crew capacity planning problem in railways which determines the minimum required crew size in a region while both feasibility and connectivity of schedules are maintained. We present alternative mathematical formulations which depend on network representations of the problem. A path-based formulation in the form of a set-covering problem along with a column-and-row generation algorithm is proposed. An arc-based formulation of the problem is solved with a commercial linear programming solver. The computational study illustrates the effect of schedule connectivity on crew capacity decisions and shows that arc-based formulation is a viable approach

Saklı Markov modelleri ve boyut indirgemeye dayalı bir beyin-bilgisayar arayüzü algoritması (A brain-computer interface algorithm based on hidden Markov models and dimensionality reduction)

Beyin-bilgisayar arayüzleri (BBA) bağlamında zihinde hareket canlandırma sürecinde toplanan EEG verilerinin sınıflandırılması problemini ele alıyoruz. Saklı Markov Modelleri (HMM) üzerine kurulu bir yaklaşım öneriyoruz. Yaklaşımımız özbağlanımlı parametrelere dayalı öznitelikleri temel bileşen analizi (PCA) tabanlı boyut indirgeme ile birlikte kullanması bakımından mevcut HMM yöntemlerinden farklıdır. Yaklaşımımızın etkinliğini genel kullanıma açık bir veri kümesi ve kendi laboratuvarımızda topladığımız veriler üzerinde, iki ve dört sınıflı problemlerdeki deneysel sonuçlar ile gösteriyoruz. -- (We consider the problem of motor imagery EEG data classification within the context of brain-computer interfaces. We propose an approach based on Hidden Markov models (HMMs). Our approach is different from existing HMM-based techniques in that it uses features based on autoregressive parameters together with dimensionality reduction based on principal component analysis (PCA). We demonstrate the effectiveness of our approach through experimental results for two and four-class problems based on a public dataset, as well as data collected in our laboratory.

Vessel tractography using an intensity based tensor model with branch detection

In this paper, we present a tubular structure seg- mentation method that utilizes a second order tensor constructed from directional intensity measurements, which is inspired from diffusion tensor image (DTI) modeling. The constructed anisotropic tensor which is fit inside a vessel drives the segmen- tation analogously to a tractography approach in DTI. Our model is initialized at a single seed point and is capable of capturing whole vessel trees by an automatic branch detection algorithm developed in the same framework. The centerline of the vessel as well as its thickness is extracted. Performance results within the Rotterdam Coronary Artery Algorithm Evaluation framework are provided for comparison with existing techniques. 96.4% average overlap with ground truth delineated by experts is obtained in addition to other measures reported in the paper. Moreover, we demonstrate further quantitative results over synthetic vascular datasets, and we provide quantitative experiments for branch detection on patient Computed Tomography Angiography (CTA) volumes, as well as qualitative evaluations on the same CTA datasets, from visual scores by a cardiologist expert