Karthik Reddy

2papers

2 Papers

13.6DCMay 10
PoHAR: Understanding Hyperlocal Human Activities with Pollution Sensor Networks

Prasenjit Karmakar, Karthik Reddy, Sandip Chakraborty

Low-cost air quality sensors are becoming ubiquitous in our daily lives as public awareness of air pollution continues to grow, and people take measures to monitor and improve the air they breathe indoors. Besides the standard operation of these sensors, fluctuations in environmental parameters can be leveraged to understand human behavior and activities in indoor spaces. Unlike traditional audio-visual, Radio Frequency, and inertial sensors, air quality sensors are easily scalable to a household, are privacy-preserving, and more economical. Such distributed sensor networks must jointly make decisions to monitor indoor occupants for downstream smart home and healthcare applications. However, due to low processing power, memory, and energy, they often struggle to maintain distributed data consensus and identify activity-affected sensor groups for accurate on-device inference. In this paper, we propose PoHAR framework that implements: (i) a conflict-free replicated data primitive for data sharing, (ii) a hierarchical clustering for ESP32 to detect activity-affected sensor groups with a self-supervised distance metric, and (iii) a leader-based group inference with off-the-shelf ML classifiers, enabling the sensor network to collaboratively detect hyperlocal indoor activities. Our extensive experiments demonstrated on-device activity detection, achieving 97.41% accuracy for indoor activity and 99.68% for cooking activity, using off-the-shelf ML models with latency below 34 microseconds.

CROct 26, 2017
High Capacity, Secure (n, n/8) Multi Secret Image Sharing Scheme with Security Key

Karthik Reddy, Tejas K, Swathi C et al.

The rising need of secret image sharing with high security has led to much advancement in lucrative exchange of important images which contain vital and confidential information. Multi secret image sharing system (MSIS) is an efficient and robust method for transmitting one or more secret images securely. In recent research, n secret images are encrypted into n or n+ 1 shared images and stored in different database servers. The decoder has to receive all n or n+1 encrypted images to reproduce the secret image. One can recover partial secret information from n-1 or fewer shared images, which poses risk for the confidential information encrypted. In this proposed paper we developed a novel algorithm to increase the sharing capacity by using (n, n/8) multi-secret sharing scheme with increased security by generating a unique security key. A unrevealed comparison image is used to produce shares which makes the secret image invulnerable to the hackers