• Title/Summary/Keyword: Block matching method

Search Result 284, Processing Time 0.037 seconds

Exterior Vision Inspection Method of Injection Molding Automotive Parts (사출성형 자동차부품의 외관 비전검사 방법)

  • Kim, HoYeon;Cho, Jae-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.2
    • /
    • pp.127-132
    • /
    • 2019
  • In this paper, we propose a visual inspection method of automotive parts for injection molding to improve the appearance quality and productivity of automotive parts. Exterior inspection of existing injection molding automobile parts was generally done by manual sampling inspection by human. First, we applied the edge-tolerance vision inspection algorithm ([1] - [4]) for vision inspection of electronic components (TFT-LCD and PCB) And we propose a new visual inspection method to overcome the problem. In the proposed visual inspection, the inspection images of the parts to be inspected are aligned on the basis of the reference image of good quality. Then, after partial adaptive binarization, the binary block matching algorithm is used to compare the good binary image and the test binary image. We verified the effectiveness of the edge-tolerance vision check algorithm and the proposed appearance vision test method through various comparative experiments using actual developed equipment.

Hierarchical Motion Estimation Method for MASF (MASF 적용을 위한 계층적 움직임 추정 기법)

  • 김상연;김성대
    • Journal of Broadcast Engineering
    • /
    • v.1 no.1
    • /
    • pp.7-13
    • /
    • 1996
  • MASF is a kind of temporal filter proposed for noise reduction and temporal band limitation. MASF uses motion vectors to extract temporal information in spatial domain. Therefore, inaccurate motion information causes some distortions in MASF operation. Currently, bilinear interpolation after BMA(Block Matching Algorithm) is used for the motion estimation sheme of MASF. But, this method results in unreliable estimation when the object in image sequence has larger movement than the maximum displacement assumed in BMA or the input images are severely corrupted with noise. In order to i:;olve this problem, we analyse the effect of inaccurate motion on MASF and propose a hierarchical motion estimation algorithm based on the analysis results. Experimental results show that the proposed method produces reliable output under large motion and noisy situations.

  • PDF

The Extraction of Fingerprint Corepoint And Region Separation using Labeling for Gate Security (출입 보안을 위한 레이블링을 이용한 영역 분리 및 지문 중심점 추출)

  • Lee, Keon-Ik;Jeon, Young-Cheol;Kim, Kang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.6
    • /
    • pp.243-251
    • /
    • 2008
  • This study is to suggest the extraction algorithms of fingerprint corepoint and region separation using the labeling for gate security in order that it might be applied to the fingerprint recognition effectively. The gate security technology is entrance control, attendance management, computer security, electronic commerce authentication, information protection and so on. This study is to extract the directional image by dividing the original image in $128{\times}128$ size into the size of $4{\times}4$ pixel. This study is to separate the region of directional smoothing image extracted by each directional by using the labeling, and extract the block that appeared more than three sorts of change in different directions to the corepoint. This researcher is to increase the recognition rate and matching rate by extracting the corepoint through the separation of region by direction using the maximum direction and labeling, not search the zone of feasibility of corepoint or candidate region of corepoint used in the existing method. According to the result of experimenting with 300 fingerprints, the poincare index method is 94.05%, the proposed method is 97.11%.

  • PDF

Estimation of Disparity Map having Reliability to Changes of Radiometric (Radiometric 특성 변화에 신뢰성을 가지는 Disparity Map 예측)

  • Shin, Kwang-mu;Kim, Sung-min;Cho, Mi-sook;Chung, Ki-dong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.93-96
    • /
    • 2015
  • The aim of the estimation of disparity map is to find the corresponding pixels from similar two or more images. However, it is a difficult problem to get precise and consistent disparity under a variety of real world situations. In other words, the color values of stereo images are easily influenced by radiometric properties such as illumination direction, illumination color, and camera exposure. Therefore, conventional stereo matching methods can have low performances under radiometric conditions. In this paper, we propose an approaching of disparity map estimation that is reliable in controlling various radiometric variations close to the real environment. This method is motivated by following constancy. Even though each other has different radiometric property in stereo images, intensity of pixels of object have general constancy in specific block. Experimental results show that the proposed method has better performances compared to the comparison group under different radiometric conditions between stereo images. Consequentially, the proposed method is able to estimate the disparity map in stable under various radiometric variations.

  • PDF

Building Matching Analysis and New Building Update for the Integrated Use of the Digital Map and the Road Name Address Map (수치지도와 도로명주소지도의 통합 활용을 위한 건물 매칭 분석과 신규 건물 갱신)

  • Yeom, Jun Ho;Huh, Yong;Lee, Jeabin
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.5
    • /
    • pp.459-467
    • /
    • 2014
  • The importance of fusion and association using established spatial information has increased gradually with the production and supply of various spatial data by public institutions. The generation of necessary spatial information without field investigation and additional surveying can reduce time, labor, and financial costs. However, the study of the integration of the newly introduced road name address map with the digital map is very insufficient. Even though the use of the road name address map is encouraged for public works related to spatial information, the digital map is still widely used because it is the national basic map. Therefore, in this study, building matching and update were performed to associate the digital map with the road name address map. After geometric calibration using the block-based ICP (Iterative Closest Point) method, multi-scale corresponding pair searching with hierarchical clustering was applied to detect the multi-type match. The accuracy assessment showed that the proposed method is more than 95% accurate and the matched building layer of the two maps is useful for the integrated application and fusion. In addition, the use of the road name address map, which carries the latest and most frequently renewed data, enables cost-effective updating of new buildings.

Digital Surveillance System with fast Detection of Moving Object (움직이는 물체의 고속 검출이 가능한 디지털 감시 시스템)

  • 김선우;최연성;박한엽
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.3
    • /
    • pp.405-417
    • /
    • 2001
  • In this paper, since we currently using surveillance system of analog type bring about waste of resource and efficiency deterioration problems, we describe new solution that design and implementation to the digital surveillance system of new type applying compression techniques and encoding techniques of image data using MPEG-2 international standard. Also, we proposed fast motion estimation algorithm requires much less than the convectional digital surveillance camera system. In this paper a fast motion estimation algorithm is proposed the MPEG-2 video encoding. This algorithm is based on a hybrid use of the block matching technique and gradient technique. Also, we describe a method of moving object extraction directly using MPEG-2 video data. Since proposed method is very simple and requires much less computational power than the conventional object detection methods. In this paper we don't use specific H/W and this system is possible only software encoding, decoding and transmission real-time for image data.

  • PDF

Multiple Pedestrians Detection and Tracking using Color Information from a Moving Camera (이동 카메라 영상에서 컬러 정보를 이용한 다수 보행자 검출 및 추적)

  • Lim, Jong-Seok;Kim, Wook-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.11B no.3
    • /
    • pp.317-326
    • /
    • 2004
  • This paper presents a new method for the detection of multiple pedestrians and tracking of a specific pedestrian using color information from a moving camera. We first extract motion vector on the input image using BMA. Next, a difference image is calculated on the basis of the motion vector. The difference image is converted to a binary image. The binary image has an unnecessary noise. So, it is removed by means of the proposed noise deletion method. Then, we detect pedestrians through the projection algorithm. But, if pedestrians are very adjacent to each other, we separate them using RGB color information. And we track a specific pedestrian using RGB color information in center region of it. The experimental results on our test sequences demonstrated the high efficiency of our approach as it had shown detection success ratio of 97% and detection failure ratio of 3% and excellent tracking.

A Fast Search Algorithm for Sub-Pixel Motion Estimation (부화소 움직임 추정을 위한 고속 탐색 기법)

  • Park, Dong-Kyun;Jo, Seong-Hyeon;Cho, Hyo-Moon;Lee, Jong-Hwa
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.26-28
    • /
    • 2007
  • The motion estimation is the most important technique in the image compression of the video standards. In the case of next generation standards in the video codec as H.264, a high compression-efficiency can be also obtained by using a motion compensation. To obtain the accurate motion search, a motion estimation should be achieved up to 1/2 pixel and 1/4 pixel uiuts. To do this, the computational complexity is increased although the image compression rate is increased. Therefore, in this paper, we propose the advanced sub-pixel block matching algorithm to reduce the computational complexity by using a statistical characteristics of SAD(Sum of Absolute Difference). Generally, the probability of the minimum SAD values is high when searching point is in the distance 1 from the reference point. Thus, we reduced the searching area and then we can overcome the computational complexity problem. The main concept of proposed algorithm, which based on TSS(Three Step Search) method, first we find three minimum SAD points which is in integer distance unit, and then, in second step, the optimal point is in 1/2 pixel unit either between the most minimum SAD value point and the second minimum SAD point or between the most minimum SAD value point and the third minimum SAD point In third step, after finding the smallest SAD value between two SAD values on 1/2 pixel unit, the final optimized point is between the most minimum SAD value and the result value of the third step, in 1/2 pixel unit i.e., 1/4 pixel unit in totally. The conventional TSS method needs an eight.. search points in the sub-pixel steps in 1/2 pixel unit and also an eight search points in 1/4 pixel, to detect the optimal point. However, in proposed algorithm, only total five search points are needed. In the result. 23 % improvement of processing speed is obtained.

  • PDF

Direction-Oriented Fast Full Search Algorithm at the Divided Search Range (세분화된 탐색 범위에서의 방향 지향적 전영역 고속 탐색 알고리즘)

  • Lim, Dong-Young;Park, Sang-Jun;Jeong, Je-Chang
    • Journal of Broadcast Engineering
    • /
    • v.12 no.3
    • /
    • pp.278-288
    • /
    • 2007
  • We propose the fast full search algorithm that reduces the computational load of the block matching algorithm which is used for a motion estimation in the video coding. Since the conventional spiral search method starts searching at the center of the search window and then moves search point to estimate the motion vector pixel by pixel, it is good for the slow motion picture. However we proposed the efficient motion estimation method which is good for the fast and slow motion picture. Firstly, when finding the initial threshold value, we use the expanded predictor that can approximately calculate minimum threshold value. The proposed algorithm estimates the motion in the new search order after partitioning the search window and adapt the directional search order in the re-divided search window. At the result, we can check that the proposed algorithm reduces the computational load 94% in average compared to the conventional spiral full search algorithm without any loss of image quality.

Object Tracking System for Additional Service Providing under Interactive Broadcasting Environment (대화형 방송 환경에서 부가서비스 제공을 위한 객체 추적 시스템)

  • Ahn, Jun-Han;Byun, Hye-Ran
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.1
    • /
    • pp.97-107
    • /
    • 2002
  • In general, under interactive broadcasting environment, user finds additional service using top-down menu. However, user can't know that additional service provides information until retrieval has finished and top-down menu requires multi-level retrieval. This paper proposes the new method for additional service providing not using top-down menu but using object selection. For the purpose of this method, the movie of a MPEG should be synchronized with the object information(position, size, shape) and object tracking technique is required. Synchronization technique uses the Directshow provided by the Microsoft. Object tracking techniques use a motion-based tracking and a model-based tracking together. We divide object into two parts. One is face and the other is substance. Face tracking uses model-based tracking and Substance uses motion-based tracking base on the block matching algorithm. To improve precise tracking, motion-based tracking apply the temporal prediction search algorithm and model-based tracking apply the face model which merge ellipse model and color model.