Results 11  20
of
301
Image Denoising Via Lossy Compression And Wavelet Thresholding
, 1997
"... Some past work has proposed to use lossy compression to remove noise, based on the rationale that a reasonable compression method retains the dominant signal features more than the randomness of the noise. Building on this theme, we explain why compression (via coefficient quantization) is appropria ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
Some past work has proposed to use lossy compression to remove noise, based on the rationale that a reasonable compression method retains the dominant signal features more than the randomness of the noise. Building on this theme, we explain why compression (via coefficient quantization
A Suboptimal Lossy Data Compression Based On Approximate Pattern Matching
 IEEE Trans. Information Theory
, 1996
"... A practical suboptimal (variable source coding) algorithm for lossy data compression is presented. This scheme is based on approximate string matching, and it naturally extends the lossless LempelZiv data compression scheme. Among others we consider the typical length of approximately repeated patt ..."
Abstract

Cited by 50 (11 self)
 Add to MetaCart
A practical suboptimal (variable source coding) algorithm for lossy data compression is presented. This scheme is based on approximate string matching, and it naturally extends the lossless LempelZiv data compression scheme. Among others we consider the typical length of approximately repeated
Solving problems in the presence of process crashes and lossy links
, 1996
"... We study the effect of link failures on the solvability of problems in asynchronous systems that are subject to process crashes: given a problem that can be solved in a system with process crashes and reliable links, is the problem solvable even if links are lossy? We answer this question for two ty ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
types of lossy links, and show that the answer depends on the maximum number of processes that may crash and the nature of the problem to be solved. In particular, we prove that the answer is positive if fewer than half of the processes may crash or if the problem speci®cation does not refer
Oligoquantization in lowrate lossy source coding
 Ph.D. dissertation, EPFL, Communication Systems, July 2000. SEPTEMBER 2001 IEEE SIGNAL PROCESSING MAGAZINE 73
, 2000
"... ii The theory of high rate lossy source coding is well developed both with respect to the practice of quantization and its fundamental rate distortion limits. But many modern compression systems for natural signals such as audio and images operate at lower rates, which are not covered by these theor ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
ii The theory of high rate lossy source coding is well developed both with respect to the practice of quantization and its fundamental rate distortion limits. But many modern compression systems for natural signals such as audio and images operate at lower rates, which are not covered
A multiscale hybrid linear model for lossy image representation
 In Proceedings of the IEEE International Conference on Computer Vision
, 2005
"... This paper introduces a simple and efficient representation for natural images. We partition an image into blocks and treat the blocks as vectors in a highdimensional space. We then fit a piecewise linear model (i.e. a union of affine subspaces) to the vectors at each downsampling scale. We call ..."
Abstract

Cited by 41 (3 self)
 Add to MetaCart
This paper introduces a simple and efficient representation for natural images. We partition an image into blocks and treat the blocks as vectors in a highdimensional space. We then fit a piecewise linear model (i.e. a union of affine subspaces) to the vectors at each downsampling scale. We call
Measurement of complex natural resonances of targets in free space and lossy media
 Progress In Electromagnetic Research
"... AbstractThe scattered fields of a number of targets in free space are measured. Their complex natural resonances are extracted from the late time responses, using the generalized penciloffunction method. The complex natural resonances, as the targets are immersed in a lossy medium, are investiga ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
AbstractThe scattered fields of a number of targets in free space are measured. Their complex natural resonances are extracted from the late time responses, using the generalized penciloffunction method. The complex natural resonances, as the targets are immersed in a lossy medium
Bloom filter and lossy dictionary based language models
, 2007
"... Language models are probability distributions over a set of unilingual natural language text used in many natural language processing tasks such as statistical machine translation, information retrieval, and speech processing. Since more wellformed training data means a better model and the increa ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Language models are probability distributions over a set of unilingual natural language text used in many natural language processing tasks such as statistical machine translation, information retrieval, and speech processing. Since more wellformed training data means a better model
Secure Lossy Source Coding with Side Information
"... Abstract — We study the problem of secure lossy source coding with side information. In all works on this problem, either the equivocation of the source at the eavesdropper or the equivocation of the legitimate user’s reconstruction of the source at the eavesdropper is used as the measure of secrecy ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract — We study the problem of secure lossy source coding with side information. In all works on this problem, either the equivocation of the source at the eavesdropper or the equivocation of the legitimate user’s reconstruction of the source at the eavesdropper is used as the measure
On the ThreeTerminal Interactive Lossy Source Coding Problem
"... Abstract—The threenode multiterminal lossy source coding problem is investigated. We derive an inner bound to the general ratedistortion region of this problem which appears to be the natural extension of the seminal work by Kaspi [1] on the interactive twoterminal source coding problem. It is sh ..."
Abstract
 Add to MetaCart
Abstract—The threenode multiterminal lossy source coding problem is investigated. We derive an inner bound to the general ratedistortion region of this problem which appears to be the natural extension of the seminal work by Kaspi [1] on the interactive twoterminal source coding problem
Joint Data Alignment Up To (Lossy) Transformations
"... Joint data alignment is often regarded as a data simplification process. This idea is powerful and general, but raises two delicate issues. First, one must make sure that the useful information about the data is preserved by the alignment process. This is especially important when data are affected ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
that pixels are independent. This is done for the case where the data is postulated to live in an affine subspaces of the embedding space of the raw data. We apply our scheme to learn sparse bases for natural images that discount domain deformations and hence significantly decrease the complexity of codebooks
Results 11  20
of
301