2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) 2010
DOI: 10.1109/allerton.2010.5707127
|View full text |Cite
|
Sign up to set email alerts
|

Sparse recovery for Earth Mover Distance

Abstract: We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A, for m n, such that for any x, given Ax, we can recover a k-sparse approximation to x under the EMD distance. We also provide an empirical evaluation of the method that, in some scenarios, shows its advantages over the "usual" recovery in the p norms.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(11 citation statements)
references
References 18 publications
0
11
0
Order By: Relevance
“…Limiting the error in sparsely recovered images to l p norms is quite inconvenient because they do not accurately represent perceptual differences between images. 43,44 Intuitively, given two images, the EMD reflects the minimal amount of work that must be performed to transform one image into the other. Thus, the EMD Journal of Electronic Imaging 021003-11 Apr-Jun 2013/Vol.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Limiting the error in sparsely recovered images to l p norms is quite inconvenient because they do not accurately represent perceptual differences between images. 43,44 Intuitively, given two images, the EMD reflects the minimal amount of work that must be performed to transform one image into the other. Thus, the EMD Journal of Electronic Imaging 021003-11 Apr-Jun 2013/Vol.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…where c, α and β collect the trigonometric coefficients from the individual approximations (14). The resulting coefficients to the equation (16) α and β yield an estimate of the frequencies via the bijective relation…”
Section: Polar Interpolationmentioning
confidence: 99%
“…We recently introduced an approach to compressive parameter estimation that relies on the earth mover's distance (EMD) to measure the error in the coefficient vector (i.e., the distance between the estimated and the true coefficient vectors) in terms of similarity between the values and locations of their nonzero entries. The EMD between two vectors is obtained by optimizing the flow of mass among the entries of one vector to make it match with the other [13,14]. Let p and q be two K-sparse coefficient vectors with nonzero entries, and let I, J ⊂ 0, 1, .…”
Section: Compressive Parameter Estimation Via Clusteringmentioning
confidence: 99%
“…Alternatively, the earth mover's distance (EMD) has recently been used in CS to measure the distance between coefficient vectors in terms of the similarity between their supports [21,22]. In particular, the EMD between two vectors with the same 1 norm optimizes the work of the flow (i.e., the amount of the flow and the distance of flow) applied to one vector in order to obtain the other vector.…”
Section: Parametric Dictionariesmentioning
confidence: 99%
“…Additionally, the guarantees of bounded error between the true and the estimated PD coefficient vectors, measured via the Euclidean distance in almost all existing methods, have very limited impact on the performance of compressive parameter estimation given that the Euclidean distance does not relate to the parameter estimation error. In contrast, the earth mover's distance (EMD) [20][21][22] is a very attractive option due to the fact that the EMD of two sparse PD coefficient vectors is indicative of the parameter estimation error when the elements of the PD are sorted in increasing order of the values of the corresponding parameters.…”
mentioning
confidence: 99%