• 제목/요약/키워드: Data quantization

검색결과 348건 처리시간 0.023초

A study on the competitive learning algorithm for robust vector qantization to transmit speech signal (벡터 양자화를 위한 학습 알고리즘을 이용한 음성 전송 기술에 관한 연구)

  • Hong, Kang-You;Park, Sang-Hui
    • Proceedings of the KIEE Conference
    • /
    • 대한전기학회 1999년도 하계학술대회 논문집 G
    • /
    • pp.3150-3152
    • /
    • 1999
  • The efficient representation and encoding of signals with limited resources, e.g., finite storage capacity and restricted transmission bandwidth, is a fundamental problem in technical information processing systems. Typically under realistic circumstances, the encoding and communication of message has to deal with different sources of noise and disturbances. In this paper, I propose a unifying approach to data compression by robust vector quantization, which explicitly deals with channel noise, and random elimination of prototypes. The resulting algorithm is able to limit the detrimental effect of noise in a very general communication scenario. In this paper, based on the robust vector quantization I have an experiment about speech coding.

  • PDF

3-dimensional Mesh Model Coding Using Predictive Residual Vector Quantization (예측 잉여신호 벡터 양자화를 이용한 3차원 메시 모델 부호화)

  • 최진수;이명호;안치득
    • Journal of Broadcast Engineering
    • /
    • 제2권2호
    • /
    • pp.136-145
    • /
    • 1997
  • As a 3D mesh model consists of a lot of vertices and polygons and each vertex position is represented by three 32 bit floating-point numbers in a 3D coordinate, the amount of data needed for representing the model is very excessive. Thus, in order to store and/or transmit the 3D model efficiently, a 3D model compression is necessarily required. In this paper, a 3D model compression method using PRVQ (predictive residual vector quantization) is proposed. Its underlying idea is based on the characteristics such as high correlation between the neighboring vertex positions and the vectorial property inherent to a vertex position. Experimental results show that the proposed method obtains higher compression ratio than that of the existing methods and has the advantage of being capable of transmitting the vertex position data progressively.

  • PDF

A Direct Digital Frequency Synthesizer Using Quantization ROM And Error ROM (양자화롬과 오차롬을 사용한 직접 디지털 주파수 합성기)

  • 양병도;성기혁;김영준;김이섭
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • 제40권2호
    • /
    • pp.104-110
    • /
    • 2003
  • A new direct digital frequency synthesizer (DDFS) is proposed. The DDFS uses a new ROM compression method that divides each ROM in the conventional DDFS into two ROMs (a quantization ROM and an error ROM). The total size of the ROMs in the proposed DDFS is significantly reduced compared to the original ROM. The ROM compression ratio of 78 is achieved for a DDFS with 12bit output data. A DDFS with 12bit output data for sine function was implemented in a 0.35${\mu}{\textrm}{m}$ CMOS technology. The power dissipation is 9.56㎽ at 100MHz with 3.3V and the maximum operating clock frequency is 330MHz.

Image Compression using an Intelligne Classified Vector Quantization Method in Transform Domain (변환영역에서의 지능형 분류벡터양자화를 이용한 영상압축)

  • 이현수;공성곤
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • 제7권4호
    • /
    • pp.18-28
    • /
    • 1997
  • This paper presents image data compression using a classified vector quantization (CVQ) which categories edge blocks according to the energy distribution of subimages in the discrete cosine transform domain. Classifying the edge blocks enhances visual quality of the compressed images while maintaining a high compression ratio. The proposed classification method categories subimages into eight lypes of edge features according to an energy distribution. A neural network, trained with the data generated from the proposed classification method, can successfully classify subimages to eight edge categories. Experimental results are given to show how the (1VQ method incorporatd with a neural network can produce faithful compressed image quality for high compression ratios.

  • PDF

Optical Encryption of Binary Information using 2-step Phase-shifting Digital Holography (2-단계 위상 천이 디지털 홀로그래피를 이용한 이진 정보 광 암호화 기법)

  • Byun, Hyun-Joong;Gil, Sang-Keun
    • Korean Journal of Optics and Photonics
    • /
    • 제17권5호
    • /
    • pp.401-411
    • /
    • 2006
  • We propose an optical encryption/decryption technique for a security system based on 2-step phase-shifting digital holography. Phase-shilling digital holography is used for recording phase and amplitude information on a CCD device. 2-step phase-shifting is implemented by moving the PZT mirror with phase step of 0 or ${\pi}/2$. The binary data and the key are expressed with random code and random phase patterns. The digital hologram is a Fourier transform hologram and is recorded on CCD with 256 gray level quantization. We remove the DC term of the digital hologram fur data reconstruction, which is essential to reconstruct the original binary input data/image. The error evaluation fer the decrypted binary data is analyzed. One of errors is a quantization error in detecting the hologram intensity on CCD, and the other is generated from decrypting the data with the incorrect key. The technique using 2-step phase-shifting holography is more efficient than a 4-step method because 2-step phase-shifting holography system uses less data than the 4-step method for data storage or transmission. The simulation shows that the proposed technique gives good results fur the optical encryption of binary information.

A Massively Parallel Algorithm for Fuzzy Vector Quantization (퍼지 벡터 양자화를 위한 대규모 병렬 알고리즘)

  • Huynh, Luong Van;Kim, Cheol-Hong;Kim, Jong-Myon
    • The KIPS Transactions:PartA
    • /
    • 제16A권6호
    • /
    • pp.411-418
    • /
    • 2009
  • Vector quantization algorithm based on fuzzy clustering has been widely used in the field of data compression since the use of fuzzy clustering analysis in the early stages of a vector quantization process can make this process less sensitive to its initialization. However, the process of fuzzy clustering is computationally very intensive because of its complex framework for the quantitative formulation of the uncertainty involved in the training vector space. To overcome the computational burden of the process, this paper introduces an array architecture for the implementation of fuzzy vector quantization (FVQ). The arrayarchitecture, which consists of 4,096 processing elements (PEs), provides a computationally efficient solution by employing an effective vector assignment strategy during the clustering process. Experimental results indicatethat the proposed parallel implementation providessignificantly greater performance and efficiency than appropriately scaled alternative array systems. In addition, the proposed parallel implementation provides 1000x greater performance and 100x higher energy efficiency than other implementations using today's ARMand TI DSP processors in the same 130nm technology. These results demonstrate that the proposed parallel implementation shows the potential for improved performance and energy efficiency.

A study on the application of residual vector quantization for vector quantized-variational autoencoder-based foley sound generation model (벡터 양자화 변분 오토인코더 기반의 폴리 음향 생성 모델을 위한 잔여 벡터 양자화 적용 연구)

  • Seokjin Lee
    • The Journal of the Acoustical Society of Korea
    • /
    • 제43권2호
    • /
    • pp.243-252
    • /
    • 2024
  • Among the Foley sound generation models that have recently begun to be studied, a sound generation technique using the Vector Quantized-Variational AutoEncoder (VQ-VAE) structure and generation model such as Pixelsnail are one of the important research subjects. On the other hand, in the field of deep learning-based acoustic signal compression, residual vector quantization technology is reported to be more suitable than the conventional VQ-VAE structure. Therefore, in this paper, we aim to study whether residual vector quantization technology can be effectively applied to the Foley sound generation. In order to tackle the problem, this paper applies the residual vector quantization technique to the conventional VQ-VAE-based Foley sound generation model, and in particular, derives a model that is compatible with the existing models such as Pixelsnail and does not increase computational resource consumption. In order to evaluate the model, an experiment was conducted using DCASE2023 Task7 data. The results show that the proposed model enhances about 0.3 of the Fréchet audio distance. Unfortunately, the performance enhancement was limited, which is believed to be due to the decrease in the resolution of time-frequency domains in order to do not increase consumption of the computational resources.

An Adaptive Information Hiding Technique of JPEG2000-based Image using Chaotic System (카오스 시스템을 이용한 JPEG2000-기반 영상의 적응적 정보 은닉 기술)

  • 김수민;서영호;김동욱
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • 제41권4호
    • /
    • pp.9-21
    • /
    • 2004
  • In this paper, we proposed the image hiding method which decreases calculation amount by encrypt partial data using discrete wavelet transform and linear scale quantization which were adopted as the main technique for frequency transform in JPEG2000 standard. Also we used the chaotic system which has smaller calculation amount than other encryption algorithms and then dramatically decreased calculation amount. This method operates encryption process between quantization and entropy coding for preserving compression ratio of images and uses the subband selection method and the random changing method using the chaotic system. For ciphering the quantization index we use a novel image encryption algerian of cyclically shifted in the right or left direction and encrypts two quantization assignment method (Top-down/Reflection code), made change of data less. Also, suggested encryption method to JPEG2000 progressive transmission. The experiments have been performed with the proposed methods implemented in software for about 500 images. consequently, we are sure that the proposed are efficient image encryption methods to acquire the high encryption effect with small amount of encryption. It has been shown that there exits a relation of trade-off between the execution time and the effect of the encryption. It means that the proposed methods can be selectively used according to the application areas. Also, because the proposed methods are performed in the application layer, they are expected to be a good solution for the end-to-end security problem, which is appearing as one of the important problems in the networks with both wired and wireless sections.

Post-filtering in Low Bit Rate Moving Picture Coding, and Subjective and Objective Evaluation of Post-filtering (저 전송률 동화상 압축에서 후처리 방법 및 후처리 방법의 주관적 객관적 평가)

  • 이영렬;김윤수;박현욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제24권8B호
    • /
    • pp.1518-1531
    • /
    • 1999
  • The reconstructed images from highly compressed MPEG or H.263 data have noticeable image degradations, such as blocking artifacts near the block boundaries, corner outliers at cross points of blocks, and ringing noise near image edges, because the MPEG or H.263 quantizes the transformed coefficients of 8$\times$8 pixel blocks. A post-processing algorithm has been proposed by authors to reduce quantization effects, such as blocking artifacts, corner outliers, and ringing noise, in MPEG-decompressed images. Our signal-adaptive post-processing algorithm reduces the quantization effects adaptively by using both spatial frequency and temporal information extracted from the compressed data. The blocking artifacts are reduced by one-dimensional (1-D) horizontal and vertical low pass filtering (LPF), and the ringing noise is reduced by two-dimensional (2-D) signal-adaptive filtering (SAF). A comparison study of the subjective quality evaluation using modified single stimulus method (MSSM), the objective quality evaluation (PSNR) and the computation complexity analysis between the signal-adaptive post-processing algorithm and the MPEG-4 VM (Verification Model) post-processing algorithm is performed by computer simulation with several MPEG-4 image sequences. According to the comparison study, the subjective image qualities of both algorithms are similar, whereas the PSNR and the comparison complexity analysis of the signal-adaptive post-processing algorithm shows better performance than the VM post-processing algorithm.

  • PDF

Digital Image Watermarking using Inner Product and Adaptive Quantization (내적과 적응성 양자화를 이용한 디지털 영상의 워터마킹 방법)

  • 이승욱;김진호;호요성
    • Journal of Broadcast Engineering
    • /
    • 제6권1호
    • /
    • pp.50-57
    • /
    • 2001
  • A digital watermarking is a newly developed scheme to embed invisible or inaudible information Into the host data in order to insist the copyright of the owner or the creator. This paper describes a robust data embedding scheme that employs inner product and adaptive quantization. Compared to the previous works for digital watermarking, our proposed scheme can embed relatively large amount of Information, since a secrete key Is not directly relaxed to the watermark data. A secret key is used for the design of random direction vectors. which are taken Inner product with the DCT transformed feature set data. In odder to achieve robustness against malicious attacks. we exploit the Properties of human visual system In designing the random direction vectors which behave as embedded noises. Experimental results show that we can recover the embedded information without utilizing the original host data. We also demonstrate that the ownership assertion is possible even though The watermarked data may undergo common signal processing operations, such as JPEG compression. clopping. and filtering.

  • PDF