arXiv subjects

Ao Zhou

Publications and source records attributed to Ao Zhou.

58 records · Page 4Linked to original sources

arXiv2020

DP-Net: Dynamic Programming Guided Deep Neural Network Compression

In this work, we propose an effective scheme (called DP-Net) for compressing the deep neural networks (DNNs). It includes a novel dynamic programming (DP) based algorithm to obtain the optimal solution of weight quantization and an optimization process to train a clustering-friendly DNN. Experiments showed that the DP-Net allows larger compression than the state-of-the-art counterparts while preserving accuracy. The largest 77X compression ratio on Wide ResNet is achieved by combining DP-Net with other compression techniques. Furthermore, the DP-Net is extended for compressing a robust DNN model with negligible accuracy loss. At last, a custom accelerator is designed on FPGA to speed up the inference computation with DP-Net.

cs.LG↗

arXiv2020

Cooperative Service Caching and Workload Scheduling in Mobile Edge Computing

Mobile edge computing is beneficial to reduce service response time and core network traffic by pushing cloud functionalities to network edge. Equipped with storage and computation capacities, edge nodes can cache services of resource-intensive and delay-sensitive mobile applications and process the corresponding computation tasks without outsourcing to central clouds. However, the heterogeneity of edge resource capacities and inconsistence of edge storage and computation capacities make it difficult to jointly fully utilize the storage and computation capacities when there is no cooperation among edge nodes. To address this issue, we consider cooperation among edge nodes and investigate cooperative service caching and workload scheduling in mobile edge computing. This problem can be formulated as a mixed integer nonlinear programming problem, which has non-polynomial computation complexity. To overcome the challenges of subproblem coupling, computation-communication tradeoff, and edge node heterogeneity, we develop an iterative algorithm called ICE. This algorithm is designed based on Gibbs sampling, which has provably near-optimal results, and the idea of water filling, which has polynomial computation complexity. Simulations are conducted and the results demonstrate that our algorithm can jointly reduce the service response time and the outsourcing traffic compared with the benchmark algorithms.

cs.NI↗

arXiv2018

Analysis of Fourier ptychographic microscopy with half of the captured images

Fourier ptychography microscopy (FPM) is a new computational imaging technique that can provide gigapixel images with both high resolution and a wide field of view (FOV). However, time consuming of the data-acquisition process is a critical issue. In this paper, we make an analysis on the FPM imaging system with half number of the captured images. Based on the image analysis of the conventional FPM system, we then compare the reconstructed images with different number of captured data. Simulation and experiment results show that the reconstructed image with half number captured data do not show obvious resolution degradation compared to that with all the captured data, except a contrast reduction. In particular in the case when the object is close to phase-only/amplitude only, the quality of the reconstructed image with half of the captured data is nearly as good as the one reconstructed with full data.

eess.IV↗

arXiv2018

Fast and robust misalignment correction of Fourier ptychographic microscopy

Fourier ptychographi cmicroscopy(FPM) is a newly developed computational imaging technique that can provide gigapixel images with both high resolution (HR) and wide field of view (FOV). However, the positional misalignment of the LED array induces a degradation of the reconstruction, especially in the regions away from the optical axis. In this paper, we propose a robust and fast method to correct the LED misalignment of FPM, termed as misalignment correction for FPM (mcFPM). Although different regions in the FOV have different sensitivity to the LED misalignment, the experimental results show that mcFPM is robust to eliminate the degradation in each region. Compared with the state-of-the-art methods, mcFPM is much faster.

cs.CV↗