Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
One Dimensional (1D) Double Weight (DW) code families are one of the coding schemes reported for Spectral Amplitude Coding — Optical Code Division Multiple Access systems. Modified Double Weight code and Enhanced Double Weight code are two algorithms which increase the scope of DW code for even and odd weights respectively. By using above mentioned codes, two Dimensional (2D) codes are generated....
Modern patient data tends to be large-scale and multi-dimensional, containing both spatial and temporal features. Learning good spatio-temporal features from large patient data is a challenging task, especially when there are missing observations. In this paper, we propose a spatio-temporal autoencoder (STAE), an unsupervised deep learning scheme, to learn features from large-scale and high-dimensional...
Identifying structure of genes in Human genomes highly depends upon accurate recognition of boundaries between exons and introns, i.e. splice sites. Hence, development of new methods for effective detection of splice sites is essential. DNA encoding approaches are used for feature extraction from gene sequences, while machine learning methods are used for classification of splice sites using those...
With the development of next-generation sequencing technologies, large number of transcripts has been accumulated in public databases. Long non-coding RNAs (lncRNAs), typically above 200 nucleotides in sequence length, have recently attracted increasing interests because of their important roles in various cellular processes. While it is straightforward to distinguishing lncRNAs from most small non-coding...
A new synthesis scheme is proposed to effectively generate a random vector with prescribed joint density that induces a (latent) Gaussian tree structure. The quality of synthesis is measured by total variation distance between the synthesized and desired statistics. The proposed layered and successive encoding scheme relies on the learned structure of tree to use minimal number of common random variables...
Feature ranking from video-wide temporal evolution brings reliable information for complex action recognition. However, a video may contain similar features in the sequence of frames which deliver unnecessary information to the ranking function. This paper proposes a method to improve the rank-pooling strategy which captures the optimized latent structure of the video sequence data. The optimization...
This paper proposes a power-stable code based DPA resistant technique for AES encryption circuit. The power-stable code is adopted to stabilize the leaked power consumption of key logic circuit. In this paper, the circuits of Addroundkey is designed with the proposed technique for standard AES algorithm. The real-time power consumption of designed circuits are recorded from oscilloscope. DPA attack...
With the significant increase of the network heterogeneity and the wide use of emerging video applications such as wireless sensor networks, video surveillance systems or remote sensing, the Distributed Scalable Video Coding (DSVC) is a potential solution for efficiently transmitting and storing video data due to its high compression efficiency and low encoding complexity capabilities. In DSVC framework,...
Traditional image classification methods require the independence and the same distribution of training and testing data. However, this requirement cannot always be satisfied in some real-world applications, especially for crossdomain image classification tasks. In this paper, we propose to deal with this problem by combining transfer learning with sparse coding and dictionary learning. In dictionary...
Erasure coding has been extensively employed for data availability protection in production storage systems by maintaining a low degree of data redundancy. However, how to mitigate the parity update overhead of partial stripe writes in erasure-coded storage systems is still a critical concern. In this paper, we reconsider this problem from two new perspectives: data correlation and stripe organization,...
We present our previous work in [17] in a more generic way to construct q-ary Golay complementary sets and near-complementary sets of size N and sequence length M · Nm by using different seed sequences, where m is an arbitrary non-negative integer, M is the length of seed sequences and N is a power of 2. The boolean functions of these sequences will also be derived with our method. To illustrate it,...
In this paper, we present a new method of constructing Z-complementary pulse trains from sequences with property of Equal Sums of (like) Powers (called ESP sequences) which are resilient to Doppler shifts. Numerical experiments indicate that the proposed Z-complementary pulse trains obtained from ESP sequences have better Doppler resilience than waveforms constructed from the well-known Prouhet-Thue-Morse...
This paper presents two intra prediction algorithms in High Efficiency Video Coding (HEVC) encoder for reducing the computational complexity and increase the encoding speed. The first algorithm takes advantage of the high spatial correlation among neighboring pixels to substitute the reference samples as the first row or first and second rows of the current block to be predicted, while the pixels...
With the introduction of several new coding tools and technology for depth maps in 3D-HEVC, the coding efficiency is improved at the expense of computational complexity. Meanwhile, the inter-view correlation is not considered and used well for depth maps, while it is developed maturely in texture video coding. Therefore, in this paper, we propose an early determination scheme for the best prediction...
In recent years, the high resolution, high precision and high sensitivity telescopes have been widely developed for astronomical observation in the world, such as SKA, Arecibo, ALMA and MingantU SpEctral Radioheliograpy (Muser). Along with these newly developed modern telescopes, a “big data” challenge was raised for data storage and processing. For example, Muser produces about 4.3TB raw data for...
We investigate the properties of two particular sets of separable two-qubit states with maximally mixed marginals, named parallel states and antiparallel states respectively. Although these two sets of states are prepared by the same type of quantum operations acting on classically correlated states with equal classical correlations, they share different properties. By comparing two fundamental figures...
Coherent singular beams, in particular optical vortices, are attractive for different applications: free-space optical communication, imaging, particle manipulation, etc. However, their deformation during propagation through random media and speckle noise forced to look to their partially coherent analogues. The singularities of partially coherent beams associated with zero points of the cross-correlation...
In this paper, an investigation of multiview video coding schemes is presented, based on different inter-view prediction structures and various group of pictures (GOP) sizes. The studied inter-view prediction schemes in this paper are: A new approach namely “PIP”, recently proposed (PBI), and the benchmark structure (MVC). Results of the conducted tests allow to order the studied inter-view structures...
Learning to hash has been recognized to accomplish highly efficient storage and retrieval for large-scale visual data. Particularly, ranking-based hashing techniques have recently attracted broad research attention because ranking accuracy among the retrieved data is well explored and their objective is more applicable to realistic search tasks. However, directly optimizing discrete hash codes without...
Generative models of 3D human motion are often restricted to a small number of activities and can therefore not generalize well to novel movements or applications. In this work we propose a deep learning framework for human motion capture data that learns a generic representation from a large corpus of motion capture data and generalizes well to new, unseen, motions. Using an encoding-decoding network...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.