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 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...
Most distributed source coding schemes involve the application of a channel code to the signal and transmission of the resulting syndromes. For low-complexity encoding with superior compression performance, graph-based channel codes such as LDPC codes are used to generate the syndromes. The encoder performs simple XOR operations, while the decoder uses belief propagation (BP) decoding to recover the...
The requirement to transmit video data over unreliable wireless networks is anticipated in the foreseeable future. Significant compression ratio and error resilience are both needed for applications including tele-operated robotics, vehicle-mounted cameras, sensor network, etc. Block-matching based inter-frame coding techniques, such as MPEG-x and H.26x, do not perform well in these scenarios due...
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...
An information hiding method on escape sequences of Huffman coding which can embed a great deal of secret information into AAC files is proposed based on the research of AAC coding standard. The proposed algorithm first unpacks the cover AAC file to search for the escape sequences, and then modifies least significant bit (LSB) of the escape sequences with the approach of matrix encoding, to improve...
The mobile robot which accomplishes a work in explored region does not know location information of surroundings. Traditionally, simultaneous localization and mapping(SLAM) algorithms solve the localization and mapping problem in explored regions. Among the several SLAM algorithms, the EKF (Extended Kalman Filter) based SLAM is the scheme most widely used. The EKF is the optimal sensor fusion method...
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...
The technique of variable block-size motion estimation is employed in the H.264 international video coding standard to obtain better compression performance. However, this technique brings about a lot of increase in the computational complexity and thus is very time-consuming. For this reason, a new fast motion estimation mode decision algorithm is proposed in this paper to reduce the computational...
In this paper, we propose a fast intra-prediction mode selection method for JVT video coding standard H.264. The fast mode decision is based on the quantization parameter and the local edge information obtained by calculating the edge histogram parameters. The inclusion of the DC mode is based on the Residual Complexity factor. The proposed method reduces the computational complexity and time considerably...
NAND flash memories are the most widely used non-volatile memories, and data movement is common in flash storage systems. We study data movement solutions that minimize the number of block erasures, which are very important for the efficiency and longevity of flash memories. To move data among n blocks with the help of ?? auxiliary blocks, where every block contains m pages, we present algorithms...
We consider a class of decentralized team decision problems with non classical information structure and discrete state spaces. In general, decentralized team decision problems are NP-complete. In this paper, we present a simple class of problems where an optimal solution can be obtained via coding. This class is motivated by a famous mathematical puzzle called the hats problem.
Digital watermarking is an effective technology for digital products copyright protection and data security maintenance as well as an important branch of information hiding technology. A kind of MPEG-2 video watermarking scheme based on spread spectrum technology is introduced in this paper. First starting with MPEG-2 compressed video standard and then the algorithm principle of video watermarking...
We present here a new algorithm for encoding binary information into words of prescribed length and weight. Existing solutions use a combinatorial approach and, though they are optimal in terms of information theory, they have a rather high algorithmic complexity as they require the computation of binomial coefficients. The solution we propose has linear complexity. The price to pay is variable length...
Front-end integrated circuits for spike sorting will be useful in neuronal recording systems that engage a large number of electrodes. Detecting, sorting and encoding spike data at the front-end will reduce the data bandwidth and enable wireless communication. Without such data reduction, large data volumes need to be transferred to a host computer and typically heavy cables are required which constrain...
Non-uniform demand networks are defined as a useful connection model, in between multicasts and general connections. In these networks, each sink demands a certain number of messages, without specifying their identities. We study the solvability of such networks and give a tight bound on the number of sinks for which the min cut condition is sufficient. This sufficiency result is unique to the non-uniform...
This paper addresses the problem of achieving a specified information rate for every user in a multi-user MIMO broadcast channel. We propose two methods for finding the set of transmit covariance matrices that minimizes the transmit power subject to the dirty-paper coding rates equal to some specified values. The first method applies to the case with a fixed encoding order and each receiver has one...
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.