File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A new fast motion estimation algorithm using hexagonal subsampling pattern and multiple candidates search

TitleA new fast motion estimation algorithm using hexagonal subsampling pattern and multiple candidates search
Authors
KeywordsComputers
Computer graphics
Issue Date1996
PublisherIEEE.
Citation
The 1996 International Conference on Image Processing, Lausanne, Switzerland, 16-19 September 1996. In International Conference on Image Processing Proceedings, 1996, v. 2, p. 497-500 How to Cite?
AbstractIn this paper we present a fast algorithm to reduce the computational complexity of block motion estimation. The reduction is obtained from the use of a new hexagonal subsampling pattern and the domain decimation method introduced by Cheng and Chan (see Proc. IEEE ICASSP, vol.4, p.2313, 1996). The multiple candidates search method is also introduced to improve the robustness of the algorithm. Computer simulation shows that the performance is very close to that of the full search.
Persistent Identifierhttp://hdl.handle.net/10722/45997
ISSN
2020 SCImago Journal Rankings: 0.315
References

 

DC FieldValueLanguage
dc.contributor.authorChoi, KTen_HK
dc.contributor.authorChan, SCen_HK
dc.contributor.authorNg, TSen_HK
dc.date.accessioned2007-10-30T06:40:16Z-
dc.date.available2007-10-30T06:40:16Z-
dc.date.issued1996en_HK
dc.identifier.citationThe 1996 International Conference on Image Processing, Lausanne, Switzerland, 16-19 September 1996. In International Conference on Image Processing Proceedings, 1996, v. 2, p. 497-500en_HK
dc.identifier.issn1522-4880en_HK
dc.identifier.urihttp://hdl.handle.net/10722/45997-
dc.description.abstractIn this paper we present a fast algorithm to reduce the computational complexity of block motion estimation. The reduction is obtained from the use of a new hexagonal subsampling pattern and the domain decimation method introduced by Cheng and Chan (see Proc. IEEE ICASSP, vol.4, p.2313, 1996). The multiple candidates search method is also introduced to improve the robustness of the algorithm. Computer simulation shows that the performance is very close to that of the full search.en_HK
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofInternational Conference on Image Processing Proceedings-
dc.rights©1996 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectComputersen_HK
dc.subjectComputer graphicsen_HK
dc.titleA new fast motion estimation algorithm using hexagonal subsampling pattern and multiple candidates searchen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1522-4880&volume=2&spage=497&epage=500&date=1996&atitle=A+new+fast+motion+estimation+algorithm+using+hexagonal+subsampling+pattern+and+multiple+candidates+searchen_HK
dc.identifier.emailChan, SC:scchan@eee.hku.hk-
dc.identifier.emailNg, TS:tsng@eee.hku.hk-
dc.identifier.authorityChan, SC=rp00094-
dc.identifier.authorityNg, TS=rp00159-
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ICIP.1996.560900en_HK
dc.identifier.scopuseid_2-s2.0-0030385849-
dc.identifier.hkuros26723-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0030385849&selection=ref&src=s&origin=recordpage-
dc.identifier.volume2-
dc.identifier.spage500-
dc.identifier.epage497-
dc.identifier.scopusauthoridChoi, KT=7403949897-
dc.identifier.scopusauthoridChan, SC=13310287100-
dc.identifier.scopusauthoridNg, TS=7402229975-
dc.customcontrol.immutablesml 151023 - merged-
dc.identifier.issnl1522-4880-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats