
Recherche avancée
Médias (10)
-
Demon Seed
26 septembre 2011, par
Mis à jour : Septembre 2011
Langue : English
Type : Audio
-
Demon seed (wav version)
26 septembre 2011, par
Mis à jour : Avril 2013
Langue : English
Type : Audio
-
The four of us are dying (wav version)
26 septembre 2011, par
Mis à jour : Avril 2013
Langue : English
Type : Audio
-
Corona radiata (wav version)
26 septembre 2011, par
Mis à jour : Avril 2013
Langue : English
Type : Audio
-
Lights in the sky (wav version)
26 septembre 2011, par
Mis à jour : Avril 2013
Langue : English
Type : Audio
-
Head down (wav version)
26 septembre 2011, par
Mis à jour : Avril 2013
Langue : English
Type : Audio
Autres articles (31)
-
ANNEXE : Les plugins utilisés spécifiquement pour la ferme
5 mars 2010, parLe site central/maître de la ferme a besoin d’utiliser plusieurs plugins supplémentaires vis à vis des canaux pour son bon fonctionnement. le plugin Gestion de la mutualisation ; le plugin inscription3 pour gérer les inscriptions et les demandes de création d’instance de mutualisation dès l’inscription des utilisateurs ; le plugin verifier qui fournit une API de vérification des champs (utilisé par inscription3) ; le plugin champs extras v2 nécessité par inscription3 (...)
-
Encoding and processing into web-friendly formats
13 avril 2011, parMediaSPIP automatically converts uploaded files to internet-compatible formats.
Video files are encoded in MP4, Ogv and WebM (supported by HTML5) and MP4 (supported by Flash).
Audio files are encoded in MP3 and Ogg (supported by HTML5) and MP3 (supported by Flash).
Where possible, text is analyzed in order to retrieve the data needed for search engine detection, and then exported as a series of image files.
All uploaded files are stored online in their original format, so you can (...) -
L’utiliser, en parler, le critiquer
10 avril 2011La première attitude à adopter est d’en parler, soit directement avec les personnes impliquées dans son développement, soit autour de vous pour convaincre de nouvelles personnes à l’utiliser.
Plus la communauté sera nombreuse et plus les évolutions seront rapides ...
Une liste de discussion est disponible pour tout échange entre utilisateurs.
Sur d’autres sites (5624)
-
Understanding the VP8 Token Tree
7 juin 2010, par Multimedia Mike — VP8I got tripped up on another part of the VP8 decoding process today. So I drew a picture to help myself understand it. Then I went back and read David Conrad’s comment on my last post regarding my difficulty understanding the VP8 spec and saw that he ran into the same problem. Since we both experienced the same hindrance in trying to sort out this matter, I thought I may as well publish the picture I drew.
VP8 defines various trees for decoding different syntax elements. There is one tree for decoding the tokens and it is expressed in the VP8 spec as such :
C :-
const tree_index coef_tree [2 * (num_dct_tokens - 1)] =
-
{
-
-dct_eob, 2, /* eob = "0" */
-
-DCT_0, 4, /* 0 = "10" */
-
-DCT_1, 6, /* 1 = "110" */
-
8, 12,
-
-DCT_2, 10, /* 2 = "11100" */
-
-DCT_3, -DCT_4, /* 3 = "111010", 4 = "111011" */
-
14, 16,
-
-dct_cat1, -dct_cat2, /* cat1 = "111100", cat2 = "111101" */
-
18, 20,
-
-dct_cat3, -dct_cat4, /* cat3 = "1111100", cat4 = "1111101" */
-
-dct_cat5, -dct_cat6 /* cat4 = "1111110", cat4 = "1111111" */
-
} ;
Here is what the table looks like when you make a tree out of it (click for full size image) :
The catch is that it makes no sense for an end-of-block (EOB) token to follow a 0 token since EOB already indicates that the remainder of the coefficients should be 0 anyway. Thus, the spec states that, "decoding of certain DCT coefficients may skip the first branch, whose preceding coefficient is a DCT_0." I confess, I didn’t understand what "skip the first branch" meant until I drew the tree.
For those wondering why it might be sub-optimal (clarity-wise) for a spec to simply regurgitate vast chunks of C code, this makes a decent case. As you can see, the spec makes certain assumptions about how a binary tree should be organized in a static array (node n points to elements n*2 and n*2+1 as its branches ; leaves are either negative or 0). This is the second method I have seen ; another piece of code (not the VP8 spec) had the nodes in the first half of the array and pointed to leaves in the second half. There must be other arrangements.
-
-
Use Google Fonts In ffmpeg fontfile
9 mars 2020, par Randy ThomasI am wanting to use Google Fonts in my ffmpeg video creations for text. Here is what I have and it’s not working at all.
$font = "//fonts.googleapis.com/css?family=Aclonica";
$cmd .= "drawtext=enable='between(t,".$fi.",".$li.")':fontfile=".$font.":fontsize=".$fontsize.":fontcolor=".$color.":x=(w-text_w)/2:y=(h/2)+".$n.":text='".$arr[$j]."',";Of course, this works with .ttf fonts but I really want to use Google Fonts.
I have also tried
$font = "https://fonts.googleapis.com/css?family=Aclonica"
that does not work either.I have a feeling that ffmpeg does not use woff2 fonts but I have seen a site that does this I just can’t say 100% for sure that they use Google Fonts in the creation, but they do use them in the selection of the font which leads me to believe they use them in the creation of the video.
-
ffmpeg, live MPEG-TS demux & decode
8 mai 2017, par NadavRubEnvironment
- Ubuntu-14
- C++
- ffmpeg
Use-case
- Live SPTS is received via UDP by a 3rd party module
- TS Packets are received iteratively
- The TS Video (ES) should be decoded in minimal latency
Considered Implementation
- Upon TS packet reception, immediately push it to the TS demux
- Once enough packets are received the video format is resolvable, create the video codec
- Push each video packet into the video decoder
- Once enough video packets were processed the video codec result a valid output frame
Problem at-hand
Can this be done w/ ffmpeg ?!?!, … using “avformat_open_input” mandate a file to read from… I need a way where I can iteratively push packets to the TS demuxer ( w/ minimal latency )…
Does ffmpeg support the above mentioned use-case ? How ?