SoC x264 2009 - Revision history

DoesItReallyMatter: +:Category:SoC

2019-02-05T08:46:45Z

← Older revision		Revision as of 08:46, 5 February 2019
Line 104:		Line 104:
	You should also contact the admin [[User:J-b\|jb]].		You should also contact the admin [[User:J-b\|jb]].

	{{GSoC}} [[Category:x264]]		{{GSoC}}

			[[Category:SoC]]
			[[Category:x264]]

J-b at 14:04, 30 September 2013

2013-09-30T14:04:26Z

← Older revision		Revision as of 14:04, 30 September 2013
Line 104:		Line 104:
	You should also contact the admin [[User:J-b\|jb]].		You should also contact the admin [[User:J-b\|jb]].

	{{GSoC}}		{{GSoC}} [[Category:x264]]

J-b at 13:45, 30 September 2013

2013-09-30T13:45:41Z

← Older revision		Revision as of 13:45, 30 September 2013
Line 103:		Line 103:

	You should also contact the admin [[User:J-b\|jb]].		You should also contact the admin [[User:J-b\|jb]].

			{{GSoC}}

Dark Shikari at 03:49, 11 January 2011

2011-01-11T03:49:15Z

← Older revision		Revision as of 03:49, 11 January 2011
Line 20:		Line 20:
	:*Motion estimation and compensation		:*Motion estimation and compensation
	:*Quantization and entropy encoding		:*Quantization and entropy encoding
	A PDF with a chapter that can serve as a primer to video compression can be found [http://www.mediafire.com/download.php?auxd23m2snw here]. It also has some more specific chapters on MPEG-4 Part 2 and Part 10.		A PDF with a chapter that can serve as a primer to video compression can be found [http://www.mediafire.com/download.php?auxd23m2snw here] (new version [http://dl.dropbox.com/u/2701213/pdfs/0470516925Video.pdf here]). It also has some more specific chapters on MPEG-4 Part 2 and Part 10.

	==Projects==		==Projects==

Dark Shikari at 21:04, 27 March 2009

2009-03-27T21:04:33Z

← Older revision		Revision as of 21:04, 27 March 2009
Line 3:		Line 3:
	This is part of the VideoLAN candidature for Google Summer of Code 2009.		This is part of the VideoLAN candidature for Google Summer of Code 2009.

	*Mentor (and author of this page): Dark Shikari		*Mentor (and author of this page): Jason Garrett-Glaser (Dark Shikari)
	*Possible backup mentor: ~~pengvado~~		*Possible backup mentor: Holger Lubitz

	==Introduction to x264==		==Introduction to x264==

Dark Shikari: /* GPU Motion Estimation */

2009-03-16T04:30:53Z

GPU Motion Estimation

← Older revision		Revision as of 04:30, 16 March 2009
Line 90:		Line 90:
	* Set N equal to 2^M, where M is an integer. A common M is 4.		* Set N equal to 2^M, where M is an integer. A common M is 4.
	* WHILE N is greater than 1:		* WHILE N is greater than 1:
	:* Downscale the image by a factor of N.		:* Downscale the image (from the original) by a factor of N.
	:* Do an ordinary diamond motion search on the image with block size 16x16. Assume the predicted motion vector to be equal to the median of the top, left, and top right motion vectors (as per H.264 MV prediction)... but use the motion vectors from the previous iteration, not the current for these (this is what allows you to parallelize things with CUDA).		:* Do an ordinary diamond motion search on the image with block size 16x16. Assume the predicted motion vector to be equal to the median of the top, left, and top right motion vectors (as per H.264 MV prediction)... but use the motion vectors from the previous iteration, not the current for these (this is what allows you to parallelize things with CUDA).
	:* For each block after searching, split the motion vectors of that block into 4 separate (but equal) motion vectors. These will be used as the starting point for the searches in the next iteration. Each iteration progressively refines the result at a progressively lesser downscale.		:* For each block after searching, split the motion vectors of that block into 4 separate (but equal) motion vectors. These will be used as the starting point for the searches in the next iteration. Each iteration progressively refines the result at a progressively lesser downscale.

Dark Shikari: /* GPU Motion Estimation */

2009-03-16T04:30:40Z

GPU Motion Estimation

← Older revision		Revision as of 04:30, 16 March 2009
Line 93:		Line 93:
	:* Do an ordinary diamond motion search on the image with block size 16x16. Assume the predicted motion vector to be equal to the median of the top, left, and top right motion vectors (as per H.264 MV prediction)... but use the motion vectors from the previous iteration, not the current for these (this is what allows you to parallelize things with CUDA).		:* Do an ordinary diamond motion search on the image with block size 16x16. Assume the predicted motion vector to be equal to the median of the top, left, and top right motion vectors (as per H.264 MV prediction)... but use the motion vectors from the previous iteration, not the current for these (this is what allows you to parallelize things with CUDA).
	:* For each block after searching, split the motion vectors of that block into 4 separate (but equal) motion vectors. These will be used as the starting point for the searches in the next iteration. Each iteration progressively refines the result at a progressively lesser downscale.		:* For each block after searching, split the motion vectors of that block into 4 separate (but equal) motion vectors. These will be used as the starting point for the searches in the next iteration. Each iteration progressively refines the result at a progressively lesser downscale.
			:* N = N/2
	* Do a final refine at no downscale at all.		* Do a final refine at no downscale at all.

Dark Shikari: /* Contact info */

2009-03-16T03:07:09Z

Contact info

← Older revision		Revision as of 03:07, 16 March 2009
Line 99:		Line 99:

	==Contact info==		==Contact info==
	If you are interested, drop by #~~videolan,~~ #x264~~, or #x264dev~~ on Freenode.		If you are interested, drop by #x264dev or #x264 on Freenode.

	You should also contact the admin [[User:J-b\|jb]].		You should also contact the admin [[User:J-b\|jb]].

Dark Shikari: /* Introduction to x264 */

2009-03-16T02:49:53Z

Introduction to x264

← Older revision		Revision as of 02:49, 16 March 2009
Line 12:		Line 12:

	An overview of x264's algorithm can be found [http://akuvian.org/src/x264/overview_x264_v8_5.pdf here].		An overview of x264's algorithm can be found [http://akuvian.org/src/x264/overview_x264_v8_5.pdf here].
			==Skills needed==
			These are required for all listed projects and probably anything not listed, too.
			*Basic C programming.
			*Basic understanding of video encoding, or at least willingness to do the appropriate reading up on the topic before the summer begins.
			*Confidence in the ability to learn the basics of following and similar topics (though not all projects will require such information):
			:*Discrete cosine transform and similar frequency transforms
			:*Motion estimation and compensation
			:*Quantization and entropy encoding
			A PDF with a chapter that can serve as a primer to video compression can be found [http://www.mediafire.com/download.php?auxd23m2snw here]. It also has some more specific chapters on MPEG-4 Part 2 and Part 10.

	==Projects==		==Projects==

Dark Shikari at 02:48, 16 March 2009

2009-03-16T02:48:49Z

← Older revision		Revision as of 02:48, 16 March 2009
Line 1:		Line 1:
	[[x264]] has loads of possibilities for [[SoC 2009]] projects.		[[x264]] has loads of possibilities for [[SoC 2009]] projects. Those listed here are merely suggestions; other ideas are always possible if they fit the time and difficulty constraints of SoC.

	This is part of the VideoLAN candidature for Google Summer of Code 2009.		This is part of the VideoLAN candidature for Google Summer of Code 2009.