Linear Hashtable Method and Predicted Hexagonal Search Algorithm with Moments Invariant

dc.contributor.authorWu, Yunsongen_US
dc.contributor.authorMegson, Grahamen_US
dc.contributor.authorNie, Zhengangen_US
dc.contributor.authorLiu, Xuanen_US
dc.contributor.editorMike Chantleren_US
dc.date.accessioned2016-02-11T13:30:56Z
dc.date.available2016-02-11T13:30:56Z
dc.date.issued2005en_US
dc.description.abstractThis paper presents a novel Linear Hashtable Method Predicted Hexagonal Search (LHMPHS) method for block base motion compensation on the basis of research from previous algorithm. Hashtable is used in video compression. Motion vectors produced by Linear Hashtable Motion Estimation Algorithm (LHMEA) are used as predictors for HEXBS. Moments invariants are also tested in hashtable to prove the more information moments have, the better it is. Experimental results show that the proposed algorithm can offer the same compression rate as the Full Search and fastest than all investigated algorithms, while the PSNR is high. LHMPHS has significant improvement on HEXBS and shows a direction for improving other fast motion estimation algorithms.en_US
dc.description.sectionheadersPoster Session 2en_US
dc.description.seriesinformationVision, Video, and Graphics (2005)en_US
dc.identifier.doi10.2312/vvg.20051026en_US
dc.identifier.isbn3-905673-57-6en_US
dc.identifier.pages195-201en_US
dc.identifier.urihttps://doi.org/10.2312/vvg.20051026en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectI.4.2 [Image Processing and Computer Vision]en_US
dc.subjectCompression (Coding)en_US
dc.titleLinear Hashtable Method and Predicted Hexagonal Search Algorithm with Moments Invarianten_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
195-201.pdf
Size:
275.19 KB
Format:
Adobe Portable Document Format
Collections