Locality and stability for phase retrieval

A frame $(x_j)_{j\in J}$ for a Hilbert space $H$ is said to do phase retrieval if for all distinct vectors $x,y\in H$ the magnitude of the frame coefficients $(|\langle x, x_j\rangle|)_{j\in J}$ and $(|\langle y, x_j\rangle|)_{j\in J}$ distinguish $x$ from $y$ (up to a unimodular scalar). We conside...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Alharbi, Wedad, Alshabhi, Salah, Freeman, Daniel, Ghoreishi, Dorsa
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Alharbi, Wedad
Alshabhi, Salah
Freeman, Daniel
Ghoreishi, Dorsa
description A frame $(x_j)_{j\in J}$ for a Hilbert space $H$ is said to do phase retrieval if for all distinct vectors $x,y\in H$ the magnitude of the frame coefficients $(|\langle x, x_j\rangle|)_{j\in J}$ and $(|\langle y, x_j\rangle|)_{j\in J}$ distinguish $x$ from $y$ (up to a unimodular scalar). We consider the weaker condition where the magnitude of the frame coefficients distinguishes $x$ from every vector $y$ in a small neighborhood of $x$ (up to a unimodular scalar). We prove that some of the important theorems for phase retrieval hold for this local condition, where as some theorems are completely different. We prove as well that when considering stability of phase retrieval, the worst stability inequality is always witnessed at orthogonal vectors. This allows for much simpler calculations when considering optimization problems for phase retrieval.
doi_str_mv 10.48550/arxiv.2210.03886
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2210_03886</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2210_03886</sourcerecordid><originalsourceid>FETCH-LOGICAL-a676-4710e78018cd467fb87b14b90422763eb5c07bfeba82677d9c6490b02af552703</originalsourceid><addsrcrecordid>eNotzr0KwjAUBeAsDqI-gJOdheptmuSmo4h_UHBxLzdtgoFqS1pE316tTodzhsPH2DyBldBSwprC0z9WnH8GSLVWY7bMm5Jq378iuldR15PxQ3NNiNordTYKtg_ePqiespGjurOzf07YZb-7bI9xfj6ctps8JoUqFpiARQ2JLiuh0BmNJhEmA8E5qtQaWQIaZw1prhCrrFQiAwOcnJQcIZ2wxe92wBZt8DcKr-KLLgZ0-gZQljsD</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Locality and stability for phase retrieval</title><source>arXiv.org</source><creator>Alharbi, Wedad ; Alshabhi, Salah ; Freeman, Daniel ; Ghoreishi, Dorsa</creator><creatorcontrib>Alharbi, Wedad ; Alshabhi, Salah ; Freeman, Daniel ; Ghoreishi, Dorsa</creatorcontrib><description>A frame $(x_j)_{j\in J}$ for a Hilbert space $H$ is said to do phase retrieval if for all distinct vectors $x,y\in H$ the magnitude of the frame coefficients $(|\langle x, x_j\rangle|)_{j\in J}$ and $(|\langle y, x_j\rangle|)_{j\in J}$ distinguish $x$ from $y$ (up to a unimodular scalar). We consider the weaker condition where the magnitude of the frame coefficients distinguishes $x$ from every vector $y$ in a small neighborhood of $x$ (up to a unimodular scalar). We prove that some of the important theorems for phase retrieval hold for this local condition, where as some theorems are completely different. We prove as well that when considering stability of phase retrieval, the worst stability inequality is always witnessed at orthogonal vectors. This allows for much simpler calculations when considering optimization problems for phase retrieval.</description><identifier>DOI: 10.48550/arxiv.2210.03886</identifier><language>eng</language><subject>Computer Science - Numerical Analysis ; Mathematics - Functional Analysis ; Mathematics - Numerical Analysis</subject><creationdate>2022-10</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2210.03886$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2210.03886$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Alharbi, Wedad</creatorcontrib><creatorcontrib>Alshabhi, Salah</creatorcontrib><creatorcontrib>Freeman, Daniel</creatorcontrib><creatorcontrib>Ghoreishi, Dorsa</creatorcontrib><title>Locality and stability for phase retrieval</title><description>A frame $(x_j)_{j\in J}$ for a Hilbert space $H$ is said to do phase retrieval if for all distinct vectors $x,y\in H$ the magnitude of the frame coefficients $(|\langle x, x_j\rangle|)_{j\in J}$ and $(|\langle y, x_j\rangle|)_{j\in J}$ distinguish $x$ from $y$ (up to a unimodular scalar). We consider the weaker condition where the magnitude of the frame coefficients distinguishes $x$ from every vector $y$ in a small neighborhood of $x$ (up to a unimodular scalar). We prove that some of the important theorems for phase retrieval hold for this local condition, where as some theorems are completely different. We prove as well that when considering stability of phase retrieval, the worst stability inequality is always witnessed at orthogonal vectors. This allows for much simpler calculations when considering optimization problems for phase retrieval.</description><subject>Computer Science - Numerical Analysis</subject><subject>Mathematics - Functional Analysis</subject><subject>Mathematics - Numerical Analysis</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzr0KwjAUBeAsDqI-gJOdheptmuSmo4h_UHBxLzdtgoFqS1pE316tTodzhsPH2DyBldBSwprC0z9WnH8GSLVWY7bMm5Jq378iuldR15PxQ3NNiNordTYKtg_ePqiespGjurOzf07YZb-7bI9xfj6ctps8JoUqFpiARQ2JLiuh0BmNJhEmA8E5qtQaWQIaZw1prhCrrFQiAwOcnJQcIZ2wxe92wBZt8DcKr-KLLgZ0-gZQljsD</recordid><startdate>20221007</startdate><enddate>20221007</enddate><creator>Alharbi, Wedad</creator><creator>Alshabhi, Salah</creator><creator>Freeman, Daniel</creator><creator>Ghoreishi, Dorsa</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20221007</creationdate><title>Locality and stability for phase retrieval</title><author>Alharbi, Wedad ; Alshabhi, Salah ; Freeman, Daniel ; Ghoreishi, Dorsa</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a676-4710e78018cd467fb87b14b90422763eb5c07bfeba82677d9c6490b02af552703</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Numerical Analysis</topic><topic>Mathematics - Functional Analysis</topic><topic>Mathematics - Numerical Analysis</topic><toplevel>online_resources</toplevel><creatorcontrib>Alharbi, Wedad</creatorcontrib><creatorcontrib>Alshabhi, Salah</creatorcontrib><creatorcontrib>Freeman, Daniel</creatorcontrib><creatorcontrib>Ghoreishi, Dorsa</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Alharbi, Wedad</au><au>Alshabhi, Salah</au><au>Freeman, Daniel</au><au>Ghoreishi, Dorsa</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Locality and stability for phase retrieval</atitle><date>2022-10-07</date><risdate>2022</risdate><abstract>A frame $(x_j)_{j\in J}$ for a Hilbert space $H$ is said to do phase retrieval if for all distinct vectors $x,y\in H$ the magnitude of the frame coefficients $(|\langle x, x_j\rangle|)_{j\in J}$ and $(|\langle y, x_j\rangle|)_{j\in J}$ distinguish $x$ from $y$ (up to a unimodular scalar). We consider the weaker condition where the magnitude of the frame coefficients distinguishes $x$ from every vector $y$ in a small neighborhood of $x$ (up to a unimodular scalar). We prove that some of the important theorems for phase retrieval hold for this local condition, where as some theorems are completely different. We prove as well that when considering stability of phase retrieval, the worst stability inequality is always witnessed at orthogonal vectors. This allows for much simpler calculations when considering optimization problems for phase retrieval.</abstract><doi>10.48550/arxiv.2210.03886</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2210.03886
ispartof
issn
language eng
recordid cdi_arxiv_primary_2210_03886
source arXiv.org
subjects Computer Science - Numerical Analysis
Mathematics - Functional Analysis
Mathematics - Numerical Analysis
title Locality and stability for phase retrieval
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T14%3A21%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Locality%20and%20stability%20for%20phase%20retrieval&rft.au=Alharbi,%20Wedad&rft.date=2022-10-07&rft_id=info:doi/10.48550/arxiv.2210.03886&rft_dat=%3Carxiv_GOX%3E2210_03886%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true