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.
HEVC (high efficiency video coding), as the latest video coding standard, is more efficient than H.264/AVC, nevertheless it also brings in a very high computational complexity. To reduce the time of CU (coding unit) splitting or PU (prediction unit) mode deciding, a fast algorithm based on ANN (artificial neural network) and texture analysis is proposed in this paper. First, we acquire and then label...
This paper proposes an intuitive yet simple machine learning (ML) approach that consist of two generic algorithms augmenting one another to solve problems they are not designed to solve. Since most machine learning algorithms are designed for a particular dataset or task, combining multiple ML algorithms can greatly improve the overall result by either helping tune one another, generalize, or adapt...
In this paper, Structure and properties of neural networks with quadratic junction are presented. Unsupervised learning rules about the neural networks are given. Using this kind of neural networks, an ART-based hierarchical clustering algorithm is suggested. The algorithm can determine the number of clusters and clustering data. The time and space complexity of the algorithm are discussed. A 2-D...
This paper describes a novel fast mean shift algorithm based on a resampling technique with marked regular pyramid structure. This new method focuses on solving the problem of high calculation complexity when high data dimension or large data sets are involved in mean shift. By resampling the original image with marked regular pyramid structure, improved method reduces the number of pixels requiring...
This paper proposed a new point symmetry-based ant clustering algorithm which can defect the number of clusters and the proper partitions from data sets when data sets possess the property of symmetry. In the proposed algorithm, a revised ant clustering algorithm is presented which can reduce the running time of standard ant clustering algorithm. Each ant represents a data object. It will decide its...
A low complexity weighted two-bit transforms (2BT) based multiple candidates motion estimation algorithm is proposed in this paper. By exploiting almost the identical operations in two different matching error criteria, we can efficiently determine two best motion vectors according to the respective matching criteria and can enhance the overall motion estimation accuracy. Experimental results show...
This paper presents a Lempel Ziv Complexity (LZC) based pruning algorithm, called Silent Pruning Algorithm (SPA), for designing artificial neural networks (ANNs). This algorithm prunes hidden neurons during the training process of ANNs according to their ranks computed with LZC. LZC extracts the number of unique patterns in a time sequence as a measure of rank. As a result, it is expected that LZC...
A methodological proposal to estimate a Tailored to the Problem Specificity mathematical transformation is developed. To begin, Linear Analysis is briefly visited because of its significant role providing a unified vision of mathematical transformations. Thereafter it is explored the possibilities of extending this approach when basis of vector spaces are built tailored to the specific knowledge on...
Subspace projection (SP) is a kind of efficient subspace tracking algorithm, and it is an incremental principal component analysis algorithm too. In this paper the SP algorithm is first analyzed in detail; then, based on the eigenvector's property the computation complexity of SP is reduced from O(N2(P+1)) to O(N2); finally, the covariance matrix is replaced with approximated covariance matrix which...
Symbiotic information and multicast algorithms have garnered limited interest from both futurists and systems engineers in the last several years. Given the current status of client-server communication, electrical engineers clearly desire the refinement of lambda calculus. We confirm not only that flip-flop gates can be made autonomous, game-theoretic, and concurrent, but that the same is true for...
We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact algorithms for finding patterns that are embedded as exact or inexact instances in all or most of the input strings. The proposed algorithms (1) improve search efficiency compared to existing exact algorithms by focusing search...
Multicarrier Modulation (MCM) is an attractive transmission technique that provides improved performance in various communication systems. A fundamental issue of multicarrier communication systems is power allocation, which is addressed as a constrained multivariable nonlinear optimization problem. In this paper, we develop a computationally efficient solution for the loading of multicarrier systems...
This paper proposes spatial outliers detection method of studying multiple non-spatial attributes based on special objects. The spatial outliers detection algorithm based on the Mahalanobis distance is proposed in this paper. The simulated experiment results demonstrate this method is feasible and effective, simultaneously the time complexity of center algorithm is analysed. Except the research type...
In order to improve the software reliability early, this paper proposes an efficient algorithm to select fault-prone software module. Based on software module's complexity metrics, the algorithm uses modified cascaded-correlation algorithm as neural network classifier to select the fault-prone software module. Finally, by analyzing the algorithm's application in the project MAP, the paper shows the...
This paper presents a critical analysis of the Pareto-Following Variation Operator (PFVO) when used as an approximation method for Multiobjective Evolutionary Algorithms (MOEA). In previous work, we have described the development and implementation of the PFVO. The simulation results reported indicated that when the PFVO was integrated with NSGA-II there was a significant increase in the convergence...
In this paper, an efficient text classification algorithm for repeating-text information on the e-commerce site can automatically classify and sort the similar string. This algorithm will greatly increase the efficiency and accuracy of audited information. All tests show that for the number of information between 100 and 1000 the algorithm is very efficient, and the 1000 text information(strings)...
Order selection of linear regression models has been thoroughly researched in the statistical community for some time. Different shrinkage methods have been proposed, such as the Ridge and Lasso regression methods. Especially the Lasso regression has won fame because of its ability to set less important parameters exactly to zero. However, these methods do not take dynamical systems into account,...
Estimating the number of hidden neurons required for the implementation of an arbitrary function is a fundamental problem of neural networks. This paper presents the lower bound on the number of hidden neurons in three-layer multi-valued multi-threshold neural networks for implementation of an arbitrary q-valued function defined on a set of N-point with n-dimension (N??qn). This result can be applied...
This paper addresses a simple and fast algorithm for finding the second critical path in CPM network by safety float. The algorithm is based on the properties of safety float and the relationship between the length of a path and its safety float. The paper argues that the longest path passing through the activity immediately succeeding the critical node with the minimum non-zero safety float is the...
In this paper, we present a new iterative receiver algorithm based on sort QR decomposition to mitigating the error propagation of VBLAST. The performance of first detected layer is enhanced for it is detected iteratively, so the performance of the overall system is improved. The proposed algorithm achieves good performance compared to standard ZF-VBLAST with reduced computational complexity.
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.