Computing Power in Real Time

Keyword(s):  
2019 ◽  
Author(s):  
Jimut Bahan Pal

It has been a real challenge for computers with low computing power and memory to detect objects in real time. After the invention of Convolution Neural Networks (CNN) it is easy for computers to detect images and recognize them. There are several technologies and models which can detect objects in real time, but most of them require high end technologies in terms of GPUs and TPUs. Though, recently many new algorithms and models have been proposed, which runs on low resources. In this paper we studied MobileNets to detect objects using webcam to successfully build a real time objectdetection system. We observed the pre trained model of the famous MS COCO dataset to achieve our purpose. Moreover, we applied Google’s open source TensorFlow as our back end. This real time object detection system may help in future to solve various complex vision problems.


2018 ◽  
Vol 8 (4) ◽  
pp. 35 ◽  
Author(s):  
Jörg Fickenscher ◽  
Sandra Schmidt ◽  
Frank Hannig ◽  
Mohamed Bouzouraa ◽  
Jürgen Teich

The sector of autonomous driving gains more and more importance for the car makers. A key enabler of such systems is the planning of the path the vehicle should take, but it can be very computationally burdensome finding a good one. Here, new architectures in ECU are required, such as GPU, because standard processors struggle to provide enough computing power. In this work, we present a novel parallelization of a path planning algorithm. We show how many paths can be reasonably planned under real-time requirements and how they can be rated. As an evaluation platform, an Nvidia Jetson board equipped with a Tegra K1 SoC was used, whose GPU is also employed in the zFAS ECU of the AUDI AG.


2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Ziang Lei

3D reconstruction techniques for animated images and animation techniques for faces are important research in computer graphics-related fields. Traditional 3D reconstruction techniques for animated images mainly rely on expensive 3D scanning equipment and a lot of time-consuming postprocessing manually and require the scanned animated subject to remain in a fixed pose for a considerable period. In recent years, the development of large-scale computing power of computer-related hardware, especially distributed computing, has made it possible to come up with a real-time and efficient solution. In this paper, we propose a 3D reconstruction method for multivisual animated images based on Poisson’s equation theory. The calibration theory is used to calibrate the multivisual animated images, obtain the internal and external parameters of the camera calibration module, extract the feature points from the animated images of each viewpoint by using the corner point detection operator, then match and correct the extracted feature points by using the least square median method, and complete the 3D reconstruction of the multivisual animated images. The experimental results show that the proposed method can obtain the 3D reconstruction results of multivisual animation images quickly and accurately and has certain real-time and reliability.


2022 ◽  
Vol 21 (1) ◽  
pp. 1-29
Author(s):  
Lanshun Nie ◽  
Chenghao Fan ◽  
Shuang Lin ◽  
Li Zhang ◽  
Yajuan Li ◽  
...  

With the technology trend of hardware and workload consolidation for embedded systems and the rapid development of edge computing, there has been increasing interest in supporting parallel real-time tasks to better utilize the multi-core platforms while meeting the stringent real-time constraints. For parallel real-time tasks, the federated scheduling paradigm, which assigns each parallel task a set of dedicated cores, achieves good theoretical bounds by ensuring exclusive use of processing resources to reduce interferences. However, because cores share the last-level cache and memory bandwidth resources, in practice tasks may still interfere with each other despite executing on dedicated cores. Such resource interferences due to concurrent accesses can be even more severe for embedded platforms or edge servers, where the computing power and cache/memory space are limited. To tackle this issue, in this work, we present a holistic resource allocation framework for parallel real-time tasks under federated scheduling. Under our proposed framework, in addition to dedicated cores, each parallel task is also assigned with dedicated cache and memory bandwidth resources. Further, we propose a holistic resource allocation algorithm that well balances the allocation between different resources to achieve good schedulability. Additionally, we provide a full implementation of our framework by extending the federated scheduling system with Intel’s Cache Allocation Technology and MemGuard. Finally, we demonstrate the practicality of our proposed framework via extensive numerical evaluations and empirical experiments using real benchmark programs.


Author(s):  
Prakash P ◽  
Darshaun K. G. ◽  
Yaazhlene. P ◽  
Medidhi Venkata Ganesh ◽  
Vasudha B

In Cloud Computing, all the processing of the data collected by the node is done in the central server. This involves a lot of time as data has to be transferred from the node to central server before the processing of data can be done in the server. Also it is not practical to stream terabytes of data from the node to the cloud and back. To overcome these disadvantages, an extension of cloud computing, known as fog computing, is introduced. In this, the processing of data is done completely in the node if the data does not require higher computing power and is done partially if the data requires high computing power, after which the data is transferred to the central server for the remaining computations. This greatly reduces the time involved in the process and is more efficient as the central server is not overloaded. Fog is quite useful in geographically dispersed areas where connectivity can be irregular. The ideal use case requires intelligence near the edge where ultra-low latency is critical, and is promised by fog computing. The concepts of cloud computing and fog computing will be explored and their features will be contrasted to understand which is more efficient and better suited for real-time application.


2021 ◽  
Author(s):  
A.L. Reznik ◽  
A.A. Soloviev ◽  
A.V. Torgov

High-performance method for improving the resolution of digital images and video sequences based on minimum-variance signal reconstruction are considered. A distinctive feature of the developed algorithms is that they allow (with the availability of modern computing power) to obtain improved images and video in “real time”.


Author(s):  
Yenumula B. Reddy

This spectrum sensing application is ideal for nanotechnology implementation because intensive computations are needed. Without nanocomputing it might be infeasible to implement sensing and analysis in real-time for cognitive radio networks with the current available computing power. Therefore, we need complicated distributed processing schemes to achieve our goals and nanocomputing is the best answer. The contribution includes the current state of nanotechnology, the cognitive radio networks, role of nanotechnology in cognitive radio networks, and building the model using nanotechnology for real-time applications.


2005 ◽  
Vol 44 (05) ◽  
pp. 665-673 ◽  
Author(s):  
K. Matsuo ◽  
Y. Tanaka ◽  
L. F. G. Sarmenta ◽  
T. Nakai ◽  
E. Bagarinao

Summary Objectives: The analysis of brain imaging data such as functional MRI often requires considerable computing resources, which in most cases are not readily available in many medical imaging facilities. This lack of computing power makes it difficult for researchers and medical practitioners alike to perform on-site analysis of the generated data. This paper presents a system that is capable of analyzing functional MRI data in real time with results available within seconds after data acquisition. Methods: The system employs remote computational servers to provide the necessary computing power. System integration is accomplished by an accompanying software package, which includes fMRI analysis tools, data transfer routines, and an easy-to-use graphical user interface. The remote analysis is transparent to the user as if all computations are performed locally. Results: The use of PC clusters in the analysis of fMRI data significantly improved the performance of the system. Simulation runs fully achieved real-time performance with a total processing time of 1.089 s per image volume (64 x 64 x 30 in size), much less than the per volume acquisition time set to 3.0 s. Conclusions: The results show the feasibility of using remote computational resources to enable on-demand real-time fMRI capabilities to imaging sites. It also offers the possibility of doing more intensive analysis even if the imaging site doesn’t have the necessary computing resources.


2004 ◽  
Vol 15 (05) ◽  
pp. 733-751 ◽  
Author(s):  
JOSEPH Y.-T. LEUNG

The problem of competitive on-line scheduling in two-processor real-time environments is studied. The model of Koren and Shasha is followed: Every task has a deadline and a value that it obtains only if it completes by its deadline – the value being its computation time. The goal is to design on-line schedulers with worst-case guarantees compared with a clairvoyant scheduler. Koren and Shasha gave algorithms for the migration and no-migration models, with competitive multipliers of 2 and 3, respectively. In this article, we give an algorithm for the no-migration model with an improved competitive multiplier of [Formula: see text]. We also show that the competitive multiplier for the migration model can be lowered by using a fast processor and a slow processor, compared with using several parallel and identical processors with the same aggregate computing power.


Sign in / Sign up

Export Citation Format

Share Document