Sparse sampling approaches have been widely studied to achieve less complex measurement systems while maintaining detection performance. In this paper, we derive a new gradient implementation of an alternating projections algorithm that determines the
{
"title_en": "Optimized Sparse Sampling Lattices",
"designation": "",
"series": "",
"status": "",
"date": "2023-03-07",
"date_original": "March 7, 2023",
"url": "https://www.nist.gov/publications/optimized-sparse-sampling-lattices",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Peter Vouras, Mohamed Hany , Sudantha Perera , Carnot Nogueira , Rick Candell , Kate Remley",
"abstract_excerpt_en": "Sparse sampling approaches have been widely studied to achieve less complex measurement systems while maintaining detection performance. In this paper, we derive a new gradient implementation of an alternating projections algorithm that determines the",
"id": "3f70cd60761046729bd0",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Optimized Sparse Sampling Lattices",
"designation": "",
"series": "",
"status": "",
"date": "2023-03-07",
"date_original": "March 7, 2023",
"url": "https://www.nist.gov/publications/optimized-sparse-sampling-lattices",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Peter Vouras, Mohamed Hany , Sudantha Perera , Carnot Nogueira , Rick Candell , Kate Remley",
"abstract_excerpt_en": "Sparse sampling approaches have been widely studied to achieve less complex measurement systems while maintaining detection performance. In this paper, we derive a new gradient implementation of an alternating projections algorithm that determines the"
}
],
"translation_state": "none"
}