Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library | 
|---|---|
| Author | Flierl, M. Wiegand, T. Girod, B. | 
| Copyright Year | 1998 | 
| Description | Author affiliation: Telecommun. Lab., Erlangen-Nurnberg Univ., Germany (Flierl, M.) | 
| Abstract | Multi-hypothesis motion-compensated prediction extends traditional motion-compensated prediction used in video coding schemes. Known algorithms for block-based multi-hypothesis motion-compensated prediction are, for example, overlapped block motion compensation (OBMC) and bidirectionally predicted frames (B-frames). This paper presents a generalization of these algorithms in a rate-distortion framework. All blocks which are available for prediction are called hypotheses. Further, we explicitly distinguish between the search space and the superposition of hypotheses. Hypotheses are selected from a search space and their spatio-temporal positions are transmitted by means of spatio-temporal displacement codewords. Constant predictor coefficients are used to combine linearly hypotheses of a multi-hypothesis. The presented design algorithm provides an estimation criterion for optimal multi-hypotheses, a rule for optimal displacement codes, and a condition for optimal predictor coefficients. Statistically dependent hypotheses of a multi-hypothesis are determined by an iterative algorithm. Experimental results show that Increasing the number of hypotheses from 1 to 8 provides prediction gains up to 3 dB in prediction error. | 
| Starting Page | 239 | 
| Ending Page | 248 | 
| File Size | 227407 | 
| Page Count | 10 | 
| File Format | |
| ISBN | 0818684062 | 
| ISSN | 10680314 | 
| DOI | 10.1109/DCC.1998.672152 | 
| Language | English | 
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) | 
| Publisher Date | 1998-03-30 | 
| Publisher Place | USA | 
| Access Restriction | Subscribed | 
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) | 
| Subject Keyword | Algorithm design and analysis Rate-distortion Motion compensation Distortion measurement Iterative algorithms Laboratories Video coding Spatiotemporal phenomena Data compression Video compression | 
| Content Type | Text | 
| Resource Type | Article | 
| Subject | Computer Networks and Communications | 
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
					
					Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details | 
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education  | 
							Sanctioning Authority | https://www.education.gov.in/ict-initiatives | 
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in | 
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in | 
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project | 
								
								 Dr. B. Sutradhar  bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon  | 
						
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in | 
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in | 
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in | 
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in | 
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in | 
| 
                             
                                Loading...
                             
                         |