• Title/Summary/Keyword: 256색 팔레트

Search Result 3, Processing Time 0.017 seconds

Development of Assistive Software for color blind to Electronic Documents (전자문서용 색각 장애 보정 소프트웨어 개발)

  • Jang, Young-Gun
    • The KIPS Transactions:PartB
    • /
    • v.10B no.5
    • /
    • pp.535-542
    • /
    • 2003
  • This study is concerned with an assistive technology which reduces color blinds´s confusion when they access electronic documents including color objects in their computers. In this study, 1 restrict the assistive technology would apply to windows operating system, 256 color mode and implement to minimize color distortion which occurs in multi window environments because of color approximation process. As a basic palette, I use a 216 colors web safe palette which the Christine proposed as a standard for color blind, expand it to 256 colors to apply all computer displays using Microsoft Windows as its operating system and implement it as windows application. To test its effectiveness, I use a simulator for dichromats, as results of the test, the developed color vision deficiency correction S/W is effective to reduce the confusion. It is more effective to use the implemented S/W in both of design and client process for electronic documents.

The Improved Binary Tree Vector Quantization Using Spatial Sensitivity of HVS (인간 시각 시스템의 공간 지각 특성을 이용한 개선된 이진트리 벡터양자화)

  • Ryu, Soung-Pil;Kwak, Nae-Joung;Ahn, Jae-Hyeong
    • The KIPS Transactions:PartB
    • /
    • v.11B no.1
    • /
    • pp.21-26
    • /
    • 2004
  • Color image quantization is a process of selecting a set of colors to display an image with some representative colors without noticeable perceived difference. It is very important in many applications to display a true color image in a low cost color monitor or printer. The basic problem is how to display 256 colors or less colors, called color palette, In this paper, we propose improved binary tree vector quantization based on spatial sensitivity which is one of the human visual properties. We combine the weights based on the responsibility of human visual system according to changes of three Primary colors in blocks of images with the process of splitting nodes using eigenvector in binary tree vector quantization. The test results show that the proposed method generates the quantized images with fine color and performs better than the conventional method in terms of clustering the similar regions. Also the proposed method can get the better result in subjective quality test and WSNR.

An Effcient Lossless Compression Algorithm using Arithmetic Coding for Indexed Color lmage (산술부호화를 이용한 인덱스 칼라 이미지에서의 효율적인 무손실 압축 방법)

  • You Kang-Soo;Lee Han-Jeong;Jang Euee S.;Kwak Hoon-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.1C
    • /
    • pp.35-43
    • /
    • 2005
  • This paper introduces a new algorithm to improve compression performance of 256 color images called palette-based or indexed images. The proposed scheme counts each frequency of index values after present index value and determines each rank for every index value by sorting them in descending order. Then, the scheme makes ranked index image instead of original indexed image using the way to replace index values with ranks. In the ranked index image's distribution produced as a result of this algorithm, the higher ranked index value, the more present same values. Therefore, data redundancy will be raised and more efficient performance of compression can be expected. Simulation results verify that because of higher compression ratio by up to 22.5, this newly designed algorithm shows a much better performance of compression in comparison with the arithmetic coding, intensity-based JPEG-LS and palette-based GIF.