#### Filter Results:

#### Publication Year

2000

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Özgür Yilmaz, Scott T. Rickard
- IEEE Transactions on Signal Processing
- 2004

Binary time-frequency masks are powerful tools for the separation of sources from a single mixture. Perfect demixing via binary time-frequency masks is possible provided the time-frequency representations of the sources do not overlap: a condition we call W-disjoint orthogonality. We introduce here the concept of approximate W-disjoint orthogonality and… (More)

- Alexander Jourjine, Scott T. Rickard, Özgür Yilmaz
- ICASSP
- 2000

We present a novel method for blind separation of any number of sources using only two mixtures. The method applies when sources are (W-)disjoint orthogonal, that is, when the supports of the (windowed) Fourier transform of any two signals in the mixture are disjoint sets. We show that, for anechoic mixtures of attenuated and delayed sources, the method… (More)

- John J. Benedetto, Özgür Yilmaz, Alexander M. Powell
- 2004 IEEE International Conference on Acoustics…
- 2004

It is shown that sigma-delta (/spl Sigma//spl Delta/) algorithms can be used effectively to quantize finite frame expansions for R/sup d/. Error estimates for various quantized frame expansions are derived, and, in particular, it is shown that /spl Sigma//spl Delta/ quantizers outperform the standard PCM schemes.

- Michael P. Friedlander, Hassan Mansour, Rayan Saab, Özgür Yilmaz
- IEEE Transactions on Information Theory
- 2012

We study recovery conditions of weighted <i>l</i><sub>1</sub> minimization for signal reconstruction from compressed sensing measurements when partial support information is available. We show that if at least 50% of the (partial) support information is accurate, then weighted <i>l</i><sub>1</sub> minimization is stable and robust under weaker sufficient… (More)

- Rayan Saab, Rick Chartrand, Özgür Yilmaz
- 2008 IEEE International Conference on Acoustics…
- 2008

We present theoretical results pertaining to the ability of lscr<sub>p</sub> minimization to recover sparse and compressible signals from incomplete and noisy measurements. In particular, we extend the results of Candes, Romberg and Tao (2005) to the p < 1 case. Our results indicate that depending on the restricted isometry constants (see, e.g., Candes… (More)

- Ingrid Daubechies, C. Sinan Güntürk, Yang Wang, Özgür Yilmaz
- IEEE Transactions on Information Theory
- 2010

This paper proposes a novel Nyquist-rate analog-to-digital (A/D) conversion algorithm which achieves exponential accuracy in the bit-rate despite using imperfect components. The proposed algorithm is based on a robust implementation of a beta-encoder with β = φ = (1 + √5)/2, the golden ratio. It was previously shown that beta-encoders… (More)

- Scott T. Rickard, Özgür Yilmaz
- 2002 IEEE International Conference on Acoustics…
- 2002

It is possible to blindly separate an arbitrary number of sources given just two anechoic mixtures provided the time-frequency representations of the sources do not overlap, a condition which we call W-disjoint orthogonality. We define a power weighted two-dimensional histogram constructed from the ratio of the time-frequency representations of the mixtures… (More)

- Rayan Saab, Özgür Yilmaz
- ArXiv
- 2008

In this note, we address the theoretical properties of ∆p, a class of compressed sensing decoders that rely on ℓ p minimization with p ∈ (0, 1) to recover estimates of sparse and compressible signals from incomplete and inaccurate measurements. In particular, we extend the results of Candès, Romberg and Tao [3] and Wojtaszczyk [30] regarding the decoder ∆ 1… (More)

- C. Sinan Güntürk, Mark Lammers, Alexander M. Powell, Rayan Saab, Özgür Yilmaz
- Foundations of Computational Mathematics
- 2013

Quantization of compressed sensing measurements is typically justified by the robust recovery results of Candès, Romberg and Tao, and of Donoho. These results guarantee that if a uniform quantizer of step size δ is used to quantize m measurements y = Φx of a k-sparse signal x ∈ R N , where Φ satisfies the restricted isometry property, then the approximate… (More)

- Hassan Mansour, Özgür Yilmaz
- ArXiv
- 2013

The Kaczmarz algorithm is a popular solver for overdeter-mined linear systems due to its simplicity and speed. In this paper, we propose a modification that speeds up the convergence of the randomized Kaczmarz algorithm for systems of linear equations with sparse solutions. The speedup is achieved by projecting every iterate onto a weighted row of the… (More)