Balanced Parallel Scheduling for Video Encoding with Adaptive GOP Structure
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 24, NO. 12, DECEMBER 2013
Hsu-Feng Hsiao, Member, IEEE, and Chen-Tsang WuBalanced Parallel Scheduling for Video Encoding with Adaptive GOP StructureOutline2IntroductionRelated WorkMethodsExperimental ResultsIntroduction3Idea 1:Scene changeIdea 2:Scheduling
Related Work #14Scene change detectionAbrupt scene changeAn abrupt scene change indicates that transition from one scene into another only spends a period of one frame.Gradual scene changeA gradual scene change takes a period of several frames to complete a scene transition.
Related Work #25Pixel-based methodSum of mean absolute difference (SMAD)Block-based methodA scene change is declared if the ratio of similar blocks between two frames is greater than some threshold.
Related Work #36Frame-level parallelism
Method #17Sum of absolute temporal difference (SATD)
Where is the pixel value at location (x,y).
Method #28Sum of absolute spatial difference (SASD)
Method #39Sum of absolute spatial difference (SASD)
Method #410
Method #511Abrupt Scene Change Detection Algorithm
If Ratio is greater than the predefined threshold
Abrupt Scene ChangeMethod #612
Ratio noiseThreshold = 1.4Method #713
Method #8142nd derivative
Local maxima of the ratios shall be at the positions where the values are negative.Threshold = -1.0
Method #915Gradual Scene Change Detection AlgorithmA gradual scene change takes a period of several framesRatio(n,m) is the ratio between frame n and frame m.
Method #1016BeginningThreshold = 0.7(0.3~1.0)EndingConvergence
Method #1117
Method #1218
Method #1319
I : 120ms B : 290msP : 360msMethod #1420
Method #1521
Method #1622
Method #1723
Experimental Results #124
Experimental Results #225
Experimental Results #326
Experimental Results #427
Experimental Results #528
Experimental Results #629