Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “Adaptive coding”
Savo Glisic · 2004
This chapter contains sections titled: Adaptive and reconfigurable block coding Adaptive and reconfigurable convolutional codes Concatenated codes with interleavers Adaptive coding, practice and prospects Appendix 2.1 Maximum a Posteriori Detection
Cited by 0
K.R., Ridderinkhof, den Wildenberg W.P.M., Van · HAL (Le Centre pour la Communication Scientifique Directe) · 2005
Cited by 0
Chengiie Tu, Jie Bang, Trac D. Tran · Proceedings - International Conference on Image Processing · 2003
Runlength coding is the standard coding technique for block transform based image/video compression. A block of quantized transform coefficients is first represented as a sequence of RUN (number of consecutive zeros) / LEVEL (the value of the following nonzero coefficient) pairs which are then entropy coded. We point out in this paper the inefficiency of conventional runlength coding and introduce a novel adaptive runlength coding scheme that encodes RUN and LEVEL symbols separately using context based adaptive binary arithmetic coding. We aim to maximize compression efficiency by adaptively exploiting the characteristics of block transform coefficients and the dependency between RUN and LEVEL. Coding results show that, with the same level of complexity, the proposed adaptive runlength coding algorithm outperforms the conventional runlength coding scheme by a wide margin in the rate-distortion (R-D) sense.
Cited by 5
Martin H. Weik · 2000
Cited by 0
Eric Gifford, Bobby R. Hunt, Michael W. Marcellin · 1995
Absfruct-A predictive image coder having minimal decoder complexity is presented. The image coder utilizes recursive interpolative DPCM in coqjunction with adaptive classfication, entropy-constrained trellis coded quantization, and optimal rate allocation to obtain signal-to-noise ratios (SNR’s) in the range of those provided by the most advanced transform coders.
Cited by 0
David C. Burr, Guido Marco Cicchini · Current Biology · 2014
Cited by 93Open access
Richard A. Jones · 1986
Cited by 1
S. Li, W. Li, Hao Sun et al. · 1998
Efficient coding of arbitrarily shaped visual objects is a new functionality of MPEG-4 visual coding standard, compared with MPEG-1 and MPEG-2. This functionality enables content-based interactivity required in many multimedia applications. There are two aspects of coding an arbitrarily shaped visual object. One is to code the shape information of the visual object (shape coding) and the other is to code the pixels in the visual object (arbitrary shape texture coding). Shape adaptive wavelet coding is a technique for efficiently coding the texture information of arbitrarily shaped visual objects. This paper presents this technique as it is used in MPEG-4.
Cited by 16
Jin Xu · oURspace (University of Regina) · 1998
Block Truncation Coding (BTC) technique has attracted much attention during the last few years as a simple source coding method to achieve good quality image reproduction by preserving the first two statistical moments of an image: the mean and the variance.It significantly reduces the amount of computation required by the traditional coding methods, such as transform or hybrid coding.Hierarchical BTC combines the BTC technique with the quadtree segmentation method to decompose the image into blocks of different sizes.HBTC reduces the bit rate by exploiting the nonstationarity of the image data, such as background.It demonstrates good performance on still and video sequence images.In this study, a new solution, called adaptive hierarchical block truncation coding (AHBTC) is proposed, which is extended from HBTC.The dynamic adaptive threshold values are used to provide a better guidance to decompose an image into different-sized blocks to achieve an even lower bit rate and better quality of the reconstructed image.The proposed method can also be used by BTC based progressive image transmission and non-progressive image transmission.With the growth of the Internet, image encryption is more and more important.A new image encryption technique for HBTC is also discussed.
Cited by 0Open access
R.D. Dony, S. Haykin · IEEE Transactions on Image Processing · 1995
The optimal linear block transform for coding images is well known to be the Karhunen-Loeve transformation (KLT). However, the assumption of stationarity in the optimality condition is far from valid for images. Images are composed of regions whose local statistics may vary widely across an image. While the use of adaptation can result in improved performance, there has been little investigation into the optimality of the criterion upon which the adaptation is based. In this paper we propose a new transform coding method in which the adaptation is optimal. The system is modular, consisting of a number of modules corresponding to different classes of the input data. Each module consists of a linear transformation, whose bases are calculated during an initial training period. The appropriate class for a given input vector is determined by the subspace classifier. The performance of the resulting adaptive system is shown to be superior to that of the optimal nonadaptive linear transformation. This method can also be used as a segmentor. The segmentation it performs is independent of variations in illumination. In addition, the resulting class representations are analogous to the arrangement of the directionally sensitive columns in the visual cortex.
Cited by 92
David Varodayan, Yao-Chung Lin, Bernd Girod · IEEE Transactions on Image Processing · 2011
We consider distributed source coding in the presence of hidden variables that parameterize the statistical dependence among sources. We derive the Slepian-Wolf bound and devise coding algorithms for a block-candidate model of this problem. The encoder sends, in addition to syndrome bits, a portion of the source to the decoder uncoded as doping bits. The decoder uses the sum-product algorithm to simultaneously recover the source symbols and the hidden statistical dependence variables. We also develop novel techniques based on density evolution (DE) to analyze the coding algorithms. We experimentally confirm that our DE analysis closely approximates practical performance. This result allows us to efficiently optimize parameters of the algorithms. In particular, we show that the system performs close to the Slepian-Wolf bound when an appropriate doping rate is selected. We then apply our coding and analysis techniques to a reduced-reference video quality monitoring system and show a bit rate saving of about 75% compared with fixed-length coding.
Cited by 20
R. Wang, Chih–Wei Huang, Pao‐Chi Chang · 2013
In this paper, we present the efficiency analysis of two sophisticated coding tools, multi-reference frame (MRF) and variable block size (VBS) that cost high computational complexity, in various spatial resolutions. The relationship between coding efficiency and spatial resolution is theoretically discovered. Based on the conclusion of the efficiency analysis that the efficiency improvement from sophisticated coding tools are gradually decreased in higher resolution, we propose an adaptive coding configuration for the encoding with various resolutions that yield significant complexity reduction with negligible RD performance decrease.
Cited by 0
Mohammad Ghasempour · 2025
Cited by 0
N. Memon · 2014
Cited by 0
Bing-bing Chai, Jozsef Vass, Xinhua Zhuang · 1998
In the mid-1980's, wavelet theory was developed in applied mathematics [1, 2, 3]. Soon, subband coding [4], which has been a very active research area for image and video compression, was identi ed as wavelet's discrete cousin. Furthermore, a fundamental insight into the structure of subband lters was developed from wavelet theory that led
Cited by 0
Michel Verhaegen, Gleb Vdovina · 2016
Abstract. We have implemented an extended depth of field optical system by wavefront coding with a micromachined membrane deformable mirror. This approach provides a versatile extension to standard wavefront coding based on fixed phase mask. First experimental results validate the feasibility of the use of adaptive optics for variable depth wavefront coding in imaging optical systems.
Cited by 0
Navneet Malani, Sang Wu Kim · IEEE Communications Letters · 2012
We propose a channel adaptive prioritized network coding technique that provides a variable quality of service (QoS) to different nodes in multiple access relay networks (MARN). The basic idea is to exclude the low priority nodes in the network encoder when their channel gains towards the destination are above a threshold, and vary the threshold to provide a variable QoS. The proposed technique can provide a soft-level prioritized service to different nodes depending on their assistance needs. They are a natural generalization of current prioritized network coding techniques which can provide only a hard-level (fixed) prioritized service. We derive the outage probability for the prioritized and non-prioritized nodes in Rayleigh flat fading channel with additive white Gaussian noise and derive optimum threshold based on QoS constraints.
Cited by 0
Shobhana Sugumar · eScholarship (California Digital Library) · 2014
Network Coding provides some benefits in terms of performance efficiency and throughput in dynamic environments such as Mobile Ad Hoc networks. However Network Coding also adds considerable overhead and computational complexity at the transmitter and receiver. Hence the need to come up with an algorithm to provide the optimum performance with minimum overhead and computational complexity arises. We propose an adaptive network coding technique that enables the source node to switch between storing and forwarding the original packets into the network and performing Random linear network coding (RLNC) of the packets of a file and send the coded packets into the network. We evaluate the performance of this adaptive technique by comparing it with MANETs with and without network coding. According to the adaptive Network Coding strategy, the source nodes, make the decision of switching network coding ON and OFF based on the size of the file, the estimated link expiration time between the nodes and the data rate of the network. We propose to switch off Network Coding in the nodes transmit the packets of the file directly when the File size is lesser than the maximum data that can be transmitted with the given data rate of the link and the estimated link expiration time. Otherwise the nodes switch On Network Coding and send coded packets into the networks.
Cited by 1Open access
Temitope Agbana, Oleg Soloviev, V. V. Bezzubik et al. · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2015
We have implemented an extended depth of field optical system by wavefront coding with a micromachined membrane deformable mirror. This approach provides a versatile extension to standard wavefront coding based on fixed phase mask. First experimental results validate the feasibility of the use of adaptive optics for variable depth wavefront coding in imaging optical systems.
Cited by 0Open access
Meng-yu SHI, Quan LIU, Qi-ming FU · SHILAP Revista de lepidopterología · 2015
In order to solve many unnecessary division,mergence supported adaptive tile coding algorithm was presented which would eliminate the unnecessary division.Simulation is conducted on mountain car problem with discrete actions and continuous state space Results show that the proposed method can eliminate the influence of false division in the traditional tile coding method and achieve a more accurate adaptive partition of continuous state space.A higher convergence rate is achieved at the same time.
Cited by 0Open access