File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Adaptive parallel video-coding algorithm

TitleAdaptive parallel video-coding algorithm
Authors
KeywordsData flow graph
H.261
Inter-processor communication
Multiprocessor scheduling
Pipelining
Video coding
Issue Date2001
PublisherS P I E - International Society for Optical Engineering. The Journal's web site is located at http://spie.org/x1848.xml
Citation
Proceedings Of Spie - The International Society For Optical Engineering, 2001, v. 4310, p. 284-295 How to Cite?
AbstractParallel encoding of video inevitably frame rate gives varying rate performance due to dynamically changing video content and motion field since the encoding process of each macro-block, especially motion estimation, is data dependent. A multiprocessor schedule optimized for a particular frame with certain macro-block encoding time may not be optimized towards another frame with different encoding time, which causes performance degradation to the parallelization. To tackle this problem, we propose a method based on a batch of near-optimal schedules generated at compile-time and a run-time mechanism to select the schedule giving the shortest predicted critical path length. This method has the advantage of being near-optimal using compile-time schedules while involving only run-time selection rather than re-scheduling. Implementation on the IBM SP2 multiprocessor system using 24 processors gives an average speedup of about 13.5 (frame rate of 38.5 frames per second) for a CIF sequence consisting of segments of 6 different scenes. This is equivalent to an average improvement of about 16.9% over the single schedule scheme with schedule adapted to each of the scenes. Using an open test sequence consisting of 8 video segments, the average improvement achieved is 13.2%, i.e. an average speedup of 13.3 (35.6 frames per second).
Persistent Identifierhttp://hdl.handle.net/10722/46238
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorLeung, KKen_HK
dc.contributor.authorYung, NHCen_HK
dc.contributor.authorCheung, PYSen_HK
dc.date.accessioned2007-10-30T06:45:27Z-
dc.date.available2007-10-30T06:45:27Z-
dc.date.issued2001en_HK
dc.identifier.citationProceedings Of Spie - The International Society For Optical Engineering, 2001, v. 4310, p. 284-295en_HK
dc.identifier.issn0277-786Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/46238-
dc.description.abstractParallel encoding of video inevitably frame rate gives varying rate performance due to dynamically changing video content and motion field since the encoding process of each macro-block, especially motion estimation, is data dependent. A multiprocessor schedule optimized for a particular frame with certain macro-block encoding time may not be optimized towards another frame with different encoding time, which causes performance degradation to the parallelization. To tackle this problem, we propose a method based on a batch of near-optimal schedules generated at compile-time and a run-time mechanism to select the schedule giving the shortest predicted critical path length. This method has the advantage of being near-optimal using compile-time schedules while involving only run-time selection rather than re-scheduling. Implementation on the IBM SP2 multiprocessor system using 24 processors gives an average speedup of about 13.5 (frame rate of 38.5 frames per second) for a CIF sequence consisting of segments of 6 different scenes. This is equivalent to an average improvement of about 16.9% over the single schedule scheme with schedule adapted to each of the scenes. Using an open test sequence consisting of 8 video segments, the average improvement achieved is 13.2%, i.e. an average speedup of 13.3 (35.6 frames per second).en_HK
dc.format.extent170542 bytes-
dc.format.extent4863 bytes-
dc.format.extent10863 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherS P I E - International Society for Optical Engineering. The Journal's web site is located at http://spie.org/x1848.xmlen_HK
dc.relation.ispartofProceedings of SPIE - The International Society for Optical Engineeringen_HK
dc.rightsS P I E - the International Society for Optical Proceedings. Copyright © S P I E - International Society for Optical Engineering.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rightsCopyright 2001 Society of Photo-Optical Instrumentation Engineers.This paper was published in Visual Communications and Image Processing, San Jose, USA, 24-26 January 2001, v. 4310, p. 284-295 and is madeavailable as an electronic reprint with permission of SPIE. One print or electronic copy may bemade for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes,or modification of the content of the paper are prohibited.en_HK
dc.subjectData flow graphen_HK
dc.subjectH.261en_HK
dc.subjectInter-processor communicationen_HK
dc.subjectMultiprocessor schedulingen_HK
dc.subjectPipeliningen_HK
dc.subjectVideo codingen_HK
dc.titleAdaptive parallel video-coding algorithmen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0277-786X&volume=4310&spage=284&epage=295&date=2001&atitle=Adaptive+parallel+video+coding+algorithmen_HK
dc.identifier.emailYung, NHC:nyung@eee.hku.hken_HK
dc.identifier.emailCheung, PYS:paul.cheung@hku.hken_HK
dc.identifier.authorityYung, NHC=rp00226en_HK
dc.identifier.authorityCheung, PYS=rp00077en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1117/12.411806en_HK
dc.identifier.scopuseid_2-s2.0-0035057913en_HK
dc.identifier.hkuros59410-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0035057913&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume4310en_HK
dc.identifier.spage284en_HK
dc.identifier.epage295en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridLeung, KK=35779695300en_HK
dc.identifier.scopusauthoridYung, NHC=7003473369en_HK
dc.identifier.scopusauthoridCheung, PYS=7202595335en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats