• Title/Summary/Keyword: sub-pixel

Search Result 271, Processing Time 0.033 seconds

Sub-pixel Evaluation with Frequency Response Analysis

  • OKAMOTO Koji
    • 한국가시화정보학회:학술대회논문집
    • /
    • 2001.12a
    • /
    • pp.14-22
    • /
    • 2001
  • The frequency responses on the sub-pixel evaluation technique were investigated using the Monte-calro Simulation technique. The frequency response by the FFT based cross-correlation gives very good results, however, the gain loss does exist for the small displacement, (less than 0.5 pixel). While, the no gain loss is observed in the Direct Cross-correlation, however, the sub-pixel accuracy was limited to be about 0.1 pixel, i.e., it could not detect the small displacement. To detect the higher accurate sub-pixel displacement, the gradient based technique is the best. For the small interrogation area (e.g., 4x4), only the gradient technique can detect the small displacement correctly.

  • PDF

Sub-Pixel Analysis of Hyperspectral Image Using Linear Spectral Mixing Model and Convex Geometry Concept

  • Kim, Dae-Sung;Kim, Yong-Il;Lim, Young-Jae
    • Korean Journal of Geomatics
    • /
    • v.4 no.1
    • /
    • pp.1-8
    • /
    • 2004
  • In the middle-resolution remote sensing, the Ground Sampled Distance (GSD) that the detector senses and samples is generally larger than the actual size of the objects (or materials) of interest, and so several objects are embedded in a single pixel. In this case, as it is impossible to detect these objects by the conventional spatial-based image processing techniques, it has to be carried out at sub-pixel level through spectral properties. In this paper, we explain the sub-pixel analysis algorithm, also known as the Linear Spectral Mixing (LSM) model, which has been experimented using the Hyperion data. To find Endmembers used as the prior knowledge for LSM model, we applied the concept of the convex geometry on the two-dimensional scatter plot. The Atmospheric Correction and Minimum Noise Fraction techniques are presented for the pre-processing of Hyperion data. As LSM model is the simplest approach in sub-pixel analysis, the results of our experiment is not good. But we intend to say that the sub-pixel analysis shows much more information in comparison with the image classification.

  • PDF

Impervious Surface Estimation Area of Seom River Basin using Satellite Imagery and Sub-pixel Classifier (위성영상과 Sub-pixel 분류에 의한 섬강유역의 불투수율 추정)

  • Na, Sang-Il;Park, Jong-Hwa;Shin, Hyoung-Sub;Park, Jin-Ki;Baek, Shin-Chul
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2012.05a
    • /
    • pp.744-744
    • /
    • 2012
  • 불투수층은 자연적인 침투를 허용하지 않는 인위적인 토지피복상태로 도시화율 추정 및 유역의 환경변화 정도를 분석하기 위한 척도로 사용되어 왔다. 특히, 수문학적 관점에서 불투수층은 단기 유출현상에 큰 영향을 끼치는 요소로 불투수율이 증가할수록 침투량이 감소하여 첨두유출량은 증가하고 도달시간은 짧아진다. 최근에는 급속한 도시화로 인해 불투수층의 영향이 더욱 커짐에 따라 불투수율의 추정에 대한 필요성이 증가하고 있다. 현재까지 위성영상을 이용한 불투수층의 추정은 고해상도 영상을 이용하여 피복분류를 수행하였다. 즉, 분류된 토지피복에 근거하여 불투수율을 산술적으로 계산하거나 분광혼합기법 및 회귀 트리기법 등 다양한 방법에 적용되어 왔다. 본 연구에서는 Sub-pixel 분류기법을 위성영상에 적용하여 섬강유역의 불투수율을 추정하고자 한다. Sub-pixel 분류는 기존 분류기법들이 다양한 토지피복이 혼합된 화소에 대해서도 가장 비중이 높은 토지피복 하나로 분류하던 것을 개선한 방법으로 fuzzy 이론을 적용하여 최소 20% 이상의 비율을 점유하는 항목 모두를 구분하여 분류하는 기법이다. 이를 위해 섬강유역의 Landsat TM 영상을 수집하고 환경부의 토지피복도와 지질도를 참조하여 트레이닝 자료를 수집하였다. 또한 결과에 영향을 미칠 수 있는 구름은 전처리를 통하여 제거하고 수집된 트레이닝 자료에 Sub-pixel 분류기법을 적용하여 섬강유역의 불투수율을 공간분포도로 작성하였다.

  • PDF

Measurements of Impervious Surfaces - per-pixel, sub-pixel, and object-oriented classification -

  • Kang, Min Jo;Mesev, Victor;Kim, Won Kyung
    • Korean Journal of Remote Sensing
    • /
    • v.31 no.4
    • /
    • pp.303-319
    • /
    • 2015
  • The objectives of this paper are to measure surface imperviousness using three different classification methods: per-pixel, sub-pixel, and object-oriented classification. They are tested on high-spatial resolution QuickBird data at 2.4 meters (four spectral bands and three principal component bands) as well as a medium-spatial resolution Landsat TM image at 30 meters. To measure impervious surfaces, we selected 30 sample sites with different land uses and residential densities across image representing the city of Phoenix, Arizona, USA. For per-pixel an unsupervised classification is first conducted to provide prior knowledge on the possible candidate spectral classes, and then a supervised classification is performed using the maximum-likelihood rule. For sub-pixel classification, a Linear Spectral Mixture Analysis (LSMA) is used to disentangle land cover information from mixed pixels. For object-oriented classification several different sets of scale parameters and expert decision rules are implemented, including a nearest neighbor classifier. The results from these three methods show that the object-oriented approach (accuracy of 91%) provides more accurate results than those achieved by per-pixel algorithm (accuracy of 67% and 83% using Landsat TM and QuickBird, respectively). It is also clear that sub-pixel algorithm gives more accurate results (accuracy of 87%) in case of intensive and dense urban areas using medium-resolution imagery.

Study on the Reliability of an OLED Pixel Circuit Using Transient Simulation (과도상태 시뮬레이션을 사용한 OLED 픽셀 회로의 신뢰성 분석 방안 연구)

  • Jung, Taeho
    • Journal of the Semiconductor & Display Technology
    • /
    • v.20 no.4
    • /
    • pp.141-145
    • /
    • 2021
  • The brightness of the Organic Light Emitting Diode (OLED) display is controlled by thin-film transistors (TFTs). Regardless of the materials and the structures of TFTs, an OLED suffers from the instable threshold voltage (Vth) of a TFT during operation. When designing an OLED pixel with circuit simulation tool such as SPICE, a designer needs to take Vth shift into account to improve the reliability of the circuit and various compensation methods have been proposed. In this paper, the effect of the compensation circuits from two typical OLED pixel circuits proposed in the literature are studied by the transient simulation with a SPICE tool in which the stretched-exponential time dependent Vth shift function is implemented. The simulation results show that the compensation circuits improve the reliability at the beginning of each frame, but Vth shifts from all TFTs in a pixel need to be considered to improve long-time reliability.

A Fast Sub-pixel Motion Estimation Method for H.264 Video Compression (H.264 동영상 압축을 위한 부 화소 단위에서의 고속 움직임 추정 방법)

  • Lee, Yun-Hwa;Choi, Myung-Hoon;Shin, Hyun-Chul
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.4
    • /
    • pp.411-417
    • /
    • 2006
  • Motion Estimation (ME) is an important part of video coding process and it takes the largest amount of computation in video compression. Half-pixel and quarter-pixel motion estimation can improve the video compression rate at the cost of higher computational complexity In this paper, we suggest a new efficient low-complexity algorithm for half-pixel and quarter pixel motion estimation. It is based on the experimental results that the sum of absolute differences(SAD) shows parabolic shape and thus can be approximated by using interpolation techniques. The sub-pixel motion vector is searched from the minimum SAD integer-pixel motion vector. The sub-pixel search direction is determined toward the neighboring pixel with the lowest SAD among 8 neighbors. Experimental results show that more than 20% reduction in computation time can be achieved without affecting the quality of video.

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

Sub-pixel Point Spread function Estimation for Fully Digital Auto-Focusing System (완전디지털 자동초점 시스템 구현을 위한 부화소단위 점확산함수 추정)

  • 황성현;신정호;백준기
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.1727-1730
    • /
    • 2003
  • In this paper we propose a sub-pixel point spread function (PSF) estimation method for a fully digital auto-focusing system. We assume that the amount of out-of-focus is the same along the concentric circle. In order to estimate the accurate PSF, sub-pixel information is considered in the proposed PSF estimation procedure. The feasibility of the proposed algorithm is experimentally demonstrated.

  • PDF

Low-Complexity Sub-Pixel Motion Estimation Utilizing Shifting Matrix in Transform Domain

  • Ryu, Chul;Shin, Jae-Young;Park, Eun-Chan
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.4
    • /
    • pp.1020-1026
    • /
    • 2016
  • Motion estimation (ME) algorithms supporting quarter-pixel accuracy have been recently introduced to retain detailed motion information for high quality of video in the state-of-the-art video compression standard of H.264/AVC. Conventional sub-pixel ME algorithms in the spatial domain are faced with a common problem of computational complexity because of embedded interpolation schemes. This paper proposes a low-complexity sub-pixel motion estimation algorithm in the transform domain utilizing shifting matrix. Simulations are performed to compare the performances of spatial-domain ME algorithms and transform-domain ME algorithms in terms of peak signal-to-noise ratio (PSNR) and the number of bits per frame. Simulation results confirm that the transform-domain approach not only improves the video quality and the compression efficiency, but also remarkably alleviates the computational complexity, compared to the spatial-domain approach.

Sub-pixel Multiplexing for Autostereoscopic Full Parallax 3D (무안경 완전시차 입체 재현을 위한 서브픽셀 다중화)

  • Eum, Homin;Lee, Gwangsoon
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.12
    • /
    • pp.2009-2015
    • /
    • 2017
  • A two-dimensional lens is required to reproduce both the horizontal and vertical parallax through an autostereoscopic 3D display. Among the two-dimensional lenses, a hexagonal micro lens array (MLA) having good optical efficiency is mainly used. However, the hexagonal MLA has complex geometric features. The first feature is that the lens cells are zigzagged in the vertical direction, which should be reflected in the view number calculation for each sub-pixel. The second feature is that the four sides of a hexagonal lens cell are tilted, requiring a more careful view index assignment to the lens cell. In this paper, we propose a sub-pixel multiplexing scheme suitable for the features of the hexagonal MLA. We also propose a view-overlay algorithm based on a two-dimensional lens and compare subjective image quality with existing view-selection through autostereoscopic 3D display implementation.