The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In High Efficiency Video Coding (HEVC), a quad-tree based Coding Unit (CU) partitioning scheme is employed, achieving a substantial improvement in coding efficiency compared with previous standards. The superior coding efficiency of HEVC is achieved at the expense of greatly increased complexity. A fast intra coding scheme consisting of fast CU depth decision and fast prediction mode decision is proposed...
In this paper, the problem of identifying correlated components in a high-dimensional Gaussian vector is considered. In the setup considered, instead of having to take a full-vector observation at each time index, the observer is allowed to observe any subset or full set of components in the vector, and he has the freedom to design his sampling strategies over time. The observer aims to find an optimal...
High Efficiency Video Coding (HEVC) is one of the latest released video standards and offers up to 40% bitrate savings when compared to the widespread H.264/AVC standard, at the cost of a substantial complexity growth. Constraining the complexity of HEVC encoding is a challenging task for embedded applications based on a software encoder. The most frequent approach to solve this problem is to optimise...
In our previous work, pseudo random binary sequence generated by using trace function, Legendre symbol and mapping function has been researched. Our previous sequence generated by applying primitive polynomial over odd characteristics field Fp, trace function, and Legendre symbol. The previous sequence contained only 0 and 1 values. It has some interesting features such as period, periodic autocorrelation,...
Consider a multi-source multicast network coding problem with correlated sources. While the fundamental limits are known, achieving them, in general, involves a computational burden due to the complex decoding process. Efficient solutions, on the other hand, are by large based on source and network coding separation, thus imposing strict topological constraints on the networks which can be solved...
This paper proposes a normalized belief with the aid of node selection (NS) method in Gaussian belief propagation (GaBP) detection especially for a large multiuser multiple-input multiple-output (MU-MIMO) configurations in bands below 6 GHz. GaBP is known as an efficient detector regarding low computational complexity as well as high detection capability only if the BS has hundreds of receive antennas...
The evaluation dependencies of the high-speed parallel ADC hardware, time, structural and functional complexity on the range of the output signal quantization and binary codes capacity were received. The prospects of mass production and use of this type of ADC in digital equipment and microelectronic technology were shown.
A data-driven model predictive control (MPC) in modified partial least squares (PLS) framework is proposed in this paper after a brief summary of MPC strategy in PLS framework. A theoretical comparison between data-driven MPC strategy in these two framework is presented, which demonstrates that MPC in modified PLS framework benefits in both computation complexity and robustness. The feature of modeling...
Pseudo random sequences play an important role in cryptography and network security system. This paper proposes a new approach for generation of pseudo random sequence over odd characteristic field. The sequence is generated by applying a primitive polynomial over odd characteristic field, trace function and möbius function. Then, some important properties of the newly generated sequence such as period,...
In our previous work, well balanced pseudo random signed binary sequence generated by using trace function and Legendre symbol has been researched. Our previous sequence generated by applying primitive polynomial over odd characteristic field Fp, trace function and Legendre symbol. The important features such as period, periodic autocorrelation, and cross-correlation have already been well discussed...
Cocaine dependence devastates millions of human lives. Despite of a variety of treatments, there is a very high rate of individual relapse to drug use. In the last decade, functional magnetic resonance imaging (fMRI) proved to be a powerful tool to diagnose and understand different pathologies. This work provides advances in the identification of cocaine dependence and in the relapse prediction based...
Multi-label classification has attracted many attentions in various fields, such as text categorization and semantic image annotation. Aiming to classify an instance into multiple labels, various multi-label classification methods have been proposed. However, the existing methods typically build models in the identical feature (sub)space for all labels, possibly inconsistent with real-world problems...
Complexity is a double-edged sword for learning algorithms when the number of available samples for training in relation to the dimension of the feature space is small. This is because simple models do not sufficiently capture the nuances of the data set, while complex models overfit. While remedies such as regularization and dimensionality reduction exist, they themselves can suffer from overfitting...
Myoelectric pattern recognition (MPR) can be used for intuitive control of virtual and robotic effectors in clinical applications such as prosthetic limbs and the treatment of phantom limb pain. The conventional approach is to feed classifiers with descriptive electromyographic (EMG) features that represent the aimed movements. The complexity and consequently classification accuracy of MPR is highly...
Given a very large dataset of moderate-to-high dimensionality, how to mine useful patterns from it? In such cases, dimensionality reduction is essential to overcome the "curse of dimensionality". Although there exist algorithms to reduce the dimensionality of Big Data, unfortunately, they all fail to identify/eliminate non-linear correlations between attributes. This paper tackles the problem...
This paper proposes a novel approach for pseudo random ternary sequence over finite field. The sequence is generated from a primitive polynomial over finite field applying trace function and möbius function. This paper further presents some important properties such as period, autocorrelation and cross-correlation of the generated sequence. The proposed approach is experimented on various bit length...
Nowadays, social network analysis receives big attention from academia, industries and governments. Some practical applications such as community detection and centrality in economic networks have become main issues in this research area. Community detection algorithm for complex network analysis is mainly accomplished by the Louvain Method that seeks to find communities by heuristically finding a...
With the increase of systems' complexity, exception detection becomes more important and difficult. For most complex systems, like cloud platform, exception detection is mainly conducted by analyzing a large amount of telemetry data collected from systems at runtime. Time series data and events data are two major types of telemetry data. Techniques of correlation analysis are important tools that...
Generalized canonical correlation analysis (GCCA) aims at extracting common structure from multiple 'views', i.e., high-dimensional matrices representing the same objects in different feature domains – an extension of classical two-view CCA. Existing (G)CCA algorithms have serious scalability issues, since they involve square root factorization of the correlation matrices of the views. The memory...
Variable transform block (TB) sizes cause high computational complexity at the HEVC encoder. In this paper, a fast residual quad-tree (RQT) structure decision method is proposed to reduce the number of candidate transform sizes. The proposed method uses spatial and temporal correlation information in the neighbor blocks to predict the depth of current RQT. In addition, an efficient all zero block...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.