Dear Igor,
I have just released a Windows 32bits version of the SPAMS toolbox, which is available athttp://www.di.ens.fr/willow/SPAMS/. I hope that it works ok, I could not test it intensively.
Best regards
Julien
Thank you Julien !
La methode dite de l'acquisition comprimee plus connue sous le vocable anglo-saxon de `Compressive Sensing' est une nouvelle methode qui permet de capturer et de retrouver par la suite un signal echantillonne a des frequences sous Nyquist. Afin de garantir la reconstitution parfaite du signal cette methode requiere la construction d'une matrice dite `sensing' matrice possedant des proprietes d'inversion particulieres. Ici, une construction de cette matrice a l'aide de sequences issues d'un systeme chaotique est proposee et il est prouve que cette matrice verifie avec une ecrasante probabilite (superieure a une construction aleatoire de type Gaussien) les proprietes de reconstruction requises.
Thanks Laurent for the tip!
Raghu Kainkaryam reminded me of how much time I personally waited to see the poolMC paper with the clear impact it will have on experimental pooling design and how it connects to compressive sensing:
Hi Igor,Thanks for linking to poolMC. It's been a long time coming. Hope to get some valuable feedback from the CS community.
With regards,
Raghu
The paper was featured in last week's longest entry. Check it out. If you recall there was a video by Anna Gilbert showing some preliminary results in the compressive sensing online talks pageand in the compressive sensing hardware page. Thanks Raghu!
While we are on the subject of compressive sensing inspired pooling, here is Yaniv Erlich's video presentation of the DNA sudoku paper mentioned earlier here.
No comments:
Post a Comment