scholarly journals A sorting image sensor: an example of massively parallel intensity-to-time processing for low-latency computational sensors

Author(s):  
V. Brajovic ◽  
T. Kanade
Author(s):  
Lucia Agnes Beena Thomas

With the proliferation of new technologies such as augmented and virtual reality, autonomous cars, 5G networks, drones, and IOT with smart cities, consumers of cloud computing are becoming the producers of data. Large volume of data is being produced at the edge of the network. This scenario insists the need for efficient real-time processing and communication at the network edge. Cloud capabilities must be distributed across the network to form an edge cloud, which places computing resources where the traffic is at the edge of the network. Edge cloud along with 5G services could also glint the next generation of robotic manufacturing. The anticipated low latency requirement, battery life constraint, bandwidth cost saving, as well as data safety and privacy are also inscribed by edge cloud. A number of giants like Nokia, AT&T, and Microsoft have emerged in the market to support edge cloud. This chapter wraps the features of edge cloud, the driving industries that are providing solutions, the use cases, benefits, and the challenges of edge cloud.


Author(s):  
Hadise Ramezani ◽  
Majid Mohammadi ◽  
Amir Sabbagh Molahoseini

The two-dimensional Gaussian smoothing filter (2D-GSF) is one of the most useful techniques in image processing. Since the 2D-GSF requires high computational resources, its efficient design and implementation are critical in real-time processing purposes. Approximate computing is a new method that can be used to increase the performance of 2D Gaussian filter design with low computing overhead on field-programmable gate arrays (FPGAs). This study aims to provide a low-latency Gaussian filter architecture on FPGA such that it can be used in real-time processing applications. In this regard, accurate and approximate carry-save adders (CSAs) have been used in adder tree-based Gaussian filters. In our proposed method, we use two approximation steps: in the first step, we use an approximation structure named Speed–Power–Area–Accuracy for Gaussian filter design and in the second stage, we use approximate CSAs to convert adder-tree structures that are used in Gaussian filter, and as a result, we have significantly reduced the delay. The results of simulation and implementation show that the latency has reduced in a 3[Formula: see text] 3 2D-GSF architecture up to 22% using proposed accurate CSAs and 45% using proposed approximate CSAs, compared to existing Gaussian filters with an adder tree structure.


2008 ◽  
Author(s):  
Meghan E. Wright ◽  
Deana Davalos ◽  
Carly Yadon ◽  
Kelsey Keener

2020 ◽  
Vol 140 (12) ◽  
pp. 1297-1306
Author(s):  
Shu Takemoto ◽  
Kazuya Shibagaki ◽  
Yusuke Nozaki ◽  
Masaya Yoshikawa

Sign in / Sign up

Export Citation Format

Share Document