scholarly journals The Improved Algorithm of Sample Adaptive Offset Based on Visual Saliency

2020 ◽  
Author(s):  
Nana Shan ◽  
Wei Zhou ◽  
Zhemin Duan
Keyword(s):  
Computational Complexity ◽  
Video Coding ◽  
Visual Saliency ◽  
Saliency Map ◽  
Experimental Result ◽  
Cost Calculation ◽  
Performance Loss ◽  
High Efficient ◽  
Efficient Video

Sample Adaptive Offset (SAO) in High Efficient Video Coding (HEVC) is a new technic to improve the quality of videos. It categories the pixels and choices the best way by adding some offsets to the reconstructed video. So, it causes a dramatically increased computational complexity. According to the dependency of sample adaptive offset and visual saliency map, an improved SAO method is proposed in order to minimize the coding time of SAO by skipping some RD cost calculation. Experimental result shows that the proposed method reduces 27.02% SAO encoding time with negligible performance loss.

scholarly journals Blotch Detection in Archive Films Based on Visual Saliency Map

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Yildiz Aydin ◽  
Bekir Dizdaroğlu
Keyword(s):  
Computational Complexity ◽  
Cultural Heritage ◽  
False Alarm ◽  
Detection Method ◽  
Visual Saliency ◽  
Saliency Map ◽  
Saliency Maps ◽  
Block Based ◽  
The Given ◽  
Blotch Detection

Degradations frequently occur in archive films that symbolize the historical and cultural heritage of a nation. In this study, the problem of detection blotches commonly encountered in archive films is handled. Here, a block-based blotch detection method is proposed based on a visual saliency map. The visual saliency map reveals prominent areas in an input frame and thus enables more accurate results in the blotch detection. A simple and effective visual saliency map method is taken into consideration in order to reduce computational complexity for the detection phase. After the visual saliency maps of the given frames are obtained, blotch regions are estimated by considered spatiotemporal patches—without the requirement for motion estimation—around the saliency pixels, which are subjected to a prethresholding process. Experimental results show that the proposed block-based blotch detection method provides a significant advantage with reducing false alarm rates over HOG feature (Yous and Serir, 2017), LBP feature (Yous and Serir, 2017), and regions-matching (Yous and Serir, 2016) methods presented in recent years.

scholarly journals Improved entropy encoding for high efficient video coding standard

2018 ◽  
Vol 57 (1) ◽  
pp. 1-9 ◽  
Author(s):  
B.S. Sunil Kumar ◽  
A.S. Manjunath ◽  
S. Christopher
Keyword(s):  
Video Coding ◽  
High Efficient ◽  
Entropy Encoding ◽  
Efficient Video

scholarly journals CU Splitting on Frame Boundary for Arbitrary Resolution Video in HEVC

2011 ◽  
Vol 1 ◽  
pp. 116-120
Author(s):  
Wei Li ◽  
Fu Zheng Yang ◽  
Shu Ai Wan ◽  
Guang Liang Ren
Keyword(s):  
Video Coding ◽  
Splitting Method ◽  
Video Content ◽  
Integral Multiple ◽  
Coding Efficiency ◽  
High Efficient ◽  
Simulation Results ◽  
Coding Unit ◽  
Efficient Video ◽  
Candidate Set

A highly flexible quadtree structure has been introduced in the latest high efficient video coding (HEVC) to efficiently represent video content. However, the performance of the quadtre structure would be impaired when the video resolution is not an integral multiply of the largest coding unit (CU). To address this, a new CU splitting method on the frame boundary for arbitrary resolution video is proposed to improve the coding efficiency of HEVC. This method introduces the non-square CU to extend the CU candidate set on the frame boundary when the video resolution is not an integral multiple of the largest CU size. Simulation results show that the proposed method can reduce the coding bit rate by up to 0.76% compared with the original TMuC 0.9 reference software.

Sign in / Sign up

Export Citation Format

Share Document