Coordinating Distributed Algorithms for Feature Extraction Offloading in Multi-Camera Visual Sensor Networks

被引:8
作者
Eriksson, Emil [1 ]
Dan, Gyorgy [1 ]
Fodor, Viktoria [1 ]
机构
[1] KTH Royal Inst Technol, Sch Elect Engn, Stockholm, Sweden
关键词
Visual feature extraction; sensor networks; divisible load theory; distributed optimization; QUANTIZATION;
D O I
10.1109/TCSVT.2017.2745102
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Real-time visual analysis tasks, like tracking and recognition, require swift execution of computationally intensive algorithms. Visual sensor networks could be enabled to perform such tasks by allowing the camera nodes to offload their computational load to nearby processing nodes. In this paper, we address the problem of minimizing the completion time of multiple camera sensors that share the transmission and the processing resources of multiple processing nodes for computation offloading. We show that the problem is NP-hard, and propose a combination of central coordination and distributed optimization with limited signaling among the camera sensors as a solution. We analyze the existence of equilibrium allocations for the distributed algorithms, evaluate the effect of the network topology and of the video characteristics on the algorithms' performance, and assess the benefits of central coordination. Our results demonstrate that with sufficient information available, distributed optimization can provide low completion times, moreover predictable and stable performance can be achieved with additional, sparse central coordination.
引用
收藏
页码:3288 / 3299
页数:12
相关论文
共 49 条
[1]  
[Anonymous], 2006, WIOPT
[2]  
[Anonymous], 2013, P 18 IEEE INT C DIG
[3]  
Ayazoglu M, 2011, IEEE I CONF COMP VIS, P2462, DOI 10.1109/ICCV.2011.6126531
[4]  
Baroffio L, 2014, IEEE IMAGE PROC, P3408, DOI 10.1109/ICIP.2014.7025690
[5]  
Baroffio L, 2013, IEEE IMAGE PROC, P1895, DOI 10.1109/ICIP.2013.6738390
[6]   Speeded-Up Robust Features (SURF) [J].
Bay, Herbert ;
Ess, Andreas ;
Tuytelaars, Tinne ;
Van Gool, Luc .
COMPUTER VISION AND IMAGE UNDERSTANDING, 2008, 110 (03) :346-359
[7]   MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J].
BENTLEY, JL .
COMMUNICATIONS OF THE ACM, 1975, 18 (09) :509-517
[8]   Brown's original fictitious play [J].
Berger, Ulrich .
JOURNAL OF ECONOMIC THEORY, 2007, 135 (01) :572-578
[9]   Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems [J].
Veeravalli Bharadwaj ;
Debasish Ghose ;
Thomas G. Robertazzi .
Cluster Computing, 2003, 6 (1) :7-17
[10]   OPTIMAL SEQUENCING AND ARRANGEMENT IN DISTRIBUTED SINGLE-LEVEL TREE NETWORKS WITH COMMUNICATION DELAYS [J].
BHARADWAJ, V ;
GHOSE, D ;
MANI, V .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (09) :968-976