Optimal Resource Allocation for Crowdsourced Image Processing

Kristina Sorensen Wheatman, Fidan Mehmeti, Mark Mahon, Hang Qiu, Kevin S. Chan, Thomas F.La Porta

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

Crowdsourced image processing has the potential to vastly impact response timeliness in various emergency situations. Because images can provide extremely important information regarding an event of interest (hits), sending the right images to an analyzer as soon as possible is of crucial importance. In this paper, we consider the problem of optimally assigning resources, both local (CPUs in phones) and remote (network-based GPUs) to mobile devices for processing images, ultimately sending those of interest to a centralized entity while also accounting for the energy consumption at the distributed nodes. To that end, we use the dual-path Network Utility Maximization (NUM) framework, coupled with a hit-ratio estimator and energy costs, to enable a distributed implementation of the system. We include analysis of different hit-ratio estimators using realistic trace data, first considering immediate and then delayed feedback. We address accuracy concerns when estimating the likelihood of future image hits and provide a window-based heuristic for scenarios when hit-ratio feedback is severely delayed. Our TCP-inspired window-method predicts both image hit likelihood and current wireless network congestion with great effectiveness. Results are validated using both synthetic simulations and real-life traces.

Original languageEnglish (US)
Pages (from-to)6110-6125
Number of pages16
JournalIEEE Transactions on Mobile Computing
Volume22
Issue number10
DOIs
StatePublished - Oct 1 2023

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Optimal Resource Allocation for Crowdsourced Image Processing'. Together they form a unique fingerprint.

Cite this