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ę "kodowanie" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-11 z 11
    Tytuł:
    P2P video streaming combining SVC and MDC
    Autorzy:
    López-Fuentes, F. A.
    Powiązania:
    https://bibliotekanauki.pl/articles/907783.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    sieć równorzędna
    strumieniowanie wideo
    kodowanie wideo
    kodowanie skalowalne
    peer-to-peer networks
    video streaming
    scalable video coding
    multiple description video coding
    Opis:
    In this paper we propose and evaluate a combined SVC-MDC (Scalable Video Coding & Multiple Description Video Coding) video coding scheme for Peer-to-Peer (P2P) video multicast. The proposed scheme is based on a full cooperation established between the peer sites, which contribute their upload capacity during video distribution. The source site splits the video content into many small blocks and assigns each block to a single peer for redistribution. Our solution is implemented in a fully meshed P2P network in which peers are connected to each other via UDP (User Datagram Protocol) links. The video content is encoded by using the Scalable Video Coding (SVC) method. We present a flow control mechanism that allows us to optimize dynamically the overall throughput and to automatically adjust video quality for each peer. Thus, peers with different upload capacity receive different video quality. We also combine the SVC method with Multiple Description Coding (MDC) to alleviate the packet loss problem. We implemented and tested this approach in the PlanetLab infrastructure. The obtained results show that our solution achieves good performance and remarkable video quality in the presence of packet loss.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2011, 21, 2; 295-306
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Gradient flow optimization for reducing blocking effects of transform coding
    Autorzy:
    Gao, F.
    Li, X.
    Wang, X.
    Wee, W. G.
    Powiązania:
    https://bibliotekanauki.pl/articles/907251.pdf
    Data publikacji:
    2004
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    przepływ gradientu
    efekt blokowania
    kodowanie transformatowe
    gradient flow
    blocking effects
    optimization
    transform coding
    Opis:
    This paper addresses the problem of reducing blocking effects in transform coding. A novel optimization approach using the gradient flow is proposed. Using some properties of the gradient flow on a manifold, an optimized filter design method for reducing the blocking effects is presented. Based on this method, an image reconstruction algorithm is derived. The algorithm maintains the fidelity of images while reducing the blocking effects. Experimental tests demonstrate that the presented algorithm is effective.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2004, 14, 1; 105-111
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Synthesis of finite state machines for CPLDs
    Autorzy:
    Czerwiński, R.
    Kania, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/930019.pdf
    Data publikacji:
    2009
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    synteza logiczna
    FSM
    kodowanie stanów
    optymalizacja logiczna
    CPLD
    logic synthesis
    state assignment
    logic optimization
    Opis:
    The paper presents a new two-step approach to FSM synthesis for PAL-based CPLDs that strives to find an optimum fit of an FSM to the structure of the CPLD. The first step, the original state assignment method, includes techniques of two-level minimization and aims at area minimization. The second step, PAL-oriented multi-level optimization, is a search for implicants that can be shared by several functions. It is based on the graph of outputs. Results of experiments prove that the presented approach is especially effective for PAL-based CPLD structures containing a low number of product terms.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2009, 19, 4; 647-659
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    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ł:
    Large-scale hyperspectral image compression via sparse representations based on online learning
    Autorzy:
    Ülkü, İ.
    Kizgut, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/331241.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    hyperspectral imaging
    compression algorithm
    dictionary learning
    sparse coding
    obrazowanie wielospektralne
    algorytm kompresji
    nauczanie online
    kodowanie rzadkie
    Opis:
    In this study, proximity based optimization algorithms are used for lossy compression of hyperspectral images that are inherently large scale. This is the first time that such proximity based optimization algorithms are implemented with an online dictionary learning method. Compression performances are compared with the one obtained by various sparse representation algorithms. As a result, proximity based optimization algorithms are listed among the three best ones in terms of compression performance values for all hyperspectral images. Additionally, the applicability of anomaly detection is tested on the reconstructed images.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2018, 28, 1; 197-207
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Neural Networks in the Framework of Granular Computing
    Autorzy:
    Pedrycz, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/911146.pdf
    Data publikacji:
    2000
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    kodowanie
    dekoder
    sieć neuronowa
    przedstawienie wiedzy
    information granulation
    pyramid architectures
    encoding and decoding
    neural networks
    learning
    knowledge representation
    Opis:
    The study is concerned with the fundamentals of granular computing and its application to neural networks. Granular computing, as the name itself stipulates, deals with representing information in the form of some aggregates (embracing a number of individual entitites) and their ensuing processing. We elaborate on the rationale behind granular computing. Next, a number of formal frameworks of information granulation are discussed including several alternatives such as fuzzy sets, interval analysis, rough sets, and probability. The notion of granularity itself is defined and quantified. A design agenda of granular computing is formulated and the key design problems are raised. A number of granular architectures are also discussed with an objective of dealineating the fundamental algorithmic and conceptual challenges. It is shown that the use of information granules of different size (granularity) lends itself to general pyramid architectures of information processing. The role of encoding and decoding mechanisms visible in this setting is also discussed in detail along with some particular solutions. Neural networks are primarily involved at the level of numeric optimization. Granularity of information introduces another dimension to the neurocomputing. We discuss the role of granular constructs in the design of neural networks and knowledge representation therein. The intent of this paper is to elaborate on the fundamentals and put the entire area in a certain perspective while not moving into specific algorithmic details.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2000, 10, 4; 723-745
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Application of triple correlation and bispectrum for interference immunity improvement in telecommunications systems
    Autorzy:
    Molchanov, P.
    Totsky, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/907903.pdf
    Data publikacji:
    2008
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    telekomunikacja
    bispektrum
    przesuw częstotliwości
    kluczowanie częstotliwości
    kodowanie nadmiarowe
    korelacja potrójna
    telecommunications
    frequency shift keying
    redundant encoding
    triple correlation
    bispectrum
    Opis:
    This paper presents a new noise immunity encoding/decoding technique by using the features of triple correlation and bispectrum widely employed in digital signal processing systems operating in noise environments. The triple correlationand bispectrum-based encoding/decoding algorithm is tested for a digital radio telecommunications binary frequency shift keying system. The errorless decoding probability was analyzed by means of computer simulation for the transmission and reception of a test message in a radio channel disturbed by both additive white Gaussian noise (AWGN) and a mixture of an AWGN and an impulsive noise. Computer simulation results obtained for varying and less than unity signal-to-noise ratios at the demodulator input demonstrate a considerable improvement in the noise immunity of the technique suggested in comparison with the traditional redundant linear block encoding/decoding technique.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2008, 18, 3; 361-367
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Comparison of supervised learning methods for spike time coding in spiking neural networks
    Autorzy:
    Kasiński, A.
    Ponulak, F.
    Powiązania:
    https://bibliotekanauki.pl/articles/908459.pdf
    Data publikacji:
    2006
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    uczenie nadzorowane
    sieć neuronowa
    kodowanie czasowe
    sekwencja czasowa
    supervised learning
    spiking neural networks
    time coding
    temporal sequences of spikes
    Opis:
    In this review we focus our attention on supervised learning methods for spike time coding in Spiking Neural Networks (SNNs). This study is motivated by recent experimental results regarding information coding in biological neural systems, which suggest that precise timing of individual spikes may be essential for efficient computation in the brain. We are concerned with the fundamental question: What paradigms of neural temporal coding can be implemented with the recent learning methods? In order to answer this question, we discuss various approaches to the learning task considered. We shortly describe the particular learning algorithms and report the results of experiments. Finally, we discuss the properties, assumptions and limitations of each method. We complete this review with a comprehensive list of pointers to the literature.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2006, 16, 1; 101-113
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Towards spike-based speech processing: a biologically plausible approach to simple acoustic classification
    Autorzy:
    Uysal, I.
    Sathyendra, H.
    Harris, J. G.
    Powiązania:
    https://bibliotekanauki.pl/articles/907947.pdf
    Data publikacji:
    2008
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    kodowanie synchroniczne
    blokowanie fazowe
    percepcja mowy
    psychoakustyka
    rozpoznawanie mowy
    spike coding
    synchrony coding
    phase locking
    speech perception
    psychoacoustics
    speech recognition
    Opis:
    Shortcomings of automatic speech recognition (ASR) applications are becoming more evident as they are more widely used in real life. The inherent non-stationarity associated with the timing of speech signals as well as the dynamical changes in the environment make the ensuing analysis and recognition extremely difficult. Researchers often turn to biology seeking clues to make better engineered systems, and ASR is no exception with the usage of feature sets such as Mel frequency cepstral coefficients, which employ filter banks similar to cochlear filter banks in frequency distribution and bandwidth. In this paper, we delve deeper into the mechanics of the human auditory system to take this biological inspiration to the next level. The main goal of this research is to investigate the computation potential of spike trains produced at the early stages of the auditory system for a simple acoustic classification task. First, various spike coding schemes from temporal to rate coding are explored, together with various spike-based encoders with various simplicity levels such as rank order coding and liquid state machine. Based on these findings, a biologically plausible system architecture is proposed for the recognition of phonetically simple acoustic signals which makes exclusive use of spikes for computation. The performance tests show superior performance on a noisy vowel data set when compared with a conventional ASR system.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2008, 18, 2; 129-137
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Facial expression recognition under difficult conditions: A comprehensive study on edge directional texture patterns
    Autorzy:
    Ahmed, F.
    Kabir, M. H.
    Powiązania:
    https://bibliotekanauki.pl/articles/331105.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    directional ternary pattern
    compressed DTP
    facial feature descriptor
    texture encoding
    support vector machine
    deskryptor cech
    kodowanie struktury
    maszyna wektorów wsparcia
    Opis:
    In recent years, research in automated facial expression recognition has attained significant attention for its potential applicability in human–computer interaction, surveillance systems, animation, and consumer electronics. However, recognition in uncontrolled environments under the presence of illumination and pose variations, low-resolution video, occlusion, and random noise is still a challenging research problem. In this paper, we investigate recognition of facial expression in difficult conditions by means of an effective facial feature descriptor, namely the directional ternary pattern (DTP). Given a face image, the DTP operator describes the facial feature by quantizing the eight-directional edge response values, capturing essential texture properties, such as presence of edges, corners, points, lines, etc. We also present an enhancement of the basic DTP encoding method, namely the compressed DTP (cDTP) that can describe the local texture more effectively with fewer features. The recognition performances of the proposed DTP and cDTP descriptors are evaluated using the Cohn–Kanade (CK) and the Japanese female facial expression (JAFFE) database. In our experiments, we simulate difficult conditions using original database images with lighting variations, low-resolution images obtained by down-sampling the original, and images corrupted with Gaussian noise. In all cases, the proposed method outperforms some of the well-known face feature descriptors.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2018, 28, 2; 399-409
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    FSM encoding for BDD representations
    Autorzy:
    Gosti, W.
    Villa, T.
    Saldanha, A.
    Sangiovanni-Vincentelli, A. L.
    Powiązania:
    https://bibliotekanauki.pl/articles/911255.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    binarny diagram decyzyjny
    kodowanie
    automat skończony
    synteza logiczna
    weryfikacja formalna
    binary decision diagram
    encoding
    finite state machine
    logic synthesis
    formal verification
    logic representation
    Opis:
    We address the problem of encoding the state variables of a finite state machine such that the BDD representing the next state function and the output function has the minimum number of nodes. We present an exact algorithm to solve this problem when only the present state variables are encoded. We provide results on MCNC benchmark circuits.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2007, 17, 1; 113-128
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-11 z 11

      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