{"id":3801,"date":"2012-04-25T23:27:52","date_gmt":"2012-04-26T06:27:52","guid":{"rendered":"http:\/\/multimedia.cx\/eggs\/?p=3801"},"modified":"2012-04-25T23:27:52","modified_gmt":"2012-04-26T06:27:52","slug":"gsoc-2012-multimedia","status":"publish","type":"post","link":"https:\/\/multimedia.cx\/eggs\/gsoc-2012-multimedia\/","title":{"rendered":"Libav\/FFmpeg and Google Summer of Code 2012"},"content":{"rendered":"

So, the projects<\/em> are participating in the Google Summer of Code for the 2012<\/a> season. (While Libav is the project officially accepted to particular, I still refer to the projects<\/em> because FFmpeg will also benefit).<\/p>\n

Here are the students, projects, and mentors for this summer:<\/p>\n

    \n
  1. Andrew D’Addesio is working on an Opus Decoder<\/a>, mentored by Justin Ruggles<\/li>\n
  2. Guillaume Martres is working on an HEVC video decoder<\/a>, mentored by Mashiat Sarker Shakkhar<\/li>\n
  3. Jan Ekstr\u00f6m is working on an LGPL Ut Video encoder<\/a>, mentored by Kostya Shishkov<\/li>\n
  4. Jordi Ortiz is working to rewrite avserver<\/a>, mentored by Luca Barbato<\/li>\n
  5. Samuel Pitoiset is working on an RTMP[E|S|T|TE] protocol implementation<\/a>, mentored by Martin Storsj\u00f6<\/li>\n<\/ol>\n

    Wish them luck– these are some ambitious projects.<\/p>\n","protected":false},"excerpt":{"rendered":"

    Libav\/FFmpeg are once again part of the Google Summer of Code program and our students have signed up for some rather ambitious projects<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[68,239,240,241,227,242,244,243],"class_list":["post-3801","post","type-post","status-publish","format-standard","hentry","category-general","tag-ffmpeg","tag-gsoc","tag-gsoc2012","tag-hevc","tag-libav","tag-opus","tag-rtmp","tag-ut-video"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t