Essays about: "computer technology and architecture"

Showing result 6 - 10 of 199 essays containing the words computer technology and architecture.

  1. 6. Deep Learning-based Regularizers for Cone Beam Computed Tomography Reconstruction

    University essay from KTH/Matematisk statistik

    Author : Sabina Syed; Josefin Stenberg; [2023]
    Keywords : Adversarial Convex Regularization; Computer Vision; Cone Beam Computed Tomography; Convolutional Neural Networks; Deep Learning; Image Reconstruction; Adversarial Convex Regularization; Bildrekonstruktion; Datorseende; Djupinlärning; Faltningsnätverk; Volymtomografi;

    Abstract : Cone Beam Computed Tomography is a technology to visualize the 3D interior anatomy of a patient. It is important for image-guided radiation therapy in cancer treatment. During a scan, iterative methods are often used for the image reconstruction step. READ MORE

  2. 7. Possibilities and Challenges of City Planning using 3D Visualization : A systematic literature review on the possibilities of city visualization using 3D computer graphics and the utility of parametric design

    University essay from Blekinge Tekniska Högskola

    Author : Benjamin Lind Nilsson; [2023]
    Keywords : ;

    Abstract : There exist numerous previously conducted surveys, studies and written articles on the topic of 3D geo-visualization. The subject has been pursued increasingly for the last two decades. In the late 1960s, digital earth, the idea of a digital copy of the real world was first proposed. However, hardware capabilities were limited. READ MORE

  3. 8. Modeling, Simulation, and Injection of Camera Images/Video to Automotive Embedded ECU : Image Injection Solution for Hardware-in-the-Loop Testing

    University essay from Uppsala universitet/Signaler och system

    Author : Anton Lind; [2023]
    Keywords : ADAS; AD; ADS; HIL; Hardware in the loop; Hardware-in-the-loop; ECU; VCU; Automotive; Embedded; System; Systems; Camera; Image; Video; Injection; FPGA; MPSoC; Vivado; Vitis; VHDL; Volvo; Cars; FMC; HPC; LPC; MIPI CSI2; GMSL2; AMBA AXI4; Xilinx; RTL; Implementation; Synthesis; Intelectual Property; IP; Vehicle computing unit; Electronic control unit; TEB0911; TEF0007; TEF0010; CSI2 Tx; CSI2 Tx Subsystem; Zynq; SerDes; AXI4; AXI4-Lite; Programmable Logic; PL; Processor System; PS; C; C ; Video test pattern generator; VTPG; Axi traffic generator; ATG; Ultrascale ; Virtual input output; VIO; Integrated logic analyzer; ILA; Interface Unit;

    Abstract : Testing, verification and validation of sensors, components and systems is vital in the early-stage development of new cars with computer-in-the-car architecture. This can be done with the help of the existing technique, hardware-in-the-loop (HIL) testing which, in the close loop testing case, consists of four main parts: Real-Time Simulation Platform, Sensor Simulation PC, Interface Unit (IU), and unit under test which is, for instance, a Vehicle Computing Unit (VCU). READ MORE

  4. 9. A General Purpose Near Data Processing Architecture Optimized for Data-intensive Applications

    University essay from Lunds universitet/Institutionen för elektro- och informationsteknik

    Author : Xingda Li; Haidi Hu; [2023]
    Keywords : Technology and Engineering;

    Abstract : In recent years, as Internet of Things (IoT) and machine learning technologies have advanced, there has been increasing interest in the study of energy-efficient and flexible architectures for embedded systems. To bridge the performance gap between microprocessors and memory systems, Near-Data Processing (NDP) was introduced. READ MORE

  5. 10. Cache behaviour analysis for graph algorithms

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Johan Söderström; [2023]
    Keywords : ;

    Abstract : Graph processing is an ever-increasing significant area of research in the wake of the demand for efficient tools that process data such as graphs, which can describe sets of objects (vertices) and their relations to each other (edges). Graph algorithms traverse these graphs by visiting their vertices or additionally calculating some properties about them such as how significant a specific vertex is in the context of the greater graph. READ MORE