• Title/Summary/Keyword: Color Quantization

Search Result 99, Processing Time 0.021 seconds

A New Document Codec System based on Wavelet Lifting and Bitplane Coding (웨이블릿 리프팅과 비트평면 부호화에 기반한 새로운 문서 코덱 시스템)

  • 이호석
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.5
    • /
    • pp.805-815
    • /
    • 2003
  • In this paper, we present the development of document compression codec using segmentation, wavelet lifting and bitplane coding. We use the segmentation to preserve the text appearance. We performed integer-to-integer wavelet lifting and also performed bitplane subblock coding for document compression. We acquired a high compression ratio and an efficient compression by encoding only the significant subblocks in the bitplane subblock coding. We also implemented scalar quantization by subband-oriented bit shifting. The system performs color conversion and downsampling before wavelet lifting and also performs graycode conversion and quantization before subblock coding. In the experiment, we show the performances of the system by presenting the high compression ratios and high PSNR values.

  • PDF

Integrating Color, Texture and Edge Features for Content-Based Image Retrieval (내용기반 이미지 검색을 위한 색상, 텍스쳐, 에지 기능의 통합)

  • Ma Ming;Park Dong-Won
    • Science of Emotion and Sensibility
    • /
    • v.7 no.4
    • /
    • pp.57-65
    • /
    • 2004
  • In this paper, we present a hybrid approach which incorporates color, texture and shape in content-based image retrieval. Colors in each image are clustered into a small number of representative colors. The feature descriptor consists of the representative colors and their percentages in the image. A similarity measure similar to the cumulative color histogram distance measure is defined for this descriptor. The co-occurrence matrix as a statistical method is used for texture analysis. An optimal set of five statistical functions are extracted from the co-occurrence matrix of each image, in order to render the feature vector for eachimage maximally informative. The edge information captured within edge histograms is extracted after a pre-processing phase that performs color transformation, quantization, and filtering. The features where thus extracted and stored within feature vectors and were later compared with an intersection-based method. The content-based retrieval system is tested to be effective in terms of retrieval and scalability through experimental results and precision-recall analysis.

  • PDF

Content-Based Image Retrieval using Region Feature Vector (영역 특징벡터를 이용한 내용기반 영상검색)

  • Kim Dong-Woo;Song Young-Jun;Kim Young-Gil;Ah Jae-Hyeong
    • The KIPS Transactions:PartB
    • /
    • v.13B no.1 s.104
    • /
    • pp.47-52
    • /
    • 2006
  • This paper proposes a method of content-based image retrieval using region feature vector in order to overcome disadvantages of existing color histogram methods. The color histogram methods have a weak point that reduces accuracy because of quantization error, and more. In order to solve this, we convert color information to HSV space and quantize hue factor being purecolor information and calculate histogram and then use thus for retrieval feature that is robust in brightness, movement, and rotation. Also we solve an insufficient part that is the most serious problem in color histogram methods by dividing an image into sixteen regions and then comparing each region. We improve accuracy by edge and DC of DCT transformation. As a result of experimenting with 1,000 color images, the proposed method has showed better precision than the existing methods.

A Study on the YCbCr Color Model and the Rough Set for a Robust Face Detection Algorithm (강건한 얼굴 검출 알고리즘을 위한 YCbCr 컬러 모델과 러프 집합 연구)

  • Byun, Oh-Sung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.7
    • /
    • pp.117-125
    • /
    • 2011
  • In this paper, it was segmented the face color distribution using YCbCr color model, which is one of the feature-based methods, and preprocessing stage was to be insensitive to the sensitivity for light which is one of the disadvantages for the feature-based methods by the quantization. In addition, it has raised the accuracy of image synthesis with characteristics which is selected the object of the most same image as the shape of pattern using rough set. In this paper, the detection rates of the proposed face detection algorithm was confirmed to be better about 2~3% than the conventional algorithms regardless of the size and direction on the various faces by simulation.

An Efficient Data Processing Method to Improve the Geostationary Ocean Color Imager (GOCI) Data Service (천리안 해양관측위성의 배포서비스 향상을 위한 자료 처리 효율화 방안 연구)

  • Yang, Hyun;Oh, Eunsong;Han, Tai-Hyun;Han, Hee-Jeong;Choi, Jong-Kuk
    • Korean Journal of Remote Sensing
    • /
    • v.30 no.1
    • /
    • pp.137-147
    • /
    • 2014
  • We proposed and verified the methods to maintain data qualities as well as to reduce data volume for the Geostationary Ocean Color Imager (GOCI), the world's first ocean color sensor operated in geostationary orbit. For the GOCI level-2 data, 92.9% of data volume could be saved by only the data compression. For the GOCI level-1 data, however, just 20.7% of data volume could be saved by the data compression therefore another approach was required. First, we found the optimized number of bits per a pixel for the GOCI level-1 data from an idea that the quantization bit for the GOCI (i.e. 12 bit) was less than the number of bits per a pixel for the GOCI level-1 data (i.e. 32 bit). Experiments were conducted using the $R^2$ and the Modulation Transfer Function (MTF). It was quantitatively revealed that the data qualities were maintained although the number of bits per a pixel was reduced to 14. Also, we performed network simulations using the Network Simulator 2 (Ns2). The result showed that 57.7% of the end-toend delay for a GOCI level-1 data was saved when the number of bits per a pixel was reduced to 14 and 92.5% of the end-to-end delay for a GOCI level-2 data was saved when 92.9% of the data size was reduced due to the compression.

Emotion Recognition Using Color and Pattern in Textile Images (컬러와 패턴을 이용한 텍스타일 영상에서의 감정인식 시스템)

  • Shin, Yun-Hee;Kim, Young-Rae;Kim, Eun-Yi
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.154-161
    • /
    • 2008
  • In this paper, a novel method is proposed using color and pattern information for recognizing some emotions included in a fertile. Here we use 10 Kobayashi emotion to represent emotions. - { romantic, clear, natural, casual, elegant chic, dynamic, classic, dandy, modem } The proposed system is composed of feature extraction and classification. To transform the subjective emotions as physical visual features, we extract representative colors and Patterns from textile. Here, the representative color prototypes are extracted by color quantization method, and patterns exacted by wavelet transform followed by statistical analysis. These exacted features are given as input to the neural network (NN)-based classifiers, which decides whether or not a textile had the corresponding emotion. When assessing the effectiveness of the proposed system with 389 textiles collected from various application domains such as interior, fashion, and artificial ones. The results showed that the proposed method has the precision of 100% and the recall of 99%, thereby it can be used in various textile industries.

Extraction of Blood Flow of Brachial Artery on Color Doppler Ultrasonography by Using 4-Directional Contour Tracking and K-Means Algorithm (4 방향 윤곽선 추적과 K-Means 알고리즘을 이용한 색조 도플러 초음파 영상에서 상환 동맥의 혈류 영역 추출)

  • Park, Joonsung;Kim, Kwang Baek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.11
    • /
    • pp.1411-1416
    • /
    • 2020
  • In this paper, we propose a method of extraction analysis of blood flow area on color doppler ultrasonography by using 4-directional contour tracking and K-Means algorithm. In the proposed method, ROI is extracted and a binarization method with maximum contrast as a threshold is applied to the extracted ROI. 4-directional contour algorithm is applied to extract the trapezoid shaped region which has blood flow area of brachial artery from the binarized ROI. K-Means based quantization is then applied to accurately extract the blood flow area of brachial artery from the trapezoid shaped region. In experiment, the proposed method successfully extracts the target area in 28 out of 30 cases (93.3%) with field expert's verification. And comparison analysis of proposed K-Means based blood flow area extraction on 30 color doppler ultrasonography and brachial artery blood flow ultrasonography provided by a specialist yielded a result of 94.27% accuracy on average.

Improving CMD Areal Density Analysis: Algorithms and Strategies

  • Wilson, R.E.
    • Journal of Astronomy and Space Sciences
    • /
    • v.31 no.2
    • /
    • pp.121-130
    • /
    • 2014
  • Essential ideas, successes, and difficulties of Areal Density Analysis (ADA) for color-magnitude diagrams (CMD's) of resolved stellar populations are examined, with explanation of various algorithms and strategies for optimal performance. A CMD-generation program computes theoretical datasets with simulated observational error and a solution program inverts the problem by the method of Differential Corrections (DC) so as to compute parameter values from observed magnitudes and colors, with standard error estimates and correlation coefficients. ADA promises not only impersonal results, but also significant saving of labor, especially where a given dataset is analyzed with several evolution models. Observational errors and multiple star systems, along with various single star characteristics and phenomena, are modeled directly via the Functional Statistics Algorithm (FSA). Unlike Monte Carlo, FSA is not dependent on a random number generator. Discussions include difficulties and overall requirements, such as need for fast evolutionary computation and realization of goals within machine memory limits. Degradation of results due to influence of pixelization on derivatives, Initial Mass Function (IMF) quantization, IMF steepness, low Areal Densities ($\mathcal{A}$), and large variation in $\mathcal{A}$ are reduced or eliminated through a variety of schemes that are explained sufficiently for general application. The Levenberg-Marquardt and MMS algorithms for improvement of solution convergence are contained within the DC program. An example of convergence, which typically is very good, is shown in tabular form. A number of theoretical and practical solution issues are discussed, as are prospects for further development.

Content-based Image Retrieval Using Color Adjacency and Gradient (칼라 인접성과 기울기를 이용한 내용 기반 영상 검색)

  • Jin, Hong-Yan;Lee, Ho-Young;Kim, Hee-Soo;Kim, Gi-Seok;Ha, Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.1
    • /
    • pp.104-115
    • /
    • 2001
  • A new content-based color image retrieval method integrating the features of the color adjacency and the gradient is proposed in this paper. As the most used feature of color image, color histogram has its own advantages that it is invariant to the changes in viewpoint and the rotation of the image etc., and the computation of the feature is simple and fast. However, it is difficult to distinguish those different images having similar color distributions using histogram-based image retrieval, because the color histogram is generated on uniformly quantized colors and the histogram itself contains no spatial information. And another shortcoming of the histogram-based image retrieval is the storage of the features is usually very large. In order to prevent the above drawbacks, the gradient that is the largest color difference of neighboring pixels is calculated in the proposed method instead of the uniform quantization which is commonly used at most histogram-based methods. And the color adjacency information which indicates major color composition feature of an image is extracted and represented as a binary form to reduce the amount of feature storage. The two features are integrated to allow the retrieval more robust to the changes of various external conditions.

  • PDF

Recognition of Conducting Motion using HMM (HMM을 이용한 지휘 동작의 인식)

  • 문형득;구자영
    • Journal of the Korea Society of Computer and Information
    • /
    • v.9 no.1
    • /
    • pp.25-30
    • /
    • 2004
  • In this Paper, a beat recognition method from a sequence of images of conducting person was proposed. Hand position was detected using color discrimination, and symbolized by quantization. Then a motion of the conductor was represented as a sequence of symbols. HMM (Hidden Markov Model), which is excellent for recognition of sequence pattern with some level of variation, was used to recognize the sequence of symbols to be a motion for a beat.

  • PDF