Channel pruning is one of the mainly used meth-ods in current network model compression. However, existing channel pruning methods lack effective hardware runtime latency guidance, making the reduction in model size n...
详细信息
Channel pruning is one of the mainly used meth-ods in current network model compression. However, existing channel pruning methods lack effective hardware runtime latency guidance, making the reduction in model size not fully converted into inference latency reduction, which results in poor inference performance of the pruned network models. This paper proposes a CNN channel pruning framework, CNNBooster, that incorporates hardware runtime latency in-formation, whose two major contributions are as follows: First, CNNBooster automatically analyses the latency behavior of various CNNs with channel reduction on different GPU hard-ware platforms, which achieves efficient localization of pruna-ble coordinates. Second, CNNBooster uses a flexible grained latency-aware and param-aware pruning algorithm based on prunable coordinates to achieve a significant reduction in model inference latency and parameter size. We evaluate CNNBooster with three benchmark models (VGG16, ResNet18 and MobilenetV1) on three NVIDIA-series platforms (V100, RTX 2080 Ti and Jetson Nano). The experimental results show that CNNBooster can achieve a maximum 67.51 % latency re-duction and 1.4x performance improvement compare with current state-of-the-art works.
A fundamental research topic in domain adaptation is how best to evaluate the distribution discrepancy across domains. The maximum mean discrepancy (MMD) is one of the most commonly used statistical distances in this ...
详细信息
A fundamental research topic in domain adaptation is how best to evaluate the distribution discrepancy across domains. The maximum mean discrepancy (MMD) is one of the most commonly used statistical distances in this field. However, information about distributions could be lost when adopting non-characteristic kernels by MMD. To address this issue, we devise a new distribution metric named maximum mean and covariance discrepancy (MMCD) by combining MMD and the proposed maximum covariance discrepancy (MCD). MCD probes the second-order statistics in reproducing kernel Hilbert space, which equips MMCD to capture more information compared to MMD alone. To verify the efficacy of MMCD, an unsupervised learning model based on MMCD abbreviated as McDA was proposed and efficiently optimized to resolve the domain adaptation problem. Experiments on image classification conducted on two benchmark datasets show that McDA outperforms other representative domain adaptation methods, which implies the effectiveness of MMCD in domain adaptation.
Two-dimensional (2D) imageprocessing and three-dimensional (3D) LIDAR point cloud data analytics are two important techniques of sensor data processing for many applications such as autonomous systems, auto driving c...
详细信息
ISBN:
(数字)9781510635661
ISBN:
(纸本)9781510635661;9781510635654
Two-dimensional (2D) imageprocessing and three-dimensional (3D) LIDAR point cloud data analytics are two important techniques of sensor data processing for many applications such as autonomous systems, auto driving cars, medical imaging and many other fields. However, 2D image data are the data that are distributed in regular 2D grids while 3D LIDAR data are represented in point cloud format that consist of points nonuniformly distributed in 3D spaces. Their different data representations lead to different data processing techniques. Usually, the irregular structures of 3D LIDAR data often cause challenges of 3D LIDAR analytics. Thus, very successful diffusion equation methods for imageprocessing are not able to apply to 3D LIDAR processing. In this paper, applying network and network dynamics theory to 2D images and 3D LIDAR analytics, we propose graph-based data processing techniques that unify 2D imageprocessing and 3D LIDAR data analytics. We demonstrate that both 2D images and 3D point cloud data can be processed in the same framework, and the only difference is the way to choose neighbor nodes. Thus, the diffusion equation techniques in 2D imageprocessing can be used to process 3D point cloud data. With this general framework, we propose a new adaptive diffusion equation technique for data processing and show with experiments that this new technique can perform data processing with high performance.
Recent studies predict that video data accounts for 82% of Internet traffic by 2022. This fact has motivated MPEG to define a new Video Coding Standard called Versatile Video Coding (VVC), which will be released by th...
详细信息
In this paper, a real-time perception system for autonomous car is presented. It is based on a highly parallel architecture using state of the art Field Programmable Gate Array (FPGA) to perform both low and intermedi...
详细信息
ISBN:
(纸本)9781510638075
In this paper, a real-time perception system for autonomous car is presented. It is based on a highly parallel architecture using state of the art Field Programmable Gate Array (FPGA) to perform both low and intermediary levels imageprocessing tasks at video frame rate ( i.e. 30 frames / s). The hardware algorithm consists to perform noise removal and edge detection, followed by Hough transform task to extract the segments corresponding the lanes boundaries. The rich hardware resources which are available in nowadays FPGAs (e.g. large built-in distributed RAM memories, DSP blocks, and reconfigurable PLLs) yielded for a compact and low power consumption real-time vision system. Series of tests on different roads within Abu Dhabi city were successfully conducted for different scenarios such as continues lines, discontinues lines and slightly curved lines for which the car speed reached up to 122 km/h.
In this paper, we study the method of digital imageprocessing as a game task with distributed parameters. The possibilities of formulating digital processing as a differential game of the Dirichlet problem for the Po...
详细信息
Clinically, retinal image characterization is utilized for the early diagnosis and treatment of retinal illness. It is necessary to automatically segregate vascular pictures from the retina and perform real-time image...
详细信息
ISBN:
(数字)9781665471978
ISBN:
(纸本)9781665471985
Clinically, retinal image characterization is utilized for the early diagnosis and treatment of retinal illness. It is necessary to automatically segregate vascular pictures from the retina and perform real-time image augmentation. image enhancement methods based on matching filters and FPGAs were previously available. This study is an expansion of past work. The hardware acceleration of matched filtering extends from a one-dimensional timing signal to a two-dimensional picture space. This article configures 17*17 matched filter kernels in 12 directions, applies pixel stream processing mode with shift registers for image data reading, calculates the convolution of the original image data with each filter kernel, and then takes the largest term as the response output for storage. This saves FPGA memory and accelerates the convolution module based on the parallel operation. In addition, compared to the store-and-read strategy, the design lowers resource and time loss in the data readout module. This article demonstrates how to configure the matched filter cores, read the input, compute, output, and save the results.
The proceedings contain 28 papers. The topics discussed include: x-controlled memristive devices for automatic gain control in RC oscillators;analysis of influence of atmospheric conditions on classification DVB-S2 si...
ISBN:
(纸本)9781728161556
The proceedings contain 28 papers. The topics discussed include: x-controlled memristive devices for automatic gain control in RC oscillators;analysis of influence of atmospheric conditions on classification DVB-S2 signals;active RC high order filters suitable for anti-aliasing and/or reconstruction filters;processing the RGB images to generate mezzotint plate and simulate the press;entropy based image quality assessment of stego images created by pulse coupled neural network;parallelimage signal processing in a distributed car plate recognition system;development of speaker recognizer using I-vectors in two programming environments;finding the sensitivity to transfer branch by graphs;prediction of wind turbines Doppler frequency shifts;and modeling output signals of solid-state photomultiplier with capacitive coupling.
We present DiffInfinite, a hierarchical diffusion model that generates arbitrarily large histological images while preserving long-range correlation structural information. Our approach first generates synthetic segme...
We present DiffInfinite, a hierarchical diffusion model that generates arbitrarily large histological images while preserving long-range correlation structural information. Our approach first generates synthetic segmentation masks, subsequently used as conditions for the high-fidelity generative diffusion process. The proposed sampling method can be scaled up to any desired image size while only requiring small patches for fast training. Moreover, it can be parallelized more efficiently than previous large-content generation methods while avoiding tiling artifacts. The training leverages classifier-free guidance to augment a small, sparsely annotated dataset with unlabelled data. Our method alleviates unique challenges in histopathological imaging practice: large-scale information, costly manual annotation, and protective data handling. The biological plausibility of DiffInfinite data is evaluated in a survey by ten experienced pathologists as well as a downstream classification and segmentation task. Samples from the model score strongly on anti-copying metrics which is relevant for the protection of patient data.
Recent empirical work has shown that hierarchical convolutional kernels inspired by convolutional neural networks (CNNs) significantly improve the performance of kernel methods in image classification tasks. A widely ...
ISBN:
(纸本)9781713871088
Recent empirical work has shown that hierarchical convolutional kernels inspired by convolutional neural networks (CNNs) significantly improve the performance of kernel methods in image classification tasks. A widely accepted explanation for their success is that these architectures encode hypothesis classes that are suitable for natural images. However, understanding the precise interplay between approximation and generalization in convolutional architectures remains a challenge. In this paper, we consider the stylized setting of covariates (image pixels) uniformly distributed on the hypercube, and characterize exactly the RKHS of kernels composed of single layers of convolution, pooling, and downsampling operations. We use this characterization to compute sharp asymptotics of the generalization error for any given function in high-dimension. In particular, we quantify the gain in sample complexity brought by enforcing locality with the convolution operation and approximate translation invariance with average pooling. Notably, these results provide a precise description of how convolution and pooling operations trade off approximation with generalization power in one layer convolutional kernels.
暂无评论