Selecting the right parameters is a vital issue in image processing algorithms. Normally this is done after experimenting with a limited number of pictures, and then one just hopes that the parameters will work adequa...
详细信息
Selecting the right parameters is a vital issue in image processing algorithms. Normally this is done after experimenting with a limited number of pictures, and then one just hopes that the parameters will work adequately with all the other images. Experimenting with the parameters, however, consumes precious human time. In this paper we present a technique that aims at finding the right parametrization of edge detection algorithms by comparing several approaches and deciding on the optimal one automatically.
For applications that require object detection to be performed in real-time, this paper presents a custom hardware accelerator, implementing state of the art Tiny YOLO-v3 algorithm. The proposed architecture achieves ...
详细信息
ISBN:
(纸本)9781665441766
For applications that require object detection to be performed in real-time, this paper presents a custom hardware accelerator, implementing state of the art Tiny YOLO-v3 algorithm. The proposed architecture achieves a reasonable tradeoff between the speed of computation (measured in frames per second or FPS) and the hardware resources required. Each CNN layer is pipelined and parameterized to make the complete design re-configurable. The proposed hardware accelerator was synthesized using the SCL(Semi-Conductor Laboratory, India) 180 nm CMOS process and also using Vivado Xilinx software with Virtex Ultrascale+ FPGA as the target device. The pipelined architecture, along with other architectural novelties, provided a higher frame-rate of 32.1 FPS and a performance of 166.4 GOPS at 200 MHz clock frequency.
The Bounding Cube algorithm used in wireless sensor networks depends greatly on the known nodes. When the number of known nodes is limited, the communication range of the unknown node is only decided by the intersecti...
详细信息
The Bounding Cube algorithm used in wireless sensor networks depends greatly on the known nodes. When the number of known nodes is limited, the communication range of the unknown node is only decided by the intersection range of known nodes, which will reduce the positioning precision. This paper presents an improved algorithm. After acquiring the communication range of unknown nodes, you can use it to update the communication range of the other unknown nodes. By constantly updating the range, the unknown nodes will be gradually reduced. Thus, with the limited number of known nodes, we can take advantage of the unknown nodes to reduce the estimated communication range of other unknown nodes and improve the location accuracy.
Aiming at the problem that the access network, backbone network and data center cloud heterogeneous controllers cannot communicate with each other in cloud network collaboration under the software Defined Network (SDN...
详细信息
ISBN:
(数字)9798350388725
ISBN:
(纸本)9798350388732
Aiming at the problem that the access network, backbone network and data center cloud heterogeneous controllers cannot communicate with each other in cloud network collaboration under the software Defined Network (SDN) architecture, this paper introduces a super controller into the control layer of the SDN architecture to communicate with each domain. Heterogeneous controllers are interconnected to control the access network, backbone network and data center cloud to achieve cloud-network collaboration. And by improving the clustering algorithm, the optimal position of each controller in the SDN architecture is obtained. First, by abstracting the network topology into an undirected graph, the multi-controller deployment problem in the network is abstracted into the shortest path problem of the undirected graph, and the cloud network collaboration and the location of the deployed switches are modeled, and the K-means algorithm is used to determine the domain. The initial location of the controller and the switch that the domain controller is responsible for connecting to. An appropriate fitness function is formulated, considering the minimization of latency, while the optimal placements of domain controllers and super controllers are determined through the utilization of the particle swarm optimization (PSO) algorithm.
This work is focused on establishing TCP / IP connection between SICK LD-OEM 1000 laser scanner and PC. Space measurements will be made using this connection. Then we analyze the data and process it. The data is proce...
详细信息
ISBN:
(数字)9781728180533
ISBN:
(纸本)9781728180540
This work is focused on establishing TCP / IP connection between SICK LD-OEM 1000 laser scanner and PC. Space measurements will be made using this connection. Then we analyze the data and process it. The data is processed by the Monte Carlo Simultaneous localization and mapping algorithm, which will be used to compile a map of the scanned space. This work is based on MATLAB software environment.
In this paper, a weight method with using a reduced lookup table is developed to decode the three possible errors in (15, 5, 7) and (31, 16, 7) BCH code. The data in the reduced lookup table consists of syndrome patte...
详细信息
In this paper, a weight method with using a reduced lookup table is developed to decode the three possible errors in (15, 5, 7) and (31, 16, 7) BCH code. The data in the reduced lookup table consists of syndrome patterns and corresponding error patterns which only have one and two errors occurred in the message block of the received codeword. The proposed algorithm makes use of the properties of cyclic codes, weight of syndrome, and the reduced lookup table. It often results in a significant reduction in the memory requirements comparing to the traditional lookup table or other algebraic decoding methods. This weight decoding algorithm together with a reduced lookup table makes a fast and low complexity of the table lookup decoding algorithm. Moreover, a computer simulation shows that such a novel method is a much faster algorithm in software than the traditional full lookup table searching algorithm.
In this paper, we expand previous work and present an accurate electricity load forecasting algorithm with back propagation neural networks. It contributes to short-term electricity load forecast methodology with neur...
详细信息
In this paper, we expand previous work and present an accurate electricity load forecasting algorithm with back propagation neural networks. It contributes to short-term electricity load forecast methodology with neural network with weather feature such as max centigrade, min centigrade and weather types. The original electricity load is from shanghai district, which is composed of original every 5 minutes load records. Through the data transform the every hour data average 12 original records and weather feature become double value. After training and simulation, the prediction errors fit for the application needs. The algorithm besides other algorithms has been used in electricity load forecasting software. Many results confirm that the proposed method is capable of forecasting load efficiently.
In modern processors, energy savings are achieved using dynamic voltage and frequency scaling (DVFS). For task scheduling, where a task graph representing a program is allocated and ordered on multiple processors, DVF...
详细信息
ISBN:
(纸本)9781509028269
In modern processors, energy savings are achieved using dynamic voltage and frequency scaling (DVFS). For task scheduling, where a task graph representing a program is allocated and ordered on multiple processors, DVFS has been employed to reduce the energy consumption of the generated schedules, hence running the processors at heterogeneous speeds A prominent class of energy-efficient scheduling algorithms is slack reclamation algorithms, which try to use idle times (slack) to slow down processor speed to save energy. Several algorithms have been proposed and under the assumed system model they can achieve considerable energy savings. However, the question arises, how realistic and accurate these algorithms and models are when implemented and executed on real hardware. Can one achieve the promised energy savings? This paper proposes a methodology to investigate these questions and performs a first experimental evaluation of selected slack reclamation algorithms. Using schedules created by three scheduling algorithms for a set of task graphs, we generate code and execute it on a small parallel system. We measure the power consumption and compare the results between the algorithms and relate them to the expected values.
Sparse representation techniques have become an important tool in image processing in recent years, for coding, de-noising and in-painting purposes, for instance. They generally rely on an lscr 2 -lscr 1 penalized cr...
详细信息
Sparse representation techniques have become an important tool in image processing in recent years, for coding, de-noising and in-painting purposes, for instance. They generally rely on an lscr 2 -lscr 1 penalized criterion and fast algorithms have been proposed to speed up the applications. We propose to replace the lscr 2 -part of the criterion, which has been chosen both for its easy implementation and its relation to the PSNR quality measure, by a lscr ∞ -part. We present a new fast way to minimize a lscr ∞ - lscr 1 penalized criterion and assess its potential benefits for image De-noising and coding.
暂无评论