KO
|
EN
gitlite — search
Search
#typescript
#ai-agents
#deepseek-harness
#dsh-plugin
#open-source
#ai
#cli
#dsh
#claude-code
#codex
#developer-tools
#react
M-LVC_CVPR2020
★ 83
Open GitHub ↗
No description available.
Download README (.md)
Explore Similar Repositories
dbt-sqlite
:
A SQLite adapter plugin for dbt (data build tool)
redoc
:
Redoc with multiple urls - https://hub.docker.com/r/volbrene/redoc
java-spring-template
:
Java Spring template for the AsyncAPI Generator
FSharp.CosmosDb
:
An F# wrapper around Cosmos DB's .NET SDK to make it more friendly for F# developers
StructPacker
:
Low-level, lightweight and performance-focused serializer for C# struct types that uses Source Generators technology.
// repository documentation
Was this content helpful?
★ 0
(0 ratings)
Select Rating:
★
★
★
★
★
Submit Feedback
Recent Feedback
×
Download README
Do you want to download the
README.md
file for
M-LVC_CVPR2020
?
Download (.md)
# M-LVC: Multiple Frames Prediction for Learned Video Compression The project page for the paper: Jianping Lin, Dong Liu, Houqiang Li, Feng Wu, “M-LVC: Multiple Frames Prediction for Learned Video Compression”. in IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2020. [[OpenAccess](https://openaccess.thecvf.com/content_CVPR_2020/html/Lin_M-LVC_Multiple_Frames_Prediction_for_Learned_Video_Compression_CVPR_2020_paper.html)][[arXiv](https://arxiv.org/abs/2004.10290)] If our paper and codes are useful for your research, please cite: ``` @inproceedings{lin2020m, title={M-LVC: Multiple Frames Prediction for Learned Video Compression}, author={Lin, Jianping and Liu, Dong and Li, Houqiang and Wu, Feng}, booktitle={Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition}, pages={3546--3554}, year={2020} } ``` If you have any question or find any bug, please feel free to contact: Jianping Lin @ University of Science and Technology of China (USTC) Email: ljp105@mail.ustc.edu.cn ## Introduction  We propose an end-to-end learned video compression scheme for low-latency scenarios. Previous methods are limited in using the previous one frame as reference. Our method introduces the usage of the previous multiple frames as references. In our scheme, the motion vector (MV) field is calculated between the current frame and the previous one. With multiple reference frames and associated multiple MV fields, our designed network can generate more accurate prediction of the current frame, yielding less residual. Multiple reference frames also help generate MV prediction, which reduces the coding cost of MV field. We use two deep auto-encoders to compress the residual and the MV, respectively. To compensate for the compression error of the auto-encoders, we further design a MV refinement network and a residual refinement network, taking use of the multiple reference frames as well. All the modules in our scheme are jointly optimized through a single rate-distortion loss function. We use a step-by-step training strategy to optimize the entire scheme. Experimental results show that the proposed method outperforms the existing learned video compression methods for low-latency mode. Our method also performs better than H.265 in both PSNR and MS-SSIM. Our code and models are publicly available. ## Codes The currently available code is for evaluation, while it can also be modified for training as the implementation of the network is available. ### Dependency - tensorflow-gpu >=1.13.1 (the code only can be run in GPU mode) - opencv-python, matplotlib, scipy, pillow - Pre-trained models ([Download link](https://drive.google.com/file/d/1DaYh6_WTmrp0RoTfEPZSjZUujr4rGhqx/view?usp=sharing)) - BPG ([Download link](https://bellard.org/bpg/)) (*In our code, we use BPG to compress I-frames instead of training learned image compression models. Here, we upload the executable files of BPG for windows.*) ### Compressing video sequences Since our code currently only supports the sequences with the height and width as the multiples of 64, we first use ffmpeg to resize the original sequences to the multiples of 64, e.g., ``` ffmpeg -pix_fmt yuv420p -s 1920x1080 -i input_video.yuv -vf scale="1920:1024" output_video.yuv ``` Our resized sequences of JCT-VC Class C dataset can be downloaded from ([link](https://drive.google.com/file/d/1gFNscYeZ3C-ZZj1T9IsWOtXBT3qtue4-/view?usp=sharing)). You can use the following command to compress any class of the UVG and JCT-VC datasets: ``` python test.py --command compress --test_seq_dir directory_containing_testSequence --test_class ClassC --exp_data_dir ./exp_data_dir -r path_to_model/model_name.ckpt --lambda 16 ``` ``` --test_class, the video class to be compressed (e.g., ClassB, ClassC, ClassD, ClassE, ClassUVG) --lambda, the lambda value of used trained model (i.e., 16, 24, 40, 64) ``` ### Entropy coding Currently, we do not provide the entropy coding module. We give the estimated Bpp for the quantized latent representations. It is straightforward to compress them by using traditional entropy coding tools, such as Range Coder. ### Experimental Results We test the proposed method on the JCT-VC (Classes B, C, D and E) and the [UVG](http://ultravideo.cs.tut.fi/#testsequences) datasets. Note that, the [UVG](http://ultravideo.cs.tut.fi/#testsequences) dataset has been enlarged recently. To compare with previous approaches, we only test on the original 7 videos in UVG, i.e., *Beauty*, *Bosphorus*, *HoneyBee*, *Jockey*, *ReadySetGo*, *ShakeNDry* and *YachtRide*. The detailed results (bpp, PSNR and MS-SSIM values) on each video dataset are shown in [data.txt](/RD_Results). The RD curves of our method compared with [Lu *et al.*, DVC](http://openaccess.thecvf.com/content_CVPR_2019/papers/Lu_DVC_An_End-To-End_Deep_Video_Compression_Framework_CVPR_2019_paper.pdf) and x264/x265 with *LDP very fast* mode are shown by the figures in /RD_Results folder. Same as DVC, for each video sequence, we got the average PSNR by averaging the PSNRs from all frames. For each dataset, like ClassB, we average the PSNR from different video sequences. Note that, the overall RD results here are slightly better than the results in our paper, as we set more appropriate quantization parameters of BPG to compress I-frames.