Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Parul Pandey

dblp:132/8417 · DBLP profile ↗
← Back
8ranked-venue papers
8as first author
1since 2021 · last 2023
0000-0002-6693-1997ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorComputer networks · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Emerging computing paradigms · 32% Embedded and real-time systems · 32% Distributed systems · 26%
Computer graphics and multimedia
1 paper
Multimedia systems and quality of experience · 100%
Computer networks
1 paper
Internet of things and sensor networks · 100%

Topics — the 4 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Emerging computing paradigms
approximate computing
0.212016
MobiDiC: Exploiting the untapped potential of mobile distributed computing via approximation · PerCom 2016
Embedded and real-time systems › mobile computing
mobile distributed systems
0.212016
MobiDiC: Exploiting the untapped potential of mobile distributed computing via approximation · PerCom 2016
Internet of things and sensor networks › camera sensor networks
camera networks
0.212023
Real-Time In-Network Image Compression via Distributed Dictionary Learning · IEEE Trans. Mob. Comput. 2023
Distributed systems
distributed machine learning
0.212023
Real-Time In-Network Image Compression via Distributed Dictionary Learning · IEEE Trans. Mob. Comput. 2023

Methods — techniques the papers use, named apart from their topics

sparse approximation · 2.0overcomplete dictionary · 2.0distributed dictionary learning · 2.0runtime approximate task selection · 0.2offline task approximation analysis · 0.2
YearPublicationVenuePosition
2023 Real-Time In-Network Image Compression via Distributed Dictionary Learning
abstract
Multi-camera networks are increasingly becoming pervasive in many monitoring and surveillance applications, and have attracted much attention in distributed systems with collaborative, real-time decision-making capabilities. While in-network data compression brings significant energy savings in camera nodes, signal representation using sparse approximations and overcomplete dictionaries have been shown to outperform traditional compression methods. In this work, an end-to-end and real-time solution is designed and implemented to enable energy-efficient and robust dictionary learning in distributed camera networks by leveraging the spatial correlation of the collected multimedia data. Traditional distributed dictionary learning relies on consensus-building algorithms, which involve communicating with neighboring nodes until convergence is achieved. Existing methods, however, do not exploit spatial correlations in camera networks for improved energy efficiency. In contrast, low-computational-complexity metrics are employed in this work to quantify and exploit the spatial correlation across camera nodes in a wireless network for efficient distributed dictionary learning and in-network image compression. The performance of the proposed approach is validated through extensive simulations on public datasets as well as via real-world experiments on a testbed composed of Raspberry Pi nodes.
Parul Pandey, Mehdi Rahmati, Waheed U. Bajwa, Dario Pompili
IEEE Trans. Mob. Comput.1
2018 Light-Weight Object Detection and Decision Making via Approximate Computing in Resource-Constrained Mobile Robots
abstract
Most of the current solutions for autonomous flights in indoor environments rely on purely geometric maps (e.g., point clouds). There has been, however, a growing interest in supplementing such maps with semantic information (e.g., object detections) using computer vision algorithms. Unfortunately, there is a disconnect between the relatively heavy computational requirements of these computer vision solutions, and the limited computation capacity available on mobile autonomous platforms. In this paper, we propose to bridge this gap with a novel Markov Decision Process framework that adapts the parameters of the vision algorithms to the incoming video data rather than fixing them a priori. As a concrete example, we test our framework on a object detection and tracking task, showing significant benefits in terms of energy consumption without considerable loss in accuracy, using a combination of publicly available and novel datasets.
Parul Pandey, Qifan He, Dario Pompili, Roberto Tron
IROS1
2018 Robust orchestration of concurrent application workflows in mobile device clouds
Parul Pandey, Hariharasudhan Viswanathan, Dario Pompili
J. Parallel Distributed Comput.1
2017 Exploiting the untapped potential of mobile distributed computing via approximation
Parul Pandey, Dario Pompili
Pervasive Mob. Comput.1
2016 MobiDiC: Exploiting the untapped potential of mobile distributed computing via approximation
abstract
Mobile computing is one of the largest untapped reservoirs in today's pervasive computing world as it has the potential to enable a variety of in-situ, real-time applications. Yet, this computing paradigm suffers when the available resources - such as device battery, CPU cycles, memory, I/O data rate - are limited. In this paper, the new paradigm of approximate computing is proposed to harness such potential and to enable real-time computation-intensive mobile applications in resource-limited and uncertain environments. A reduction in time and energy consumed by an application is obtained via approximate computing by decreasing the amount of computation needed by different tasks in an application; such improvement, however, comes with the potential loss in accuracy. Hence, a Mobile Distributed Computing framework, MobiDiC, is introduced to determine offline the `approximable' tasks in an application and a light-weight algorithm is devised to select the approximate version of the tasks in an application during run-time. The effectiveness of the proposed approach is validated through extensive simulation and testbed experiments by comparing approximate versus exact-computation performance.
Parul Pandey, Dario Pompili
PerCom1
2016 A Distributed Computing Framework for Real-Time Detection of Stress and of Its Propagation in a Team
abstract
Stress is one of the key factor that impacts the quality of our daily life: From the productivity and efficiency in the production processes to the ability of (civilian and military) individuals in making rational decisions. Also, stress can propagate from one individual to other working in a close proximity or toward a common goal, e.g., in a military operation or workforce. Real-time assessment of the stress of individuals alone is, however, not sufficient, as understanding its source and direction in which it propagates in a group of people is equally-if not more-important. A continuous near real-time in situ personal stress monitoring system to quantify level of stress of individuals and its direction of propagation in a team is envisioned. However, stress monitoring of an individual via his/her mobile device may not always be possible for extended periods of time due to limited battery capacity of these devices. To overcome this challenge a novel distributed mobile computing framework is proposed to organize the resources in the vicinity and form a mobile device cloud that enables offloading of computation tasks in stress detection algorithm from resource constrained devices (low residual battery, limited CPU cycles) to resource rich devices. Our framework also supports computing parallelization and workflows, defining how the data and tasks divided/assigned among the entities of the framework are designed. The direction of propagation and magnitude of influence of stress in a group of individuals are studied by applying real-time, in situ analysis of Granger Causality. Tangible benefits (in terms of energy expenditure and execution time) of the proposed framework in comparison to a centralized framework are presented via thorough simulations and real experiments.
Parul Pandey, Dario Pompili
IEEE J. Biomed. Health Informatics1
2015 Dynamic Collaboration Between Networked Robots and Clouds in Resource-Constrained Environments
abstract
Underwater mobile sensor networks such as Autonomous Underwater Vehicles (AUVs) or robots are envisioned to enable applications for oceanographic data collection, environmental and pollution monitoring, offshore exploration, and distributed tactical surveillance. These applications require running compute- and data-intensive algorithms that go beyond the capabilities of the individual AUVs that are involved in a mission. To execute these task-parallel algorithms in resource- and time-constrained environments, dynamic and reliable collaboration between local networked robots (e.g., AUVs) and remote public Clouds is needed. To this end, the heterogeneous sensing, computing, communication, and storage capabilities of local and remote resources are exploited to form a “loosely coupled” mobile Cloud, and a novel resource provisioning engine that dynamically takes decisions on “what” and “where” the tasks should be executed in the mobile Cloud is introduced. Comparison of benefits of collaboration between local and Cloud resources with purely local and centralized approaches are presented through exhaustive computer simulations.
Parul Pandey, Dario Pompili, Jingang Yi
IEEE Trans Autom. Sci. Eng.1
2013 Distributed Computing Framework for Underwater Acoustic Sensor Networks
abstract
The goal of this paper is to enable near-realtime acquisition and processing of high resolution, high-quality, heterogeneous data from mobile and static sensing platforms to advance ocean exploration by providing infrastructure for a distributed computing framework. Reaching this goal will improve the efficiency of monitoring dynamic oceanographic phenomena such as phytoplankton growth and rate of photosynthesis, salinity and temperature gradient, and concentration of pollutants. resource provisioning framework for organizing the heterogeneous sensing, computing, and communication capabilities of static and mobile devices in the vicinity in order to form an elastic resource pool a hybrid static/mobile computing grid is presented. This local computing grid can be harnessed to enable innovative data- and compute-intensive mobile applications such as onshore near-real-time data processing, analysis and visualization, mission planning and online ocean adaptive sampling.
Parul Pandey, Dario Pompili
DCOSS1