Measurement-driven Analysis of an Edge-Assisted Object Recognition System

by   A. Galanopoulos, et al.

We develop an edge-assisted object recognition system with the aim of studying the system-level trade-offs between end-to-end latency and object recognition accuracy. We focus on developing techniques that optimize the transmission delay of the system and demonstrate the effect of image encoding rate and neural network size on these two performance metrics. We explore optimal trade-offs between these metrics by measuring the performance of our real time object recognition application. Our measurements reveal hitherto unknown parameter effects and sharp trade-offs, hence paving the road for optimizing this key service. Finally, we formulate two optimization problems using our measurement-based models and following a Pareto analysis we find that careful tuning of the system operation yields at least 33 for real time conditions, over the standard transmission method.



There are no comments yet.


page 1

page 6


Variable-Viewpoint Representations for 3D Object Recognition

For the problem of 3D object recognition, researchers using deep learnin...

Analysis of Trade-offs in RF Photonic Links based on Multi-Bias Tuning of Silicon Photonic Ring-Assisted Mach Zehnder Modulators

Recent progress in silicon-based photonic integrated circuits (PICs) hav...

Designing with Static Capabilities and Effects: Use, Mention, and Invariants

Capabilities (whether object or reference capabilities) are fundamentall...

Analysis-of-marginal-Tail-Means - a new method for robust parameter optimization

This paper presents a novel method, called Analysis-of-marginal-Tail-Mea...

Vision Transformer for Fast and Efficient Scene Text Recognition

Scene text recognition (STR) enables computers to read text in natural s...

Online VNF Chaining and Predictive Scheduling: Optimality and Trade-offs

For NFV systems, the key design space includes the function chaining for...

Characterizing the Energy Trade-Offs of End-to-End Vehicular Communications using an Hyperfractal Urban Modelling

We characterize trade-offs between the end-to-end communication delay an...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

Edge-assistance will most likely be a key component of future latency-critical and computationally-demanding mobile applications such as video analytics and Tactile Internet services [killer_app, Zhang18]. Augmented Reality [edge_assisted] and real time object recognition [Glimpse] are examples of such services that can benefit from the computational power of a nearby edge server, since mobile devices are too slow to timely perform the required computations. Nevertheless, the practical performance benefits of such edge architectures remain unexplored. On the one hand, data transmissions are added to the service delay. On the other hand, the quality and execution delay of analytics is affected by the volume of the transmitted data, as well as the complexity of the algorithm running on the edge server.

In this paper we investigate this issue experimentally, by building the edge computing system illustrated in Fig. 1

. We develop a real-time object recognition system, as a representative of the plethora of emerging visual-aided services, e.g. video stream analytics, mobile augmented reality, etc. A mobile handset (client) captures camera images and transmits them to an edge server for processing; the server uses a deep neural network (NN) to detect and classify objects in the images; and sends the output to the handset which overlays this information on the screen. We built the above system using an Android application and a state-of-the-art deep learning network running on GPU hardware for the server. We use a high performance 802.11ac wireless link for communication between the handset and the server, which features technology likely to persist in future small cells

111We use MU-MIMO/OFDM and channel aggregation at the PHY layer, and employ packet aggregation at the MAC layer to reduce framing/signaling overheads., hence making our results relevant to a range of systems.

Fig. 1: Schematic of edge-assisted object recognition system.

Our goal is to understand the system-level trade-offs between end-to-end (E2E) latency and object recognition accuracy, and propose specific solutions that can improve the performance of the system. We firstly show that the degree of image compression and deep learning NN input size are key parameters affecting both performance metrics. In particular, the use of more aggressive image compression saves on communication latency between client and server (since the transmitted image file is smaller), but at the cost of reduced object recognition accuracy. While the impact of image degradation due to noise or blur on recognition accuracy has started to receive attention in the deep learning literature [dodge2016], the impact of compression on accuracy remains relatively poorly understood. Furthermore, a large NN size will improve recognition performance at the cost of higher execution delay at the server, hence increasing E2E latency. To the best of our knowledge, the trade-off between E2E latency and recognition accuracy for the above parameters, has not previously been explored.

We focus our effort in designing wireless transmission interventions that further improve the communication delay of the system. Such interventions have not yet received significant attention by the edge computing literature, as most efforts have been devoted to minimizing computation delays[DeepMon, DeepDecision, AAY18]. This delay source however, is of critical importance to low latency services, and hinders their ability to achieve real time performance, e.g. [Overlay, Glimpse]. We show that transmit time can be reduced by up to 65% by sending the images as short back-to-back bursts of UDP packets. We also find that the client Network Interface Controller (NIC) powersave can incur substantial transmit latency and, hence, smarter sleep mode adaptation can further decrease latency by up to 60%.

Finally, we model the different sources of delay in our system, and the obtained accuracy, as functions of the NN size and encoding rate using our measurements. We illustrate the use of the developed model to highlight optimal trade-offs between E2E latency and system object detection accuracy. Moreover, we show that the use of smart wireless transmission techniques employed, can nearly double the system performance along the Pareto-optimal curve of accuracy vs frame rate. Our main contributions are as follow.

  • [leftmargin=*]

  • We build the edge architecture of Fig. 1, where the image encoding rate and input NN size are tunable parameters.

  • We tailor the system design, with wireless transmission interventions (Transport layer, MAC aggregation, device wake-up), reducing the communication delay to just 2-6 ms.

  • Using the system, we explore the impact of image encoding quality and NN size on the delay and recognition accuracy. Extensive experiments reveal sharp trade-offs between these two performance criteria.

  • We collect a wealth of measurements and use them to build statistical models for the performance metrics of interest. These can be used in order to tailor the system operation based on the needs of the client, e.g. maximize accuracy for a minimum perceived frame rate.

Paper Organization. In Sec. II we describe the system architecture and the evaluation scenario. In Sec. III we measure the impact of the image encoding and NN size on the E2E latency, and present our design choices for reducing the transmission delay. In Sec. IV we analyze the inherent latency-accuracy trade-off, while in Sec. V we use our measurements to obtain analytical models for delay and accuracy. Finally, Sec. VI presents a discussion of the related work, while Sec. VII concludes the paper.

Ii Preliminaries

Ii-a Hardware & Software Setup

We developed an Android application that captures images through the handset’s camera, carries out JPEG encoding and then transmits the compressed images to an edge server for processing. The server software (written in C/C++) decompresses and pre-processes the images, and submits them to the deep learning neural network (NN) which is implemented using a GPU-optimized framework. The results, i.e., the bounding boxes and labels, are then sent back to the client handset and overlaid on the displayed image.

Object recognition is performed by YOLO [yolov3]

, a state-of-the-art deep learning detector implemented on darknet, an open source framework that supports GPU computations via cuda. It takes an

array of image pixels as input, with each pixel being a float value, and down-samples by to give an grid. Then, each grid cell proposes bounding boxes and labels for any contained objects. These results are filtered to generate the output consisting of a set of bounding boxes of recognized objects with their labels and respective confidence.

We use different mobile devices to measure the effect of the end user’s hardware on the system’s performance: (i) a Google Pixel 2 (default device), (ii) a Samsung Galaxy S8, and (iii) a Huawei P10 Lite. All devices are equipped with 802.11ac chipsets, and we will be using the Google phone unless stated otherwise. The edge server is connected via Ethernet to a WiFi router that serves as an access point (802.11ac, 5GHz) for the handsets222The edge server is a 3.7 GHz Core i7 PC equipped with 32GB of RAM and a GeForce RTX 2080Ti GPU; and the router is the ASUS RT-AC86U., see Fig. 1.

Ii-B The Need for Edge Server Offload

We investigated first the viability of running YOLO on the handset by cross-compiling darknet, but found that the running times were excessive (on the order of minutes). Use of a cut-down version of YOLO, referred to as TinyYOLO [yolov3], was also investigated. The running time was around 1s per image, substantially faster than with the full YOLO network but still very slow compared to the server. Note also that the speedup of TinyYOLO is obtained at the cost of significantly reduced object recognition accuracy, and supports only a small subset of object types. Our tests convey the same message as previous studies [DL_offloading, LAVEA], namely confirm the necessity for offloading the object recognition task to a powerful server, if low latency operation is to be obtained.

Ii-C Evaluation Scenario

To evaluate the system performance we used the extensive COCO dataset [COCO] which covers a wide range of images and objects, and includes ground truth for each image (object locations and labels within each image). For quantifying performance, we used the Average Precision (AP) and Average Recall (AR) metrics333AP is the ratio while AR is the ratio , with being the true positive detections, the false positive and the false negative detections. The results are averaged over all objects classes.

for a range of Intersection-over-Union (IoU) values. Detection is considered successful when the ratio of the overlapping area between the detected object and the ground truth, over their respective union area, is higher than an IoU value of 0.5. COCO further breaks precision and recall metrics down by whether objects are large, medium or small. YOLO is known to perform poorly on small objects and so we focus on large and medium objects.

To use the COCO images we connected the phone to a server via a USB cable and a Python script on the server sends commands to the phone using the Android Debug Bridge (adb). The server initiates the client application through adb and configures the system parameters for the experiment (e.g., the JPEG compression level). Then it iterates over 5000 images from the COCO validation set, sending them one-by-one to the phone through cable. The phone transmits each image to the server through the wireless interface, as if they were images captured by its camera, receives the server response over WiFi and passes this back over the USB cable for logging.

Iii System End-to-End Latency

Our first goal is to measure each of the different delay components involved in the procedure, and investigate how they are affected by the encoding rate and NN size , but also by the network set up (from the transport, to data link and physical layer). Based on our findings we propose and evaluate network design choices that speedup the task completion.

Iii-a Encoding Delay ()

The handset application converts its camera images to JPEG format before transmission to the server. We use JPEG as it is widely adopted and supported by the Android API. While image encoding is a typical step in such systems, its impact on the performance of edge-assisted object recognition has not received attention, with only few exceptions [Zhang18]. JPEG is a lossy format and its compression is decided by the encoding rate . Note that we rely on the terminology of the compression library we employed in our system444For jpeg compression (through quantization) we used the Android library: and define as the percentage ratio of compressed image size over its actual size, where for an uncompressed image.

At higher encoding rates, the number of discrete cosine transform coefficients that represent the JPEG image is larger, leading to an expected increase in the encoding delay. Indeed, Fig. 1(a) (upper plot) shows the encoding delay vs. the encoding rate . It can be seen that grows from 5ms to 11ms as increases from 25% to 100%. This has also impact on the size of the compressed image, see Fig. 1(a) (lower plot).

Iii-B Decoding and Pre-processing Delay ()

Upon receiving an image, the server (i) decompresses it to obtain an RGB image; (ii)

re-samples/pads the image to match the input size

of the deep learning network; (iii) rotates the image to compensate for the handset camera orientation; and (iv) converts the pixel values from 0-255 integers to 0-1.0 floats. Our profiling indicates that most of this processing is limited by memory resources rather than CPU. Hence, in our implementation we execute steps (i) and (ii) jointly so as to minimize memory movements and maximize scope for in-processor caching. And similarly we designed our implementation to execute simultaneously steps (iii) and (iv). Contrary to encoding delay, this part of the processing depends both on the encoding rate and the NN size. Fig. 1(b) plots measurements of the processing time vs. and . Observe that when the latency is largely insensitive to , i.e., it is dominated by the preprocessing steps other than image decompression. Similarly, the NN size affects significantly only when it is very large (notice the sudden increase when ). As we will see later, these findings create opportunities for optimizing the overall system operation.

Fig. 2: Time used for: (a) JPEG encoding, (b) decoding and preprocessing, vs encoding rate . Results are averaged for the entire COCO library (5000 images).

Iii-C Transmission Delay ()

Next, we investigate the network impact on the task delay, and propose specific solutions that can effectively halve this time. First, note that the size of the transmitted images vary between 20–250KB, corresponding to roughly 13–166 packets (each 1500B long). In contrast, the server response contains object bounding boxes and typically fits into a single packet. Hence, the network transmission delay is dominated by the time taken to transmit the image and we expect that this will increase with the encoding rate .

Fig. 3: (a) Wireless transmission delay using TCP vs JPEG encoding rate, (b) example time history of the NIC state on the mobile handset when power saving is enabled.

The solid line in Fig. 2(a) plots the transmission delay vs. . This delay includes the time needed to send the image to the server and the time for transmitting back the response. The measurements are when TCP is used with default Android and Linux settings, i.e., Cubic congestion control and dynamic socket buffer sizing. As expected, the delay tends to increase with the JPEG quality (for larger ). However, when the delay is relatively insensitive to the encoding rate. Further investigation reveals that this insensitivity is mainly caused by two factors. Firstly, the handset’s power management aggressively puts the NIC into sleep mode, and this induces a delay to wake the NIC when transmission or reception restarts. Secondly, the dynamics of TCP congestion control mean that it takes multiple round-trip times to transmit all image packets. Next, we propose solutions for these two issues.

Iii-C1 Handset NIC Wake-from-Sleep Latency

When entering sleep mode, the handset’s 802.11 NIC sends a special flagging frame to the AP which buffers any packets awaiting transmission until the handset signals it has woken up. Fig. 2(b) plots an example time history of the handset’s NIC state derived by extracting these state transitions from tcpdump data555In our experiment a delay is inserted between input of each image to the android app to make the power-save behavior easier to see.. Also indicated on Fig. 2(b) are “active” periods where the NIC is awake and exchanges data with the server. Note that the NIC regularly enters a sleep state, waking up when the handset starts to send an image. As indicated by our measurements above, the handset can roughly predict when the next image transmission will occur. Namely, a new captured image is transmitted approximately after 5-10ms (time for its encoding), and this could be used to preemptively wake up the NIC.

Solution: In order to investigate the potential latency gains of smart wake-up strategies, we adopted the cruder approach of using iperf to generate 1Mb/s of background UDP traffic from the server to the client, to keep the handset’s wireless interface awake. The dashed line in Fig. 2(a) shows that the overall transmit delay is now decreased for all values of , consistent with the handset NIC no longer having to be woken up for transmitting the image. The delay reduction is approximately 5ms for all encoding rates which corresponds to a reduction of 50% in the wireless transmission delay.

Iii-C2 Latency Caused By TCP Dynamics

The upper plot in Fig. 3(a) shows the time history when transferring an image using TCP. The connection is kept open and used for sending multiple images so that the overhead of the TCP handshake (SYN-SYNACK-ACK) is only incurred once (takes 4ms; not shown). The compressed image in this example is 31335B in size, and when the HTTP request header is added, it occupies 22 TCP packets666The payload of a 1500B TCP packet is 1448B including header overheads.. Its transmission lasts 2.5ms and uses 4 MAC frames for data and 3 for TCP ACKs. On average, 5.5 TCP data packets are therefore sent in each MAC frame. Observe that the client needs to receive TCP ACKs before it can send the full image since the TCP congestion window (cwnd) limits the packets in flight to around 10 when starting a new transfer. Also, observe that there is contention between uplink and downlink due to the ACKs transmitted by the server.

Solution: We explore the gains from removing uplink/downlink contention and the impact of TCP cwnd, by modifying the Android client and server to use UDP. At the client side, an image is segmented and placed into a sequence of UDP packets which are then sent to the socket back-to-back to facilitate aggregation by the NIC. The lower plot in Fig. 3(a) shows UDP measurements777Including the time needed to segment the image into UDP packets, so the values are comparable with the TCP data. for transmission of the same image. Despite that UDP packets are fit within a single MAC frame (our system can aggregate up to 128 packets in 1 frame), we see that the transfer used actually 3 frames. Presumably this is due to the scheduling delays between the kernel and NIC, and the relative timing of channel access opportunities and packet arrivals. Nevertheless, we find that the data transfer time is now 0.8ms, i.e., 3 times faster than with TCP. Finally, Fig. 3(b) plots measurements of the overall wireless transmission time (sending the image and receiving its response) for the full COCO data set when using TCP and UDP; and with mobile NIC power-save disabled. We find that using UDP packet bursting roughly halves the transmit time for all JPEG encoding rates.

Concluding, in this subsection we showed that tailored transmission strategies, such as smart NIC power-saving and using UDP with packet bursting, reduce the transmit time to around 5ms. This improvement is hugely important given the targeted E2E latency budgets.888To achieve real time frame update rates, such as 30fps, the available total latency budget is only 33ms.

Fig. 4: (a) Time histories showing transfer of a compressed image from client to server using TCP (upper plot) and UDP (lower plot), markers indicate packet boundaries. (b) Wireless transmission delay for TCP and UDP vs JPEG encoding rate with mobile NIC power-save disabled.
Fig. 5: Server recognition delay (), for different NN size.
Fig. 6: Edge device delay comparison.

Iii-D Recognition Delay () and Impact of Handheld

YOLO outputs the coordinates of the image’s detected objects along with their labels. The recognition delay depends on the NN size, and our measurements in Fig. 5 show that it increases, roughly, quadratically with . Other works have reported similar findings, e.g., see [DeepDecision, DL_offloading], but the delays are quite higher than our results, presumably due to the usage of older GPU hardware. Furthermore, DeepMon [DeepMon] proposes NN optimizations on the mobile devices that reduce the delay at about 1sec for YOLO, but it is still worse than our system’s performance. These values may vary from system to system, but we expect qualitatively the trend to persist.

Similarly, we suspect that the handset hardware affects only slightly (i.e., quantitatively) the results. To verify this, we repeat our experiments with 2 additional mobile devices. The delays that are directly related to the handset device, and may vary due to the different hardware specifications, are the encoding and transmission delay. Fig. 6 plots the total encoding and transmission delay measured for the 3 devices (Pixel 2, P10 Lite, Galaxy S8) for each encoding rate (averaging all dataset images). We find that compared to the Pixel 2, the other 2 devices are slightly faster in image encoding, but also slower in transmitting. Such differences might likely arise due to the different chipsets/firmware implementations. Observe however, that the roughly quadratic increase of both delay components persists across all devices as increases. Hence, qualitatively the results hold for different hardware.

Fig. 7: Performance Trade-offs (disabled power-save; UDP). (a-b) Precision and recall (IoU=0.5) vs and . (c-d) Precision and recall for medium and large objects vs for uncompressed images (in (c)), and vs with fixed (in (d)). (e) Frame rate vs NN size and encoding rate . All results are averaged over all images and all IoUs in .

Iv Performance Trade-offs

Using our measurements above we discuss here the interaction and trade-offs between the two performance metrics, i.e., the accuracy and E2E delay, under a range of different scenarios. We discover that in several cases there are sharp trade-off curves which create opportunities for improving the system operation, by carefully tuning parameters and .

Figures 6(a)-6(b) plot the object recognition999We have used the Python library CoCoApi for calculating these metrics, average precision and recall vs the encoding rate and the NN size . We see that both metrics generally increase with and , although there is a sharp improvement going from to . Moreover, as drops the precision and recall performance deteriorate and cannot be improved even if we use high (e.g., see last row in each matrix). This finding differs from previous studies, e.g., [dodge2016], perhaps due to the COCO dataset which contains images with a large range of object sizes.

We further study the impact of the object sizes on performance, while we consider different detection thresholds (IoU values) [COCO]. In Fig. 6(c) we plot the precision and recall vs and for large and medium objects, averaged for a range of IoU values. We see that for large objects the accuracy increases rapidly with but plateaus when . For medium objects on the other hand, the benefits of larger input size (and so higher image resolution) are greater and accuracy only plateaus when . Fig. 6(d) shows that the dependence on , albeit not that strong, follows indeed a continuous increase. We note that the precision and recall values in these plots are relatively low because we use very high IoU thresholds (up to 0.95). Also, we do not consider larger NNs since for we already have satisfactory precision but also large delays.

Finally, we study the frame rate, i.e., the reciprocal of E2E latency, for different NN sizes and image encoding rates. Fig. 6(e) presents the average frame rate for each scenario. Notice that for small NNs () the encoding affects significantly the frame rate, but this effect is weaker for . For example, when the rate falls below 30fps even for very small values of

. In other words, we find that in the low NN size regime, the accuracy gains from choosing a high encoding rate are not significant, while the frame rate gains of a low encoding rate are substantial. Hence, a low encoding rate is probably more suitable for a small NN. The opposite is true in the high NN size regime, where we can achieve substantial accuracy gains without compromising significantly the frame rate.

These findings underline the importance of selecting jointly the values of parameters and . Next section provides a systematic methodology towards that end.

V Data Models and Pareto Analysis

V-a Fitting the Measurements

Our measurements indicate that the latency components and accuracy can be approximated using quadratic functions of the decision variables and . Note that only the decoding delay and precision (we omit recall for brevity) depend on both and . On the other hand, the encoding and transmission delays, and , depend only on , and the deep learning delay on . We therefore define:


The model parameters are obtained by fitting our measurements to (1)-(5). Clearly, the exact values of these parameters can change if, for instance, we use a different access point or server. However, as our tests with the different handset devices have revealed, the changes are minimal and only quantitative.101010The handsets affect only the values of parameters and .

V-B Pareto Analysis

We leverage the above models to explore the interaction of the decision variables:

i.e., study how they jointly affect the precision and the frame rate (E2E latency), while we also devise the Pareto fronts for these two performance criteria by following a detailed parameter-sensitivity analysis. We formulate two optimization problems; , where we maximize the precision subject to achieving a minimum frame rate; and where we maximize the frame rate while not dropping the precision below a threshold value. Formally the 2 problems can be written:


s.t. (7)


s.t. (9)

where we have defined:

and is the highest tolerable delay in order to achieve a frame rate of fps. Respectively, is the target precision requested by the user. In essence, constraint (7) ensures that the total delay does not exceed , and hence the frame rate will be greater or equal to the threshold . Similarly in we maximize the frame rate by minimizing . Using both problem formulations we will be able to highlight the trade-offs between delay and precision.

Fig. 7(a) plots the values of and that maximize the precision while keeping the frame rate at or above the value indicated on the x-axis (recall that is a multiple of 32). The achieved precision for each frame rate is displayed with a solid line in Fig. 7(b). Observe how the increasing frame rate dictates the drop of NN size and encoding rate, which in turn result in decreasing precision performance. Moreover, we observe that the NN size continuously drops or stays level with the frame rate, while the encoding rate can increase in some cases. That occurs when the NN size has been reduced and hence the increase of the encoding rate can sustain a higher precision. Notice that for the largest range of frame rates, the NN size can be kept quite high (around and above 400), even when exceeding 30 fps. This yields a satisfactory precision of at 40 fps111111Recall that we obtain low precision values because on purpose we used very high IoU values; for more typical thresholds the precision is much higher.. However, after the 40 fps threshold, the NN size has to be very small to facilitate fast object recognition and the precision performance drops dramatically.

Fig. 8: (a) Optimal NN size and encoding rate for the desired frame rate. (b) Corresponding maximal precision values.
Fig. 9: (a) Optimal NN size and encoding rate for the target accuracy. (b) Corresponding maximal frame rate values.

To highlight the impact of our optimized networking configuration, we compare the performance with the respective results of a non-optimized (vanilla) system, dashed line in Fig. 7(b). Namely, these results were obtained by fitting the non-optimized (TCP, and enabled powersave) wireless transmission delay measurements to (3) and solving . Clearly, the increased transmission delays hamper the ability of the system to achieve high precision for acceptable frame rates (precision drops by 33% at 30 fps). Moreover, becomes infeasible for a target frame rate above 34 fps, indicating the greater range in which the system can operate after configuring the network. The respective results for are displayed in Fig. 8(a)8(b). The optimal frame rate can be kept very close to 30 fps, even for very high target precision. Also, we observe a huge gap between the optimized and non-optimized solution in this case, with the former achieving up to 93% higher frame rate than the latter when target precision is very low.

Vi Related Work

Deep Learning With Compressed Images. The impact of image compression on recognition accuracy has started to receive attention in the deep learning literature, see seminal paper [dodge2016] and follow-up works, but this aspect of performance remains relatively poorly understood. Most attention has focused on developing new compression approaches tailored to deep learning e.g. see [DeepN, edge_assisted]. The authors in [Zhang18] explore the effect of image compression rate to the object detection accuracy. To the best of our knowledge however, the system-level trade-offs between E2E latency and deep learning accuracy introduced by the use of image compression have not been previously explored.

Edge-Assistance. JAGUAR [JAGUAR] and Glimpse [Glimpse] are edge-assisted, real-time object recognition systems. They both use object tracking to reduce the number of recognitions, but do not use state of the art deep learning techniques for object recognition. [DL_offloading] proposes a solution for deciding the execution location of augmented reality tasks, either on the mobile, or an edge server. The idea of distributing the neural network layers among different tiers of the network architecture is demonstrated in [DDNN_1, DDNN_2]. The devices, based on their computation resources execute smaller or larger parts of the NN towards increasing the accuracy of inferences with tolerable execution and network delays. In [AAY18] the authors propose a framework for distributing deep learning sub-processes to edge, cloudlet and cloud nodes towards increasing the job execution rate of the system. [edge_assisted] presents an augmented reality object detection system that leverages an edge server, as well as object tracking and image encoding to improve latency. The above works indicate the necessity of edge architectures, towards improving the E2E latency of delay sensitive services.

Accuracy/Latency Trade-off. JALAD [JALAD] proposes the decoupling of a Deep Neural Network (DNN) between edge and cloud towards minimizing latency with execution accuracy guarantees. Overlay [Overlay] presents an augmented reality system for mobile devices, assisted by a GPU-enabled server that is designed towards minimizing the tracking error. MobiQoR [MobiQoR]

studies the trade-off between delay and Quality of Result for edge applications that involve machine learning and analytics like face recognition. The authors show that sacrificing computation result quality can decrease delay as well as energy consumption. LAVEA 

[LAVEA] proposes a system for computation offloading of data analytics to nearby edge nodes. The formulated optimization problem aims in making offloading and bandwidth allocation decisions towards minimizing latency. DeepDecision [DeepDecision] is a video analytics system that balances accuracy and latency, by properly adjusting the camera sample rate, video encoding rate, and deep learning model. However, both transmission and processing delays are much higher than the ones obtained by our system. DeepMon [DeepMon] distributes the execution of a large DNN across multiple mobile GPUs to reduce latency. It focuses on DNN optimizations, instead of the network-centric analysis presented in our work. All the above works, highlight the inherent trade-off between latency and accuracy in edge architectures. Our work however goes beyond that, by proposing important delay reducing modifications that easily enable real time performance for object recognition.

Vii Conclusions

We develop an edge-assisted object recognition system and show that careful network transmit and powersave strategies can significantly reduce the wireless transmission delay. We find that the level of image compression, as well as the dimension of the deep learning network used, are key design parameters, affecting both end-to-end latency and object recognition accuracy. We demonstrate how our measurements can be used to choose these design parameters to optimally trade-off between execution delay and accuracy.


The authors would like to thank Domenico Guistianino for helpful input and discussions during development of the system. This publication has emanated from research supported in part by SFI research grants 17/CDA/4760, 16/IA/4610 and is co-funded under the European Regional Development Fund under Grant Number 13/RC/2077.