Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
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.
Block-based motion estimation (ME) and motion compensation (MC) techniques are widely used in modern video processing algorithms and compression systems. The great variety of video applications and devices results in diverse compression specifications, such as frame rates and bit rates. In this paper, we study the effect of frame rate and compression bit rate on block-based ME and MC as commonly utilized...
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...
With increase in the use of multimedia technology, the integrity of the digital images has become a major problem. The transformation between the soft and hard-copy of the image makes the problem even more complex. This paper proposes a new watermarking technique that is robust against geometrical and print-scan attacks. The method uses multiple domains to embed the message in the image, whereby watermarks...
In this paper, a new algorithm combined compression and image encryption is presented. The proposed algorithm can be used in the field of high-speed confidential data transmission where security is required. The compression is based on a hierarchical structure called SPIHT(Set Partitioning in Hierarchical Trees). This compression is followed by an encryption scheme PSCS (Parametric Switching Chaotic...
A new scheme is proposed which uses the features of Discrete Cosine Transform (DCT) for the embedding of the watermark coefficients and uses a pseudo-random sequence for selection of the DCT coefficients to embed the watermark. These coefficients are different in different watermarked images so there is no chance of collusion of the watermarked images to detect the watermark illegally. The scheme...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.