SearcharxivSearch

arXiv subjects

Sanjit Kaul

Publications and source records attributed to Sanjit Kaul.

2 recordsLinked to original sources

Smartphone Audio Based Distress Detection

We investigate an unobtrusive and $24\times7$ human distress detection and signaling system, Always Alert, that requires the smartphone, and not its human owner, to be on alert. The system leverages the microphone sensor, at least one of which is available on every phone, and assumes the availability of a data network. We propose a novel two-stage supervised learning framework, using support vector machines (SVMs), that executes on a user's smartphone and monitors natural vocal expressions of fear---screaming and crying in our study---when a human being is in harm's way. The challenge is to achieve a high distress detection rate while ensuring that the false alarm rate is a manageable overhead, while a typical smartphone user goes about living life as usual. We train the learning framework with carefully selected audio fingerprints of distress and of varied environmental contexts. The audio is used to tune the learning framework to obtain a desirable distress detection rate and false alarm rate (FAR). The ability of the proposed framework to detect distress in rather challenging audio environments is demonstrated. Exploiting the time contiguous nature of false alarms further allows us to reduce the FAR. We show the feasibility of using our framework anytime and anywhere by testing it over many hours of audio fingerprints recorded by volunteers on their smartphones, as they went about their daily routines. We are able to achieve high distress detection rates at an average overhead that is equivalent to about 1 facebook post every 3 to 4 hours.

cs.SD

Investigating Randomly Generated Adjacency Matrices For Their Use In Modeling Wireless Topologies

Generation of realistic topologies plays an important role in determining the accuracy and validity of simulation studies. This study presents a discussion to justify why, and how often randomly generated adjacency matrices may not not conform to wireless topologies in the physical world. Specifically, it shows through analysis and random trials that, more than 90% of times, a randomly generated adjacency matrix will not conform to a valid wireless topology, when it has more than 3 nodes. By showing that node triplets in the adjacency graph need to adhere to rules of a geometric vector space, the study shows that the number of randomly chosen node triplets failing consistency checks grow at the order of O(base^3), where base is the granularity of the distance metric. Further, the study models and presents a probability estimate with which any randomly generated adjacency matrix would fail realization. This information could be used to design simpler algorithms for generating k-connected wireless topologies.

cs.NI