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.
RFID technology provides a powerful ability of perceiving the world for human and it produces vast amounts of data. how to store and analyze the mass information has become a new challenge. A novel data structure for management and storage of RFID data is proposed in this paper, which uses a improvement form of the T tree - T list of trees (Dual T tree) and a path encoding technique to build spatio-temporal...
This paper focuses on the problem of queue-aware resource allocation for OFDMA cellular systems supporting both real-time and non-real-time services. A set of practical algorithms is proposed to solve the problem of maximizing the system utility under the constraints of both system resources and the actual amounts of data to be transmitted in buffers. Moreover, an upper bound is devised to quantify...
Mobile broadcasting MIMO systems differ in several essential ways from conventional MIMO applications, especially when they are operating in single-frequency networks. There are certain channel features, like the imbalance of received average powers, which should be taken into account in system design. In this paper, space-time coding that allows reduced complexity maximum likelihood decoding of the...
The availability of inexpensive cameras enables alternative applications beyond personal video communication. For example, surveillance of rooms and home premises is such an alternative application, which can be extended with remote viewing on hand-held battery-powered consumer devices. Scalable wavelet image/video coding is attractive for this application since the video can be scaled easily to many...
Scalable video coding (SVC) is an H.264/AVC scalable extension (SE) that is used to provide network-friendly scalability at the bit stream level. SVC newly adapts the various prediction techniques. They can achieve high encoding efficiency, but they increase the computational complexity. In this paper, an efficient mode decision is proposed to speed up SVC with combined scalability. The experimental...
The purpose of this paper is to improve allocation of the number of bits without skipping the frame by accurately estimating the target bits in H.264/AVC rate control. In our scheme, we propose an enhancement method of the target frame rate based H.264/AVC bit allocation. The enhancement uses a frame complexity estimation to improve the existing mean absolute difference (MAD) complexity measurement...
Multi-view video coding by using the hierarchical B picture structure utilizes intra-view and inter-view predictions to reduce redundant information. The best coding mode is determined by exhaustively searching over all possible partition modes using rate distortion comparison in motion estimation for each macroblock. However, there is a high computational complexity in exhaustive searching. This...
In this paper, we propose a novel efficient downsizing video transcoder for H.264/AVC low bit-rate compressed images. The algorithm accounts for new coding tools introduced by the H.264/AVC standard and applies directly on the transformed coefficients, thus reducing greatly the computational complexity of the transcoding algorithm. In a first approach, we restrict ourselves to 4×4 blocks intra-coded...
In our previous work, the rate-distortion optimized transform (RDOT) is introduced for Intra coding, which is featured by the usage of multiple offline-trained transform matrix candidates. The proposed RDOT achieves remarkable coding gain for KTA Intra coding, while maintaining almost the same computational complexity at the decoder. However, at the encoder, the computational complexity is increased...
In this paper, we address two problems found in embedded implementations of Scalable Video Codecs (SVCs): the temporal signal energy distribution and frame-to-frame quality fluctuations. The unequal energy distribution between the low- and high-pass band with integer-based wavelets leads to sub-optimal rate-distortion choices coupled with quantization-error accumulations. The second problem is the...
We propose a novel power-aware scheme for complexity-scalable multiview video coding on mobile devices. Our scheme exploits the asymmetric view quality which is based on the binocular suppression theory. Our scheme employs different quality-complexity classes (QCCs) and adapts at run time depending upon the current battery state. It thereby enables a run-time tradeoff between complexity and video...
Distributed Video Coding (DVC) is a popular topic in the research community and the past years have seen several different implementations. DVC has been proposed as a solution for applications that have limited battery resources and low hardware complexity, thus necessitating a low complexity encoder. An ideal application would be in remote surveillance/monitoring or live video conferencing. However,...
In this paper, an efficient search center definition algorithm is proposed for H.264/AVC. H.264/AVC achieved high coding efficiency by introducing some new coding tools including a new definition of the search center. However, the definition of the search center is not efficient in the case of significant motions. This work proposes some new search center candidates using spatial and temporal correlations...
Today, video applications on handheld devices become more and more popular. Due to limited computational capability of handheld devices, complexity constrained video coding draws much attention. In this paper, a medium-granularity computational complexity control (MGCC) is proposed for H.264/AVC. First, a large dynamic range in complexity is achieved by taking 16×16 motion estimation in a single reference...
This paper presents an improved feedback-assisted low complexity WZVC scheme. The performance of this scheme is improved by two enhancements: an improved mode-based key frame encoding and a 3DRS-assisted (three-dimensional recursive search assisted) motion estimation algorithm for WZ encoding. Experimental results show that our coding scheme can achieve significant gain compared to state-of-the-art...
In this paper, we introduce the concept of generalized instantly decodable network coding (G-IDNC) to further minimize decoding delay in wireless broadcast, compared to strict instantly decodable network coding (S-IDNC), studied in. G-IDNC loosens the strict instant decodability constraint in order to target more receivers while preserving the attractive properties of S-IDNC. We show that the minimum...
We consider the problem of accessing large data files stored at multiple locations across a content distribution, peer-to-peer, or massive storage network. We assume that the data is stored in either original form, or encoded form at multiple network locations. Clients access the data through simultaneous downloads from several servers across the network. The central problem in this context is to...
We consider distributed storage over two untrusted networks, whereby coding is used as a means to achieve a prescribed level of confidentiality. The key idea is to exploit the algebraic structure of the Vandermonde matrix to mix the input blocks, before they are stored in different locations. The proposed scheme ensures that eavesdroppers with access to only one of the networks are unable to decode...
In this paper, the performance limit of lattice sequential decoder for coded M× N MIMO channel is analysed. We determine the rates achievable by lattice coding and sequential decoding applied to such channel. The diversity-multiplexing trade- off under lattice sequential decoding is derived as a function of its parameter---the bias term. Such parameter is critical for controlling the amount of computations...
H.264 introduces a technology of intra-prediction to improve the coding efficiency of I frames, but also greatly increased the computational complexity of encoding. This paper proposes a fast intra- prediction mode selection algorithm. The algorithm predicted macroblock boundaries and the fast intra- prediction mode selection to speed up encoding rate. The result of experiments show that the proposed...
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.