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.
We take two new approaches to design efficient algorithms for transmitter optimization under rate constraints in order to guarantee the Quality of Service for MIMO B-MAC interference networks. A B-MAC network is a generalized interference network that is a combination of multiple interfering broadcast channels (BC) and multiaccess channels (MAC). Two related optimization problems, maximizing the minimum...
Abstract--This article is based on H.264/AVC video coding standard, including analysis of the current UMHexagonS algorithm processes and problems, Optimization of the entire pixel search algorithm UMHexagonS and an improved sub-pixel search algorithm, and gives the improved UMHexagonS algorithm process ,describes its advantages. Experimental results show the improved efficiency of the algorithm, practical...
Motion estimation for video coding problem, a prediction based on the triangle - a small cross algorithm. The algorithm is mainly used in small cross on the static template blocks and blocks of small campaign focused search, the search for large sports block with triangle template. With the classic diamond search algorithm and square - diamond search algorithm comparison, the search speed increased...
We present a new implicit branching strategy for maximum clique. The new strategy is based in Konj and Janečič's improvement over reference MCR algorithm. It uses a fixed initial non increasing degree vertex ordering at every step of the search, to obtain tighter bounds than MCR on average. We show that the new branching strategy integrates nicely with a natural bit model for the domain. This allows...
This paper proposes a fast inter prediction mode decision method for H.264. Motion compensation residuals of macroblock are used to analyze motion characteristics of each portion, and reduce the candidate inter modes to a small subset. Compared with the exhaustive mode search, the proposed method achieves an average 63% reduction in computation time with negligible degradation in visual quality. Compared...
To find MST (Minimum Spanning Trees) in complete graph is a classical problem in operation research having network design as an important application. It is possible to solve MST problem efficiently, but its Biobjective versions are NP hard. In this paper, we present a comparison of two encoding schemes for representing tree in Biobjective optimization scenario. The three different instances of Biobjective...
Wireless Sensor Network (WSN) nodes are powered by limited battery and communication consumes most of the energy. Therefore, it's not appropriate to transmit data directly in the networks while compressing data before sending is an effective method to save energy for nodes. According to the need for fully recovering the compressed numerical data, based on the LZW (Lempel-Ziv-Welch) algorithm, this...
This paper presents one-bit cell supporting input voltage to synthesize triangular-like DC transfer characteristic and digital output of Gray-code algorithmic analog-to-digital converter. The proposed one-bit cell is based on the use of operational conveyors in connection with resistors, diodes, and voltage comparator. An N-bit resolution can be simply realized by cascading the N proposed one-bit...
In this paper, we present a fast biological data mining algorithm named IRTM based on embedded frequent subtree. We also advance a string encoding method for representing the trees, a scope-list for extending all substrings and some pruning rules which can further reduce the computational time and space cost. Experimental results show that IRTM algorithm can achieve significantly performance improvement...
To deploy highly efficient video coding technologies on different hardware platform, complexity adjustable algorithms are required. One of the significant resource consumers is motion estimation (ME). This paper proposes a complexity adjustable algorithm for ME to remedy this issue. First, we build a mathematic model to indicate that macroblocks (MBs) with intensive motion are worthier of finer searching...
Association rule mining based on support and confidence generates a large number of rules. However, post analysis is required to obtain interesting rules as many of the generated rules are useless. We pose mining association rules as multi-objective optimization problem where objective functions are rule interestingness measures and use NSGA-II, a well known multi-objective evolutionary algorithm...
Differential evolution (DE) algorithm is a heuristic approach that gains more interest in today's research. It finds the true global minimum regardless of the initial parameter values, fast convergence, and using few control parameters. DE algorithm is a population based algorithm like genetic algorithm using similar operators; crossover, mutation and selection. This paper addresses the restrictive...
In today's world of globalization, local language storage and retrieval is essential for the developing nations like India. As our country is diversified by languages and only 10% of population is aware of English language, this diversity of languages is becoming barrier to understand and acquainted in digital world. It has been found that when services are provided in local languages, it has been...
Single Row Facility Layout Problem (SRFLP) consists of arranging a number of rectangular facilities with varying length on one side of a straight line to minimize the weighted sum of the distance between all facility pairs. In this paper we use a Particle Swarm Optimization (PSO) algorithm to solve the SRFLP. We first employ a new coding and decoding technique to efficiently map discrete feasible...
A fast mode decision algorithm is proposed to solve the computation complexity for enhancement hierarchical-B pictures with adaptive inter-layer prediction in H.264/AVC scalable extension, scalable video coding. This method exploits the evaluated modes of the co-located reference macroblocks, which include the best and other abandoned modes, to compose a new candidate group for the current macroblock...
In a variety of applications, ranging from highspeed networks to massive databases, there is a need to maintain histograms and other statistics in a streaming manner. Motivated by such applications, we establish the existence of efficient source codes that are both locally encodable and locally decodable. Our solution is an explicit construction in the form of a (randomized) data structure for storing...
Video Compression has played an important role in Multimedia data storage and transmission. Video compression techniques remove spatial as well as temporal redundancy using intra-frame and inter-frame coding respectively. A large level of compression can be achieved through inter-frame coding. In this paper, performance of four matching criterion in the temporal coding of video signal, which are Minimum...
Association rules mining is an important problem of data mining, in this paper we propose a association rules mining algorithm based on the simulated annealing immune programming algorithm which combines each character of the simulated annealing algorithm and immune programming algorithm. Through the theoretical analysis and the experiment we can find that this algorithm has better robustness and...
In order to facilitate the H.264/AVC implementation in application system with low bit rate; its coding algorithm should be optimized. In this paper, through analysis of the motion vector distribution in the video image and the serial search strategy, a type of parallel program based on the cross search algorithm is presented, designed and implemented. Finally this design program is played in the...
In order to improve some fundamental problems of the clonal selection algorithm (CSA), a novel clonal selection algorithm (NCSA) is proposed. After analyzing the mechanism of the clonal selection and proposing the antibody model, the basic character of the application problem fused into the NCSA based on rearrangements of antibody molecule coding genes. Next, we analyzed synthetically the antibody-antigen...
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.