• Title/Summary/Keyword: Data quantization

Search Result 348, Processing Time 0.023 seconds

The Method to Estimate Quality Degradation from Information Hiding in JPEG Compression Environment (JPEG 압축 환경의 정보은닉에서 영상 질 저하 예측방법)

  • Choi, Yong-Soo;Kim, Hyoung-Joong;Lee, Dal-Ho
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.551-555
    • /
    • 2008
  • In these days, compressed file is useful in internet environment and has many advantages. So a lot of data hiding algorithms works on JPEG compressed file. Of course they know basic rules of transformation and quantization and they utilize those rules to implement their programming. But most of them evaluate the affection of data hiding after data modification. We propose how to predict the affection of data modification in course of data hiding process. Through some kind of experiments, several valuable facts are revealed which used in data hiding in compressed domain such as JPEG. These facts will improve existing data hiding algorithms (F3, F4 and F5 which including Matrix Encoding)[1],[5],[6].

  • PDF

The Modeling of the Optimal Data Format for JPEG2000 CODEC on the Fixed Compression Ratio (고정 압축률에서의 JPEG2000 코덱을 위한 최적의 데이터 형식 모델링)

  • Kang, Chang-Soo;Seo, Choon-Weon
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.1257-1260
    • /
    • 2005
  • This paper is related to optimization in the image data format, which can make a great effect in performance of data compression and is based on the wavelet transform and JPEG2000. This paper established a criterion to decide the data format to be used in wavelet transform, which is on the bases of the data errors in frequency transform and quantization. This criterion has been used to extract the optimal data format experimentally. The result were (1, 9) of 10-bit fixed-point format for filter coefficients and (9, 7) of 16-bit fixed-point data format for wavelet coefficients and their optimality was confirmed.

  • PDF

Fast Local Indoor Map Building Using a 2D Laser Range Finder (2차원 레이저 레이진 파이더를 이용한 빠른 로컬 실내 지도 제작)

  • Choi, Ung;Koh, Nak-Yong;Choi, Jeong-Sang
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 1999.10a
    • /
    • pp.99-104
    • /
    • 1999
  • This paper proposes an efficient method constructing a local map using the data of a scanning laser range finder. A laser range finder yields distance data of polar form, that is, distance data corresponding to every scanning directions. So, the data consists of directional angle and distance. We propose a new method to find a line fitting with a set of such data. The method uses Log-Hough Transformation. Usually, map building from these data requires some transformations between different coordinate systems. The new method alleviates such complication. Also, the method simplifies computation for line recognition and eliminates the slope quantization problems inherent in the classical Cartesian Hough transform method. To show the efficiency of the proposed method, it is applied to find a local map using the data from a laser range finder PLS(Proximity Laser Scanner, made by SICK).

  • PDF

Bitrate Scalable Video Coder (비트율 계위 비디오 부호기)

  • 임범렬;임성호;민병의;황승구;황재정
    • Journal of Broadcast Engineering
    • /
    • v.2 no.2
    • /
    • pp.206-215
    • /
    • 1997
  • We pror.a;e a H.263-based video ceder with two-layer ocalability. The bare layer is ceded by using the default H.263 axling algorithms to achieve high compresred video data and the enhanced layer is axied by enhanced axling such as HVS-based quantization updating. The enhanced layer contains only arled refinement data for the OCT coefficients of the bare layer. Bitstream syntax and semantics for enhancement layer are designed and quantizer design using the HVS is pror.ooed. Data from the two layers are combined after inverse quantization and inverse OCT prcx:esses in the deaxier. We show with e~rirrental results that the pror.a;ed layered arlee achieves comparable picture quality with non-layered arlee at bitrates of 30 kbr;s or less. Overhead information for the bitstream layer can 00 limited to less than 0.5 kbits/frame.

  • PDF

A Feedback Buffer Control Algorithm for H.264 Video Coding (H.264 동영상 부호기를 위한 Feedback 버퍼 제어 방식)

  • Son Nam Rye;Lee Guee Sang
    • The KIPS Transactions:PartB
    • /
    • v.11B no.6
    • /
    • pp.625-632
    • /
    • 2004
  • Since the H.264 encoding adopts both forward prediction and hi-direction prediction modes and exploits Variable Length Coding(VLC), the amount of data generated from video encoder varies as Flaying time goes by. The fixed bit rate encoding system which has limited transmission channel capacity uses a buffer to control output bitstream It's necessary to control the bitstream to maintain within manageable range so as to protect buffer from overflow or underflow. With existing bit amount control algorithms, the $\lambda_{MODE}$ which is relationship between distortion value and quantization parameter often excesses normal value to end up with video error. This paper proposes an algorithm to protect buffer from overflow or underflow by introducing a new quantization parameter against distortion value of H.264 video data. The test results of 6 exemplary data show that the proposed algorithm has the same PSNR as and up to 8% reduced bit rate against existing algorithms.

Design of an IFFT∪FFT processor with manipulated coefficients based on the statistics distribution for OFDM (확률분포 특성을 이용한 OFDM용 IFFT∪FFT프로세서 설계)

  • Choi, Won-Chul;Lee, Hyun;Cho, Kyoung-Rok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.12
    • /
    • pp.87-94
    • /
    • 2003
  • In this paper, we propose an IFFT/FFT design method to minimize quantization error in IEEE 802.11a WLAN. In the proposed algorithm, the twiddle coefficient of IFFT/FFT processor is manipulated by the statistics distribution of the input data at each stage. We applies this algorithm to radix-2/$^2$ SDF architecture. Both IFFT and FFT processor shares the circuit blocks cause to the symmetric architecture. The maximum quantization error with the 10 bits length of the input and output data is 0.0021 in IFFT and FFT that has a self-loop structure with the proposed method. As a result, the proposed architecture saves 3bits for the data to keep the same resolution compared with the conventional method.

Hybrid Coding for Multi-spectral Satellite Image Compression (다중스펙트럼 위성영상 압축을 위한 복합부호화 기법)

  • Jung, Kyeong-Hoon
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.3 no.1
    • /
    • pp.1-11
    • /
    • 2000
  • The hybrid coding algorithm for multi-spectral image obtained from satellite is discussed. As the spatial and spectral resolution of satellite image are rapidly increasing, there are enormous amounts of data to be processed for computer processing and data transmission. Therefore an efficient coding algorithm is essential for multi-spectral image processing. In this paper, VQ(vector quantization), quadtree decomposition, and DCT(discrete cosine transform) are combined to compress the multi-spectral image. VQ is employed for predictive coding by using the fact that each band of multi-spectral image has the same spatial feature, and DCT is for the compression of residual image. Moreover, the image is decomposed into quadtree structure in order to allocate the data bit according to the information content within the image block to improve the coding efficiency. Computer simulation on Landsat TM image shows the validity of the proposed coding algorithm.

  • PDF

An Adaptive Rate Control Using Piecewise Linear Approximation Model (부분 선형 근사 모델을 이용한 적응적 비트율 제어)

  • 조창형;정제창;최병욱
    • Journal of Broadcast Engineering
    • /
    • v.2 no.2
    • /
    • pp.194-205
    • /
    • 1997
  • In video compression standards such as MPEG and H.263. rate control is one of the key components for good coding performance. This paper presents a simple adaptive rate control scheme using a piecewise linear approximation model. While conventional buffer control approach is performed by adjusting the quantization parameter linearly according to the buffer fullness. the proposed approach uses a piecewise linear approximation model derived from logarithmic relation between the quantization parameter and bitrate in data compression. In addition. a forward analyzer performed in the spatial domain is used to improve image quality. Simulation results demonstrate that the proposed method provides better performance than the conventional one and reduces the fluctuation of the PSNR per frame while maintaining the quality of the reconstructed frames at a relatively stable level.

  • PDF

Optimization of Gate Stack MOSFETs with Quantization Effects

  • Mangla, Tina;Sehgal, Amit;Saxena, Manoj;Haldar, Subhasis;Gupta, Mridula;Gupta, R.S.
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.4 no.3
    • /
    • pp.228-239
    • /
    • 2004
  • In this paper, an analytical model accounting for the quantum effects in MOSFETs has been developed to study the behaviour of $high-{\kappa}$ dielectrics and to calculate the threshold voltage of the device considering two dielectrics gate stack. The effect of variation in gate stack thickness and permittivity on surface potential, inversion layer charge density, threshold voltage, and $I_D-V_D$ characteristics have also been studied. This work aims at presenting a relation between the physical gate dielectric thickness, dielectric constant and substrate doping concentration to achieve targeted threshold voltage, together with minimizing the effect of gate tunneling current. The results so obtained are compared with the available simulated data and the other models available in the literature and show good agreement.

Sequential Speaker Classification Using Quantized Generic Speaker Models (양자화 된 범용 화자모델을 이용한 연속적 화자분류)

  • Kwon, Soon-Il
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.44 no.1
    • /
    • pp.26-32
    • /
    • 2007
  • In sequential speaker classification, the lack of prior information about the speakers poses a challenge for model initialization. To address the challenge, a predetermined generic model set, called Sample Speaker Models, was previously proposed. This approach can be useful for accurate speaker modeling without requiring initial speaker data. However, an optimal method for sampling the models from a generic model pool is still required. To solve this problem, the Speaker Quantization method, motivated by vector quantization, is proposed. Experimental results showed that the new approach outperformed the random sampling approach with 25% relative improvement in error rate on switchboard telephone conversations.