• Title/Summary/Keyword: Gray Level Image

Search Result 443, Processing Time 0.028 seconds

Development of a Vision System for the Complete Inspection of CO2 Welding Equipment of Automotive Body Parts (자동차 차체부품 CO2용접설비 전수검사용 비전시스템 개발)

  • Ju-Young Kim;Min-Kyu Kim
    • Journal of Sensor Science and Technology
    • /
    • v.33 no.3
    • /
    • pp.179-184
    • /
    • 2024
  • In the car industry, welding is a fundamental linking technique used for joining components, such as steel, molds, and automobile parts. However, accurate inspection is required to test the reliability of the welding components. In this study, we investigate the detection of weld beads using 2D image processing in an automatic recognition system. The sample image is obtained using a 2D vision camera embedded in a lighting system, from where a portion of the bead is successfully extracted after image processing. In this process, the soot removal algorithm plays an important role in accurate weld bead detection, and adopts adaptive local gamma correction and gray color coordinates. Using this automatic recognition system, geometric parameters of the weld bead, such as its length, width, angle, and defect size can also be defined. Finally, on comparing the obtained data with the industrial standards, we can determine whether the weld bead is at an acceptable level or not.

A Study on the Preprocessing Method Using Construction of Watershed for Character Image segmentation

  • Nam Sang Yep;Choi Young Kyoo;Kwon Yun Jung;Lee Sung Chang
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.814-818
    • /
    • 2004
  • Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic and timing information besides has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing For off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods which effectively extracts skeleton through conditional test mask considering running time and quality. of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Watershed image conversion uses prewitt operator for gradient image conversion, extracts local minima considering 8-neighborhood pixel. And methods by using difference of mean value is used in region merging step, Converted watershed image by means of this methods separates effectively character region and background region applying to segmentation function. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.

  • PDF

e-Catalogue Image Retrieval Using Vectorial Combination of Color Edge (컬러에지의 벡터적 결합을 이용한 e-카탈로그 영상 검색)

  • Hwang, Yei-Seon;Park, Sang-Gun;Chun, Jun-Chul
    • The KIPS Transactions:PartB
    • /
    • v.9B no.5
    • /
    • pp.579-586
    • /
    • 2002
  • The edge descriptor proposed by MPEG-7 standard is a representative approach for the contents-based image retrieval using the edge information. In the edge descriptor, the edge information is the edge histogram derived from a gray-level value image. This paper proposes a new method which extracts color edge information from color images and a new approach for the contents-based image retrieval based on the color edge histogram. The poposed method and technique are applied to image retrieval of the e-catalogue. For the evaluation, the results of image retrieval using the proposed approach are compared with those of image retrieval using the edge descriptor by MPEG-7 and the statistics shows the efficiency of the proposed method. The proposed color edge model is made by combining the R,G,B channel components vectorially and by characterizing the vector norm of the edge map. The color edge histogram using the direction of the color edge model is subsequently used for the contents-based image retrieval.

An Algorithm for Traffic Information by Vehicle Tracking from CCTV Camera Images on the Highway (고속도로 CCTV카메라 영상에서 차량 추적에 의한 교통정보 수집 알고리즘)

  • Min Joon-Young
    • Journal of Digital Contents Society
    • /
    • v.3 no.1
    • /
    • pp.1-9
    • /
    • 2002
  • This paper is proposed to algorithm for measuring traffic information automatically, for example, volume count, speed and occupancy rate, from CCTV camera images installed on highway, add to function of image detectors which can be collected the traffic information. Recently the method of traffic informations are counted in lane one by one, but this manner is occurred critical errors by occlusion frequently in case of passing larger vehicles(bus, truck etc.) and is impossible to measure in the 8 lanes of highway. In this paper, installed the detection area include with all lanes, traffic informations are collected using tracking algorithm with passing vehicles individually in this detection area, thus possible to detect all of 8 lanes. The experiment have been conducted two different real road scenes for 20 minutes. For the experiments, the images are provided with CCTV camera which was installed at Kiheung Interchange upstream of Kyongbu highway, and video recording images at Chungkye Tunnel. For image processing, images captured by frame-grabber board 30 frames per second, $640{\times}480$ pixels resolution and 256 gray-levels to reduce the total amount of data to be interpreted.

  • PDF

Saturation Compensating Method by Embedding Pseudo-Random Code in Wavelet Packet Based Colorization (웨이블릿 패킷 기반의 컬러화 알고리즘에서 슈도랜덤코드 삽입을 이용한 채도 보상 방법)

  • Ko, Kyung-Woo;Jang, In-Su;Kyung, Wang-Jun;Ha, Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.4
    • /
    • pp.20-27
    • /
    • 2010
  • This paper proposes a saturation compensating method by embedding pseudo-random code information in wavelet packet based colorization algorithm. In the color-to-gray process, an input RGB image is converted into YCbCr images, and a 2-level wavelet packet transform is applied to the Y image. And then, color components of CbCr are embedded into two sub-bands including minimum amount of energy on the Y image. At this time, in order to compensate the color saturations of the recovered color image during the printing and scanning process, the maximum and minimum values of CbCr components of an original image are also embedded into the diagonal-diagonal sub-band by a form of pseudo-random code. This pseudo-random code has the maximum and minimum values of an original CbCr components, and is expressed by the number of white pixels. In the gray-to-color process, saturations of the recovered color image are compensated using the ratio of the original CbCr values to the extracted CbCr values. Through the experiments, we can confirm that the proposed method improves color saturations in the recovered color images by the comparison of color difference and PSNR values.

MRI Quantification Analysis on Fall in Sick Times of the Cerebral Infarction Patients Using Object-Centered Hierarchical Planning (객체 중심 계층적 계획을 이용한 뇌경색 환자의 시기별 MRI 정량적 분석에 관한 연구)

  • Ha, Kwang;Jeon, Gye-Rok;Kim, Gil-Joong
    • Journal of Biomedical Engineering Research
    • /
    • v.24 no.2
    • /
    • pp.61-68
    • /
    • 2003
  • This paper presents a quantitative analysis method for fall in sick times of the cerebral infarction patients using three types of magnetic resonance image, which play an important role in deciding method of medical treatment. For this object, image characteristics obtained by three radiographic methods of MRI and their relation were analyzed by means of object centered hierarchical Planning method. This methode presents an approach to the knowledge based processes for image interpretation and analysis. To compare three type of MRI. a multiple warping algorithm and affine transform method performed for image matching. Then each fall in sick times level of cerebral infarction was quantified and pseudo-color mapping performed by comparing gray level value one another according to Previously obtained hand maid data. The result of this study was compared to a medical doctors decision.

Design of Stereo Image Match Processor for Real Time Stereo Matching (실시간 스테레오 정합을 위한 스테레오 영상 정합 프로세서 설계)

  • Kim, Yeon-Jae;Sim, Deok-Seon
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.37 no.2
    • /
    • pp.50-59
    • /
    • 2000
  • Stereo vision is a technique extracting depth information from stereo images, which are two images that view an object or a scene from different locations. The most important procedure in stereo vision, which is called stereo matching, is to find the same points in stereo images. It is difficult to match stereo images in real time because stereo matching requires heavy calculation. In this Paper we design a digital VLSI to Process stereo matching in real time, which we call stereo image match processor (SIMP). For implementation of real time stereo matching, sliding memory and minimum selection tree are presented. SIMP is designed with pipeline architecture and parallel processing. SIMP takes 64 gray level 64$\times$64 stereo images and yields 8 level 64 $\times$64 disparity map by 3 bit disparity and 12 bit address outputs. SIMP can process stereo images with process speed of 240 frames/sec.

  • PDF

Object Segmentation for Image Transmission Services and Facial Characteristic Detection based on Knowledge (화상전송 서비스를 위한 객체 분할 및 지식 기반 얼굴 특징 검출)

  • Lim, Chun-Hwan;Yang, Hong-Young
    • Journal of the Korean Institute of Telematics and Electronics T
    • /
    • v.36T no.3
    • /
    • pp.26-31
    • /
    • 1999
  • In this paper, we propose a facial characteristic detection algorithm based on knowledge and object segmentation method for image communication. In this algorithm, under the condition of the same lumination and distance from the fixed video camera to human face, we capture input images of 256 $\times$ 256 of gray scale 256 level and then remove the noise using the Gaussian filter. Two images are captured with a video camera, One contains the human face; the other contains only background region without including a face. And then we get a differential image between two images. After removing noise of the differential image by eroding End dilating, divide background image into a facial image. We separate eyes, ears, a nose and a mouth after searching the edge component in the facial image. From simulation results, we have verified the efficiency of the Proposed algorithm.

  • PDF

Forensic Image Classification using Data Mining Decision Tree (데이터 마이닝 결정나무를 이용한 포렌식 영상의 분류)

  • RHEE, Kang Hyeon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.7
    • /
    • pp.49-55
    • /
    • 2016
  • In digital forensic images, there is a serious problem that is distributed with various image types. For the problem solution, this paper proposes a classification algorithm of the forensic image types. The proposed algorithm extracts the 21-dim. feature vector with the contrast and energy from GLCM (Gray Level Co-occurrence Matrix), and the entropy of each image type. The classification test of the forensic images is performed with an exhaustive combination of the image types. Through the experiments, TP (True Positive) and FN (False Negative) is detected respectively. While it is confirmed that performed class evaluation of the proposed algorithm is rated as 'Excellent(A)' because of the AUROC (Area Under Receiver Operating Characteristic Curve) is 0.9980 by the sensitivity and the 1-specificity. Also, the minimum average decision error is 0.1349. Also, at the minimum average decision error is 0.0179, the whole forensic image types which are involved then, our classification effectiveness is high.

QuadTree-Based Lossless Image Compression and Encryption for Real-Time Processing (실시간 처리를 위한 쿼드트리 기반 무손실 영상압축 및 암호화)

  • Yoon, Jeong-Oh;Sung, Woo-Seok;Hwang, Chan-Sik
    • The KIPS Transactions:PartC
    • /
    • v.8C no.5
    • /
    • pp.525-534
    • /
    • 2001
  • Generally, compression and encryption procedures are performed independently in lossless image compression and encryption. When compression is followed by encryption, the compressed-stream should have the property of randomness because its entropy is decreased during the compression. However, when full data is compressed using image compression methods and then encrypted by encryption algorithms, real-time processing is unrealistic due to the time delay involved. In this paper, we propose to combine compression and encryption to reduce the overall processing time. It is method decomposing gray-scale image by means of quadtree compression algorithms and encrypting the structural part. Moreover, the lossless compression ratio can be increased using a transform that provides an decorrelated image and homogeneous region, and the encryption security can be improved using a reconstruction of the unencrypted quadtree data at each level. We confirmed the increased compression ratio, improved encryption security, and real-time processing by using computer simulations.

  • PDF