Abstract
Abstract : It is highly desirable to have a video coding framework that can flexibly distributed coding complexity between the video encoder and decoder. However, today's video compression techniques impose a rigid computational complexity distribution between the video encoder and decoder. Specifically, video decoders are very simple but encoders are computationally complex as they need to carry out motion estimation and mode decision. Distributed video coding has shown great potentials in enabling flexible complexity distribution between the video encoder and decoder. Previous work on distributed video coding has studied two extreme operating points of complexity distribution: (1) Complex encoder with light-weight decoder to achieve maximum compression efficiency and (2) Light encoder and complex decoder to achieve robustness against transmission packet drops (at the cost of reduced compression efficiency). In this project, our main goal is to explore the middle ground between these two extreme points. In particular, we study the effect of doing coarse motion search at the encoder.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
