File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Adaptive search center non-linear three step search

TitleAdaptive search center non-linear three step search
Authors
Chung, HYCheung, PYSYung, NHC
KeywordsComputers
Computer graphics
Issue Date1998
PublisherIEEE.
Citation
Ieee International Conference On Image Processing, 1998, v. 2, p. 191-194 How to Cite?
DOI: http://dx.doi.org/10.1109/ICIP.1998.723345
AbstractThis paper presents a new motion estimation algorithm using an adaptive search center predicted from its adjacent blocks, and a non-linear center biased search point pattern. It does not have the problem of being trapped by local minimum, and is characterized by finding the majority motion vector in one step. When compared with six other block-based search algorithms including the full-search and three-step-search, the new algorithm has an average PSNR very close to that of full-search, yet an average search time faster than the three-step-search.
Persistent Identifierhttp://hdl.handle.net/10722/46146
ISSN
1522-4880
2020 SCImago Journal Rankings: 0.315

 

DC FieldValueLanguage
dc.contributor.authorChung, HYen_HK
dc.contributor.authorCheung, PYSen_HK
dc.contributor.authorYung, NHCen_HK
dc.date.accessioned2007-10-30T06:43:29Z-
dc.date.available2007-10-30T06:43:29Z-
dc.date.issued1998en_HK
dc.identifier.citationIeee International Conference On Image Processing, 1998, v. 2, p. 191-194en_HK
dc.identifier.issn1522-4880en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46146-
dc.description.abstractThis paper presents a new motion estimation algorithm using an adaptive search center predicted from its adjacent blocks, and a non-linear center biased search point pattern. It does not have the problem of being trapped by local minimum, and is characterized by finding the majority motion vector in one step. When compared with six other block-based search algorithms including the full-search and three-step-search, the new algorithm has an average PSNR very close to that of full-search, yet an average search time faster than the three-step-search.en_HK
dc.format.extent383864 bytes-
dc.format.extent4863 bytes-
dc.format.extent10863 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofIEEE International Conference on Image Processingen_HK
dc.rights©1998 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.titleAdaptive search center non-linear three step searchen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1522-4880&volume=2&spage=191&epage=194&date=1998&atitle=Adaptive+search+center+non-linear+three+step+searchen_HK
dc.identifier.emailChung, HY:hychung@cs.hku.hken_HK
dc.identifier.emailCheung, PYS:paul.cheung@hku.hken_HK
dc.identifier.emailYung, NHC:nyung@eee.hku.hken_HK
dc.identifier.authorityChung, HY=rp00219en_HK
dc.identifier.authorityCheung, PYS=rp00077en_HK
dc.identifier.authorityYung, NHC=rp00226en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ICIP.1998.723345en_HK
dc.identifier.scopuseid_2-s2.0-0032295647en_HK
dc.identifier.hkuros45807-
dc.identifier.volume2en_HK
dc.identifier.spage191en_HK
dc.identifier.epage194en_HK
dc.identifier.scopusauthoridChung, HY=14059962600en_HK
dc.identifier.scopusauthoridCheung, PYS=7202595335en_HK
dc.identifier.scopusauthoridYung, NHC=7003473369en_HK
dc.identifier.issnl1522-4880-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats