Data reuse algorithm for multiple reference frame motion estimation
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Shim, H | ko |
| dc.contributor.author | Kyung, Chong-Min | ko |
| dc.date.accessioned | 2013-03-06T21:50:54Z | - |
| dc.date.available | 2013-03-06T21:50:54Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 2007-03 | - |
| dc.identifier.citation | ELECTRONICS LETTERS, v.43, pp.382 - 383 | - |
| dc.identifier.issn | 0013-5194 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/88585 | - |
| dc.description.abstract | A data reuse algorithm for multiple reference frame motion estimation is described. The proposed algorithm reduces memory access by modifying the reference frame search order and search centre such that the likelihood of data reuse is increased. Experimental results show that the algorithm reduces memory access by 15-30% compared to the conventional fast reference frame selection algorithm, while maintaining similar bit rate and PSNR. | - |
| dc.language | English | - |
| dc.publisher | INST ENGINEERING TECHNOLOGY-IET | - |
| dc.title | Data reuse algorithm for multiple reference frame motion estimation | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000246291800009 | - |
| dc.identifier.scopusid | 2-s2.0-34047121711 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 43 | - |
| dc.citation.beginningpage | 382 | - |
| dc.citation.endingpage | 383 | - |
| dc.citation.publicationname | ELECTRONICS LETTERS | - |
| dc.identifier.doi | 10.1049/el:20070149 | - |
| dc.contributor.localauthor | Kyung, Chong-Min | - |
| dc.contributor.nonIdAuthor | Shim, H | - |
| dc.type.journalArticle | Article | - |
- Appears in Collection
- EE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 4 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.