Fast full search in motion estimation by hierarchical use of Minkowski's inequality (humi)
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
952 | en_US |
dc.citation.issue |
7 | en_US |
dc.citation.spage |
945 | en_US |
dc.citation.volume |
31 | en_US |
dc.citation.woscount |
29 | |
dc.contributor.author |
Lu, JY | en_US |
dc.contributor.author |
Wu, KS | en_US |
dc.contributor.author |
Lin, JC | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:48:55Z | |
dc.date.available |
2014-12-08T15:48:55Z | |
dc.date.issued |
1998-07-01 | en_US |
dc.description.abstract |
In this paper, we extend the idea of successive elimination algorithm (SEA) to obtain a fast full search (FS) algorithm accelerating the block matching procedure of motion estimation. Based on the monotonic relation between the accumulated absolution distortions (AAD) obtained for distinct layers of a pyramid structure; the proposed method successfully rejects many impossible candidates considered in the FS. The derivation of the monotonicity relation repeatedly uses in a four-dimensional vector space the l(1)-version of Minkowski's inequality, an inequality which is quite well-known in the field of mathematics. Simulation results show that the processing speed is faster than that of several well-known fast full search methods, including the SEA that uses just once the Minkowski's inequality (in a vector space of 256 dimension when the block size is 16 x 16). The processing speed of the proposed method is also competitive with that of the three-step search (TSS), which is often used for block matching in interframe video coding, although the visual quality performance of TSS is usually a little poorer than that of the FS. (C) 1998 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved. | en_US |
dc.identifier.issn |
0031-3203 | en_US |
dc.identifier.journal |
PATTERN RECOGNITION | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/32532 | |
dc.identifier.wosnumber |
WOS:000074348500010 | |
dc.language.iso |
en_US | en_US |
dc.subject |
motion estimation | en_US |
dc.subject |
block matching | en_US |
dc.subject |
position vector | en_US |
dc.subject |
motion vector | en_US |
dc.subject |
accumulated absolute distortion | en_US |
dc.subject |
Minkowski's inequality | en_US |
dc.subject |
l(1)-norm | en_US |
dc.title |
Fast full search in motion estimation by hierarchical use of Minkowski's inequality (humi) | en_US |
dc.type |
Article | en_US |
檔案
- 000074348500010.pdf (109.9 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Lu, J., Wu, K., & Lin, J. (1998). Fast full search in motion estimation by hierarchical use of Minkowski's inequality (humi). PATTERN RECOGNITION, 31(7), 945–952. https://ir.lib.nycu.edu.tw/handle/11536/32532
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/32532