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.
In this paper, an adaptive palette reordering method is proposed to reshape the statistical properties of the color index map of a color-indexed image with a dynamic palette. The proposed method extracts information from both the palette and the color index map to achieve the objective. It reduces the zero-order entropy of the image and removes the spatial correlation among pixels significantly. The...
Multiple description coding (MDC) combined with multiple path transport (MPT) is a new research direction for image and video transmission over unreliable networks. Using the signal decomposition and reconstruction framework that has been proven very effective for image coding, several new approaches to MDC have been developed. Instead of using hierarchical decomposition, which is aimed at maximizing...
This work presents an integrated system for progressive and predictive image sequences coding and human body movement tracking. The object shape representation, based on the morphological skeleton, is used for both coding and tracking and it allows achieving a high compression ratio. Kalman Filters are used to track the shape of the human body. Practical applications of the focused proposed strategy...
In this paper, a multi-layer SNR-scalable error-bounded image encoder is achieved in the framework of Laplacian pyramids with quantization noise feedback, by exploiting an entropy-minimizing optimum quantization strategy, a content-driven decision rule based on an L∞ activity measure, and multistage quantizers to progressively upgrade quality at full scale. The resulting scheme yields intermediate...
In this paper we present a new approach of spectral decorrelation for multispectral image compression. It is based on the merging of two main tendencies such as the use of KLT as spectral decorrelator and object based image coding schemes. The use of the principal component in multispectral imagery is described and used to perform a multispectral segmentation. This segmentation is taken as the basis...
An entirely new method of automatic wire-frame fitting for semantic-based moving image coding is proposed. The algorithm utilises a code-book of facial images. All elements of the facial data-base are pre-processed and manually fitted with the wire frame model. Both preprocessing and manual fitting are a part of the facial images data-base preparation. As such, they are not a part of on-line processing...
In this paper, we propose a new image coding scheme based on fractal coding of the coefficients of a wavelet transform, in order to take into account the self-similarity observed in each subband. The original image is first decomposed into subbands containing information in different spatial directions and at different scales, using Finite Impulse Response filters. Subbands are encoded using Local...
Fractal image compression is an image compression technique which is based on local similarity of image structure. Fractal image compression provides good quality of reconstructed image and high compression ratio with extra feature of fast decompression. Fractal image compression suffers from time consumption in encoding phase. This paper presents a method to reduce the complexity in coding time....
Gaussian random matrix (GRM) has been widely used to generate linear measurements in compressive sensing (CS) of natural images. However, in practice, there actually exist two problems with GRM. One is that GRM is non-sparse and complicated, leading to high computational complexity and high difficulty in hardware implementation. The other is that regardless of the characteristics of signal the measurements...
Lossless video compression is a novel research area, but it is gaining widespread importance. As an example, in digital cinema the post-production chain requires all the information captured by digital cameras, and any data loss is not tolerated. On the other hand, the camera sensors size is expected to grow up to 4k × 2k pixels at 10 bit per pixel per component, and cameras output frame-rate up to...
This paper proposes an efficient extension of Set Partitioning Embedded bloCK (SPECK) algorithm to lossless colour image coding by using the integer wavelet transform. First, the RGB image is losslessly transformed to LC (Luminance-Chrominance) plane. Then, an integer wavelet transform is applied to each plane. Depending on the energy of each transformed plane and the correlation between each pair...
This paper illustrates an algorithm specifically designed for encoding multiple views of the same scene taken from calibrated cameras. The assumption here is that these views are strongly correlated as they represent the same content viewed from different perspectives. In order to keep the encoding complexity low, the proposed algorithm builds on PRISM (Power-efficient, Robust, hIgh compression, Syndrome-based...
The Wavelet Transform is not optimal for image compression. The coefficients on the same level of decomposition preserve a residual correlation which may harm the efficiency of the encoding algorithm. In the case of entropic codes, this effect can be reduced by using an appropriate coefficients scanning and long enough contexts for the conditional probabilities. Such an approach needs the knowledge...
In this paper we conduct a statistical analysis of the sensitivity and consistency behavior of objective image quality measures. We categorize the quality measures and compare them for still image compression applications. The measures have been categorized into pixel difference-based, correlation-based, edge-based, spectral-based, context-based and HVS-based (Human Visual System-based) measures....
A subband-DCT approach for image watermarking is proposed in this communication. The watermark is casted in a selected number of coefficients of all four bands of a one-level decomposition. A great number of coefficients is being used. Each band gives a different detection output. The result is taken as the average detection result of all bands. It is shown that the final result is better than the...
This work introduces an alternative video coding approach that exploits the temporal correlation present in video signals by applying a combined wavelet/DCT three-dimensional transform to the input video sequence. As the correlation along the temporal axis is likely lowered when motion is present we first partitioning the input sequence into partitions or groups of similar pictures and then applying...
A new watermarking algorithm for still images is presented in this paper. The watermark is embedded in magnitude of the DFT domain and introduces image changes that are invisible to the human eye. It is robust to compression, filtering, cropping, translation, rotation and scaling. The detection algorithm does not require the original image. The watermark has a self-similar structure that accelerates...
Today data hiding is latest research area in which secret data is hidden in any cover image like audio, video, file and image. Hiding of data is mainly done in medical and military needs. In this paper, it covers many data hiding and compression schemes, but we mainly focus on side match vector quantitation and image inpainting in this paper. The goal of using side match vector quantitation is to...
In this paper the Theoretical basis of components and accelerator multi-digit processors and the structure of the synthesized arithmetic logic units operating multibasis processors, it targeted at solving problems encryption.
Matched-texture coding (MTC) exploits the redundancy of textured regions in natural images in order to achieve low-encoding-rate structurally lossless compression. A key element of MTC identifying large image blocks that can be replaced with previously encoded blocks that have similar structure. The side matching (SM) approach attempts to do this by matching the upper and left boundary (side) of a...
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.