2013
DOI: 10.1051/0004-6361/201321079
|View full text |Cite
|
Sign up to set email alerts
|

Optimal arrays for compressed sensing in snapshot-mode radio interferometry

Abstract: Context. Radio interferometry has always faced the problem of incomplete sampling of the Fourier plane. A possible remedy can be found in the promising new theory of compressed sensing (CS), which allows for the accurate recovery of sparse signals from sub-Nyquist sampling given certain measurement conditions. Aims. We provide an introductory assessment of optimal arrays for CS in snapshot-mode radio interferometry, using orthogonal matching pursuit (OMP), a widely used CS recovery algorithm similar in some re… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 27 publications
0
4
0
Order By: Relevance
“…On the other hand, the disadvantages of these sequences include (i) the absence of known CS recovery guarantees and (ii) a logistically challenging implementation of these schemes in the field due to off-grid locations of sources (or receivers). Furthermore, the numerical studies on CS reconstruction with the Hammersley points demonstrate discouraging results [38] and, finally, low-discrepancy sequences may require additional transformation to reduce aliasing [39].…”
Section: Overview Of Sampling Methodsmentioning
confidence: 99%
“…On the other hand, the disadvantages of these sequences include (i) the absence of known CS recovery guarantees and (ii) a logistically challenging implementation of these schemes in the field due to off-grid locations of sources (or receivers). Furthermore, the numerical studies on CS reconstruction with the Hammersley points demonstrate discouraging results [38] and, finally, low-discrepancy sequences may require additional transformation to reduce aliasing [39].…”
Section: Overview Of Sampling Methodsmentioning
confidence: 99%
“…Indeed, there is a close relationship between CS principles and the aperture-synthesis image reconstruction problem, which was first addressed in Wiaux et al (2009a), Wenger et al (2010), Li et al (2011b) and Carrillo et al (2012). Wide-field observations were subsequently studied in McEwen & Wiaux (2011), and different antenna configurations (Fannjiang 2013) and non-coplanar effects (Wiaux et al 2009a,b;Wolz et al 2013) were analysed in a compressedsensing framework. Aperture synthesis presents the three main ingredients that are fundamental in CS: From the CS perspective, the best way to reconstruct an image X from its visibilities is to use sparse recovery by solving the following optimization problem:…”
Section: Compressed Sensing and Sparse Recoverymentioning
confidence: 99%
“…Several minimization methods have been used for aperture synthesis, the FISTA method (fast iterative shrinkagethresholding algorithm in Beck & Teboulle (2009) Wenger et al (2010), Hardy (2013) and Wenger et al (2013), the OMP (orthogonal matching pursuit) (G. Davis et al 1997) in Fannjiang (2013), Douglas-Rachford splitting in Wiaux et al (2009b), Wiaux (2011) andCarrillo et al (2012) or the SDMM (simultaneous-direction method of multipliers in Combettes &Pesquet (2011) andCarrillo et al (2014). In our experiments, we investigated mainly two algorithms, FISTA, and a recent algorithm proposed by VÅ© (2013), which works in the analysis framework.…”
Section: Algorithmmentioning
confidence: 99%
“…This sparsity can be used on purpose in the design of an array (e.g. [58]). Instruments such as the SKA will provide a tremendous amount of redundant data that are difficult to calibrate.…”
Section: Conclusion and Future Developmentsmentioning
confidence: 99%