当前位置:网站首页>FFmpeg命令(六)、 视频提取无音视频
FFmpeg命令(六)、 视频提取无音视频
2022-04-22 06:19:00 【许三多2020】
提取为无音视频
ffmpeg -i input.mp4 -vcodec copy -an out.mp4
//-i 输入 input.mp4本地视频
//vcodec:指定视频编码器,copy指明只拷贝,不做编解码
//an:a代表音频,n代表no an就是无音频的意思
//out.mp4 生成的文件,在当前目录下
版权声明
本文为[许三多2020]所创,转载请带上原文链接,感谢
https://blog.csdn.net/Gary__123456/article/details/112306251
边栏推荐
- Codeforces Round #623
- Codeforces Round #780 (Div. 3)
- Cache hit rate of sequential table
- Abstract classes and abstract methods
- L2-002 链表去重(测试点1的坑)
- L2-005 集合相似度(set判重)
- B. Ball dropping (simple geometric calculation / similar triangle) (2021 Niuke summer multi school training camp 1)
- L2-001 紧急救援 (最短路Dijkstra的扩展 - 最短路径数&路径最大权值)
- C language | pointer
- blog同步更新通知
猜你喜欢

LeetCode - 8 - (三数之和、Z字形变换、两数之和<链表>、盛最多水的容器、电话号码的字母组合)

1005 monopoly congruence solution (2021 Chinese college student programming competition CCPC network trial replay)

L2-002 链表去重(测试点1的坑)

F. Find 3-friendly integers (2021 Niuke summer multi school training camp 1)

Quick sort and merge sort

并发编程的艺术(2):Synchronized的使用场景

363 · rainwater connection

1. Jam packed (Game 5 of 2021 training League warm-up training competition)

This关键字详细概述

抽象类和抽象方法
随机推荐
Bom 浏览器对象模型
Redis Advanced
下面这段SQL能否用索引优化查询性能
1005 Monopoly 同余求解(2021中国大学生程序设计竞赛CCPC-网络选拔赛重赛)
278 · 绘制填充
Introduction
Leetcode - 3 - (string addition, maximum number of consecutive 1 < Ⅰ Ⅲ >, maximum difficulty of the exam, deletion of the penultimate node of the linked list)
Could not resolve com.nbsp:library:1.8如何解决
843 · 数字翻转
Educational Codeforces Round 122 (Rated for Div. 2)
Educational Codeforces Round 122 (Rated for Div. 2)
Kotlin协程+Flow+Retrofit实现网络请求
F. Find 3-friendly Integers (特殊数字 / 找规律) (2021牛客暑期多校训练营1)
Codeforces Round #776 (Div. 3)
Internal class instructions (static, instance, local)
抽象类和抽象方法
F. Find 3-friendly integers (2021 Niuke summer multi school training camp 1)
Installation and configuration of Yapi (Reprint)
L1-071 previous life files (20 points) (similar two points)
Leetcode - 7 - (nearest common ancestor of binary tree, rotation array, direct of binary tree, next permutation, combined sum)