File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: PATTERN RECOGNITION FOR AUTOMATED WIRE BONDING.

TitlePATTERN RECOGNITION FOR AUTOMATED WIRE BONDING.
Authors
Issue Date1984
Citation
Iee Proceedings E: Computers And Digital Techniques, 1984, v. 131 n. 1, p. 19-30 How to Cite?
AbstractThe design and development of an integrated pattern-recognition system for transistor/LED wire bonding is presented. The system uses a M6809 microprocessor for computation. Three recognition algorithms are studied, and their relative performances are compared. The firts algorithm based on edge extraction and projection is relatively slow but is a candidate for hardware implementation at higher speeds. The second algorithm based on the Freeman tracer is the fastest, but not intelligent enough to identify connected regions. A new algorithm called the 'connected-tracer' algorithm is proposed, which solves the problem of simple connectiveness with a speed performance of around 0. 1 s using a 1 MHz processor. A variety of die samples of different sizes, scribing and attachment methods are tested. The results indicate that the system developed is both reliable and effective for fully automated transistor/LED wire bonding.
Persistent Identifierhttp://hdl.handle.net/10722/154827
ISSN

 

DC FieldValueLanguage
dc.contributor.authorLi, HFen_US
dc.contributor.authorTsang, CMen_US
dc.contributor.authorCheung, YSen_US
dc.date.accessioned2012-08-08T08:30:49Z-
dc.date.available2012-08-08T08:30:49Z-
dc.date.issued1984en_US
dc.identifier.citationIee Proceedings E: Computers And Digital Techniques, 1984, v. 131 n. 1, p. 19-30en_US
dc.identifier.issn0143-7062en_US
dc.identifier.urihttp://hdl.handle.net/10722/154827-
dc.description.abstractThe design and development of an integrated pattern-recognition system for transistor/LED wire bonding is presented. The system uses a M6809 microprocessor for computation. Three recognition algorithms are studied, and their relative performances are compared. The firts algorithm based on edge extraction and projection is relatively slow but is a candidate for hardware implementation at higher speeds. The second algorithm based on the Freeman tracer is the fastest, but not intelligent enough to identify connected regions. A new algorithm called the 'connected-tracer' algorithm is proposed, which solves the problem of simple connectiveness with a speed performance of around 0. 1 s using a 1 MHz processor. A variety of die samples of different sizes, scribing and attachment methods are tested. The results indicate that the system developed is both reliable and effective for fully automated transistor/LED wire bonding.en_US
dc.languageengen_US
dc.relation.ispartofIEE Proceedings E: Computers and Digital Techniquesen_US
dc.titlePATTERN RECOGNITION FOR AUTOMATED WIRE BONDING.en_US
dc.typeArticleen_US
dc.identifier.emailCheung, YS:paul.cheung@hku.hken_US
dc.identifier.authorityCheung, YS=rp00077en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0021190498en_US
dc.identifier.volume131en_US
dc.identifier.issue1en_US
dc.identifier.spage19en_US
dc.identifier.epage30en_US
dc.identifier.scopusauthoridLi, HF=15035118700en_US
dc.identifier.scopusauthoridTsang, CM=55167957500en_US
dc.identifier.scopusauthoridCheung, YS=7202595335en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats