File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Bit-pairing codification for binary pattern projection system

TitleBit-pairing codification for binary pattern projection system
Authors
KeywordsComputers
Artificial intelligence
Issue Date2006
PublisherIEEE, Computer Society.
Citation
Proceedings - International Conference On Pattern Recognition, 2006, v. 2, p. 263-266 How to Cite?
AbstractIn a previous work, we proposed a new binary-light projection mechanism that had a much reduced system size that made it particularly suitable for 3D shape inspection of semiconductor products. The inspection speed of the mechanism was governed by the number of required images which also equaled the number of shiftings of the grating. In this paper we address how inspection speed could be gained, i.e., how the number of required images could be reduced, by the incorporation of two neighboring bits in the codification of each scene element. We provide an optimal design of such a codification strategy. A solution to the shifting strategy optimization is also proposed that is applicable to any given binary patterns. Theoretical analysis and real image experiments are presented to illustrate the workability of the solutions. © 2006 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/57281
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorCheng, Jen_HK
dc.contributor.authorChung, Ren_HK
dc.contributor.authorLam, EYen_HK
dc.contributor.authorFung, KSMen_HK
dc.date.accessioned2010-04-12T01:31:40Z-
dc.date.available2010-04-12T01:31:40Z-
dc.date.issued2006en_HK
dc.identifier.citationProceedings - International Conference On Pattern Recognition, 2006, v. 2, p. 263-266en_HK
dc.identifier.issn1051-4651en_HK
dc.identifier.urihttp://hdl.handle.net/10722/57281-
dc.description.abstractIn a previous work, we proposed a new binary-light projection mechanism that had a much reduced system size that made it particularly suitable for 3D shape inspection of semiconductor products. The inspection speed of the mechanism was governed by the number of required images which also equaled the number of shiftings of the grating. In this paper we address how inspection speed could be gained, i.e., how the number of required images could be reduced, by the incorporation of two neighboring bits in the codification of each scene element. We provide an optimal design of such a codification strategy. A solution to the shifting strategy optimization is also proposed that is applicable to any given binary patterns. Theoretical analysis and real image experiments are presented to illustrate the workability of the solutions. © 2006 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE, Computer Society.en_HK
dc.relation.ispartofProceedings - International Conference on Pattern Recognitionen_HK
dc.rights©2006 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.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectComputersen_HK
dc.subjectArtificial intelligenceen_HK
dc.titleBit-pairing codification for binary pattern projection systemen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1051-4651&volume=2&spage=263&epage=266&date=2006&atitle=Bit-pairing+codification+for+binary+pattern+projection+systemen_HK
dc.identifier.emailLam, EY:elam@eee.hku.hken_HK
dc.identifier.authorityLam, EY=rp00131en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ICPR.2006.331en_HK
dc.identifier.scopuseid_2-s2.0-34047202941en_HK
dc.identifier.hkuros125267-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-34047202941&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume2en_HK
dc.identifier.spage263en_HK
dc.identifier.epage266en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridCheng, J=14057685600en_HK
dc.identifier.scopusauthoridChung, R=7202439610en_HK
dc.identifier.scopusauthoridLam, EY=7102890004en_HK
dc.identifier.scopusauthoridFung, KSM=8627247700en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats