Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method of reducing stereo video depth map coding complexity

A technology for depth map coding and stereoscopic video, applied in the field of video coding, can solve the problem of high computational complexity, save system cache, reduce computational complexity, and save total coding time.

Active Publication Date: 2018-01-16
HUAZHONG UNIV OF SCI & TECH
View PDF4 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0011] In view of the above defects or improvement needs of the prior art, the present invention provides a method for reducing the coding complexity of stereoscopic video depth maps, thereby solving the technical problem of high computational complexity existing in the current stereoscopic video depth map coding process

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method of reducing stereo video depth map coding complexity
  • Method of reducing stereo video depth map coding complexity
  • Method of reducing stereo video depth map coding complexity

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0032]In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not constitute a conflict with each other.

[0033] The present invention uses K-means to divide the current PU block pixels into two categories, generates K-means clustering templates, and then uses the generated K-means clustering templates to match the templates in the wedgelet template list to find the best wedgelet segmentation template to complete Specifically encoding the sharp edge blocks of the depth map effectively reduces the com...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The present invention discloses a method of reducing stereo video depth map coding complexity. The method is mainly used to reduce the coding complexity of a depth map edge in the 3D-HEVC, and comprises the steps of using a K-means clustering method to divide the inputted depth map PU block pixels into two categories having obvious difference, and generating a K-means clustering template; calculating the similarity matching degree of the K-means clustering template and the wedge segmentation templates generated at the coding initialization, and recording the optimal similarity matching degreeand an index value of the wedge segmentation template corresponding to the optimal similarity matching degree; according to the optimal similarity matching degree, determining a search radius for searching the optimal wedge segmentation template, calculating the rate distortion of all wedge segmentation templates within the search radius, and finding the optimal wedge segmentation template havingthe smallest rate distortion. The method of the present invention abandons a search mode that needs to store the wedge nodes at a coding / decoding end in advance, saves the system cache, enables the calculation complexity of a DMMI mode to be reduced, and saves 7.1% of the total coding time averagely while guaranteeing the coding quality.

Description

technical field [0001] The present invention belongs to the technical field of video coding based on 3D-HEVC, and more specifically relates to a method for reducing the coding complexity of a stereoscopic video depth map in the depth video coding technology in 3D-HEVC. Background technique [0002] In recent years, following the great achievements of the 3D film industry, 3D stereoscopic video has received more and more attention from academia and industry, and has been widely used in practice. For example, the live video developed by HHI (Heinrich Hertz Institute) Meetings, 3D movies and Microsoft's 3D games (XBOX), etc. In principle, the perception of a 3D scene is achieved by simultaneously presenting different videos to the left and right eyes of the audience. The Joint CollaborativeTeam of 3D Video Coding Extensions (JCT-3V) is developing a new 3D video coding standard called 3D-HEVC. 3D-HEVC adopts the 3D video format of multi-view video plus depth (MVD), and each vi...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04N19/147H04N19/176H04N19/597
Inventor 喻莉黎天送王晟伟王鸿奎
Owner HUAZHONG UNIV OF SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com