Friday, June 12, 2009

CS: Quantization for Compressed Sensing Reconstruction, Optimal Quantization of Random Measurements in CS, Journal of Computational Geometry


Today we have two papers and a call for a new journal that includes CS as a subject of interest:

The two papers talk about quantization in CS an issue that is beginning to gain some coverage in the community:

Quantization for Compressed Sensing Reconstruction by John Z. Sun and Vivek K Goyal. The abstract reads:

Quantization is an important but often ignored consideration in discussions about compressed sensing. This paper studies the design of quantizers for random measurements of sparse signals that are optimal with respect to mean-squared error of the lasso reconstruction. We utilize recent results in high-resolution functional scalar quantization and homotopy continuation to approximate the optimal quantizer. Experimental results compare this quantizer to other practical designs and show a noticeable improvement in the operational distortion-rate performance.


Quantization is an important but often ignored consideration in discussions about compressed sensing. This paper studies the design of quantizers for random measurements of sparse signals that are optimal with respect to mean-squared error of the lasso reconstruction. We utilize recent results in high-resolution functional scalar quantization and homotopy continuation to approximate the optimal quantizer. Experimental results compare this quantizer to other practical designs and show a noticeable improvement in the operational distortion-rate performance.



From the Dense outliers blog, here is a new announcement for a journal:

The Journal of Computational Geometry (jocg.org) is now accepting submissions.

Scope and Focus
The Journal of Computational Geometry (JoCG) is an international open access electronic journal devoted to original research of the highest quality in all aspects of computational geometry. JoCG publishes papers on the design and analysis of geometric algorithms, the complexity of geometric problems, experimental work on geometric algorithms, applications of computational geometry, and topics at the intersection of geometry and algorithms. Topics include metric space embeddings, graph drawing, computational topology, topological learning, meshing, compressed sensing, manifold learning, computer-aided design, discrete geometry, and combinatorial geometry. Outstanding survey papers in the area are also considered.




Credit photo: University of New South Wales/Anglo-Australian Observatory (J. Bailey and S. Lee). Jeremy Bailey (University of New South Wales) and Steve Lee (Anglo-Australian Observatory) with the Anglo-Australian Observatory took this series of shots were taken just before and right after the japanese Kaguya spacecraft impacted the moon. If you recall Kaguya produced the magnificient video in this entry.

4 comments:

JackD said...

Dear Igor,

I think there is a mistake in the link of the second paper. It seems to be the same as the firstone.

Best,
Jack

Igor said...

Corrected.

Thanks Laurent.

Igor.

Iqbal said...

Apart from one Lemma and the theorem's proof, both papers seem to be the same. Correct me if I am wrong. Thanks

Igor said...

Iqbal,

I believe you are right.

Igor.

Printfriendly