• Title/Summary/Keyword: Improved entropy

Search Result 125, Processing Time 0.022 seconds

Image coding using blocked zerotree

  • Lee, Jin-Ho;Nam, In-Gil;Park, Sang-Ho
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.6 no.1
    • /
    • pp.39-47
    • /
    • 2001
  • A blocked zerotree coding algorithm for compression of subband image is proposed. Significance of blocks with respect to a certain threshold are coded with a set of transition rules for the significance of blocks. Significant blocks are quantized by vector quantization. The basic idea for this coding approach are: 1) Subband images are coded by blocks, 2) Important blocks based on the significance of blocks are coded and quantized, 3) Multiband codebook which is composed of sub-codebooks dedicated for each threshold and subband level is adapted to produce good reproduction vectors for vector quantization. The compression results are similar to Shapiro's zerotree coding even though ours are obtained without entropy coding of bit streams from blocked zerotree encoder. If an entropy coding is applied to the bitstream, PSNR will be improved.

  • PDF

Distributed Video Coding for Illumination Compensation of Multi-view Video

  • Park, Sean-Ae;Sim, Dong-Gyu;Jeon, Byeung-Woo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.6
    • /
    • pp.1222-1236
    • /
    • 2010
  • In this paper, we propose an improved distributed multi-view video coding method that is robust to illumination changes among different views. The use of view dependency is not effective for multi-view video because each view has different intrinsic and extrinsic camera parameters. In this paper, a modified distributed multi-view coding method is presented that applies illumination compensation when generating side information. The proposed encoder codes DC values of discrete cosine transform (DCT) coefficients separately by entropy coding. The proposed decoder can generate more accurate side information by using the transmitted DC coefficients to compensate for illumination changes. Furthermore, AC coefficients are coded with conventional entropy or channel coders depending on the frequency band. We found that the proposed algorithm is about 0.1~0.5 dB better than conventional algorithms.

A Watermarking Method Based on the Informed Coding and Embedding Using Trellis Code and Entropy Masking (Trellis 부호 및 엔트로피 마스킹을 이용한 정보부호화 기반 워터마킹)

  • Lee, Jeong-Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2677-2684
    • /
    • 2009
  • In this paper, we study a watermarking method based on the informed coding and embedding by means of trellis code and entropy masking. An image is divided as $8{\times}8$ block with no overlapping and the discrete cosine transform(DCT) is applied to each block. Then the 16 medium-frequency AC terms of each block are extracted. Next it is compared with gaussian random vectors having zero mean and unit variance. As these processing, the embedding vectors with minimum value of linear combination between linear correlation and Watson distance can be obtained by Viterbi algorithm at each stage of trellis coding. For considering the image characteristics, we apply different weight value between the linear correlation and the Watson distance using the entropy masking. To evaluate the performance of proposed method, the average bit error rate of watermark message is calculated from different several images. By the experiments the proposed method is improved in terms of the average bit error rate.

High-Speed Implementation and Efficient Memory Usage of Min-Entropy Estimation Algorithms in NIST SP 800-90B (NIST SP 800-90B의 최소 엔트로피 추정 알고리즘에 대한 고속 구현 및 효율적인 메모리 사용 기법)

  • Kim, Wontae;Yeom, Yongjin;Kang, Ju-Sung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.28 no.1
    • /
    • pp.25-39
    • /
    • 2018
  • NIST(National Institute of Standards and Technology) has recently published SP 800-90B second draft which is the document for evaluating security of entropy source, a key element of a cryptographic random number generator(RNG), and provided a tool implemented on Python code. In SP 800-90B, the security evaluation of the entropy sources is a process of estimating min-entropy by several estimators. The process of estimating min-entropy is divided into IID track and non-IID track. In IID track, the entropy sources are estimated only from MCV estimator. In non-IID Track, the entropy sources are estimated from 10 estimators including MCV estimator. The running time of the NIST's tool in non-IID track is approximately 20 minutes and the memory usage is over 5.5 GB. For evaluation agencies that have to perform repeatedly evaluations on various samples, and developers or researchers who have to perform experiments in various environments, it may be inconvenient to estimate entropy using the tool and depending on the environment, it may be impossible to execute. In this paper, we propose high-speed implementations and an efficient memory usage technique for min-entropy estimation algorithm of SP 800-90B. Our major achievements are the three improved speed and efficient memory usage reduction methods which are the method applying advantages of C++ code for improving speed of MultiMCW estimator, the method effectively reducing the memory and improving speed of MultiMMC by rebuilding the data storage structure, and the method improving the speed of LZ78Y by rebuilding the data structure. The tool applied our proposed methods is 14 times faster and saves 13 times more memory usage than NIST's tool.

An Improved ViBe Algorithm of Moving Target Extraction for Night Infrared Surveillance Video

  • Feng, Zhiqiang;Wang, Xiaogang;Yang, Zhongfan;Guo, Shaojie;Xiong, Xingzhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.12
    • /
    • pp.4292-4307
    • /
    • 2021
  • For the research field of night infrared surveillance video, the target imaging in the video is easily affected by the light due to the characteristics of the active infrared camera and the classical ViBe algorithm has some problems for moving target extraction because of background misjudgment, noise interference, ghost shadow and so on. Therefore, an improved ViBe algorithm (I-ViBe) for moving target extraction in night infrared surveillance video is proposed in this paper. Firstly, the video frames are sampled and judged by the degree of light influence, and the video frame is divided into three situations: no light change, small light change, and severe light change. Secondly, the ViBe algorithm is extracted the moving target when there is no light change. The segmentation factor of the ViBe algorithm is adaptively changed to reduce the impact of the light on the ViBe algorithm when the light change is small. The moving target is extracted using the region growing algorithm improved by the image entropy in the differential image of the current frame and the background model when the illumination changes drastically. Based on the results of the simulation, the I-ViBe algorithm proposed has better robustness to the influence of illumination. When extracting moving targets at night the I-ViBe algorithm can make target extraction more accurate and provide more effective data for further night behavior recognition and target tracking.

A VLSI Design and Implementation of a Single-Chip Encoder/Decoder with Dictionary Search Processor(DISP) using LZSS Algorithm and Entropy Coding (LZSS 알고리즘과 엔트로피 부호를 이용한 사전탐색처리장치를 갖는 부호기/복호기 단일-칩의 VLSI 설계 및 구현)

  • Kim, Jong-Seop;Jo, Sang-Bok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.38 no.2
    • /
    • pp.103-113
    • /
    • 2001
  • This paper described a design and implementation of a single-chip encoder/decoder using the LZSS algorithm and entropy coding in 0.6${\mu}{\textrm}{m}$ CMOS technology. Dictionary storage for the dictionary search processor(DISP) used a 2K$\times$8bit on-chip memory with 50MHz clock speed. It performs compression on byte-oriented input data at a data rate of one byte per clock cycle except when one out of every 33 cycles is used to update the string window of dictionary. In result, the average compression ratio is 46% by applied entropy coding of the LZSS codeword output. This is to improved on the compression performance of 7% much more then LZSS.

  • PDF

An Entropy-based Cooperative-Aided Routing Protocol for Mobile Ad-hoc Wireless Sensor Networks (모바일 Ad-hoc 무선 센서 네트워크를 위한 엔트로피기반 협력도움 라우팅 프로토콜)

  • An, Beong-Ku;Lee, Joo-Sang
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.106-113
    • /
    • 2008
  • In this paper, we propose an Entropy-based Cooperative-Aided Routing Protocol (ECARP) in Mobile Ad-hoc fireless Sensor Networks (MAWSN). The main contributions and features of this paper are as follows. First, the entropy-based cooperative routing protocol which is based on node mobility is proposed for supporting stable routing route construction. Second, cooperative data transmission method is used for improving data transmission ratio with the improved SNR. Third, we consider a realistic approach, in the points of view of the MAWSN, based on mobile sensor nodes as well as fixed sensor nodes in sensor fields while the conventional research for sensor networks focus on mainly fixed sensor nodes. The performance evaluation of the proposed routing protocol is performed via simulation and analysis.

A Comparative Study on the Methods Estimating Wave Directional Spectrum (파향스펙트럼 추정법의 비교 연구)

  • 오병철;심재설
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.2 no.3
    • /
    • pp.119-127
    • /
    • 1990
  • Wave directional spectrum estimation methods for irregular waves were considered in this study. Until now, the Longuet-Higgins Method (LHM) initiated by Longuet-Higgins et al. (1963) has been widely used, but resolutions of the estimation were found to be low. Kobune's Maximum Entropy Method (MEM) for the estimation of wave directional spectrum, bas-ed on the entropy Principle showed higher resolutions comparing with the LHM . If the wave directional spectrum is of Delta functions, the MEM is exact in its estimation. It was also found that for a unimodal spectrum, if the Mitsuyasu's spreading coefficient is above 5, the estimation resolutions were high. In bimodal spectrum, as the angle difference between the two peaks increased, the resolution improved. The energy seems to transfer to the smoother peak in the smoothing of peak's peakedness. LHM has a tendency to estimate bimodal spectrum as a unimodal spectrum ; thus, except for its computational speed, the resolution of LHM falls far below that of MEM.

  • PDF

Study of protein loop conformational changes by free energy estimation using colony energy

  • Kang, Beom Chang;Lee, Gyu Rie;Seok, Chaok
    • Proceeding of EDISON Challenge
    • /
    • 2014.03a
    • /
    • pp.63-74
    • /
    • 2014
  • Predicting protein loop structures is an important modeling problem since protein loops are often involved in diverse biological functions by participating in enzyme active sites, ligand binding sites, etc. However, loop structure prediction is difficult even when structures of homologous proteins are known due to large sequence and structure variability among loops of homologous proteins. Therefore, an ab initio approach is necessary to solve loop modeling problems. One of the difficulties in the development of ab initio loop modeling method is to derive an accurate scoring function that closely approximates the true free energy function. In particular, entropy as well as energy contribution have to be considered adequately for loops because loops tend to be flexible compared to other parts of protein. In this study, the contribution of conformational entropy is considered in scoring loop conformations by employing "colony energy" which was previously proposed to estimate the free energy for an ensemble of conformations. Loop conformations were generated by using two EDISON_Chem programs GalaxyFill and GalaxySC, and colony energy was designed for this sampling by tuning relevant parameters. On a test set of 40 loops, the accuracy of predicted loop structure improved on average by scoring with the colony energy compared to scoring by energy alone. In addition, high correlation between colony energy and deviation from the native structure suggested that more extensive sampling can further improve the prediction accuracy. In another test on 6 ligand-binding loops that show conformational changes by ligand binding, both ligand-free and ligand-bound states could be identified by using colony energy when no information on the ligand-bound conformation is used.

  • PDF

Context-based Predictive Coding Scheme for Lossless Image Compression (무손실 영상 압축을 위한 컨텍스트 기반 적응적 예측 부호화 방법)

  • Kim, Jongho;Yoo, Hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.1
    • /
    • pp.183-189
    • /
    • 2013
  • This paper proposes a novel lossless image compression scheme composed of direction-adaptive prediction and context-based entropy coding. In the prediction stage, we analyze the directional property with respect to the current coding pixel and select an appropriate prediction pixel. In order to further reduce the prediction error, we propose a prediction error compensation technique based on the context model defined by the activities and directional properties of neighboring pixels. The proposed scheme applies a context-based Golomb-Rice coding as the entropy coding since the coding efficiency can be improved by using the conditional entropy from the viewpoint of the information theory. Experimental results indicate that the proposed lossless image compression scheme outperforms the low complexity and high efficient JPEG-LS in terms of the coding efficiency by 1.3% on average for various test images, specifically for the images with a remarkable direction the proposed scheme shows better results.