Efficient Motion Estimation Algorithm for Bidirectional Prediction Scheme
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | M.-K.Kim | ko |
| dc.contributor.author | Kim, Jae Kyoon | ko |
| dc.date.accessioned | 2013-02-25T03:49:31Z | - |
| dc.date.available | 2013-02-25T03:49:31Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1994-04 | - |
| dc.identifier.citation | ELECTRONICS LETTERS, v.30, no.8, pp.632 - 633 | - |
| dc.identifier.issn | 0013-5194 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/59626 | - |
| dc.description.abstract | A novel block matching algorithm based on successive refinement using motion correlation is presented, which estimates more accurate forward and back-ward motion vectors for interpolative prediction as well as forward and backward predictions in bidirectionally predictive-coded pictures. Experimental results show that this algorithm achieves good performance in PSNR and subjective quality with low computational complexity. | - |
| dc.language | English | - |
| dc.publisher | Inst Engineering Technology-Iet | - |
| dc.title | Efficient Motion Estimation Algorithm for Bidirectional Prediction Scheme | - |
| dc.type | Article | - |
| dc.identifier.wosid | A1994NL30900014 | - |
| dc.identifier.scopusid | 2-s2.0-0028407016 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 30 | - |
| dc.citation.issue | 8 | - |
| dc.citation.beginningpage | 632 | - |
| dc.citation.endingpage | 633 | - |
| dc.citation.publicationname | ELECTRONICS LETTERS | - |
| dc.contributor.nonIdAuthor | M.-K.Kim | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | IMAGE PROCESSING | - |
| dc.subject.keywordAuthor | MOTION ESTIMATION | - |
- Appears in Collection
- 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 8 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.