Search results for "Image compression"
showing 10 items of 53 documents
The Kolmogorov Spline Network for Image Processing
2011
In 1900, Hilbert stated that high order equations cannot be solved by sums and compositions of bivariate functions. In 1957, Kolmogorov proved this hypothesis wrong and presented his superposition theorem (KST) that allowed for writing every multivariate functions as sums and compositions of univariate functions. Sprecher has proposed in (Sprecher, 1996) and (Sprecher, 1997) an algorithm for exact univariate function reconstruction. Sprecher explicitly describes construction methods for univariate functions and introduces fundamental notions for the theorem comprehension (such as tilage). Köppen has presented applications of this algorithm to image processing in (Köppen, 2002) and (Köppen &…
Visual information flow in Wilson-Cowan networks.
2020
In this paper, we study the communication efficiency of a psychophysically tuned cascade of Wilson-Cowan and divisive normalization layers that simulate the retina-V1 pathway. This is the first analysis of Wilson-Cowan networks in terms of multivariate total correlation. The parameters of the cortical model have been derived through the relation between the steady state of the Wilson-Cowan model and the divisive normalization model. The communication efficiency has been analyzed in two ways: First, we provide an analytical expression for the reduction of the total correlation among the responses of a V1-like population after the application of the Wilson-Cowan interaction. Second, we empiri…
Image Compression by 2D Motif Basis
2011
Approaches to image compression and indexing based on extensions to 2D of some of the Lempel-Ziv incremental parsing techniques have been proposed in the recent past. In these approaches, an image is decomposed into a number of patches, consisting each of a square or rectangular solid block. This paper proposes image compression techniques based on patches that are not necessarily solid blocks, but are affected instead by a controlled number of undetermined or don't care pixels. Such patches are chosen from a set of candidate motifs that are extracted in turn from the image 2D motif basis, the latter consisting of a compact set of patterns that result from the autocorrelation of the image w…
Non-consistent cell-average multiresolution operators with application to image processing
2016
In recent years different techniques to process signal and image have been designed and developed. In particular, multiresolution representations of data have been studied and used successfully for several applications such as compression, denoising or inpainting. A general framework about multiresolution representation has been presented by Harten (1996) 20. Harten's schemes are based on two operators: decimation, D , and prediction, P , that satisfy the consistency property D P = I , where I is the identity operator. Recently, some new classes of multiresolution operators have been designed using learning statistical tools and weighted local polynomial regression methods obtaining filters…
Why you trust in visual saliency
2015
Image understanding is a simple task for a human observer. Visual attention is automatically pointed to interesting regions by a natural objective stimulus in a first step and by prior knowledge in a second step. Saliency maps try to simulate human response and use actual eye-movements measurements as ground truth. An interesting question is: how much corruption in a digital image can affect saliency detection respect to the original image? One of the contributions of this work is to compare the performances of standard approaches with respect to different type of image corruptions and different threshold values on saliency maps. If the corruption can be estimated and/or the threshold is fi…
On the Design of Fast Wavelet Transform Algorithms With Low Memory Requirements
2008
In this paper, a new algorithm to efficiently compute the two-dimensional wavelet transform is presented. This algorithm aims at low memory consumption and reduced complexity, meeting these requirements by means of line-by-line processing. In this proposal, we use recursion to automatically place the order in which the wavelet transform is computed. This way, we solve some synchronization problems that have not been tackled by previous proposals. Furthermore, unlike other similar proposals, our proposal can be straightforwardly implemented from the algorithm description. To this end, a general algorithm is given which is further detailed to allow its implementation with a simple filter bank…
New techniques for visualization of losses due to image compression in grayscale medical still images
2003
To evaluate the visual influence of irreversible compression on medical images, changes of the images have to be visualized. The authors have explored alternative techniques to be used instead of the usual side-by-side comparison, where the information contained in both images is perceived in a single image, preserving the context between compression errors and image structures. Thus fast and easy comparison can be done. These techniques make use of the human ability to perceive information also in the dimensions of color, space, and time. A study was performed with JPEG-compressed coronary angiographic images. Changes in the resulting images for six compression factors from 7 to 30 were sc…
Kolmogorov superposition theorem for image compression
2012
International audience; The authors present a novel approach for image compression based on an unconventional representation of images. The proposed approach is different from most of the existing techniques in the literature because the compression is not directly performed on the image pixels, but is rather applied to an equivalent monovariate representation of the wavelet-transformed image. More precisely, the authors have considered an adaptation of Kolmogorov superposition theorem proposed by Igelnik and known as the Kolmogorov spline network (KSN), in which the image is approximated by sums and compositions of specific monovariate functions. Using this representation, the authors trad…
Mesh connectivity compression using convection reconstruction
2007
International audience; During a highly productive period running from 1995 to about 2002, the research in lossless compression of 3D meshes mainly consisted in a hard battle for the best bitrates. But for a few years, compression rates seem stabilized around 1.5 bit per vertex for the connectivity coding of usual meshes, and more and more work is dedicated to remeshing, lossy compression, or gigantic mesh compression, where memory and CPU optimizations are the new priority. However, the size of 3D models keeps growing, and many application fields keep requiring lossless compression. In this paper, we present a new contribution for single-rate lossless connectivity compression, which first …
New Representations for Multidimensional Functions Based on Kolmogorov Superposition Theorem. Applications on Image Processing
2012
Mastering the sorting of the data in signal (nD) can lead to multiple applications like new compression, transmission, watermarking, encryption methods and even new processing methods for image. Some authors in the past decades have proposed to use these approaches for image compression, indexing, median filtering, mathematical morphology, encryption. A mathematical rigorous way for doing such a study has been introduced by Andrei Nikolaievitch Kolmogorov (1903-1987) in 1957 and recent results have provided constructive ways and practical algorithms for implementing the Kolmogorov theorem. We propose in this paper to present those algorithms and some preliminary results obtained by our team…