Matches in UGent Biblio for { <https://biblio.ugent.be/publication/2048020#aggregation> ?p ?o. }
Showing items 1 to 36 of
36
with 100 items per page.
- aggregation classification "P1".
- aggregation creator B94101.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation date "2012".
- aggregation format "application/pdf".
- aggregation hasFormat 2048020.bibtex.
- aggregation hasFormat 2048020.csv.
- aggregation hasFormat 2048020.dc.
- aggregation hasFormat 2048020.didl.
- aggregation hasFormat 2048020.doc.
- aggregation hasFormat 2048020.json.
- aggregation hasFormat 2048020.mets.
- aggregation hasFormat 2048020.mods.
- aggregation hasFormat 2048020.rdf.
- aggregation hasFormat 2048020.ris.
- aggregation hasFormat 2048020.txt.
- aggregation hasFormat 2048020.xls.
- aggregation hasFormat 2048020.yaml.
- aggregation isPartOf urn:isbn:9780819489548.
- aggregation isPartOf urn:issn:0277-786X.
- aggregation language "eng".
- aggregation publisher "SPIE, the International Society for Optical Engineering".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Technology and Engineering".
- aggregation title "A content-adaptive scheme for reduced-complexity, multi-view video coding".
- aggregation abstract "Disparity estimation is a highly complex and time consuming process in multi-view video encoders. Since multiple views taken from a 2D camerea array need to be coded at every time instance, the complexity of the encoder plays an important role besides its rate-distortion performance. In previous papers we have introduced a new frame type called D frame that exploits the stron geometrical correspondence between views, thereby reducing the complexity of the encoder. By employing D frames instead of some of the P frames in the prediction structure, significant compexity gain can be achieved if the trhreshold value which is a keystone element to adjust the complexity at the cost of quality and/or bit-rate is selected wisely. In this work, a new adaptive method to calculate the threshold value automatically from existing information during the encoding process is presented. In this method, the threshold values are generated for each block of each D frame to increase the accuracy. The algorithm is applied to several image sets and 20.6% complexity gain is achieved using the automatically generated threshold values without compromising qaulity or bit-rate.".
- aggregation authorList BK242080.
- aggregation volume "8290".
- aggregation aggregates 2048021.
- aggregation isDescribedBy 2048020.
- aggregation similarTo 12.912099.
- aggregation similarTo LU-2048020.