arXiv subjects

Rajib Rana

Publications and source records attributed to Rajib Rana.

59 records · Page 4Linked to original sources

arXiv2014

EEG source localization using a sparsity prior based on Brodmann areas

Localizing the sources of electrical activity in the brain from Electroencephalographic (EEG) data is an important tool for non-invasive study of brain dynamics. Generally, the source localization process involves a high-dimensional inverse problem that has an infinite number of solutions and thus requires additional constraints to be considered to have a unique solution. In the context of EEG source localization, we propose a novel approach that is based on dividing the cerebral cortex of the brain into a finite number of Functional Zones which correspond to unitary functional areas in the brain. In this paper we investigate the use of Brodmanns areas as the Functional Zones. This approach allows us to apply a sparsity constraint to find a unique solution for the inverse EEG problem. Compared to previously published algorithms which use different sparsity constraints to solve this problem, the proposed method is potentially more consistent with the known sparsity profile of the human brain activity and thus may be able to ensure better localization. Numerical experiments are conducted on a realistic head model obtained from segmentation of MRI images of the head and includes four major compartments namely scalp, skull, cerebrospinal fluid (CSF) and brain with relative conductivity values. Three different electrode setups are tested in the numerical experiments.

q-bio.QM↗

arXiv2014

SimpleTrack:Adaptive Trajectory Compression with Deterministic Projection Matrix for Mobile Sensor Networks

Some mobile sensor network applications require the sensor nodes to transfer their trajectories to a data sink. This paper proposes an adaptive trajectory (lossy) compression algorithm based on compressive sensing. The algorithm has two innovative elements. First, we propose a method to compute a deterministic projection matrix from a learnt dictionary. Second, we propose a method for the mobile nodes to adaptively predict the number of projections needed based on the speed of the mobile nodes. Extensive evaluation of the proposed algorithm using 6 datasets shows that our proposed algorithm can achieve sub-metre accuracy. In addition, our method of computing projection matrices outperforms two existing methods. Finally, comparison of our algorithm against a state-of-the-art trajectory compression algorithm show that our algorithm can reduce the error by 10-60 cm for the same compression ratio.

cs.IT↗

arXiv2014

Signal Reconstruction from Rechargeable Wireless Sensor Networks using Sparse Random Projections

Due to non-homogeneous spread of sunlight, sensing nodes possess non-uniform energy budget in recharge- able Wireless Sensor Networks (WSNs). An energy-aware workload distribution strategy is therefore nec- essary to achieve good data accuracy subject to energy-neutral operation. Recently proposed signal approx- imation strategies assume uniform sampling and fail to ensure energy neutral operation in rechargeable wireless sensor networks. We propose EAST (Energy Aware Sparse approximation Technique), which ap- proximates a signal, by adapting sensor node sampling workload according to solar energy availability. To the best of our knowledge, we are the first to propose sparse approximation to model energy-aware workload distribution in rechargeable WSNs. Experimental results, using data from an outdoor WSN deployment suggest that EAST significantly improves the approximation accuracy offering approximately 50% higher sensor on-time. EAST requires the approximation error to be known beforehand to determine the number of measure- ments. However, it is not always possible to decide the accuracy a-priori. We improve EAST and propose EAST+, which, given only the energy budget of the nodes, computes the optimal number of measurements subject to the energy neutral operation.

cs.NI↗

arXiv2013

Ear-Phone: A Context-Aware Noise Mapping using Smart Phones

A noise map facilitates the monitoring of environmental noise pollution in urban areas. However, state-of-the-art techniques for rendering noise maps in urban areas are expensive and rarely updated, as they rely on population and traffic models rather than on real data. Smart phone based urban sensing can be leveraged to create an open and inexpensive platform for rendering up-to- date noise maps. In this paper, we present the design, implementation and performance evaluation of an end-to-end, context-aware, noise mapping system called Ear-Phone. Ear-Phone investigates the use of different interpolation and regularization methods to address the fundamental problem of recovering the noise map from incomplete and random samples obtained by crowdsourcing data collection. Ear-Phone, implemented on Nokia N95, N97 and HP iPAQ, HTC One mobile devices, also addresses the challenge of collecting accurate noise pollution readings at a mobile device. A major challenge of using smart phones as sensors is that even at the same location, the sensor reading may vary depending on the phone orientation and user context (for example, whether the user is carrying the phone in a bag or holding it in her palm). To address this problem, Ear-Phone leverages context-aware sensing. We develop classifiers to accurately determine the phone sensing context. Upon context discovery, Ear-Phone automatically decides whether to sense or not. Ear-phone also implements in-situ calibration which performs simple calibration that can be carried out without any technical skills whatsoever required on the user's part. Extensive simulations and outdoor experiments demonstrate that Ear-Phone is a feasible platform to assess noise pollution, incurring reasonable system resource consumption at mobile devices and providing high reconstruction accuracy of the noise map.

cs.OH↗

arXiv2013

A Deterministic Construction of Projection matrix for Adaptive Trajectory Compression

Compressive Sensing, which offers exact reconstruction of sparse signal from a small number of measurements, has tremendous potential for trajectory compression. In order to optimize the compression, trajectory compression algorithms need to adapt compression ratio subject to the compressibility of the trajectory. Intuitively, the trajectory of an object moving in starlight road is more compressible compared to the trajectory of a object moving in winding roads, therefore, higher compression is achievable in the former case compared to the later. We propose an in-situ compression technique underpinning the support vector regression theory, which accurately predicts the compressibility of a trajectory given the mean speed of the object and then apply compressive sensing to adapt the compression to the compressibility of the trajectory. The conventional encoding and decoding process of compressive sensing uses predefined dictionary and measurement (or projection) matrix pairs. However, the selection of an optimal pair is nontrivial and exhaustive, and random selection of a pair does not guarantee the best compression performance. In this paper, we propose a deterministic and data driven construction for the projection matrix which is obtained by applying singular value decomposition to a sparsifying dictionary learned from the dataset. We analyze case studies of pedestrian and animal trajectory datasets including GPS trajectory data from 127 subjects. The experimental results suggest that the proposed adaptive compression algorithm, incorporating the deterministic construction of projection matrix, offers significantly better compression performance compared to the state-of-the-art alternatives.

cs.IT↗