期刊文献+

印刷电路板光电图像获取与预处理研究 被引量:5

Study of Capturing and Preprocessing of Printed Circuit Board Photoelectric Image
原文传递
导出
摘要 为了获取完整且大面积的印刷电路板(PCB)光电图像,在淡入淡出的自然缝合算法的基础上,提出了一种基于硬件的图像自动拼接新算法,并分析了其基本原理。选择用中值滤波滤除图像中的噪声。针对获取后的PCB光电图像整体偏暗的特点和其直方图中出现灰度冗余的情况,提出了去灰度冗余与灰度变换结合起来的图像增强新算法,并分析了其基本原理。用图像自动拼接算法得到了完整且大面积的PCB光电图像实验结果;用完整图像中的局部小图像从主观与客观两方面对几种图像增强算法的增强效果进行了比较,本图像增强算法的增强效果较好。 On the basis of natural suture algorithm of fade in and fade out,a novel image automatic mosaic algorithm based on hardware is presented in order to capture whole and massive printed circuit board(PCB) photoelectric image,and its basic principle is analyzed.Noise in the PCB photoelectric image is filtered through median filtering. Because of the character of unitary obscuration of the image captured and its gray redundance in image histogram,a novel algorithm of image enhancement that combines removing gray redundance and using gray transform is presented,and its basic principle is analyzed.The whole and massive PCB photoelectric image is captured by the image mosaic algorithm proposed in the experiment.After image preprocessing,the enhancement result of the small part of the whole and massive PCB photoelectric image with our enhancement algorithm is better than that by other enhancement algorithms on the aspects of subjectivity and objectivity.
出处 《光学学报》 EI CAS CSCD 北大核心 2010年第4期984-988,共5页 Acta Optica Sinica
基金 国家重点实验室基金(9140C1406020708) 粤港关键领域重点突破项目(20091683) 湖南省科技计划项目(2009FJ3187)资助课题
关键词 图像处理 印刷电路板光电图像 线阵CCD 图像自动拼接 图像增强 image processing printed circuit board photoelectric image linear array CCD image automatic mosaic image enhancement
  • 相关文献

参考文献17

  • 1K. Chomsuwan, A. S. Yamad, A. M. Iwahar. Improvement on defect detection performance of PCB inspection based on ECT technique with multi-SV-GMR sensor[J]. IEEE T. Magn., 2007, 43(6): 2394-2396.
  • 2K. Chomsuwan, S. Yamada, M. Iwahara et al.. Application of eddy current testing technique for high-density double layer printed circuit board inspection[J]. IEEE T. Magn., 2005, 41(10): 3619-3621.
  • 3S. Yamada, K. Nakamura, M. Iwahara et al.. Application of ECT technique for inspection of bare PCB[J]. IEEE T. Magn. , 2003, 39(5):3325-3327.
  • 4T. Taniguchi, D. Kacqrzak, S. Yamada et al.. Wavelet based processing of ECT images for inspection of printed circuit board [J]. IEEE T. Magn. , 2001, 37(7):2790-2793.
  • 5艾莉莉,袁峰,丁振良.照相物镜径向畸变模型的再商讨[J].光学学报,2008,28(10):1930-1933. 被引量:7
  • 6冯忠耀,贾昉,周景会,忽满利.数字全息中利用图像拼接测量大物体的三维形貌[J].中国激光,2008,35(12):2017-2021. 被引量:13
  • 7杨占龙,郭宝龙.基于兴趣点伪泽尼克矩的图像拼接[J].中国激光,2007,34(11):1548-1552. 被引量:15
  • 8杨甬英,陆春华,梁蛟,刘东,杨李茗,李瑞洁.光学元件表面缺陷的显微散射暗场成像及数字化评价系统[J].光学学报,2007,27(6):1031-1038. 被引量:47
  • 9X. Dal, S. Khorram. A feature-based image registration algorithm using improved chain-code representation combined with invariant moments[J]. IEEE T. Geo Sci. Remote. , 1999, 37(5) : 2351-2362.
  • 10Lingjia Gu, Shuxu Guo, Shuzhi Ren et al.. Target image mosaic algorithm based on interest points matching[C]. International Conference on Communications, Circuits and Systems, 2007. 755-759.

二级参考文献51

共引文献137

同被引文献64

  • 1FINKEL R A, BENTLEY J L. Quad trees-a data structure for retrieval on composite keys [ J ]. Acta Informatica,1974,4(1) :1-9.
  • 2EASTMAN C M, ZEMANKOVA M. Partially specified nearest neighbor searches using K-D trees [ J ]. Information Processing Letters, 1982,15 (2) : 53-56.
  • 3MURPHY O J, SELKOW S M. The efficiency of using k-d trees for finding nearest neighbors in discrete space [ J ]. Information Processing Letters, 1986, 23 ( 4 ) : 215-218.
  • 4BENTLEY J L. Multidimensional binary search trees used for associative searching [ J ]. Communications of ACM, 1975,18(9) : 509-517.
  • 5YSMAR V, FILHO S. Optimal choice of discriminators in a balanced k-d binary search tree [ J ]. Information Processing Letters, 1981,13 ( 2 ) : 67-70.
  • 6FRIEDMAN J H, BENTLEY J L, FINKEL R A. An algorithm for finding best matches in logarithmic expected time[J]. Transactions on Mathematical Software, 1977,3 ( 3 ) :209-226.
  • 7FUKUNAGA K, HOSTETLER L D. Optimization of k-nearest neighbor density estimates [J]. IEEE Trans. Info. Theory, 1973, 33(19) :320-326.
  • 8RIVEST R. On the optimality of Elias' algorithm for performing best match searches [ C ]. Proceedings IFIP Congress 74, Stockholm, Sweden, 1974:678-681.
  • 9EASTMAN C M. Optimal bucket size for nearest neighbor searching in k-d trees [J]. Information Processing Letters, 1981,12(4) :165-167.
  • 10KNUTH D E. The art of computer programming [ M ]. Massachusetts : Addison-Wesley, 1969 : 401.

引证文献5

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部