• Title/Summary/Keyword: pixel based matching

Search Result 158, Processing Time 0.026 seconds

Contour Shape Matching based Motion Vector Estimation for Subfield Gray-scale Display Devices (서브필드계조방식 디스플레이 장치를 위한 컨투어 쉐이프 매칭 기반의 모션벡터 추정)

  • Choi, Im-Su;Kim, Jae-Hee
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.327-328
    • /
    • 2007
  • A contour shape matching based pixel motion estimation is proposed. The pixel motion information is very useful to compensate the motion artifact generated at the specific gray level contours in the moving image for subfield gray-scale display devices. In this motion estimation method, the gray level boundary contours are extracted from the input image. Then using contour shape matching, the most similar contour in next frame is found, and the contour is divided into segment unit. The pixel motion vector is estimated from the displacement of the each segment in the contour by segment matching. From this method, more precise motion vector can be estimated and this method is more robust to image motion with rotation or from illumination variations.

  • PDF

A stereo matching algorithm in pixel-based disparity space image (화소기반 변이공간영상에서의 스테레오 정합)

  • 김철환;이호근;하영호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.6C
    • /
    • pp.848-856
    • /
    • 2004
  • In this paper, a fast stereo matching algorithm based on pixel-wise matching strategy, which can get a stable and accurate disparity map, is proposed. Since a stereo image pair has small differences each other and the differences between left and right images are just caused by horizontal shifts with some order, the matching using a large window will not be needed within a given search range. However, disparity results of conventional pixel-based matching methods are somewhat unstable and wrinkled, the principal direction of disparities is checked by the accumulated cost along a path on array with the dynamic programming method. Experimental results showed that the proposed method could remove almost all disparity noise and set a good quality disparity map in very short time.

3D VISION SYSTEM FOR THE RECOGNITION OF FREE PARKING SITE LOCATION

  • Jung, H.G.;Kim, D.S.;Yoon, P.J.;Kim, J.H.
    • International Journal of Automotive Technology
    • /
    • v.7 no.3
    • /
    • pp.361-367
    • /
    • 2006
  • This paper describes a novel stereo vision based localization of free parking site, which recognizes the target position of automatic parking system. Pixel structure classification and feature based stereo matching extract the 3D information of parking site in real time. The pixel structure represents intensity configuration around a pixel and the feature based stereo matching uses step-by-step investigation strategy to reduce computational load. This paper considers only parking site divided by marking, which is generally drawn according to relevant standards. Parking site marking is separated by plane surface constraint and is transformed into bird's eye view, on which template matching is performed to determine the location of parking site. Obstacle depth map, which is generated from the disparity of adjacent vehicles, can be used as the guideline of template matching by limiting search range and orientation. Proposed method using both the obstacle depth map and the bird's eye view of parking site marking increases operation speed and robustness to visual noise by effectively limiting search range.

Fast Detection of Copy-Move Forgery Image using DCT

  • Shin, Yong-Dal
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.4
    • /
    • pp.411-417
    • /
    • 2013
  • In this paper, we proposed a fast detection method of copy-move forgery image based on low frequency coefficients of the DCT coefficients. We proposed a new matching criterion of copy-moved forgery image detection (MCD) using discrete cosine transform. For each $8{\times}8$ pixel block, the DCT transform is calculated. Our algorithm uses low frequency four (DC, 3 AC coefficient) and six coefficients (DC, 5 AC coefficients) of DCT per $8{\times}8$ pixel block. Our algorithm worked block matching for DCT coefficients of the $8{\times}8$ pixel block is slid by one pixel along the image from the upper left corner to the lower right corner. Our algorithm can reduce computational complexity more than conventional copy moved forgery detection algorithms.

Stereo matching algorithm based on systolic array architecture using edges and pixel data (에지 및 픽셀 데이터를 이용한 어레이구조의 스테레오 매칭 알고리즘)

  • Jung, Woo-Young;Park, Sung-Chan;Jung, Hong
    • Proceedings of the KIEE Conference
    • /
    • 2003.11c
    • /
    • pp.777-780
    • /
    • 2003
  • We have tried to create a vision system like human eye for a long time. We have obtained some distinguished results through many studies. Stereo vision is the most similar to human eye among those. This is the process of recreating 3-D spatial information from a pair of 2-D images. In this paper, we have designed a stereo matching algorithm based on systolic array architecture using edges and pixel data. This is more advanced vision system that improves some problems of previous stereo vision systems. This decreases noise and improves matching rate using edges and pixel data and also improves processing speed using high integration one chip FPGA and compact modules. We can apply this to robot vision and automatic control vehicles and artificial satellites.

  • PDF

Modified Weight Filter Algorithm using Pixel Matching in AWGN Environment (AWGN 환경에서 화소매칭을 이용한 변형된 가중치 필터 알고리즘)

  • Cheon, Bong-Won;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.10
    • /
    • pp.1310-1316
    • /
    • 2021
  • Recently, with the development of artificial intelligence and IoT technology, the importance of video processing such as object tracking, medical imaging, and object recognition is increasing. In particular, the noise reduction technology used in the preprocessing process demands the ability to effectively remove noise and maintain detailed features as the importance of system images increases. In this paper, we provide a modified weight filter based on pixel matching in an AWGN environment. The proposed algorithm uses a pixel matching method to maintain high-frequency components in which the pixel value of the image changes significantly, detects areas with highly relevant patterns in the peripheral area, and matches pixels required for output calculation. Classify the values. The final output is obtained by calculating the weight according to the similarity and spatial distance between the matching pixels with the center pixel in order to consider the edge component in the filtering process.

A Stereo Matching Algorithm with Projective Distortion of Variable Windows (가변 윈도우의 투영왜곡을 고려한 스테레오 정합 알고리듬)

  • Kim, Gyeong-Beom;Jeong, Seong-Jong
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.25 no.3
    • /
    • pp.461-469
    • /
    • 2001
  • Existing area-based stereo algorithms rely heavily on rectangular windows for computing correspondence. While the algorithms with the rectangular windows are efficient, they generate relatively large matching errors due to variations of disparity profiles near depth discontinuities and doesnt take into account local deformations of the windows due to projective distortion. In this paper, in order to deal with these problems, a new correlation function with 4 directional line masks, based on robust estimator, is proposed for the selection of potential matching points. These points is selected to consider depth discontinuities and reduce effects on outliers. The proposed matching method finds an arbitrarily-shaped variable window around a pixel in the 3d array which is constructed with the selected matching points. In addition, the method take into account the local deformation of the variable window with a constant disparity, and perform the estimation of sub-pixel disparities. Experiments with various synthetic images show that the proposed technique significantly reduces matching errors both in the vicinity of depth discontinuities and in continuously smooth areas, and also does not be affected drastically due to outlier and noise.

Performance Analysis of Matching Cost Functions of Stereo Matching Algorithm for Making 3D Contents (3D 콘텐츠 생성에서의 스테레오 매칭 알고리즘에 대한 매칭 비용 함수 성능 분석)

  • Hong, Gwang-Soo;Jeong, Yeon-Kyu;Kim, Byung-Gyu
    • Convergence Security Journal
    • /
    • v.13 no.3
    • /
    • pp.9-15
    • /
    • 2013
  • Calculating of matching cost is an important for efficient stereo matching. To investigate the performance of matching process, the concepts of the existing methods are introduced. Also we analyze the performance and merits of them. The simplest matching costs assume constant intensities at matching image locations. We consider matching cost functions which can be distinguished between pixel-based and window-based approaches. The Pixel-based approach includes absolute differences (AD) and sampling-intensitive absolute differences (BT). The window-based approach includes the sum of the absolute differences, the sum of squared differences, the normalized cross-correlation, zero-mean normalized cross-correlation, census transform, and the absolute differences census transform (AD-Census). We evaluate matching cost functions in terms of accuracy and time complexity. In terms of the accuracy, AD-Census method shows the lowest matching error ratio (the best solution). The ZNCC method shows the lowest matching error ratio in non-occlusion and all evaluation part. But it performs high matching error ratio at the discontinuities evaluation part due to blurring effect in the boundary. The pixel-based AD method shows a low complexity in terms of time complexity.

The Image Measuring System for accurate calibration-matching in objects (정밀 켈리브레이션 정합을 위한 화상측징계)

  • Kim, Jong-Man
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2006.11a
    • /
    • pp.357-358
    • /
    • 2006
  • Accurate calibration matching for maladjusted stereo cameras with calibrated pixel distance parameter is presented. The camera calibration is a necessary procedure for stereo vision-based depth computation. Intra and extra parameters should be obtain to determine the relation between image and world coordination through experiment. One difficulty is in camera alignment for parallel installation: placing two CCD arrays in a plane. No effective methods for such alignment have been presented before. Some amount of depth error caused from such non-parallel installation of cameras is inevitable. If the pixel distance parameter which is one of Intra parameter is calibrated with known points, such error can be compensated in some amount and showed the variable experiments for accurate effects.

  • PDF

Disparity Gradient-Based New Semi-Global Matching for Accurate Stereo Disparity (정확한 스테레오 시차를 위한 시차기울기 기반의 새로운 SGM)

  • Cha, Mi-Hye;Park, Jeong-Min;Lee, Joon-Woong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.1
    • /
    • pp.46-52
    • /
    • 2016
  • We propose a new type of semi-global matching (SGM) in order to solve a streaking problem arising from conventional SGM. Conventional SGM imposes a penalty to a pixel when the disparity of the pixel differs from that of the previous pixel along a scan path, and thus, disparity changes are not easily allowed, causing the streaking effect. The road surface is an appropriate target for such an effect, because the colors of the surfaces are very similar, and the image pixels corresponding to the surfaces show disparities that change very smoothly along the viewing direction. In contrast to conventional SGM, the new type of SGM imposes penalties depending on the disparity gradients, and thus, the streaking effect is controlled. The experimental results show the effectiveness of the proposed SGM method.