scholarly journals Comparison of 3D 360-Degree Video Compression Performance Using Different Projections

Author(s):  
Mohammadreza Jamali ◽  
Firouzeh Golaghazadeh ◽  
Stephane Coulombe ◽  
Ahmad Vakili ◽  
Carlos Vazquez
2020 ◽  
Vol 2020 (10) ◽  
pp. 136-1-136-7
Author(s):  
Daniel J Ringis ◽  
François Pitié ◽  
Anil Kokaram

The majority of internet traffic is video content. This drives the demand for video compression in order to deliver high quality video at low target bitrates. This paper investigates the impact of adjusting the rate distortion equation on compression performance. An constant of proportionality, k, is used to modify the Lagrange multiplier used in H.265 (HEVC). Direct optimisation methods are deployed to maximise BD-Rate improvement for a particular clip. This leads to up to 21% BD-Rate improvement for an individual clip. Furthermore we use a more realistic corpus of material provided by YouTube. The results show that direct optimisation using BD-rate as the objective function can lead to further gains in bitrate savings that are not available with previous approaches.


VLSI Design ◽  
2007 ◽  
Vol 2007 ◽  
pp. 1-10 ◽  
Author(s):  
P. Guironnet de Massas ◽  
P. Amblard ◽  
F. Pétrot

This paper presents the necessary steps to modify the implementation of the SPARCV8 architecture to enhance it with multimedia-oriented instructions. The purpose is improving video compression performance without designing dedicated coprocessors. We investigate the complexity of modifying a standard processor instruction set and show that, although not trivial, this is feasible in a few weeks. We implemented 12 new instructions and use some of them to optimize the computation of a demanding step of the MPEG encoding. The result is a performance increase of 67% in the execution of a part of this algorithm, allowing us to expect a 30% speedup in the execution of an MPEG video compression. The area increase of the integer unit is about 18% and the clock frequency is not significantly modified in an LEON-2 implementing 6 among 12 of the new instructions.


With the rising advancement of the multimedia technology, video compression is becoming a challenging problem. Although, there is availability of various standard compression algorithms, yet robust compression performance is yet to be seen in existing compression techniques. This paper also highlights that machine learning plays a significant contributory role in improving the performance of the video compression. Therefore, this manuscript offers a technical insight about the performance of existing video compression technique using machine learning approach. The contribution of this paper is its findings which states that machine learning approach do have significant advantage but the advantageous features are limited by the inherent and unsolved research problem. The core findings of this paper are basically to highlight the strength and limitations of existing methods as well as to highlight the research gap in terms of open-end research problems which requires immediate attention.


2018 ◽  
Vol 7 (2.12) ◽  
pp. 394
Author(s):  
S Mahaboob Basha ◽  
M Kannan

Motion Estimation (ME) is one of the most intensive computational operations in video compression techniques. Video compression algo-rithm utilizes numerous standards such as MPEG1, MPEG4 AND H.261, H.264. Compression performance can be increased drastically by efficient motion estimation techniques by which energy is reduced within the residual frames involved in motion compensation. In this paper literature survey of motion estimation especially considering block matching ME (Motion Estimation). In this paper, comparison is made between the already existing block matching algorithms and their limitations in motion estimation along with their applications. Many algorithms including Three Step Search (TSS), Improved Three Step Search (ITSS), New Three Step Search (NTSS), Four Step Search (4SS), Diamond Search (DS), Flexible Triangle Search(FTS), Full Search(FS), Modified Full Search(MDF) are compared and their per-formance measures are discussed in this paper.  


Author(s):  
Mohammad Barr

Background: High-Efficiency Video Coding (HEVC) is a recent video compression standard. It provides better compression performance compared to its predecessor, H.264/AVC. However, the computational complexity of the HEVC encoder is much higher than that of H.264/AVC encoder. This makes HEVC less attractive to be used in real-time applications and in devices with limited resources (e.g., low memory, low processing power, etc.). The increased computational complexity of HEVC is partly due to its use of a variable size Transform Unit (TU) selection algorithm which successively performs transform operations using transform units of different sizes before selecting the optimal transform unit size. In this paper, a fast transform unit size selection method is proposed to reduce the computational complexity of an HEVC encoder. Methods: Bayesian decision theory is used to predict the size of the TU during encoding. This is done by exploiting the TU size decisions at a previous temporal level and by modeling the relationship between the TU size and the Rate-Distortion (RD) cost values. Results: Simulation results show that the proposed method achieves a reduction of the encoding time of the latest HEVC encoder by 16.21% on average without incurring any noticeable compromise on its compression efficiency. The algorithm also reduces the number of transform operations by 44.98% on average. Conclusion: In this paper, a novel fast TU size selection scheme for HEVC is proposed. The proposed technique outperforms both the latest HEVC reference software, HM 16.0, as well as other state-of-the-art techniques in terms of time-complexity. The compression performance of the proposed technique is comparable to that of HM 16.0.


2021 ◽  
Vol 45 (3) ◽  
pp. 405-417
Author(s):  
S. Madenda ◽  
A. Darmayantie

This paper describes the use of some color spaces in JPEG image compression algorithm and their impact in terms of image quality and compression ratio, and then proposes adaptive color space models (ACSM) to improve the performance of lossy image compression algorithm. The proposed ACSM consists of, dominant color analysis algorithm and YCoCg color space family. The YCoCg color space family is composed of three color spaces, which are YCcCr, YCpCg and YCyCb. The dominant colors analysis algorithm is developed which enables to automatically select one of the three color space models based on the suitability of the dominant colors contained in an image. The experimental results using sixty test images, which have varying colors, shapes and textures, show that the proposed adaptive color space model provides improved performance of 3 % to 10 % better than YCbCr, YDbDr, YCoCg and YCgCo-R color spaces family. In addition, the YCoCg color space family is a discrete transformation so its digital electronic implementation requires only two adders and two subtractors, both for forward and inverse conversions.


2007 ◽  
Vol 53 (4) ◽  
pp. 1687-1693 ◽  
Author(s):  
Dong-Hwan Kim ◽  
Hwa-Yong Oh ◽  
Ouzhan Urhan ◽  
Sarp Erturk ◽  
Tae-Gyu Chang

Sign in / Sign up

Export Citation Format

Share Document