完整後設資料紀錄
DC 欄位語言
dc.contributor.authorWu, Kuang-Shyr
dc.contributor.authorLu, Jing-Yi
dc.contributor.authorLin, Ja-Chen
dc.date.accessioned2009-08-23T04:39:17Z
dc.date.accessioned2020-05-25T06:25:08Z-
dc.date.available2009-08-23T04:39:17Z
dc.date.available2020-05-25T06:25:08Z-
dc.date.issued2006-10-30T01:25:48Z
dc.date.submitted1996-12-19
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/2823-
dc.description.abstractIn this paper, a fast full search (FS) algorithm is proposed to accelerate the block matching procedure of motion estimation. Based on the monotonic relation between the Supreme of absolute differences (SAD) obtained for distinct layers of a pyramid structure called Sup-pyramid, the proposed method successfully rejects many impossible candidates considered in the FS. The derivation of the monotonicity relation uses the l∞ version of Minkowski’s Inequality, an inequality which is quite well-known in the field of Math. Simulation results show that the computational complexity is much better than that of the FS. The processing speed of the proposed method is also compared 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 poorer than that of the FS.
dc.description.sponsorship中山大學,高雄市
dc.format.extent7p.
dc.format.extent1104434 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries1996 ICS會議
dc.subject.otherComputer Vision
dc.titleA Fast Full Algorithm for Minimizing the Maximum Difference (MinMax) in Motion Estimation
分類:1996年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics001996000167.pdf1.08 MBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。