An Event-Based System for Low-Power ECG QRS Complex Detection

One of the greatest challenges in the design of modern wearable devices is energy efficiency. While data processing and communication have received a lot of attention from the industry and academia, leading to highly efficient microcontrollers and transmission devices, sensor data acquisition in medical devices is still based on a conservative paradigm that requires regular sampling at the Nyquist rate of the target signal. This requirement is usually excessive for signals that are typically sparse and highly non-stationary, leading to data overload and a waste of resources in the full processing pipeline. In this work we propose a new system to create event-based heart-rate analysis devices, including a novel algorithm for QRS detection that is able to process electrocardiogram signals acquired irregularly and much below the theoretically-required Nyquist rate. This technique allows us to drastically reduce the average sampling frequency of the signal and, hence, the energy needed to process it and extract the relevant information. We implemented both the proposed event-based algorithm and a state-of-the-art version based on regular sampling on an ultra-low power hardware platform, and the experimental results show that the event-based version reduces the energy consumption in runtime up to 15.6 times, while the detection performance is maintained at an average F1 score of 99.5%.

Adaptive wake and sleep detection for wearable systems

Walter Karlen

Sleep problems and disorders have a serious impact on human health and wellbeing. The rising costs for treating sleep-related chronic diseases in industrialized countries demands efficient prevention. Low-cost, wearable sleep / wake detection systems which give feedback on the wearer's "sleep performance" are a promising approach to reduce the risk of developing serious sleep disorders and fatigue. Not all bio-medical signals that are useful for sleep / wake discrimination can be easily recorded with wearable systems. Sensors often need to be placed in an obtrusive location on the body or cannot be efficiently embedded into a wearable frame. Furthermore, wearable systems have limited computational and energetic resources, which restrict the choice of sensors and algorithms for online processing and classification. Since wearable systems are used outside the laboratory, the recorded signals tend to be corrupted with additional noise that influences the precision of classification algorithms. In this thesis we present the research on a wearable sleep / wake classifier system that relies on cardiorespiratory (ECG and respiratory effort) and activity recordings and that works autonomously with minimal user interaction. This research included the selection of optimal signals and sensors, the development of a custom-tailored hardware demonstrator with embedded classification algorithms, and the realization of experiments in real-world environments for the customization and validation of the system. The processing and classification of the signals were based on Fourier transformations and artificial neural networks that are efficiently implementable into digital signal controllers. Literature analysis and empiric measurements revealed that cardiorespiratory signals are more promising for a wearable sleep / wake classification than clinically used signals such as brain potentials. The experiments conducted during this thesis showed that inter-subject differences within the recorded physiological signals make it difficult to design a sleep / wake classification model that can generalize to a group of subjects. This problem was addressed in two ways: First by adding features from another signal to the classifier, that is, measuring the behavioral quiescence during sleep using accelerometers. Conducted research on different feature extraction methods from accelerometer data showed that this data generalizes well for distinct subjects in the study group. In addition, research on user-adaptation methods was conducted. Behavioral sleep and wake measures, notably the measurement of reactivity and activity, were developed to build up a priori knowledge that was used to adapt the classification algorithm automatically to new situations. This thesis demonstrates the design and development of a low-cost, wearable hardware and embedded software for on-line sleep / wake discrimination. The proposed automatic user-adaptive classifier is advantageous compared to previously suggested classification methods that generalize over multiple subjects, because it can take changes in the wearer's physiology and sleep / wake behavior into account without adjustment from a human expert. The results of this thesis contribute to the development of smart, wearable, bio-physiological monitoring systems which require a high degree of autonomy and have only low computational resources available. We believe that the proposed sleep / wake classification system is a first promising step toward a context-aware system for sleep management, sleep disorder prevention, and reduction of fatigue.

EPFL2009

Rate allocation and optimized decoding in inter-session network coding

Eirina Bourtsoulatze

Recent advances in data processing and communication systems have led to a continuous increase in the amount of data communicated over today’s networks. These large volumes of data pose new challenges on the current networking infrastructure that only offers a best effort mechanism for data delivery. The emergence of new distributed network architectures, such as peer-to-peer networks and wireless mesh networks, and the need for efficient data delivery mechanisms have motivated researchers to reconsider the way that information is communicated and processed in the networks. This has given rise to a new research field called network coding. The network coding paradigm departs from the traditional routing principle where information is simply relayed by the network nodes towards the destination, and introduces some intelligence in the network through coding at the intermediate nodes. This in-network data processing has been proved to substantially improve the performance of data delivery systems in terms of throughput and error resilience in networks with high path diversity. Motivated by the promising results in the network coding research, we focus in this thesis on the design of network coding algorithms for simultaneous transmission of multiple data sources in overlay networks. We investigate several problems that arise in the context of inter-session network coding, namely (i) decoding delay minimization in inter-session network coding, (ii) distributed rate allocation for inter-session network coding and (iii) correlation-aware decoding of incomplete network coded data. We start by proposing a novel framework for data delivery from multiple sources to multiple clients in an overlay wireline network, where intermediate nodes employ randomized inter-session network coding. We consider networks with high resource diversity, which creates network coding opportunities with possibly large gains in terms of throughput, delay and error robustness. However, the coding operations in the intermediate nodes must be carefully designed in order to enable efficient data delivery. We look at the problem from the decoding delay perspective and design solutions that lead to a small decoding delay at clients through proper coding and rate allocation. We cast the optimization problem as a rate allocation problem, which seeks for the coding operations that minimize the average decoding delay in the client population. We demonstrate the validity of our algorithm through simulations in representative network topologies. The results show that an effective combination of intra- and inter-session network coding based on randomized linear coding permits to reach small decoding delays and to better exploit the available network resources even in challenging network settings. Next, we design a distributed rate allocation algorithm where the users decide locally how many intra- and inter-session network coded packets should be requested from the parent nodes in order to get minimal decoding delay. The capability to take coding decisions locally with only a partial knowledge of the network statistics is of crucial importance for applications where users are organized in dynamic overlay networks. We propose a receiver-driven communication protocol that operates in two rounds. First, the users request and obtain information regarding the network conditions and packet availability in their local neighborhood. Then, every user independently optimizes the rate allocation among different possible intra- and inter-session packet combinations to be requested from its parents. We also introduce the novel concept of equivalent flows, which permits to efficiently estimate the expected number of packets that are necessary for decoding and hence to simplify the rate allocation process. Experimental results indicate that our algorithm is capable of eliminating the bottlenecks and reducing the decoding delay of users with limited resources. We further investigate the application of the proposed distributed rate allocation algorithm to the transmission of video sequences and validate the performance of our system using the NS-3 simulator. The simulation results show that the proposed rate allocation algorithm is successful in improving the quality of the delivered video compared to intra-session network coding based solutions. Finally, we investigate the problem of decoding the source information from an incomplete set of network coded data with the help of source priors in a finite algebraic field. The inability to form a complete decoding system can be often caused by transmission losses or timing constraints imposed by the application. In this case, exact reconstruction of the source data by conventional algorithms such as Gaussian elimination is not feasible; however, partial recovery of the source data may still be possible, which can be useful in applications where approximate reconstruction is informative. We use the statistical characteristics of the source data in order to perform approximate decoding. We first analyze the performance of a hypothetical maximum a posteriori decoder, which recovers the source data from an incomplete set of network coded data given the joint statistics of the sources. We derive an upper bound on the probability of erroneous source sequence decoding as a function of the system parameters. We then propose a constructive solution to the approximate decoding problem and design an iterative decoding algorithm based on message passing, which jointly considers the network coding and the correlation constraints. We illustrate the performance of our decoding algorithm through extensive simulations on synthetic and real data sets. The results demonstrate that, even by using a simple correlation model expressed as a correlation noise between pairs of sources, the original source data can be partially decoded in practice from an incomplete set of network coded symbols. Overall, this thesis addresses several important issues related to the design of efficient data delivery methods with inter-session network coding. Our novel framework for decoding delay minimization can impact the development of practical inter-session network coding algorithms that are appropriate for applications with low delay requirements. Our rate allocation algorithms are able to exploit the high resource diversity of modern networking systems and represent an effective alternative in the development of distributed communication systems. Finally, our algorithm for data recovery from incomplete network coded data using correlation priors can contribute significantly to the improvement of the delivered data quality and provide new insights towards the design of joint source and network coding algorithms.

EPFL2013

A Quality-Scalable and Energy-Efficient Approach for Spectral Analysis of Heart Rate Variability

Mohamed Mostafa Sabry Aly, David Atienza Alonso, Andreas Peter Burg, Georgios Karakonstantis, Aviinaash Sankaranarayanan

Today there is a growing interest in the integration of health monitoring applications in portable devices necessitating the development of methods that improve the energy efficiency of such systems. In this paper, we present a systematic approach that enables energy-quality trade-offs in spectral analysis systems for bio-signals, which are useful in monitoring various health conditions as those associated with the heart-rate. To enable such trade-offs, the processed signals are expressed initially in a basis in which significant components that carry most of the relevant information can be easily distinguished from the parts that influence the output to a lesser extent. Such a classification allows the pruning of operations associated with the less significant signal components leading to power savings with minor quality loss since only less useful parts are pruned under the given requirements. To exploit the attributes of the modified spectral analysis system, thresholding rules are determined and adopted at design- and run-time, allowing the static or dynamic pruning of less-useful operations based on the accuracy and energy requirements. The proposed algorithm is implemented on a typical sensor node simulator and results show up-to 82% energy savings when static pruning is combined with voltage and frequency scaling, compared to the conventional algorithm in which such trade-offs were not available. In addition, experiments with numerous cardiac samples of various patients show that such energy savings come with a 4.9% average accuracy loss, which does not affect the system detection capability of sinus-arrhythmia which was used as a test case.