| Paper title: |
Using Mathematical Morphology to Detect the Imperfections of the Printed Circuit Boards |
| Published in: | Issue 1, (Vol. 2) / 2008 |
| Pages: | 9-14 |
| Author(s): | Balan Ionut |
| Abstract. | Image processing is a form of signal processing (analysis, interpretation, and manipulation of signals) for which the input is an image, such as photographs; the output of image processing can be either an image or a set of characteristics or parameters related to the image. Typical operations of image processing are geometric transformations such as enlargement, reduction and rotation, color corrections such as brightness and contrast adjustments, quantization, or conversion to a different color space, interpolation and recovery of a full image from a raw image format, image editing, image differencing, image stabilization, image segmentation and other. Applications of these operations are encountered in computer vision, face detection, feature detection, medical image processing, microscope image processing, morphological image processing, remote sensing and many other disciplines. Morphological image processing is a collection of techniques for digital image processing based on mathematical morphology. By combining these morphological operators we can obtain algorithms for many image processing tasks, such as feature detection, image segmentation, image sharpening, image filtering, and granulometry. Likewise, using this technology we can detect some imperfections of the printed circuits, imperfections that allow us to repair it, opportunely. So in this way, we can eliminate some costs in the technological process. The paper presents an introduction in mathematical morphology, describes “hit and miss transform”, dilation and erosion and, after all, we present the usage of two of these operations in printed circuit error detection. |
| Keywords: | Morphology, Image, Erosion, Dilation, Opening, Closing, Pixel |
| References: | 1. J.Baskar Babujee, J.Julie, Special Automata from Graph Structures, Proceeding of the International Conference on Mathematics and Computer Science, (2011), 135-137. 2. I. Cahit, Cordial graphs: a weaker version of graceful and harmonious graphs, Ars Combin., 23 (1987) 201-207. 3. John. E. Hopcroft and Jeffery. D. Ullman, Introduction to Automata theory, Languages and computation, Narosa Publishing House, 1987. 4. K.R.Parthasarathy, Basic Graph Theory, Tata McGraw-Hill. Publishing Company Ltd., New Delhi (1994). |
| Back to the journal content | |
