Percorrer por autor "Cruz, Luis A. da Silva"
A mostrar 1 - 10 de 25
Resultados por página
Opções de ordenação
- 3D key-frame extraction method based on visual saliencyPublication . Ferreira, Lino; Assunção, Pedro; Cruz, Luis A. da SilvaThis paper presents a method for key-frame extraction from 3D video using visual saliency to weight the 3D content according to a user attention model. Key-frames are found in temporal segments of arbitrary length (i.e., 3D scenes) using a dynamic programming algorithm which minimises the dissimilarity between the reconstructed and the original temporal segment. The dissimilarity measure is based on a combination of frame difference and visual relevance estimated through visual saliency maps. These maps result from attention modeling, taking into account spatial, temporal and depth features of the 3D video content. The results, evaluated using the Shot Reconstruction Degree and the Fidelity measure, show that the proposed method outperforms those obtained from uniform sampling and attention curve methods. This method may be useful for fast browsing of 3D video repositories.
- 3D video shot boundary detection based on clustering of depth-temporal featuresPublication . Ferreira, Lino; Assunção, Pedro; Cruz, Luis A. da SilvaThis paper proposes an algorithm for automatic detection of 3D video shots with different perceptual features. The proposed algorithm is able to identify distinct three-dimensional visual scenes by detecting 3D video shot boundaries based on clustering of depth-temporal features. A combination of texture variation along the temporal dimension and depth variance is used by K-means clustering to find the stereo frames which comprised the 3D scene boundaries. An important characteristic of the proposed algorithm in comparison with others published in the literature for temporal segmentation of classic 2D video is that no thresholds are used in the decision processes neither training data sets. The experimental results show that the proposed method is capable of achieving high recall (e.g., 0.95) and precision rate (e.g., 1.0) in video sequences with both sharp and smooth 3D scene transitions.
- Classification-based early termination for coding tree structure decision in HEVCPublication . Correa, Guilherme; Assunção, Pedro; Cruz, Luis A. da Silva; Agostini, LucianoThe High Efficiency Video Coding (HEVC) standard provides improved compression rates in comparison to its predecessors at the cost of large increases in computational complexity. An important share of such increases is due to the introduction of flexible Coding Tree structures, which best configuration is decided through exhaustive tests in a Rate-Distortion Optimization (RDO) scheme. In this work, an early termination method for the decision of such structures was designed using classification trees obtained through Data Mining techniques. The classification trees were trained using intermediate encoding results from a training set of video sequences and implemented in the encoder to skip the full RDO-based decision. An average reduction of 37% in the HEVC encoder computational complexity was achieved when using the designed classification trees, with a negligible cost of only 0.28% in terms of Bjontegaard Delta-rate increase.
- Complexity control of HEVC through quadtree depth estimationPublication . Correa, Guilherme; Assunção, Pedro; Agostini, Luciano; Cruz, Luis A. da SilvaThe emerging HEVC standard introduces a number of tools which increase compression efficiency in comparison to its predecessors at the cost of greater computational complexity. This paper proposes a complexity control method for HEVC encoders based on dynamic adjustment of the newly proposed coding tree structures. The method improves a previous solution by adopting a strategy that takes into consideration both spatial and temporal correlation in order to decide the maximum coding tree depth allowed for each coding tree block. Complexity control capability is increased in comparison to a previous work, while compression losses are decreased by 70%. Experimental results show that the encoder computational complexity can be downscaled to 60% with an average bit rate increase around 1.3% and a PSNR decrease under 0.07 dB.
- Complexity-Aware High Efficiency Video CodingPublication . Corrêa, Guilherme; Assunção, Pedro; Agostini, Luciano; Cruz, Luis A. da SilvaThis book discusses computational complexity of High Efficiency Video Coding (HEVC) encoders with coverage extending from the analysis of HEVC compression efficiency and computational complexity to the reduction and scaling of its encoding complexity. After an introduction to the topic and a review of the state-of-the-art research in the field, the authors provide a detailed analysis of the HEVC encoding tools compression efficiency and computational complexity. Readers will benefit from a set of algorithms for scaling the computational complexity of HEVC encoders, all of which take advantage from the flexibility of the frame partitioning structures allowed by the standard. The authors also provide a set of early termination methods based on data mining and machine learning techniques, which are able to reduce the computational complexity required to find the best frame partitioning structures. The applicability of the proposed methods is finally exemplified with an encoding time control system that employs the best complexity reduction and scaling methods presented throughout the book. The methods presented in this book are especially useful in power-constrained, portable multimedia devices to reduce energy consumption and to extend battery life. They can also be applied to portable and non-portable multimedia devices operating in real time with limited computational resources.
- Computational complexity control for HEVC based on coding tree spatio-temporal correlationPublication . Correa, Guilherme; Assunção, Pedro; Cruz, Luis A. da Silva; Agostini, LucianoThe High Efficiency Video Coding standard shows improved compression efficiency in comparison to previous standards at the cost of higher computational complexity. In this paper, a complexity control method for HEVC encoders based on the dynamic adjustment of the number of constrained coding treeblocks is proposed. The method limits the maximum tree depth used in the coding structures based on spatio-temporal correlation in order to decrease the number of evaluations performed in the Rate-Distortion Optimization process. Experimental results show that the proposed method is capable of maintaining the encoding time per frame under a pre-defined target, reaching computational complexity decreases of up to 50% at the cost of an average BD-PSNR loss of 0.26 dB in the worst case scenario.
- Computational Resource Management for Video Coding in Mobile EnvironmentsPublication . Correa, Guilherme; Assunção, Pedro; Agostini, Luciano; Cruz, Luis A. da SilvaThe increase of computational resources in mobile devices and the availability of reliable communication infrastructures provide support for acquisition, display, coding/decoding and transmission of high-resolution video in a broad set of equipment such as tablets and smartphones. Nevertheless, real-time video encoding and decoding is still a challenge in such computing environments, especially when considering the amount of computational resources required by state-of-the-art video coding standards. Moreover, battery technologies did not evolve as much as desired, which makes power consumption minimization an important issue for the mobile devices industry and users. Therefore, in current mobile systems, the available computational resources along with battery-life are responsible for imposing significant limitations on mobile real-time multimedia communications. This chapter presents an overview of the state-of-the-art research on management of computational resources for video encoding systems in mobile communications equipment. A review on computational complexity analysis of both H.264/AVC and HEVC video coding standards is presented, followed by a description of current methods for modelling, reducing and controlling the expenditure of computational resources on these video codecs. Finally, future trends on computational complexity management for video codecs implemented on power-constrained devices are lined out.
- Constrained encoding structures for computational complexity scalability in HEVCPublication . Correa, Guilherme; Assunção, Pedro; Cruz, Luis A. da Silva; Agostini, LucianoThe High Efficiency Video Coding standard shows improved compression efficiency in comparison to previous standards at the cost of higher computational complexity. In this paper, a complexity scalability method for HEVC encoders based on the dynamic adjustment of the number of constrained coding treeblocks is proposed. The method limits the Prediction Unit shapes and the maximum tree depth used in each Coding Treeblock in order to decrease the number of evaluations performed in the Rate-Distortion Optimization process. The encoder is capable of trading off computational complexity and compression efficiency while still maintaining the encoding time per Group of Pictures (GOP) under a pre-defined target. The encoding complexity can be decreased in up to 60% when compared to the original encoder at the cost of small Bjontegaard Delta (BD)-rate increases.
- Disparity compensation of light fields for improved efficiency in 4D transform-based encodersPublication . Santos, Joao M.; Thomaz, Lucas A.; Assuncao, Pedro A. A.; Cruz, Luis A. da Silva; Tavora, Luis M. N.; Faria, Sergio M. M. deEfficient light field en coders take advantage of the inherent 4D data structures to achieve high compression performance. This is accomplished by exploiting the redundancy of co-located pixels in different sub-aperture images (SAIs) through prediction and/or transform schemes to find a m ore compact representation of the signal. However, in image regions with higher disparity between SAIs, such scheme's performance tends to decrease, thus reducing the compression efficiency. This paper introduces a reversible pre-processing algorithm for disparity compensation that operates on the SAI domain of light field data. The proposed method contributes to improve the transform efficiency of the encoder, since the disparity-compensated data presents higher correlation between co-located image blocks. The experimental results show significant improvements in the compression performance of 4D light fields, achieving Bjontegaard delta rate gains of about 44% on average for MuLE codec using the 4D discrete cosine transform, when encoding High Density Camera Arrays (HDCA) light field images.
- Dynamic tree-depth adjustment for low power HEVC encodersPublication . Correa, Guilherme; Assunção, Pedro; Cruz, Luis A. da Silva; Agostini, LucianoPower consumption is a major problem in multimedia-capable mobile devices, especially those equipped with the most advanced video codecs. The emerging HEVC standard introduces a set of features which significantly increase the encoder computational complexity and consequently the power consumption in comparison to its predecessor, H.264/AVC. This paper presents two complexity reduction methods that selectively constrain the coding tree depth to keep computational complexity below a pre-established limit. Experimental results show that the encoder complexity can be reduced to 60% of the original complexity, allowing the implementation of low power HEVC encoders with small or negligible loss in rate-distortion performance.
- «
- 1 (current)
- 2
- 3
- »