Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/68849
Title: Applying chaotic particle swarm optimization to the template matching problem
Authors: Wu, C 
Dong, N
Ip, W 
Chen, Z
Yung, K 
Keywords: Chaotic particle swarm optimization
Template matching
PCB manufacture
Issue Date: 2009
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2009, v. 5821, p. 411-421 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: An improved particle swarm optimization algorithm, CSPSO (Chaotic Species-based particle swarm optimization), is proposed for solving the template matching problem. Template matching is one of the image comparison techniques widely applied to component existence checking in the printed circuit board (PCB) and electronics assembly industries. The proposed approach adopts the special nonlinear characteristic and ergodicity of chaos to enrich the search ability of the species-based particle swarm optimization (SPSO). To test its performance, the proposed CSPSO-based approach is compared with SPSObased approach using two experimental studies. The CSPSO-based approach is proven to be superior to the original SPSO-based one in term of efficiency.
Description: 4th International Symposium on Intelligence Computation and Applications (ISICA), Oct 23-25, 2009, Huangshi, China
URI: http://hdl.handle.net/10397/68849
ISSN: 0302-9743
EISSN: 1611-3349
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

2
Checked on Nov 13, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.