• Title/Summary/Keyword: 픽셀

Search Result 1,791, Processing Time 0.028 seconds

A Design of Embedded LED Display Board Module and Control Unit which the Placement of Pixels is Free (픽셀 배치가 자유로운 임베디드 LED 전광판 모듈 및 제어장치 설계)

  • Lee, Bae-Kyu;Kim, Jung-Hwa
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.10
    • /
    • pp.135-141
    • /
    • 2013
  • In this paper, we installed three high brightness red, green, and blue LED in one socket and made one pixel unit. And we also developed the full-color display board module and control unit which can express various images such as text, graphics, video image with the combination of pixel units and a number of modules. LED display driver module have a driver circuit within the combination of the RGB pixel dot on unit area. These modules of the existing form can be high priced because of implementation a fixed resolution in specific space and installation space. To overcome these shortcomings, we developed a LED driver and LED pixel modules free in array at random pitch intervals. Display board module of this paper enabled to display smoothly video image which have many data processing quantity through dragging data speed up 36 frames per second. Also there are an effect which is provided more clear image because of improving the flickering of the existing display board.

An effective quality improvement scheme of magnified image using the surface characteristics in image (영상의 곡면 특성을 활용한 효과적인 확대영상의 화질 향상 기법)

  • Jung, Soo-Mok;On, Byung-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.8
    • /
    • pp.45-54
    • /
    • 2014
  • In this paper, we proposed an effective quality improvement scheme of magnified image using the surface characteristics in image. If the surface in image is estimated as simple convex surface or simple concave surface, the interpolated value can be calculated to have the surface characteristics by using the other method in the proposed scheme. The calculated value becomes the interpolated pixel value inmagnified image. So, themagnified image reflects the surface characteristics of the real image. If the surface is not estimated as simple convex surface or simple concave surface, the interpolated value is calculated more accurately than bilinear interpolation by using the method of the proposed scheme. The PSNR values of the magnified images using the proposed schemes are greater than those of the magnified images using the previous interpolation schemes.

Investigation of Ring Artifact Using Algebraic Reconstruction Technique (대수적 재구성 기법을 통한 링 아티팩트 조사)

  • Chon, Kwon Su
    • Journal of the Korean Society of Radiology
    • /
    • v.12 no.1
    • /
    • pp.65-70
    • /
    • 2018
  • Computed tomography system is widely used on various fields because section image of an object can be acquired. During several step to obtain section image, artifacts by many error factors can be added on the image. Ring artifact induced by the CT system is examined in this study. A test phantom of $512{\times}512$ size was constructed numerically, and the ring artifact was investigated by the algebraic reconstruction technique. The computer program was realized using Visual C++ under the fan beam geometry with projections of 720 and detector pixel of 1,280. The generation of ring artifact was verified by applying different detection efficiency on detector pixels. The ring intensity became large as increasing the ring value, and the ring artifacts were strongly emphasized near the center of the reconstructed image. The ring artifact may be eliminated by tracking the position of ring artifact on the reconstructed image and by calibrating the detector pixel.

Adaptive LSB Steganography for High Capacity in Spatial Color Images (컬러이미지 대상 고용량 적응형 LSB 스테가노그라피)

  • Lee, Haeyoung
    • Journal of the Korea Computer Graphics Society
    • /
    • v.24 no.1
    • /
    • pp.27-33
    • /
    • 2018
  • This paper presents a new adaptive LSB steganography for high capacity in spatial color images. The number of least signi ficant bit (LSB) of each RGB component in a color image pixel, to replace with the data bits to be hidden, was determine d through analysis of the worst case peak signal noise ratio (PSNR). In addition, the combination of the number of bits is determined adaptively according to image content. That is, 70% of the data to be hidden is proposed to be replaced with 3 bit LSB of two components, 2 bit LSB of the rest component, and 30% be replaced with 4 bit LSB of each RGB compon ent. To find edge areas in an image, delta sorting in local area is also suggested. Using the proposed method, the data cap acity is 9.2 bits per pixel (bpp). The average PSNR value of the tested images with concealed data of up to 60Kbyte was 43.9 db and also natural histograms were generated.

A New Design of Memory-in-Pixel with Modified S-R Flip-Flop for Low Power LCD Panel (저전력 LCD 패널을 위한 수정된 S-R 플립플롭을 가진 새로운 메모리-인-픽셀 설계)

  • Ryu, Jee-Youl;Noh, Seok-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.600-603
    • /
    • 2008
  • In this paper, a new circuit design named memory-in-pixel for low power consumption of the liquid crystal display (LCD) is presented. Since each pixel has a memory, it is able to express 8 color grades using the data saved in the memory without the operation of the gate and source driver ICs so that it can reduce the power consumption of the LCD panel. A memory circuit consists of modified S-R flip-flop (NAND-type) implemented in the pixel, which can supply AC bias for operating the liquid crystal (LC) with the interlocking clocks (CLK_A and CLK_B). This circuit is more complex than the inverter-type memory circuit, but it has lower power consumption of approximately 50% than the circuit. We have investigated the power consumption both NAND and inverter-type memory circuit using a Smart SPICE for the resolution of $96{\times}128$. The estimated power consumption of the inverter-type memory was about 0.037mW. On the other hand, the NAND-type memory showed power consumption of about 0.007mW.

  • PDF

Error Concealment Using Gradient Vectors in H.264 Decoder (H.264 디코더에서 기울기 벡터를 이용한 에러복원 방법)

  • Jeon Sung-Hoon;Yoo Jae-Myeong;Lee Guee-Sang
    • The KIPS Transactions:PartB
    • /
    • v.13B no.3 s.106
    • /
    • pp.197-204
    • /
    • 2006
  • Recent advances in information technology have resulted in rapid growth in the mobile communication. With this explosive growth, reliable transmission and error concealment technique become increasingly important to offer high quality multimedia services. In this paper, we propose an improved BMA(Boundary Matching Algorithm) method using gradient vectors to conceal channel errors in inter-frames of H.264 video images. General BMA method computes the sum of pixel differences of adjacent pixels of the candidate block and its neighbouring blocks, assuming that adjacent pixels have almost the same value. In real images, however, there exist some gradients, which means that the pixel values are increasing or decreasing in a specific direction. In this paper, we develop a precise estimation method of errors in candidates blocks using gradient information and try to recover lost blocks with this technique. Experimental results show the improvement of picture quality about $1{\sim}3dB$ compared to existing methods.

A New Confidence Measure for Eye Detection Using Pixel Selection (눈 검출에서의 픽셀 선택을 이용한 신뢰 척도)

  • Lee, Yonggeol;Choi, Sang-Il
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.4 no.7
    • /
    • pp.291-296
    • /
    • 2015
  • In this paper, we propose a new confidence measure using pixel selection for eye detection and design a hybrid eye detector. For this, we produce sub-images by applying a pixel selection method to the eye patches and construct the BDA(Biased Discriminant Analysis) feature space for measuring the confidence of the eye detection results. For a hybrid eye detector, we select HFED(Haar-like Feature based Eye Detector) and MFED(MCT Feature based Eye Detector), which are complementary to each other, as basic detectors. For a given image, each basic detector conducts eye detection and the confidence of each result is estimated in the BDA feature space by calculating the distances between the produced eye patches and the mean of positive samples in the training set. Then, the result with higher confidence is adopted as the final eye detection result and is used to the face alignment process for face recognition. The experimental results for various face databases show that the proposed method performs more accurate eye detection and consequently results in better face recognition performance compared with other methods.

The Clustering Threshold Image Processing Technique in fMRI (핵자기 뇌기능 영상에서 군집경계기법을 이용한 영상처리법)

  • Jeong, Sun-Cheol;No, Yong-Man;Jo, Jang-Hui
    • Journal of Biomedical Engineering Research
    • /
    • v.16 no.4
    • /
    • pp.425-430
    • /
    • 1995
  • The correlation technique has been widely used in ctRl data processing. The proposed CLT (clus- tering threshold) technique is a modified CCT (correlation coefficient threshold) technique and has many advantages compared with the conventional CCT technique. The CLT technique is explained by the following two steps. First, once the correlation coefficient map above the proper TH value is obtained using the CCT technique which is discrete and includes splash noise data, then the spurious pixels are rejected and the real neural activity pixels extracted using an nxn matrix box. Second, a clustering operation is performed by the two correction rules. The real neuronal activated pixels can be clustered and the false spurious pixels can be suppressed by the proposed CLT technique. The proposed CLT technique used in the post processing in ctRl has advantages over other existing techniques. It is especially proved to be robust in noisy environment.

  • PDF

Long Distance and High Resolution Three-Dimensional Scanning LIDAR with Coded Laser Pulse Waves (레이저 펄스 부호화를 이용한 원거리 고해상도 3D 스캐닝 라이다)

  • Kim, Gunzung;Park, Yongwan
    • Korean Journal of Optics and Photonics
    • /
    • v.27 no.4
    • /
    • pp.133-142
    • /
    • 2016
  • This paper presents the design and simulation of a three-dimensional pixel-by-pixel scanning light detection and ranging (LIDAR) system with a microelectromechanical system (MEMS) scanning mirror and direct sequence optical code division multiple access (DS-OCDMA) techniques. It measures a frame with $848{\times}480$ pixels at a refresh rate of 60 fps. The emitted laser pulse waves of each pixel are coded with DS-OCDMA techniques. The coded laser pulse waves include the pixel's position in the frame, and a checksum. The LIDAR emits the coded laser pulse waves periodically, without idle listening time to receive returning light at the receiver. The MEMS scanning mirror is used to deflect and steer the coded laser pulse waves to a specific target point. When all the pixels in a frame have been processed, the travel time is used by the pixel-by-pixel scanning LIDAR to generate point cloud data as the measured result.

Efficient Image Warping Mechanism Using Template Matching and Partial Warping (템플릿 매칭과 부분 워핑을 이용한 효율적인 원근 영상 워핑 기법)

  • Jeong, Dae-Heon;Cho, Tai-Hoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.05a
    • /
    • pp.339-342
    • /
    • 2017
  • Geometric transform of an image is used to image correction. Ridid-Body, Simlilary transform, etc, many correction methods are exist in computer vision. Image warping is used to correction for image with perspective. To image warping I extracted 4 feature point about warping position. But It is difficult to extract 4 points accurately and warping result with these point is occurs error over 3 or 4 pixel at warping position. So I used template matching to extract 4 points correctly and selected repeatedly 2 points of 4 points because to confirm result correctly. positions of 2 points are changed in near of 3 by 3 pixel and warped each change. So I selected optimal 4 points with a error of less than 1 pixel and finally, warped image using optimal points. For this way is possible to obtain optimum result.

  • PDF