• 제목/요약/키워드: Entropy encoding

검색결과 47건 처리시간 0.025초

HDTV용 엔트로피 부호화기의 메모리 포화 방지에 관한 연구 (A Study on the Memory Saturation Prevention of the Entropy Encoder for He HDTV)

  • 이선근;임순자;김환용
    • 한국통신학회논문지
    • /
    • 제29권5A호
    • /
    • pp.545-553
    • /
    • 2004
  • 네트워크 환경의 발전과 더불어 멀티미디어의 확대는 HDTV와 같은 응용 서비스의 보편화를 요구한다. 이러한 상황에서 핸드폰과 같은 무선통신 시스템과 xDSL과 광케이블에 의한 유선통신 시스템에서 멀티미디어 실시간 처리는 필수조건이다. 그러므로 본 논문에서 영상정보에 대해서 최소의 평균 부호장을 가지며 순간적 디코딩 능력이 뛰어난 허프만 부호화와 압축 수행속도가 우수한 렘펠-지브 알고리즘의 장점을 접목하여 채널 전송률 및 압축과 정중의 처리속도를 증가시키기 위하여 최적 메모리 할당 기법을 HDTV의 엔트로피 부호화기에 적용하여 설계하고 검증하였다. 구현된 최적 메모리 할당 기법을 사용한 엔트로피 부호화기 시스템은 메모리 포화를 방지할 수 있기 때문에 기존 시스템에 비하여 동영상에 대한 압축률이 허프만 부호나 LZW에 비하여 우수하다는 것을 확인하였다.

HEVC 엔트로피 부호화를 고려한 비균등 양자화 방법 (Non-fixed Quantization Considering Entropy Encoding in HEVC)

  • 권령희;한우진;이영렬
    • 방송공학회논문지
    • /
    • 제16권6호
    • /
    • pp.1036-1046
    • /
    • 2011
  • ITU-T VCEG과 ISO/IEC MPEG은 공동으로 JCT-VC(Joint Collaborative Team on Video Coding) 를 구성하여 차세대 비디오 코덱 HEVC(High Efficiency Video Coding)에 대한 표준화를 진행하고 있다. HEVC에서 사용되고 있는 양자화 및 역 양자화는 TU(Transform Unit)내 모든 위치의 변환계수에 동일한 크기의 양자화 및 역 양자화를 수행한다. TU내의 변환계수는 동일하게 분포되어 있지 않으므로 모든 위치의 변환계수에 동일한 크기의 양자화 및 역 양자화를 수행하는 것은 비효율적이다. 또한 주사 순서상 뒤쪽에 있는 양자화 된 계수는 엔트로피 부호화 방법상 비효율적 일 수도 있다. 이 논문에서는 엔트로피 부호화의 효율성을 고려하여 TU 내 변환계수의 위치에 따라 다른 크기의 양자화를 수행하여 성능을 향상시키는 알고리즘을 제시한다. 이 알고리즘의 원리는 양자화 된 계수 분포의 통계적 특징에 따른 TU의 주사 순서에 따라 다른 크기의 양자화 및 역 양자화를 수행하는 것이다. 이 알고리즘은 평균 Y BD-rate 0.34% 의 압축률 향상을 나타내었다.

Nonlinear Quality Indices Based on a Novel Lempel-Ziv Complexity for Assessing Quality of Multi-Lead ECGs Collected in Real Time

  • Zhang, Yatao;Ma, Zhenguo;Dong, Wentao
    • Journal of Information Processing Systems
    • /
    • 제16권2호
    • /
    • pp.508-521
    • /
    • 2020
  • We compared a novel encoding Lempel-Ziv complexity (ELZC) with three common complexity algorithms i.e., approximate entropy (ApEn), sample entropy (SampEn), and classic Lempel-Ziv complexity (CLZC) so as to determine a satisfied complexity and its corresponding quality indices for assessing quality of multi-lead electrocardiogram (ECG). First, we calculated the aforementioned algorithms on six artificial time series in order to compare their performance in terms of discerning randomness and the inherent irregularity within time series. Then, for analyzing sensitivity of the algorithms to content level of different noises within the ECG, we investigated their change trend in five artificial synthetic noisy ECGs containing different noises at several signal noise ratios. Finally, three quality indices based on the ELZC of the multi-lead ECG were proposed to assess the quality of 862 real 12-lead ECGs from the MIT databases. The results showed the ELZC could discern randomness and the inherent irregularity within six artificial time series, and also reflect content level of different noises within five artificial synthetic ECGs. The results indicated the AUCs of three quality indices of the ELZC had statistical significance (>0.500). The ELZC and its corresponding three indices were more suitable for multi-lead ECG quality assessment than the other three algorithms.

평활한 완전 8방향 윤곽선과 이의 부호화 기법 (SMOOTHLY PERFECT 8-CONNECTED CONTOUR AND ITS CODING TECHNIQUE)

  • 조성호;김인철;이상욱
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 1996년도 학술대회
    • /
    • pp.195-198
    • /
    • 1996
  • In this paper, we introduce the notion of the smoothly perfect 8-connected (SP8C) contour and propose a coding technique for the SP8C contours. Based on the contour simplification using the majority filter proposed by Gu[6], SP8C contours are extracted on the contour lattice from the segmented image. By noting that, unlike the perfect 8-connected contours, the SP8C contours are restricted to travel in only 3 different directions along the contours, we also propose two techniques for encoding the SP8C contours. The one is the modified version of the neighbouring direction segment coding by Kandeko[2], while the other is to employ the notion of the entropy coding. From the comparison in terms of the entropy, it is shown that the proposed SP8C contours require les bits in encoding the diagonal contours than the 4-connected contours employed by Gu. And computer simulations reveal that the contours can be efficiently encoded by the proposed technique.

  • PDF

줄길이 신호원의 순환지수 부호화 (Encoding of a run-length soruce using recursive indexing)

  • 서재준;나상신
    • 전자공학회논문지A
    • /
    • 제33A권7호
    • /
    • pp.23-33
    • /
    • 1996
  • This paper deals with the design of a recursively-indexed binary code for facsimile soruces and its performance. Sources used here are run-lengths of white pixels form higher-resolution facsimile. The modified huffman code used for G.3 facsimile is chosen for the performance comparison. Experiments confirm the fact that recursive indexing preserves the entropy of a memoryless geometric source: the entropy of recursively-indexed physical surce iwth roughly geometric distributin remains within 2% of the empirical source entropy. The designed recursively-indexed binary codes consist of a code applied to text-type documents and to graphics - type documents is compared iwth that of the modified huffman code. Numerical resutls show that the modified huffman code performs well for text-type documents and not equally well for graphics-tyep documents. On the other hand, recursively-indexed binary codes have shown a better performance for graphics-type documents whose distribution are similar to a geometric distribution. Specifically, the code rates of recursively-indexed binary codes with 60 codewords are from 8% to 20% of the empirical source entropy smaller than that of th emodified huffman code with 91 codewords.

  • PDF

H.264/AVC를 위한 효율적인 Pipelined Arithmetic Encoder (An efficient Pipelined Arithmetic Encoder for H.264/AVC)

  • 윤재복;박태근
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2005년도 추계종합학술대회
    • /
    • pp.687-690
    • /
    • 2005
  • H.264/AVC에서 압축 효율을 향상시키기 위해 사용된 entropy coding중에 CABAC(Context-based Adaptive Binary Arithmetic Coding)은 하드웨어 복잡도가 높고 bit-serial 과정에서 data dependancy가 존재하기 때문에 빠른 연산이 어렵다. 본 논문에서는 adaptive arithmetic encoder와 정규화 과정을 효율적으로 구성하여 각 입력 심벌이 정규화 과정의 반복횟수에 관계없이 고정된 cycle에 encoding이 되도록 하였다. 제안한 구조는 pipeline으로 구성하기 용이하며, 이 경우 매 cycle에 한 입력 심벌의 encoding이 가능하다.

  • PDF

고효율 엔트로피 부호화를 위한 ICMEP 알고리즘 설계 (Design of the ICMEP Algorithm for the Highly Efficient Entropy Encoding)

  • 이선근;임순자;김환용
    • 대한전자공학회논문지SD
    • /
    • 제41권4호
    • /
    • pp.75-82
    • /
    • 2004
  • 압축 과정 중에 빠른 처리율을 보여주는 렘펠-짚 알고리즘의 결합에 의하여 채널 전송율은 증가한다. 영상정보의 압축 과정동안 처리율을 향상시키기 위하여 ICMEP 알고리즘을 제안하였으며 HDTV에 적용시켜 엔트로피 부호화기를 설계하였으며 이를 검증하였다. ICMEP 엔트로피 암호기는 top-down 방식을 이용하여 설계하였으며 VHDL을 이용하여 회로 합성 및 모의실험을 수행하였다. 모의실험 결과, 구현된 ICHEP 엔트로피 부호화기는 메모리 포화방지 및 압축률 증가로 인하여 전체적인 시스템 효율이 향상됨을 확인하였다.

Multi-Symbol Binary Arithmetic Coding Algorithm for Improving Throughput in Hardware Implementation

  • Kim, Jin-Sung;Kim, Eung Sup;Lee, Kyujoong
    • Journal of Multimedia Information System
    • /
    • 제5권4호
    • /
    • pp.273-276
    • /
    • 2018
  • In video compression standards, the entropy coding is essential to the high performance compression because redundancy of data symbols is removed. Binary arithmetic coding is one of high performance entropy coding methods. However, the dependency between consecutive binary symbols prevents improving the throughput. For the throughput enhancement, a new probability model is proposed for encoding multi-symbols at one time. In the proposed method, multi-symbol encoder is implemented with only adders and shifters, and the multiplication table for interval subdivision of binary arithmetic coding is removed. Compared to the compression ratio of CABAC of H.264/AVC, the performance degradation on average is only 1.4% which is negligible.

Anomaly-based Alzheimer's disease detection using entropy-based probability Positron Emission Tomography images

  • Husnu Baris Baydargil;Jangsik Park;Ibrahim Furkan Ince
    • ETRI Journal
    • /
    • 제46권3호
    • /
    • pp.513-525
    • /
    • 2024
  • Deep neural networks trained on labeled medical data face major challenges owing to the economic costs of data acquisition through expensive medical imaging devices, expert labor for data annotation, and large datasets to achieve optimal model performance. The heterogeneity of diseases, such as Alzheimer's disease, further complicates deep learning because the test cases may substantially differ from the training data, possibly increasing the rate of false positives. We propose a reconstruction-based self-supervised anomaly detection model to overcome these challenges. It has a dual-subnetwork encoder that enhances feature encoding augmented by skip connections to the decoder for improving the gradient flow. The novel encoder captures local and global features to improve image reconstruction. In addition, we introduce an entropy-based image conversion method. Extensive evaluations show that the proposed model outperforms benchmark models in anomaly detection and classification using an encoder. The supervised and unsupervised models show improved performances when trained with data preprocessed using the proposed image conversion method.

유전자 알고리즘을 이용한 타이어 공력소음의 저감 (Reduction of Air-pumping Noise based on a Genetic Algorithm)

  • 김의열;황성욱;김병현;이상권
    • 한국소음진동공학회논문집
    • /
    • 제22권1호
    • /
    • pp.61-73
    • /
    • 2012
  • The paper presents the novel approach to solve some problems occurred in application of the genetic algorithm to the determination of the optimal tire pattern sequence in order to reduce the tire air-pumping noise which is generated by the repeated compression and expansion of the air cavity between tire pattern and road surface. The genetic algorithm has been used to find the optimal tire pattern sequence having a low level of tire air-pumping noise using the image based air-pumping model. In the genetic algorithm used in the previous researches, there are some problems in the encoding structure and the selection of objective function. The paper proposed single encoding element with five integers, divergent objective function based on evolutionary process and the optimal evolutionary rate based on Shannon entropy to solve the problems. The results of the proposed genetic algorithm with evolutionary process are compared with those of the randomized algorithm without evolutionary process on the two-dimensional normal distribution. It is confirmed that the genetic algorithm is more effective to reduce the peak value of the predicted tire air-pumping noise and the consistency and cohesion of the obtained simulation results are also improved in terms of probability.