Bruno Boessio Vizzotto

dblp:119/0186 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2017
0009-0002-2911-9972ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 38% Hardware accelerators and domain-specific architectures · 38% Energy-efficient computing · 23%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems
fault tolerance
0.312017
Application-Guided Power-Efficient Fault Tolerance for H.264 Context Adaptive Variable Length Coding · IEEE Trans. Computers 2017
Hardware accelerators and domain-specific architectures
video coding accelerator
0.312017
Application-Guided Power-Efficient Fault Tolerance for H.264 Context Adaptive Variable Length Coding · IEEE Trans. Computers 2017
Energy-efficient computing › power management
dynamic power management
0.112017
Application-Guided Power-Efficient Fault Tolerance for H.264 Context Adaptive Variable Length Coding · IEEE Trans. Computers 2017
Energy-efficient computing
power management
0.112017
Application-Guided Power-Efficient Fault Tolerance for H.264 Context Adaptive Variable Length Coding · IEEE Trans. Computers 2017
YearPublicationVenuePosition
2017 Application-Guided Power-Efficient Fault Tolerance for H.264 Context Adaptive Variable Length Coding
abstract
This paper presents a fault-tolerance technique for H.264's Context-Adaptive Variable Length Coding (CAVLC) on unreliable computing hardware. The application-specific knowledge is leveraged at both algorithm and architecture levels to protect the CAVLC process (especially context adaptation and coding tables) in a reliable yet power-efficient manner. Specifically, the statistical analysis of coding syntax and video content properties are exploited for: (1) selective redundancy of coefficient/header data of video bitstreams; (2) partitioning the coding tables into various sub-tables to reduce the power overhead of fault tolerance; and (3) run-time power management of memory parts storing the sub-tables and their parity computations. Experimental results demonstrate that leveraging application-specific knowledge reduces area and performance overhead by 2x compared to a double-parity table protection technique. For functional verification and area comparison, the complete H.264 CAVLC architecture is prototyped on a Xilinx Virtex-5 FPGA (though not limited to it).
Muhammad Shafique 0001, Semeen Rehman, Florian Kriebel, Muhammad Usman Karim Khan, Bruno Zatt, Arun Subramaniyan 0001, Bruno Boessio Vizzotto, Jörg Henkel
IEEE Trans. Computers7
2013 Model Predictive Hierarchical Rate Control With Markov Decision Process for Multiview Video Coding
abstract
This paper presents a novel hierarchical rate control (HRC) for the Multiview Video Coding standard targeting improved bandwidth usage and high video quality. The HRC is designed to jointly address the rate control at both frame level and basic unit (BU) level. The proposed scheme is able to exploit the bitrate distribution correlation with neighboring frames to efficiently predict the future bitrate behavior by employing a model predictive control that defines a proper control action through quantization parameter (QP) adaptation. To provide a fine-grained tuning, the QP is further adapted within each frame by a Markov decision process implemented at BU level able to take into consideration a map of the regions of interest. A coupled frame/BU level feedback is performed in order to guarantee the system consistency. Experimental results show the superiority of our HRC compared to state-of-the-art solutions in terms of bitrate allocation accuracy and rate distortion while delivering smooth video quality at frame and BU levels.
Bruno Boessio Vizzotto, Bruno Zatt, Muhammad Shafique 0001, Sergio Bampi, Jörg Henkel
IEEE Trans. Circuits Syst. Video Technol.1
2012 A Model Predictive Controller for Frame-Level Rate Control in Multiview Video Coding
abstract
In this work, we present a novel frame-level Rate Control algorithm for Multiview Video Coding encoder that adopts the Model Predictive Control technique in order to provide low bitrate fluctuation and high video quality. Our Model Predictive Rate Control (MPRC) predicts the bitrate for a frame by employing (i) inter-view inter-GOP (Group of Pictures) phase-based bitrate prediction, and (ii) temporal (intra-GOP) target bitrate linear weighting. Moreover, the MPRC also defines an optimal control action through frame-level QP value selection. Experimental results demonstrate that our MPRC bitrate prediction incurs a Mean Bit Estimation Error (MBEE) of 1.13% compared to 2.46% provided by single view-based Rate Control and 1.61% provided by the state-of-the-art MVC Rate Control. Our solution also provides on average 0.876dB BD-PSNR increase and 28.92% BD-Bitrate reduction while providing smoother quality and bitrate variations when compared to state-of-the-art.
Bruno Boessio Vizzotto, Bruno Zatt, Muhammad Shafique 0001, Sergio Bampi, Jörg Henkel
ICME1
2012 A low-cost and high efficiency entropy encoder architecture for H.264/AVC
Cristiano Thiele, Bruno Boessio Vizzotto, André Luís Machado Martinez, Vagner Santos Da Rosa, Sergio Bampi
VLSI-SoC2
2011 Applying CUDA Architecture to Accelerate Full Search Block Matching Algorithm for High Performance Motion Estimation in Video Encoding
abstract
This work presents a parallel GPU-based solution for the Motion Estimation (ME) process in a video encoding system. We propose a way to partition the steps of Full Search block matching algorithm in the CUDA architecture. A comparison among the performance achieved by this solution with a theoretical model and two other implementations (sequential and parallel using OpenMP library) is made as well. We obtained a O(n^2/log^2n) speed-up which fits the proposed theoretical model considering different search areas. It represents up to 600x gain compared to the serial implementation, and 66x compared to the parallel OpenMP implementation.
Eduarda Monteiro, Bruno Boessio Vizzotto, Cláudio Machado Diniz, Bruno Zatt, Sergio Bampi
SBAC-PAD2