• Title/Summary/Keyword: 화소값

Search Result 809, Processing Time 0.029 seconds

Intra Prediction Method by Quadric Surface Modeling for Depth Video (깊이 영상의 이차 곡면 모델링을 통한 화면 내 예측 방법)

  • Lee, Dong-seok;Kwon, Soon-kak
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.27 no.2
    • /
    • pp.35-44
    • /
    • 2022
  • In this paper, we propose an intra-picture prediction method by a quadratic surface modeling method for depth video coding. The pixels of depth video are transformed to 3D coordinates using distance information. A quadratic surface with the smallest error is found by least square method for reference pixels. The reference pixel can be either the upper pixels or the left pixels. In the intra prediction using the quadratic surface, two predcition values are computed for one pixel. Two errors are computed as the square sums of differences between each prediction values and the pixel values of the reference pixels. The pixel sof the block are predicted by the reference pixels and prediction method that they have the lowest error. Comparing with the-state-of-art video coding method, simulation results show that the distortion and the bit rate are improved by up to 5.16% and 5.12%, respectively.

Viola-Jones Object Detection Algorithm Using Rectangular Feature (사각 특징을 추가한 Viola-Jones 물체 검출 알고리즘)

  • Seo, Ji-Won;Lee, Ji-Eun;Kwak, No-Jun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.49 no.3
    • /
    • pp.18-29
    • /
    • 2012
  • Viola-Jones algorithm, a very effective real-time object detection method, uses Haar-like features to constitute weak classifiers. A Haar-like feature is made up of at least two rectangles each of which corresponds to either positive or negative areas and the feature value is computed by subtracting the sum of pixel values in the negative area from that of pixel values in the positive area. Compared to the conventional Haar-like feature which is made up of more than one rectangle, in this paper, we present a couple of new rectangular features whose feature values are computed either by the sum or by the variance of pixel values in a rectangle. By the use of these rectangular features in combination with the conventional Haar-like features, we can select additional features which have been excluded in the conventional Viola-Jones algorithm where every features are the combination of contiguous bright and dark areas of an object. In doing so, we can enhance the performance of object detection without any computational overhead.

Extraction of Changed Pixels for Hyperion Hyperspectral Images Using Range Average Based Buffer Zone Concept (구간평균 그래프 기반의 버퍼존 개념을 적용한 Hyperion 초분광영상의 변화화소 추출)

  • Kim, Dae-Sung;Pyen, Mu-Wook
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.29 no.5
    • /
    • pp.487-496
    • /
    • 2011
  • This study is aimed to perform more reliable unsupervised change detection through the re-extraction of the changed pixels which were extracted with global thresholding by applying buffer zone concept. First, three buffer zone was divided on the basis of the thresholding value which was determined using range average and the maximum distance point from a straight line. We re-extracted the changed pixels by performing unsupervised classification for buffer zone II which consists of changed pixels and unchanged pixels. The proposed method was implemented in Hyperion hyperspectral images and evaluated comparing to the existing global thresholding method. The experimental results demonstrated that the proposed method performed more accuracy change detection for vegetation area even if extracted slightly more changed pixels.

The Modified Mean Filter to Remove AWGN (AWGN 제거를 위한 변형된 평균필터)

  • Gao, Yinyu;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.5
    • /
    • pp.1177-1182
    • /
    • 2011
  • The image signals are corrupted by various noises in signal processing and the noises caused the degradation phenomenon. gaussian noise occurs in the process of transmission. Many studies are being accomplished to restore those signals which corrupted by additive gaussian noise. In this paper, the algorithm is proposed to remove AWGN. The algorithm first calculates the mask's standard deviation and next according to the thresholds separated as three levels, then calculates the weight which for different location in the mask's pixels. At last the mean value of the modified mean filter's is the output. Also we compare existing methods through the simulation and using PSNR as the standard of judgement of improvement effect.

Automatic Determination of Matching Window Size Using Histogram of Gradient (그레디언트 히스토그램을 이용한 정합 창틀 크기의 자동적인 결정)

  • Ye, Chul-Soo;Moon, Chang-Gi
    • Korean Journal of Remote Sensing
    • /
    • v.23 no.2
    • /
    • pp.113-117
    • /
    • 2007
  • In this paper, we propose a new method for determining automatically the size of the matching window using histogram of the gradient in order to improve the performance of stereo matching using one-meter resolution satellite imagery. For each pixel, we generate Flatness Index Image by calculating the mean value of the vertical or horizontal intensity gradients of the 4-neighbors of every pixel in the entire image. The edge pixel has high flatness index value, while the non-edge pixel has low flatness index value. By using the histogram of the Flatness Index Image, we find a flatness threshold value to determine whether a pixel is edge pixel or non-edge pixel. If a pixel has higher flatness index value than the flatness threshold value, we classify the pixel into edge pixel, otherwise we classify the pixel into non-edge pixel. If the ratio of the number of non-edge pixels in initial matching window is low, then we consider the pixel to be in homogeneous region and enlarge the size of the matching window We repeat this process until the size of matching window reaches to a maximum size. In the experiment, we used IKONOS satellite stereo imagery and obtained more improved matching results than the matching method using fixed matching window size.

Environment Implementation of Real-time Supervisory System Using Motion Detection Method (동작 검출 기법을 이용한 실시간 감시시스템의 구현)

  • 김형균;고석만;오무송
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.999-1002
    • /
    • 2003
  • In this study, embodied supervisory system that apply motion detection technique to small web camera and detects watch picture. Motion detection technique that use pixel value of car image that use in existing need memory to store background image. Also, there is sensitive shortcoming at increase of execution time by data process of pixel unit and noise. Suggested technique that compare extracting motion information by block unit to do to have complexion that solve this shortcoming and is strong at noise. Because motion information by block compares block characteristic value of image without need frame memory, store characteristic cost by block of image. Also, can get effect that reduce influence about noise and is less sensitive to flicker etc.. of camera more than motion detection that use pixel value in process that find characteristic value by block unit.

  • PDF

Image Segment-Based Stereo Matching for Improving Boundary Accuracy (경계영역 정확도 향상을 위한 영상분할 기반 스테레오 매칭)

  • Mun, Ji-Hun;Ho, Yo-Sung
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2015.11a
    • /
    • pp.63-66
    • /
    • 2015
  • 3차원 영상을 생성하기 위해 스테레오 매칭을 통해 깊이 정보를 획득한다. 이때 발생하는 경계영역과 텍스처가 부족한 부분의 깊이정보 부정확성 문제를 해결하기 위해 영상 분할 기반 스테레오 매칭 방법을 제안한다. 일반적으로 사용하는 윈도우 기반 스테레오 매칭 결과를 기반으로 분할된 영상 내에서 최적의 변위 값을 재 할당함으로서 깊이정보의 정확성을 향상시킬 수 있다. Mean-shift는 참조 영상에서 화소 간 평균값 차이가 최대가 되는 영역들을 반복적으로 찾는다. 유사한 평균값을 갖는 영역들을 기반으로 영상을 분할하는 것을 Mean-shift를 이용한 영상분할 이라고 한다. 분할된 영상은 각 영역을 대표하는 패치 구조를 가지고 있어 참조 영상에 포함되어있는 잡음에 강인한 특성을 지닌다. 스테레오 매칭을 통해 화소별로 변위 값을 할당해주는 대신, 분할된 영상을 이용하여 각 분할 영역에 동일한 변위 값을 할당한다. 분할된 영상에 동일한 변위 정보를 할당할 경우 객체와 배경의 경계영역에서 잘못된 변위 값이 할당되는 경우가 발생한다. 이러한 경계 영역의 변위정보 부정확성을 보완하기 위해 화소의 기울기 항을 비용 값 계산 과정에 추가하여 단점을 보완한다. 최종 비용 값 계산을 통해 획득한 초기 변위 지도에 중간 값 필터를 적용하여 분류된 영역에 동일한 변위 값을 할당한다. 제안한 방법을 적용하여 경계영역의 정확도가 향상된 최종 변위 지도를 획득한다.

  • PDF

Background Generation using Temporal and Spatial Information of Pixels (시간축과 공간축 화소 정보를 이용한 배경 생성)

  • Cho, Sang-Hyun;Kang, Hang-Bong
    • The KIPS Transactions:PartB
    • /
    • v.17B no.1
    • /
    • pp.15-22
    • /
    • 2010
  • Background generation is very important for accurate object tracking in video surveillance systems. Traditional background generation techniques have some problems with non-moving objects for longer periods. To overcome this problem, we propose a newbackground generation method using mean-shift and Fast Marching Method (FMM) to use pixel information along temporal and spatial dimensions. The mode of pixel value density along time axis is estimated by mean-shift algorithm and spatial information is evaluated by FMM, and then they are used together to generate a desirable background in the existence of non-moving objects during longer period. Experimental results show that our proposed method is more efficient than the traditional method.

Bar Code Location Algorithm Using Pixel Gradient and Labeling (화소의 기울기와 레이블링을 이용한 효율적인 바코드 검출 알고리즘)

  • Kim, Seung-Jin;Jung, Yoon-Su;Kim, Bong-Seok;Won, Jong-Un;Won, Chul-Ho;Cho, Jin-Ho;Lee, Kuhn-Il
    • The KIPS Transactions:PartD
    • /
    • v.10D no.7
    • /
    • pp.1171-1176
    • /
    • 2003
  • In this paper, we propose an effective bar code detection algorithm using the feature analysis and the labeling. After computing the direction of pixels using four line operators, we obtain the histogram about the direction of pixels by a block unit. We calculate the difference between the maximum value and the minimum value of the histogram and consider the block that have the largest difference value as the block of the bar code region. We get the line passing by the bar code region with the selected block but detect blocks of interest to get the more accurate line. The largest difference value is used to decide the threshold value to obtain the binary image. After obtaining a binary image, we do the labeling about the binary image. Therefore, we find blocks of interest in the bar code region. We calculate the gradient and the center of the bar code with blocks of interest, and then get the line passing by the bar code and detect the bar code. As we obtain the gray level of the line passing by the bar code, we grasp the information of the bar code.

Character Region and Picture Extraction of Passport Image (여권 인식을 위한 영상 및 문자 영역 추출)

  • Kim Tae Jong;Kwon Young Bin
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.11a
    • /
    • pp.825-828
    • /
    • 2004
  • 본 논문에서는 여권 인식 시스템을 위한 전처리 단계로 스캔된 여권 영상에서 문자 영역을 추출하는 방법에 대해 제안하였다. 인식에 필요한 문자 영역을 흑 화소로 나머지 영역은 휜 화소로 이진화하기 위해서 문자의 RGB 값을 이용하였다. 이진화하는 임계 값을 자동으로 결정하기 위하여 MRZ 의 일부 영역을 사용하였다. 이진화된 영상에서 비문자 영역인 사진 영역을 제거하기 위하여 가로/세로 프로파일을 수행한다. 결과 값을 분석하여 사진 영역을 결정하고 제거하여 여권 상에서 문자 영역 추출이 가능하였다.

  • PDF