Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "entropy coding" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    Tytuł:
    Entropy Coder for Audio Signals
    Autorzy:
    Ulacha, G.
    Stasinski, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/226974.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    lossless audio coding
    entropy coding
    OLS
    Opis:
    In the paper an effective entropy coder designed for coding of prediction errors of audio signals is presented. The coder is implemented inside a greater structure, which signal modeling part is a lossless coding backward adaptation algorithm consisting of cascaded Ordinary Least Squares (OLS), three Normalized Least Mean Square (NLMS), and prediction error bias correction sections. The technique performance is compared to that of four other lossless codecs, including MPEG-4 Audio Lossless (ALS) one, and it is shown that indeed, on the average the new method is the best. The entropy coder is an advanced context adaptive Golomb one followed by two context adaptive arithmetic coders.
    Źródło:
    International Journal of Electronics and Telecommunications; 2015, 61, 2; 219-224
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Increased Compression Efficiency of AVC and HEVC CABAC by Precise Statistics Estimation
    Autorzy:
    Karwowski, D.
    Domański, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/226764.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    entropy coding
    CABAC algorithm
    CTW technique
    Video Compression
    AVC
    HEVC
    Opis:
    The paper presents Improved Adaptive Arithmetic Coding algorithm for application in future video compression technology. The proposed solution is based on the Context-based Adaptive Binary Arithmetic Coding (CABAC) technique and uses the authors mechanism of symbols probability estimation that exploits Context-Tree Weighting (CTW) technique. This paper proposes the version of the algorithm, that allows an arbitrary selection of depth D of context trees, when activating the algorithm in the framework of the AVC or HEVC video encoders. The algorithm has been tested in terms of coding efficiency of data and its computational complexity. Results showed, that depending on depth of context trees from 0.1% to 0.86% reduction of bitrate is achieved, when using the algorithm in the HEVC video encoder and 0.4% to 2.3% compression gain in the case of the AVC. The new solution increases complexity of entropy encoder itself, however, this does not cause an increase of the complexity of the whole video encoder.
    Źródło:
    International Journal of Electronics and Telecommunications; 2018, 64, 3; 277-284
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Information Theory in the mathematical Statistics
    Autorzy:
    Inglot, Tadeusz
    Powiązania:
    https://bibliotekanauki.pl/articles/747349.pdf
    Data publikacji:
    2014
    Wydawca:
    Polskie Towarzystwo Matematyczne
    Tematy:
    Entropy, Kullback-Leibler distance, Fisher informa- tion, entropy convergence, statistical model and source coding, Stein's Lemma, density estimation.
    Entropia, odległość Kullbacka-Leiblera, informacja Fishera, zbieżność entropii, lemat Steina, model statystyczny a kodowanie źródła, estymacja gęstości
    Opis:
    W niniejszym artykule przedstawiony jest zarys teorii informacji z probabilistycznego i statystycznego punktu widzenia. Ten nurt teorii informacji rozwijał się intensywnie w ostatnich dziesięcioleciach. Wpłynął też w znaczący sposób na rozwój metod statystycznych. Celem artykułu jest wprowadzenie czytelnika w przystępny sposób w podaną powyżej tematykę, dostarczenie mu pewnych intuicji i przybliżenie specyfiki podejścia teorio-informacyjnego w statystyce matematycznej.
    In the paper we present an outline of the information theory from the probabilistic and statistical point of view. Such a direction of the information theory has been intensively developed in recent decades and significantly influenced a progress in the statistical methodology. The aim of the article is to introduce the reader into these problems, provide some intuitions and acquaint with a specific information-theoretic approach to the mathematical statistics.The first part of the paper is devoted to brief and easy of approach introduction to the main notions of the information theory like entropy, relative entropy (Kullback-Leibler distance), information projection and Fisher information as well as presentation of their most important properties including de Bruijn's identity, Fisher information inequalities and entropy power inequalities. In the short second part we give applications of the notions and results from the first part to limit theorems of the probability theory such as the asymptotic equipartition property, the convergence of empirical measures in the entropy distance, large deviation principle with emphasis to Sanov theorem, the convergence of distributions of homogeneous Markov chains in the entropy distance and the central limit theorem. The main, last part of the article shows some most significant and important applications of the information theory to the mathematical statistics. We discuss connections of the maximum likelihood estimators with the information projections and the notion of sufficient statistic fromthe information-theoretic point of view. The problems of source coding, channel capacity and an amount of information provided by statistical experiments are presented in a statistical framework. Some attention is paid to the expansion of Clarke and Barron and its corollaries e.g. in density estimation. Next, applications of the information theory to hypothesis testing is discussed. We give the classical Stein's Lemma and its generalization to testing composite hypothesis obtained by Bahadur and show their connections with the asymptotic efficiency of statistical tests. Finally, we briefly mention the problem of information criteria in a model seletion including the most popular two-stage minimal description length criterion of Rissanen. The enclosed literature is limited only to papers and books which are referred to in the paper.
    Źródło:
    Mathematica Applicanda; 2014, 42, 1
    1730-2668
    2299-4009
    Pojawia się w:
    Mathematica Applicanda
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Koncepcja implementacji w układzie FPGA dekodowania VLC dla potrzeb sprzętowej dekompresji w standardzie cyfrowego wideo DV
    Concept design of FPGA-based VLC decoder implementation for the hardware decoding system compliant with DV standard
    Autorzy:
    Cichoń, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/154772.pdf
    Data publikacji:
    2010
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    kodowanie entropijne
    kompresja wewnątrz-ramkowa
    architektura potokowa
    entropy coding
    intraframe coding
    pipeline architecture
    Opis:
    Kodowanie VLC (ang. Variable Length Coding) jest odmianą kodowania entropijnego. W różnych odmianach występuje ono w wielu standardach kompresji wideo. W niniejszej publikacji opisany zostanie algorytm kodowania VLC stosowany w kompresji DV, oraz następujący po nim etap formowania skompresowanego segmentu wizji. Zaproponowana zostanie koncepcja implementacji dekodera VLC w układzie reprogramowalnym, realizująca wszystkie trzy etapy, z uwzględnieniem aspektów wykorzystania w sprzętowym dekoderze.
    VLC coding (Variable Length Coding) is one of entropy type coding. With different modifications it is used in many video compression standards of both moving and still images, e.g. JPEG, MPEG-2, DV (IEC 61834). In the paper the VLC coding algorithm used in DV as well as a consecutive compressed video data forming phase together with the macroblock compressed area built in this process are described in details. This phase is performed in three stages, each on different data granularity, which generates some constraints with regard to FPGA implementation. In the paper there are presented experimental results which show that stages 2 and 3 have an influence on the higher overall quality of the decompression. The previous works [3][4] were focused on the first, or on the first and second decoding stage. There is described the concept design of VLC decoder implementation in a reprogrammable chip, realising all three stages in compliance with the IEC-61834 standard when taking into account reusing it in a hardware DV decoder as a processing element in the pipeline architecture.
    Źródło:
    Pomiary Automatyka Kontrola; 2010, R. 56, nr 7, 7; 755-757
    0032-4140
    Pojawia się w:
    Pomiary Automatyka Kontrola
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Lightweight compression with encryption based on asymmetric numeral systems
    Autorzy:
    Duda, Jarosław
    Niemiec, Marcin
    Powiązania:
    https://bibliotekanauki.pl/articles/2201015.pdf
    Data publikacji:
    2023
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    symmetric cryptography
    lightweight cryptography
    data compression
    entropy coding
    kryptografia symetryczna
    kryptografia lekka
    kompresja danych
    kodowanie entropijne
    Opis:
    Data compression combined with effective encryption is a common requirement of data storage and transmission. Low cost of these operations is often a high priority in order to increase transmission speed and reduce power usage. This requirement is crucial for battery-powered devices with limited resources, such as autonomous remote sensors or implants. Well-known and popular encryption techniques are frequently too expensive. This problem is on the increase as machine-to-machine communication and the Internet of Things are becoming a reality. Therefore, there is growing demand for finding trade-offs between security, cost and performance in lightweight cryptography. This article discusses asymmetric numeral systems-an innovative approach to entropy coding which can be used for compression with encryption. It provides a compression ratio comparable with arithmetic coding at a similar speed as Huffman coding; hence, this coding is starting to replace them in new compressors. Additionally, by perturbing its coding tables, the asymmetric numeral system makes it possible to simultaneously encrypt the encoded message at nearly no additional cost. The article introduces this approach and analyzes its security level. The basic application is reducing the number of rounds of some cipher used on ANS-compressed data, or completely removing an additional encryption layer when reaching a satisfactory protection level.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2023, 33, 1; 45--55
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Novel Ideas for Lossless Audio Coding
    Autorzy:
    Ulacha, G.
    Stasiński, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/227339.pdf
    Data publikacji:
    2013
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    Lossless Audio Coding
    context coding
    LS predictors
    MMSE
    MMAE
    zero-order entropy
    Opis:
    Novel ideas for lossless audio coding analyzed in the paper are linked with forward predictor adaptation, and concern optimization of predictors on the basis of zero-order entropy and MMAE criterions, and context sound coding. Direct use of the former criterion is linked with exponential growth of optimization procedure, hence, a suboptimal algorithm having polynomial complexity is proposed. It is shown that on average the new types of predictors are better than those obtained by MMSE technique, while two- and three context systems are on average better than a single predictor one. It also appears that 7-bit PARCOR coefficients in the MPEG-4 ALS standard have insufficient precision for some predictor length, and that for very long frames coding results improve with the predictor rank practically in unlimited way.
    Źródło:
    International Journal of Electronics and Telecommunications; 2013, 59, 1; 17-23
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-6 z 6

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies