Parabola
10th February 2013, 21:53
This is an interesting competition looking for open-source codec optimisations with 2 x $10k prizes.
A total of US$20,000 in financial awards and travel grants will be presented, US$10,000 in each of the two competitions. The prizes will be awarded during the Plenary Session at the Picture Coding Symposium 2013 in San Jose, California, USA, which starts December 8, 2013.
One compression challenge will be based on the open source WebM project and one compression challenge will be based on ITU-T H.265/ISO/IEC 23008-2 HEVC. If a technology works both in the WebM and the HEVC framework it can be submitted to both competitions.
Both the WebM and the HEVC competition have each two tracks:
i) encoder optimization; bitstreams must be decoded by the unchanged baseline decoder.
ii) new tools; both encoder and decoder can be modified.
Submissions must comprise compilable source code, benchmarks and a paper...
http://pcs2013.org/GrandCompressionChallenge.asp
A total of US$20,000 in financial awards and travel grants will be presented, US$10,000 in each of the two competitions. The prizes will be awarded during the Plenary Session at the Picture Coding Symposium 2013 in San Jose, California, USA, which starts December 8, 2013.
One compression challenge will be based on the open source WebM project and one compression challenge will be based on ITU-T H.265/ISO/IEC 23008-2 HEVC. If a technology works both in the WebM and the HEVC framework it can be submitted to both competitions.
Both the WebM and the HEVC competition have each two tracks:
i) encoder optimization; bitstreams must be decoded by the unchanged baseline decoder.
ii) new tools; both encoder and decoder can be modified.
Submissions must comprise compilable source code, benchmarks and a paper...
http://pcs2013.org/GrandCompressionChallenge.asp