Severity: Warning
Message: file_get_contents(https://...@pubfacts.com&api_key=b8daa3ad693db53b1410957c26c9a51b4908&a=1): Failed to open stream: HTTP request failed! HTTP/1.1 429 Too Many Requests
Filename: helpers/my_audit_helper.php
Line Number: 176
Backtrace:
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 176
Function: file_get_contents
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 250
Function: simplexml_load_file_from_url
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 1034
Function: getPubMedXML
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 3152
Function: GetPubMedArticleOutput_2016
File: /var/www/html/application/controllers/Detail.php
Line: 575
Function: pubMedSearch_Global
File: /var/www/html/application/controllers/Detail.php
Line: 489
Function: pubMedGetRelatedKeyword
File: /var/www/html/index.php
Line: 316
Function: require_once
Interferometry is routinely used for spectral or modal analysis of optical signals. By posing interferometric modal analysis as a sparse recovery problem, we show that compressive sampling helps exploit the sparsity of typical optical signals in modal space and reduces the number of required measurements. Instead of collecting evenly spaced interferometric samples at the Nyquist rate followed by a Fourier transform as is common practice, we show that random sampling at sub-Nyquist rates followed by a sparse reconstruction algorithm suffices. We demonstrate our approach, which we call compressive interferometry, numerically in the context of modal analysis of spatial beams using a generalized interferometric configuration. Compressive interferometry applies to widely used optical modal sets and is robust with respect to noise, thus holding promise to enhance real-time processing in optical imaging and communications.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1364/OE.23.028449 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!