Bubacarr’s talk: ABSTRACT: Restricted Isometry Constants (RICs) of a matrix are a popular tool in the analysis of compressed sensing algorithms. The best known bounds will be presented for Gaussian matrices as well as expander graphs. In the former case we will also present explicit formulae for the bounds in …
Gongguo’s talk: Title: Computable Bounds on Sparsity Recovery Abstract: The performance of sparsity recovery depends on the structures of the sensing matrices. The quality of these matrices in the context of signal recovery is usually quantified by the restricted isometry constant and its variants. However, the restricted isometry constant and …
Suppose given a set S of objects, together with some measure of dissimilarity between pairs of objects in S. It is an old and much-studied problem to find good embeddings of S into standard metric spaces (like the real plane, or a binary tree) so that the dissimilarities between objects …
The IEEE 802.11s working group was tasked to provide ways of establishing and securing a wireless mesh network. One proposal established a Mesh Security Architecture (MSA), with a developed key hierarchy and full protocol definitions. This talk examines the correctness and security of the MSA proposal and its corresponding protocols. …
Statistical dependencies among wavelet coefficients are commonly represented by graphical models such as hidden Markov trees. However, in linear inverse problems such as deconvolution, tomography, and compressed sensing, the presence of a sensing or observation matrix leads to reconstruction problems that are intractable or non-convex optimizations. Past work has dealt …
This talk will follow up on last week’s SILO talk by Prof. Ellenberg. In particular, this will be a discussion about the “EDSN” algorithm for robust and efficient hierarchical clustering. Hierarchical clustering based on pairwise similarities is a common tool used in a broad range of scientific applications. However, in …
This talk introduces a way to conduct audio morphings by imposing a constraint that can be used to smoothly connect two different audio spectra. The method exploits a formal analogy between the two spatial dimensions of Laplace’s partial differential equation and the two dimensions (time and frequency) of a spectrogram. …
We study the generation of secret keys based on the inherent randomness of wireless multipath channels. This study falls into the broad area of physical layer security. In this setting the objective is for a pair of users, Alice and Bob, to extract a secret key from a natually occurring …
Statistical testing is a ubiquitous in engineering and science. The outcomes of testing and the significance we attach to them have profound effects on society; e.g., they are the basis for many public health and other social-engineering initiatives. So, it is crucial that we all agree and understand what it …
Low-dimensional linear subspace approximations to high-dimensional data are a common approach to handling problems of estimation, detection and prediction, with applications such as network monitoring, collaborative filtering, object tracking in computer vision, and environmental sensing. Corrupt and missing data are the norm in many high-dimensional situations, not only because of …