Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Real-time Distributed Visual Feature Extraction from Video in Sensor Networks
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0001-8968-3976
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0002-4876-0223
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0002-2764-8099
2014 (English)In: Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014, 2014Conference paper, Published paper (Refereed)
Abstract [en]

Enabling visual sensor networks to perform visual analysis tasks in real-time is challenging due to the computational complexity of detecting and extracting visual features. A promising approach to address this challenge is to distribute the detection and the extraction of local features among the sensor nodes, in which case the time to complete the visual analysis of an image is a function of the number of features found and of the distribution of the features in the image. In this paper we formulate the minimization of the time needed to complete the distributed visual analysis for a video sequence subject to a mean average precision requirement as a stochastic optimization problem. We propose a solution based on two composite predictors that reconstruct randomly missing data, and use a quantile-based linear approximation of the feature distribution and time series analysis methods. The composite predictors allow us to compute an approximate optimal solution through linear programming. We use two surveillance videos to evaluate the proposed algorithms, and show that prediction is essential for controlling the completion time. The results show that the last value predictor together with regular quantile-based distribution approximation provide a low complexity solution with very good performance.

Place, publisher, year, edition, pages
2014.
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-156173DOI: 10.1109/DCOSS.2014.30ISI: 000361020100023Scopus ID: 2-s2.0-84904420756ISBN: 978-147994619-8 (print)OAI: oai:DiVA.org:kth-156173DiVA, id: diva2:765482
Conference
IEEE Intl. Conference on Distributed Computing in Sensor Systems (DCOSS)
Note

QC 20150223

Available from: 2014-11-24 Created: 2014-11-24 Last updated: 2015-10-05Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Eriksson, EmilDán, GyörgyFodor, Viktoria

Search in DiVA

By author/editor
Eriksson, EmilDán, GyörgyFodor, Viktoria
By organisation
Communication Networks
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 70 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf