Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/1924
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Reddy, B K V | - |
dc.contributor.author | Meher, S | - |
dc.date.accessioned | 2013-04-17T09:39:21Z | - |
dc.date.available | 2013-04-17T09:39:21Z | - |
dc.date.issued | 2013-03 | - |
dc.identifier.citation | International Conference on Electrical, Electronics, Communications and Photonics, Goa, 31st March, 2013 | en |
dc.identifier.isbn | 978-93-81693-88-19 | - |
dc.identifier.uri | http://hdl.handle.net/2080/1924 | - |
dc.description | Copyright belongs to proceeding publisher | en |
dc.description.abstract | Based on the study of motion vector distribution from several commonly used test image sequences,a three step diamond search [TSDS]algorithm for fast block matching motion estimation is proposed in this paper .The performance of this algorithm is compared with other existing algorithms by means of error metrics and no of search points in this the simulation results shows that the proposed three step diamond search algorithm achieves close performance with that of diamond search [DS] and uses less no of search points than the three step search[TSS]. When compared with original diamond search [DS] algorithm, this algorithm requires less computation time and gives an improved performance. | en |
dc.format.extent | 149566 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.subject | Block motion estimation | en |
dc.subject | block matching algorithm | en |
dc.subject | search pattern | en |
dc.subject | three step search | en |
dc.subject | diamond search | en |
dc.title | Three step Diamond Search Algorithm for Fast Block-Matching Motion Estimation | en |
dc.type | Article | en |
Appears in Collections: | Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
43] ICEECP-033.pdf | 146.06 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.