Efficient signal reconstruction for a broad range of applications

Abolfazl Asudeh, Jees Augustine, Azade Nazi, Saravanan Thirumuruganathan, Nan Zhang, Gautam Das, Divesh Srivastava

Research output: Contribution to journalArticle

Abstract

The signal reconstruction problem (SRP) is an important optimization problem where the objective is to identify a solution to an under-determined system of linear equations AX = b that is closest to a given prior. It has a substantial number of applications in diverse areas including network traffic engineering, medical image reconstruction, acoustics, astronomy and many more. Most common approaches for solving SRP do not scale to large problem sizes. In this paper, we propose a dual formulation of this problem and show how adapting database techniques developed for scalable similarity joins provides a significant speedup when the A matrix is sparse and binary. Extensive experiments on real-world and synthetic data show that our approach produces a significant speedup of up to 20x over competing approaches.

Original languageEnglish
Pages (from-to)42-49
Number of pages8
JournalSIGMOD Record
Volume48
Issue number1
DOIs
Publication statusPublished - Mar 2019

Fingerprint

Signal reconstruction
Astronomy
Image reconstruction
Linear equations
Acoustics
Experiments

ASJC Scopus subject areas

  • Software
  • Information Systems

Cite this

Asudeh, A., Augustine, J., Nazi, A., Thirumuruganathan, S., Zhang, N., Das, G., & Srivastava, D. (2019). Efficient signal reconstruction for a broad range of applications. SIGMOD Record, 48(1), 42-49. https://doi.org/10.14778/3231751.3231752

Efficient signal reconstruction for a broad range of applications. / Asudeh, Abolfazl; Augustine, Jees; Nazi, Azade; Thirumuruganathan, Saravanan; Zhang, Nan; Das, Gautam; Srivastava, Divesh.

In: SIGMOD Record, Vol. 48, No. 1, 03.2019, p. 42-49.

Research output: Contribution to journalArticle

Asudeh, A, Augustine, J, Nazi, A, Thirumuruganathan, S, Zhang, N, Das, G & Srivastava, D 2019, 'Efficient signal reconstruction for a broad range of applications', SIGMOD Record, vol. 48, no. 1, pp. 42-49. https://doi.org/10.14778/3231751.3231752
Asudeh, Abolfazl ; Augustine, Jees ; Nazi, Azade ; Thirumuruganathan, Saravanan ; Zhang, Nan ; Das, Gautam ; Srivastava, Divesh. / Efficient signal reconstruction for a broad range of applications. In: SIGMOD Record. 2019 ; Vol. 48, No. 1. pp. 42-49.
@article{38d5eb618ef84a22a04c7b205089b60a,
title = "Efficient signal reconstruction for a broad range of applications",
abstract = "The signal reconstruction problem (SRP) is an important optimization problem where the objective is to identify a solution to an under-determined system of linear equations AX = b that is closest to a given prior. It has a substantial number of applications in diverse areas including network traffic engineering, medical image reconstruction, acoustics, astronomy and many more. Most common approaches for solving SRP do not scale to large problem sizes. In this paper, we propose a dual formulation of this problem and show how adapting database techniques developed for scalable similarity joins provides a significant speedup when the A matrix is sparse and binary. Extensive experiments on real-world and synthetic data show that our approach produces a significant speedup of up to 20x over competing approaches.",
author = "Abolfazl Asudeh and Jees Augustine and Azade Nazi and Saravanan Thirumuruganathan and Nan Zhang and Gautam Das and Divesh Srivastava",
year = "2019",
month = "3",
doi = "10.14778/3231751.3231752",
language = "English",
volume = "48",
pages = "42--49",
journal = "SIGMOD Record",
issn = "0163-5808",
publisher = "Association for Computing Machinery (ACM)",
number = "1",

}

TY - JOUR

T1 - Efficient signal reconstruction for a broad range of applications

AU - Asudeh, Abolfazl

AU - Augustine, Jees

AU - Nazi, Azade

AU - Thirumuruganathan, Saravanan

AU - Zhang, Nan

AU - Das, Gautam

AU - Srivastava, Divesh

PY - 2019/3

Y1 - 2019/3

N2 - The signal reconstruction problem (SRP) is an important optimization problem where the objective is to identify a solution to an under-determined system of linear equations AX = b that is closest to a given prior. It has a substantial number of applications in diverse areas including network traffic engineering, medical image reconstruction, acoustics, astronomy and many more. Most common approaches for solving SRP do not scale to large problem sizes. In this paper, we propose a dual formulation of this problem and show how adapting database techniques developed for scalable similarity joins provides a significant speedup when the A matrix is sparse and binary. Extensive experiments on real-world and synthetic data show that our approach produces a significant speedup of up to 20x over competing approaches.

AB - The signal reconstruction problem (SRP) is an important optimization problem where the objective is to identify a solution to an under-determined system of linear equations AX = b that is closest to a given prior. It has a substantial number of applications in diverse areas including network traffic engineering, medical image reconstruction, acoustics, astronomy and many more. Most common approaches for solving SRP do not scale to large problem sizes. In this paper, we propose a dual formulation of this problem and show how adapting database techniques developed for scalable similarity joins provides a significant speedup when the A matrix is sparse and binary. Extensive experiments on real-world and synthetic data show that our approach produces a significant speedup of up to 20x over competing approaches.

UR - http://www.scopus.com/inward/record.url?scp=85074811484&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85074811484&partnerID=8YFLogxK

U2 - 10.14778/3231751.3231752

DO - 10.14778/3231751.3231752

M3 - Article

AN - SCOPUS:85074811484

VL - 48

SP - 42

EP - 49

JO - SIGMOD Record

JF - SIGMOD Record

SN - 0163-5808

IS - 1

ER -