Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Justin Dauwels is active.

Publication


Featured researches published by Justin Dauwels.


Progress in Neurobiology | 2010

Steady-state visually evoked potentials: Focus on essential paradigms and future perspectives

François-Benoı̂t Vialatte; Monique Maurice; Justin Dauwels; Andrzej Cichocki

After 40 years of investigation, steady-state visually evoked potentials (SSVEPs) have been shown to be useful for many paradigms in cognitive (visual attention, binocular rivalry, working memory, and brain rhythms) and clinical neuroscience (aging, neurodegenerative disorders, schizophrenia, ophthalmic pathologies, migraine, autism, depression, anxiety, stress, and epilepsy). Recently, in engineering, SSVEPs found a novel application for SSVEP-driven brain-computer interface (BCI) systems. Although some SSVEP properties are well documented, many questions are still hotly debated. We provide an overview of recent SSVEP studies in neuroscience (using implanted and scalp EEG, fMRI, or PET), with the perspective of modern theories about the visual pathway. We investigate the steady-state evoked activity, its properties, and the mechanisms behind SSVEP generation. Next, we describe the SSVEP-BCI paradigm and review recently developed SSVEP-based BCI systems. Lastly, we outline future research directions related to basic and applied aspects of SSVEPs.


Proceedings of the IEEE | 2007

The Factor Graph Approach to Model-Based Signal Processing

Hans-Andrea Loeliger; Justin Dauwels; Junli Hu; Sascha Korl; Li Ping; Frank R. Kschischang

The message-passing approach to model-based signal processing is developed with a focus on Gaussian message passing in linear state-space models, which includes recursive least squares, linear minimum-mean-squared-error estimation, and Kalman filtering algorithms. Tabulated message computation rules for the building blocks of linear models allow us to compose a variety of such algorithms without additional derivations or computations. Beyond the Gaussian case, it is emphasized that the message-passing approach encourages us to mix and match different algorithmic techniques, which is exemplified by two different approaches - steepest descent and expectation maximization - to message passing through a multiplier node.


NeuroImage | 2010

A comparative study of synchrony measures for the early diagnosis of Alzheimer's disease based on EEG.

Justin Dauwels; François-Benoît Vialatte; Toshimitsu Musha; Andrzej Cichocki

It is well known that EEG signals of Alzheimers disease (AD) patients are generally less synchronous than in age-matched control subjects. However, this effect is not always easily detectable. This is especially the case for patients in the pre-symptomatic phase, commonly referred to as mild cognitive impairment (MCI), during which neuronal degeneration is occurring prior to the clinical symptoms appearance. In this paper, various synchrony measures are studied in the context of AD diagnosis, including the correlation coefficient, mean-square and phase coherence, Granger causality, phase synchrony indices, information-theoretic divergence measures, state space based measures, and the recently proposed stochastic event synchrony measures. Experiments with EEG data show that many of those measures are strongly correlated (or anti-correlated) with the correlation coefficient, and hence, provide little complementary information about EEG synchrony. Measures that are only weakly correlated with the correlation coefficient include the phase synchrony indices, Granger causality measures, and stochastic event synchrony measures. In addition, those three families of synchrony measures are mutually uncorrelated, and therefore, they each seem to capture a specific kind of interdependence. For the data set at hand, only two synchrony measures are able to convincingly distinguish MCI patients from age-matched control patients, i.e., Granger causality (in particular, full-frequency directed transfer function) and stochastic event synchrony. Those two measures are used as features to distinguish MCI patients from age-matched control subjects, yielding a leave-one-out classification rate of 83%. The classification performance may be further improved by adding complementary features from EEG; this approach may eventually lead to a reliable EEG-based diagnostic tool for MCI and AD.


Current Alzheimer Research | 2010

Diagnosis of Alzheimers Disease from EEG Signals: Where Are We Standing?

Justin Dauwels; François B. Vialatte; Andrzej Cichocki

This paper reviews recent progress in the diagnosis of Alzheimers disease (AD) from electroencephalograms (EEG). Three major effects of AD on EEG have been observed: slowing of the EEG, reduced complexity of the EEG signals, and perturbations in EEG synchrony. In recent years, a variety of sophisticated computational approaches has been proposed to detect those subtle perturbations in the EEG of AD patients. The paper first describes methods that try to detect slowing of the EEG. Next the paper deals with several measures for EEG complexity, and explains how those measures have been used to study fluctuations in EEG complexity in AD patients. Then various measures of EEG synchrony are considered in the context of AD diagnosis. Also the issue of EEG pre-processing is briefly addressed. Before one can analyze EEG, it is necessary to remove artifacts due to for example head and eye movement or interference from electronic equipment. Pre-processing of EEG has in recent years received much attention. In this paper, several state-of-the-art pre-processing tech- niques are outlined, for example, based on blind source separation and other non-linear filtering paradigms. In addition, the paper outlines opportunities and limitations of computational approaches for diagnosing AD based on EEG. At last, future challenges and open problems are discussed.


Alzheimers & Dementia | 2015

Innovative diagnostic tools for early detection of Alzheimer's disease

Christoph Laske; Hamid R. Sohrabi; Shaun Frost; Karmele López-de-Ipiña; Peter Garrard; Massimo Buscema; Justin Dauwels; Surjo R. Soekadar; Stephan Mueller; Christoph Linnemann; Stephanie A. Bridenbaugh; Yogesan Kanagasingam; Ralph N. Martins; Sid E. O'Bryant

Current state‐of‐the‐art diagnostic measures of Alzheimers disease (AD) are invasive (cerebrospinal fluid analysis), expensive (neuroimaging) and time‐consuming (neuropsychological assessment) and thus have limited accessibility as frontline screening and diagnostic tools for AD. Thus, there is an increasing need for additional noninvasive and/or cost‐effective tools, allowing identification of subjects in the preclinical or early clinical stages of AD who could be suitable for further cognitive evaluation and dementia diagnostics. Implementation of such tests may facilitate early and potentially more effective therapeutic and preventative strategies for AD. Before applying them in clinical practice, these tools should be examined in ongoing large clinical trials. This review will summarize and highlight the most promising screening tools including neuropsychometric, clinical, blood, and neurophysiological tests.


international conference on intelligent transportation systems | 2012

Online map-matching based on Hidden Markov model for real-time traffic sensing applications

Chong Yang Goh; Justin Dauwels; Nikola Mitrovic; Muhammad Tayyab Asif; Ali Oran; Patrick Jaillet

In many Intelligent Transportation System (ITS) applications that crowd-source data from probe vehicles, a crucial step is to accurately map the GPS trajectories to the road network in real time. This process, known as map-matching, often needs to account for noise and sparseness of the data because (1) highly precise GPS traces are rarely available, and (2) dense trajectories are costly for live transmission and storage. We propose an online map-matching algorithm based on the Hidden Markov Model (HMM) that is robust to noise and sparseness. We focused on two improvements over existing HMM-based algorithms: (1) the use of an optimal localizing strategy, the variable sliding window (VSW) method, that guarantees the online solution quality under uncertain future inputs, and (2) the novel combination of spatial, temporal and topological information using machine learning. We evaluated the accuracy of our algorithm using field test data collected on bus routes covering urban and rural areas. Furthermore, we also investigated the relationships between accuracy and output delays in processing live input streams. In our tests on field test data, VSW outperformed the traditional localizing method in terms of both accuracy and output delay. Our results suggest that it is viable for low latency applications such as traffic sensing.


Optics Express | 2014

Transport of Intensity phase imaging by intensity spectrum fitting of exponentially spaced defocus planes

Zhong Jingshan; Rene A. Claus; Justin Dauwels; Lei Tian; Laura Waller

We propose an alternative method for solving the Transport of Intensity equation (TIE) from a stack of through-focus intensity images taken by a microscope or lensless imager. Our method enables quantitative phase and amplitude imaging with improved accuracy and reduced data capture, while also being computationally efficient and robust to noise. We use prior knowledge of how intensity varies with propagation in the spatial frequency domain in order to constrain a fitting algorithm [Gaussian process (GP) regression] for estimating the axial intensity derivative. Solving the problem in the frequency domain inspires an efficient measurement scheme which captures images at exponentially spaced focal steps, significantly reducing the number of images required. Low-frequency artifacts that plague traditional TIE methods can be suppressed without an excessive number of captured images. We validate our technique experimentally by recovering the phase of human cheek cells in a brightfield microscope.


International Journal of Alzheimer's Disease | 2011

Slowing and Loss of Complexity in Alzheimer's EEG: Two Sides of the Same Coin?

Justin Dauwels; Karthik Srinivasan; M. Ramasubba Reddy; Toshimitsu Musha; François-Benoît Vialatte; Charles Latchoumane; Jaeseung Jeong; Andrzej Cichocki

Medical studies have shown that EEG of Alzheimers disease (AD) patients is “slower” (i.e., contains more low-frequency power) and is less complex compared to age-matched healthy subjects. The relation between those two phenomena has not yet been studied, and they are often silently assumed to be independent. In this paper, it is shown that both phenomena are strongly related. Strong correlation between slowing and loss of complexity is observed in two independent EEG datasets: (1) EEG of predementia patients (a.k.a. Mild Cognitive Impairment; MCI) and control subjects; (2) EEG of mild AD patients and control subjects. The two data sets are from different patients, different hospitals and obtained through different recording systems. The paper also investigates the potential of EEG slowing and loss of EEG complexity as indicators of AD onset. In particular, relative power and complexity measures are used as features to classify the MCI and MiAD patients versus age-matched control subjects. When combined with two synchrony measures (Granger causality and stochastic event synchrony), classification rates of 83% (MCI) and 98% (MiAD) are obtained. By including the compression ratios as features, slightly better classification rates are obtained than with relative power and synchrony measures alone.


international symposium on information theory | 2008

Message-passing decoding of lattices using Gaussian mixtures

Brian M. Kurkoski; Justin Dauwels

A belief-propagation decoder for low-density lattice codes, which represents messages explicitly as a mixture of Gaussians functions, is given. In order to prevent the number of functions from growing as the decoder iterations progress, a method for reducing the number of Gaussians at each step is given. A squared distance metric is used, which is shown to be a lower bound on the divergence. For an unconstrained power system, comparisons are made with a quantized implementation. For a dimension 100 lattice, a loss of about 0.2 dB was found; for dimension 1000 and 10000 lattices, the difference in error rate was indistinguishable. The memory required to store the messages is substantially superior to the quantized implementation.


international symposium on information theory | 2007

On Variational Message Passing on Factor Graphs

Justin Dauwels

In this paper, it is shown how (naive and structured) variational algorithms may be derived from a factor graph by mechanically applying generic message computation rules; in this way, one can bypass error-prone variational calculus. In prior work by Bishop et al., Xing et al., and Geiger, directed and undirected graphical models have been used for this purpose. The factor graph notation amounts to simpler generic variational message computation rules; by means of factor graphs, variational methods can straightforwardly be compared to and combined with various other message-passing inference algorithms, e.g., Kalman filters and smoothers, iterated conditional modes, expectation maximization (EM), gradient methods, and particle filters. Some of those combinations have been explored in the literature, others seem to be new. Generic message computation rules for such combinations are formulated.

Collaboration


Dive into the Justin Dauwels's collaboration.

Top Co-Authors

Avatar

François B. Vialatte

RIKEN Brain Science Institute

View shared research outputs
Top Co-Authors

Avatar

Hang Yu

Nanyang Technological University

View shared research outputs
Top Co-Authors

Avatar

Andrzej Cichocki

RIKEN Brain Science Institute

View shared research outputs
Top Co-Authors

Avatar

Patrick Jaillet

Massachusetts Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Andrzej Cichocki

RIKEN Brain Science Institute

View shared research outputs
Top Co-Authors

Avatar

Nikola Mitrovic

Nanyang Technological University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge