AnimateLCM: Computation-Efficient Personalized Style Video Generation without Personalized Video Data


Abstract

This paper introduces an effective method for computation-efficient personalized style video generation without requiring access to any personalized video data. It reduces the necessary generation time of similarly sized video diffusion models from 25 seconds to around 1 second while maintaining the same level of performance. The method’s effectiveness lies in its dual-level decoupling learning approach: 1) separating the learning of video style from video generation acceleration, which allows for personalized style video generation without any personalized style video data, and 2) separating the acceleration of image generation from the acceleration of video motion generation, enhancing training efficiency and mitigating the negative effects of low-quality video data.

<ccs2012> <concept> <concept_id>10010147.10010178</concept_id> <concept_desc>Computing methodologies Artificial intelligence</concept_desc> <concept_significance>500</concept_significance> </concept> </ccs2012>

1 Introduction↩︎

Over the past few years, the field of video generation has made significant strides, thanks to the utilization of video diffusion models [1][3]. Currently, commonly applied video diffusion models can generate short video clips of about 2 seconds with relatively high-quality and reasonable motions. Nevertheless, those video generation models still have two significant shortcomings:

  1. Slow generation speed. The high-quality generation achieved by the diffusion model relies on the iterative denoising process that gradually transforms high-dimensional noises into real data. However, the nature of iterative sampling leads to slow generation and high computational burdens of the diffusion model whose generation is much slower than other generative models (e.g., GAN) [4], [5]. For example, even testing on a high-performance GPU A100, it still takes 25 seconds to generate a 2-second short video clips in 512p\(\times\)​512p.

  2. Inflexibility of generation style. In general, the quality of video data is inferior to that of image data, and accurately annotating video data with textual information is more challenging. Consequently, high-quality video data is difficult to obtain. Using low-quality video data typically results in suboptimal generation outcomes. Furthermore, users tend to prefer generating videos with higher quality and diverse styles, such as 2D animation, 3D animation, ink painting, etc. However, collecting high-quality videos in these styles is often very difficult.

Our approach effectively addresses the aforementioned issues without requiring complex steps. The core of our method lies in independently solving the problems of style learning and video generation acceleration, and then integrating them through weight fusion. By doing so, we only need to collect high-quality image data of specific styles for content learning, while utilizing lower-quality video datasets to learn motion characteristics and accelerate video generation. Additionally, it is worth noting that a video can essentially be regarded as a series of images over time, connected through motion relationships. Therefore, we further decouple the acceleration of video generation into two parts: the generation acceleration of images and the generation acceleration of video motion. Our experimental results demonstrate that this decoupled acceleration method significantly enhances training efficiency. We illustrates the high-level idea of our methods in Fig. 1.

Figure 1: High-level overview of the pipeline of AnimateLCM. 1) Fine-tune the base LDM on the high-quality personalized style image data for stylized image generation. 2) Accelerate the base LDM into LCM for fast image generation. 3) Accelerate and extend the LCM into video LCM for fast video generation. 4) Combine the weights of personalized LDM and video LCM into AnimateLCM for computation-efficient personalized style video generation without any personalized video data.

2 Related Works↩︎

Diffusion Models have gradually dominated the filed of image and video generation, though suffering from low generation speed. LCM-LoRA [6][9], working as a versatile acceleration module for image diffusion models, attracted huge attention. This work explores an versatile module, enabling the off-the-shell image diffusion models for computation-efficient personalized style video generation.

Figure 2: In the given denoising time budget, our model completes three high-quality generations, while video diffusion models are still in the process of denoising.

3 Method↩︎

Our model supports high-quality personalized style video generation without learning from any personalized video data. It also reduces the generation time by around 10–25 times compared to similarly sized diffusion models. Its effectiveness benefits from its dual-level decoupled learning strategy: 1) separating video style learning from generation acceleration, and 2) separating image generation acceleration and video motion generation acceleration.

3.1 Decoupling Style Learning and Acceleration↩︎

Fine-tuning base LDM on a personalized image dataset. The base LDM is trained on a vast amount of text-image pairs that have not been thoroughly filtered. It can accept text inputs and generate corresponding images. Due to issues such as data quality and model capacity, this base model often struggles to accurately generate images that match the style described by the text. Fortunately, this pretrained base model has a good capability for fine-tuning. Typically, individuals can collect a few hundred or more private data samples to re-fine-tune the model, transforming the base LDM into a personalized LDM that can generate high-quality images in a specified style. Generally, since personal users have limited training resources, such as GPUs, they often adopt parameter-efficient fine-tuning methods, with LoRA [10] being the most widely used. Specifically, the model’s weight update can be expressed as \(w = w_0 + A B\), where \(w_0 \in \mathbb{R}^{d \times k}\) is the original weight of the model, \(A \in \mathbb{R}^{d \times r}\), and \(B \in \mathbb{R}^{r \times k}\), with \(r \ll \min(d, k)\). We can denote the \(AB\) as \(\tau_{personalize}\), functioning as a specific weight residual for stylized generation.

AnimateLCM as a universal efficient video generation module. Our motivation is that the process of accelerating the model through consistency distillation can still be seen as a fine-tuning process of the pretrained model. Therefore, the distillation acceleration process of the base LDM can still be viewed as learning a weight residual for the base LDM. Specifically, \(w_{\text{accelerated}} = w_{0} + \tau_{\text{accelerated}}\), where \(w_{\text{accelerated}}, w_{0}, \tau_{\text{accelerated}} \in \mathbb{R}^{d\times k}\). In this way, we obtain two weight residuals, \(\tau_{\text{accelerated}}\) and \(\tau_{\text{personalized}}\). We can linearly combine these residuals with the original weights for joint functionality. In practice, we use scaling factors \(\alpha\) and \(\beta\) to control the influence of different weight residuals, combining them as \(w_{\text{combined}} = w_0 + \alpha \tau_{\text{accelerated}} + \beta \tau_{\text{personalized}}\). It’s important to note that since these residuals are directly integrated with the original weights, they do not affect the actual computation speed.

The decoupling learning approach eliminates the need for high-quality personalized style video data collection. Overall, in the process described above, the stylized weight parameters are fine-tuned using a high-quality image dataset, while the weight residuals for acceleration are trained on general images and lower-quality video datasets, since high-quality stylized videos are hard to obtain. This approach allows us to combine the advantages of both methods, thereby eliminating the need for high-quality stylized video collections.

3.2 Decoupling Image and Video Acceleration↩︎

Videos can generally be viewed as sequences of images over time, with motion relationships between temporally adjacent frames. With this in mind, our motivation is that the acceleration weight residual mentioned earlier can be decomposed into two parts: one for learning the acceleration residuals in image generation, and the other for video motion generation. On one hand, learning from image data is typically easier and less costly than learning from video data. That is, \[\begin{align} \tau_{accelerated} = \tau_{accelerated}^{image} + \tau_{accelerated}^{video} \, , \end{align}\] where \(\tau_{accelerated}^{image}\) aims to image generation acceleration while \(\tau_{accelerated}^{video}\) aims to video motion generation acceleration. On the other hand, the content of a video forms the basis for its motion; without clear spatial content, any temporal relationships become meaningless. Therefore, we propose first accelerating the base LDM for image generation to obtain the base LCM. From there, we extend the base LCM to accept video inputs and continue acceleration training on readily available low-quality video datasets. We found that this approach significantly speeds up the training process. In practice, we implement the \(v_{accelerated}^{image}\) as the LoRA and implement the \(v_{accelerated}^{video}\) as the motion module composed of temporal attention blocks.

Thereby, the final weight is written as \[\begin{align} w' = w_0 + \alpha \tau_{personalized} + \beta \tau_{accelerated}^{image} + \gamma \tau_{accelerated}^{video}\, , \end{align}\] where \(\alpha, \beta, \gamma\) are all scaling factor. In practice, we find we generally have to set \(\gamma = 1\) considering that the it is the only weight enables the video generation ability of base LDM. For \(\alpha\) and \(\beta\), users can scaling them to control the impact of different weight residuals.

4 Experiments↩︎

4.1 Benchmarks.↩︎

To evaluate our approach, we follow previous works, utilizing the widely used UCF-101 [11] for validation. For each category, we generate \(24\) videos with 16 frames in resolution \(512 \times 512\) and thus generate \(24 \times 101\) videos in total. We apply FVD [12] and CLIPSIM [13] as the validation metric. For CLIPSIM, we rely on the CLIP ViT-H/14 LAION-2B [14] to compute the mean value of the similarities of the brief caption and all the frames in the video. Following the validation choice in LCM [7], we compare AnimateLCM with the teacher model using the DDIM [15] and DPM-Solver++ [16].

4.2 Experimental Results↩︎

Figure 3: Qualitative comparison under different number of inference steps (NFE).

Qualitative results. Fig. 4 demonstrates the 4-step generation results of our method in text-conditioned video generation with different personalized style models including styles of realistic, 2D anime, and 3D anime, image-conditioned video generation, and layout-conditioned video generation. We also demonstrate the generation results under different numbers of function evaluation (NFEs) in Fig. 3. We demonstrate good visual quality with only 2 inference steps. As the NFE increases, the generation quality increases accordingly, achieving competitive performance with the teacher model with 25 steps.

Figure 4: 4-step generation results. AnimateLCM supports text-to-video, image-to-video, and controllable video generation.
Table 1: Zero-shot video generation comparision on UCF-101.
Methods FVD \(\downarrow\) CLIPSIM \(\uparrow\)
1-Step 2-Step 4-Step 8-Step 1-Step 2-Step 4-Step 8-Step
DDIM [15] 4940.83 3218.74 1944.82 1209.88 4.43 5.26 14.87 24.38
DPM++ [16] 2731.37 2093.47 1043.82 932.43 10.48 18.04 26.82 29.50
Ours 1256.50 1081.26 925.71 910.34 22.16 25.99 28.89 30.03
Ours-R 1071.50 790.99 929.79 1081.72 25.41 29.39 30.62 30.71

 

Quantitative Comparison. Table  1 illustrates quantitative metrics comparison for AnimateLCM and strong baseline methods DDIM [15], and DPM++ [16]. AnimateLCM significantly surpasses the baseline methods, especially in the low step regime (1\(\sim\)​4). Additionally, all these metrics of AnimateLCM are evaluated without requiring classifier-free guidance (CFG) [17] instead of 7.5 CFG strength applied for other baselines, thus saving half of the inference peak memory cost and inference time. Additionally, we show Ours-R, which we replace the LDM weights with new weights finetuned on the high-quality personalized image datasets, can achieve even superior performance. It further indicates the effectiveness of our decouple learning approach.

Advanced quantitative comparison. For a more comprehensive evaluating of the ability of AnimateLCM, we apply Vbench [18] for a more advanced metric comparision, which including measurements from dozens of perspectives. We can observe from the Table. 2 that, our model as the only video generation support fast generation (typically at lease 5 times faster than all compared methods), still achieves very competitive totoal score.

Table 2: Advanced evaluation with Vbench.
Model Name Fast Total Score Quality Score Semantic Score
Pika-1.0 (2024-06) N/A 80.69% 82.92% 71.77%
Gen-2 (2023-12) N/A 80.58% 82.47% 73.03%
VideoCrafter-1.0 [19] \(\times\) 79.72% 81.59% 72.22%
AnimateLCM (Ours) \(✔\) 79.42% 82.36% 67.65%
OpenSora V1.2 \(\times\) 79.23% 80.71% 73.30%
Show-1 [20] \(\times\) 78.93% 80.42% 72.98%
OpenSoraPlan V1.1 \(\times\) 77.99% 80.90% 66.38%
AnimateDiff-V1 [21] \(\times\) 77.46% 80.24% 66.32%
Latte-1 [22] \(\times\) 77.29% 79.72% 67.58%
Open-Sora [23] \(\times\) 75.91% 78.82% 64.28%

Effectiveness of decoupled consistency learning. We validate the effectiveness of our proposed decoupled distillation strategy. For a fair comparison of convergence speed, we train the spatial LoRA weights for 4 hours on an 8 A100 GPUs. We then train our strategy on the video dataset for an additional 4 hours. We train the baseline without decoupled distillation for 8 hours. Our strategy achieves FVD 985.9 and CLIPSIM 27.7 within the training budget while the baseline without the decoupled distillation strategy achieves FVD 1060.6 and CLIPSIM 18.8.

Inference time comparision. Diffusion models require 50 steps with proper CFG values for high-quality generation (50 \(\times\) 2 model evaluations). Our model can generate videos in 4 steps without CFG (4 model evaluations). Theoretically, our model can achieve acceleration by \(\frac{50 \times 2}{4} = 25\) times. Testing on a single A800 with fp16 mixed precision, our model generates 2-second videos in 963ms, whereas normal diffusion models take 23564ms (24.47 times slower). Note that for the time computation, we exclude the VAE decoding time since it does not belong to the denoising process.

Denoising process visualization. In Fig. 2, we visualize the denoising process of our model as well as that of a conventional video model. Within the same time frame, our model has generated three high-quality videos, while the compared video diffusion model has yet to complete the denoising of a single video.

5 Conclusions and Limitations↩︎

We present AnimateLCM, achieving computation-efficient personalized style video generation without personalized video data. Its decoupling strategies from two perspectives allows us to achieve fast stylized video generation with smaller training budget and alleviating the need to collect high-quality stylized video data. It might fail to generate samples with good quality with very low steps (e.g., one-step) though.

This project is funded in part by National Key R&D Program of China Project 2022ZD0161100, by the Centre for Perceptual and Interactive Intelligence (CPII) Ltd under the Innovation and Technology Commission (ITC)’s InnoHK, by General Research Fund of Hong Kong RGC Project 14204021. Hongsheng Li is a PI of CPII under the InnoHK.

References↩︎

[1]
Jonathan Ho, Tim Salimans, Alexey Gritsenko, William Chan, Mohammad Norouzi, and David J Fleet.2022. . arXiv:2204.03458(2022).
[2]
Uriel Singer, Adam Polyak, Thomas Hayes, Xi Yin, Jie An, Songyang Zhang, Qiyuan Hu, Harry Yang, Oron Ashual, Oran Gafni, et al2022. . arXiv preprint arXiv:2209.14792(2022).
[3]
Xiaoyu Shi, Zhaoyang Huang, Fu-Yun Wang, Weikang Bian, Dasong Li, Yi Zhang, Manyuan Zhang, Ka Chun Cheung, Simon See, Hongwei Qin, et al2024. . In ACM SIGGRAPH 2024 Conference Papers. 1–11.
[4]
Lijun Yu, Yong Cheng, Kihyuk Sohn, José Lezama, Han Zhang, Huiwen Chang, Alexander G Hauptmann, Ming-Hsuan Yang, Yuan Hao, Irfan Essa, et al2023. . In CVPR. 10459–10469.
[5]
Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio.2014. . NeurIPS(2014).
[6]
Yang Song, Prafulla Dhariwal, Mark Chen, and Ilya Sutskever.2023. . arXiv preprint arXiv:2303.01469(2023).
[7]
Simian Luo, Yiqin Tan, Longbo Huang, Jian Li, and Hang Zhao.2023. . arXiv preprint arXiv:2310.04378(2023).
[8]
Fu-Yun Wang, Zhaoyang Huang, Alexander William Bergman, Dazhong Shen, Peng Gao, Michael Lingelbach, Keqiang Sun, Weikang Bian, Guanglu Song, Yu Liu, et al2024. . arXiv preprint arXiv:2405.18407(2024).
[9]
Zhengyang Geng, Ashwini Pokle, William Luo, Justin Lin, and J Zico Kolter.2024. . arXiv preprint arXiv:2406.14548(2024).
[10]
Edward J Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen.2021. . arXiv preprint arXiv:2106.09685(2021).
[11]
Khurram Soomro, Amir Roshan Zamir, and Mubarak Shah.2012. . arXiv preprint arXiv:1212.0402(2012).
[12]
Thomas Unterthiner, Sjoerd Van Steenkiste, Karol Kurach, Raphael Marinier, Marcin Michalski, and Sylvain Gelly.2018. . arXiv preprint arXiv:1812.01717(2018).
[13]
Jack Hessel, Ari Holtzman, Maxwell Forbes, Ronan Le Bras, and Yejin Choi.2021. . arXiv preprint arXiv:2104.08718(2021).
[14]
Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, et al2021. . In ICML. PMLR, 8748–8763.
[15]
Jiaming Song, Chenlin Meng, and Stefano Ermon.2020. . arXiv preprint arXiv:2010.02502(2020).
[16]
Cheng Lu, Yuhao Zhou, Fan Bao, Jianfei Chen, Chongxuan Li, and Jun Zhu.2022. . Advances in Neural Information Processing Systems35(2022), 5775–5787.
[17]
Jonathan Ho Tim Salimans.2022. . arXiv preprint arXiv:2207.12598(2022).
[18]
Ziqi Huang, Yinan He, Jiashuo Yu, Fan Zhang, Chenyang Si, Yuming Jiang, Yuanhan Zhang, Tianxing Wu, Qingyang Jin, Nattapol Chanpaisit, et al2024. . In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 21807–21818.
[19]
Yingqing He, Tianyu Yang, Yong Zhang, Ying Shan, and Qifeng Chen.2022. . arXiv preprint arXiv:2211.13221(2022).
[20]
David Junhao Zhang, Jay Zhangjie Wu, Jia-Wei Liu, Rui Zhao, Lingmin Ran, Yuchao Gu, Difei Gao, and Mike Zheng Shou.2023. . arXiv preprint arXiv:2309.15818(2023).
[21]
Yuwei Guo, Ceyuan Yang, Anyi Rao, Yaohui Wang, Yu Qiao, Dahua Lin, and Bo Dai.2023. . arXiv preprint arXiv:2307.04725(2023).
[22]
Xin Ma, Yaohui Wang, Gengyun Jia, Xinyuan Chen, Ziwei Liu, Yuan-Fang Li, Cunjian Chen, and Yu Qiao.2024. . arXiv preprint arXiv:2401.03048(2024).
[23]
Zangwei Zheng, Xiangyu Peng, Tianji Yang, Chenhui Shen, Shenggui Li, Hongxin Liu, Yukun Zhou, Tianyi Li, and Yang You.2024. Open-Sora: Democratizing Efficient Video Production for All. ://github.com/hpcaitech/Open-Sora.