Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > eess > arXiv:1911.09857

Help | Advanced Search

Electrical Engineering and Systems Science > Image and Video Processing

arXiv:1911.09857 (eess)
[Submitted on 22 Nov 2019 ]

Title: Dual Learning-based Video Coding with Inception Dense Blocks

Title: 基于双学习的视频编码与Inception密集块

Authors:Chao Liu, Heming Sun, Junan Chen, Zhengxue Cheng, Masaru Takeuchi, Jiro Katto, Xiaoyang Zeng, Yibo Fan
Abstract: In this paper, a dual learning-based method in intra coding is introduced for PCS Grand Challenge. This method is mainly composed of two parts: intra prediction and reconstruction filtering. They use different network structures, the neural network-based intra prediction uses the full-connected network to predict the block while the neural network-based reconstruction filtering utilizes the convolutional networks. Different with the previous filtering works, we use a network with more powerful feature extraction capabilities in our reconstruction filtering network. And the filtering unit is the block-level so as to achieve a more accurate filtering compensation. To our best knowledge, among all the learning-based methods, this is the first attempt to combine two different networks in one application, and we achieve the state-of-the-art performance for AI configuration on the HEVC Test sequences. The experimental result shows that our method leads to significant BD-rate saving for provided 8 sequences compared to HM-16.20 baseline (average 10.24% and 3.57% bitrate reductions for all-intra and random-access coding, respectively). For HEVC test sequences, our model also achieved a 9.70% BD-rate saving compared to HM-16.20 baseline for all-intra configuration.
Abstract: 在本文中,引入了一种基于双学习的内部编码方法用于PCS大挑战。 该方法主要由两部分组成:内部预测和重建滤波。 它们使用不同的网络结构,基于神经网络的内部预测使用全连接网络来预测块,而基于神经网络的重建滤波则利用卷积网络。 不同于之前的滤波工作,我们在重建滤波网络中使用了一个具有更强特征提取能力的网络。 并且滤波单元是块级别的,以实现更精确的滤波补偿。 据我们所知,在所有基于学习的方法中,这是首次在一个应用中结合两种不同的网络,我们在HEVC测试序列上实现了AI配置的最先进性能。 实验结果表明,与HM-16.20基线相比,我们的方法在提供的8个序列中显著降低了BD率(平均所有帧内编码减少了10.24%,随机访问编码减少了3.57%)。 对于HEVC测试序列,我们的模型在所有帧内配置中也比HM-16.20基线提高了9.70%的BD率节省。
Subjects: Image and Video Processing (eess.IV) ; Machine Learning (cs.LG); Multimedia (cs.MM)
Cite as: arXiv:1911.09857 [eess.IV]
  (or arXiv:1911.09857v1 [eess.IV] for this version)
  https://doi.org/10.48550/arXiv.1911.09857
arXiv-issued DOI via DataCite

Submission history

From: Chao Liu [view email]
[v1] Fri, 22 Nov 2019 04:57:44 UTC (1,746 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
eess.IV
< prev   |   next >
new | recent | 2019-11
Change to browse by:
cs
cs.LG
cs.MM
eess

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号