EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Matrix Completion from One-Bit Dither Samples

Arian Eamaz, Farhang Yeganegi, Mojtaba Soltanalian

IEEE Transactions on Signal Processing · 2026 · 74 · 1616-1630

DOI: 10.1109/tsp.2024.3445289 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Signal Processing, 2026. Verfasst von Arian Eamaz und 2 weiteren Autor:innen. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 49 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We explore the impact of coarse quantization on matrix completion in the extreme scenario of dithered one-bit sensing, where the matrix entries are compared with random dither levels. In particular, instead of observing a subset of high-resolution entries of a low-rank matrix, we have access to a small number of one-bit samples, generated as a result of these comparisons. In order to recover the low-rank matrix using its coarsely quantized known entries, we begin by transforming the problem of one-bit matrix completion with random dithering into a nuclear norm minimization problem. The one-bit sampled information is represented as linear inequality feasibility constraints. We then develop the popular singular value thresholding (SVT) algorithm to accommodate these inequality constraints, resulting in the creation of the One-Bit SVT (OB-SVT). Our findings demonstrate that incorporating multiple random dither sequences in one-bit matrix completion can significantly improve the performance of the matrix completion algorithm. In pursuit of achieving this objective, we utilize diverse dithering schemes, namely uniform, Gaussian, and discrete dithers. To accelerate the convergence of our proposed algorithm, we introduce three variants of the OB-SVT algorithm. Among these variants is the randomized sketched OB-SVT, which departs from using the entire information at each iteration, opting instead to utilize sketched data. This approach effectively reduces the dimension of the operational space and accelerates the convergence. We perform numerical evaluations comparing our proposed algorithm with the maximum likelihood estimation method previously employed for one-bit matrix completion, and demonstrate that our approach can achieve a better recovery performance.

Förderung

  • National Science Foundation

Zitieren

APA

Eamaz, A., Yeganegi, F., & Soltanalian, M. (2026). Matrix Completion from One-Bit Dither Samples. IEEE Transactions on Signal Processing, 74, 1616-1630. https://doi.org/10.1109/tsp.2024.3445289

Vancouver

Eamaz A, Yeganegi F, Soltanalian M. Matrix Completion from One-Bit Dither Samples. IEEE Transactions on Signal Processing. 2026;74:1616-1630. doi:10.1109/tsp.2024.3445289

BibTeX
@article{Eamaz2026,
  author = {Eamaz, Arian and Yeganegi, Farhang and Soltanalian, Mojtaba},
  title = {Matrix Completion from One-Bit Dither Samples},
  journal = {IEEE Transactions on Signal Processing},
  year = {2026},
  volume = {74},
  pages = {1616--1630},
  doi = {10.1109/tsp.2024.3445289}
}
Kostenlos starten →