skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Award ID contains: 2012238

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. We consider the problem of recovering a complex vector (up to a global unimodular constant) given noisy and incomplete outer product measurements. Such problems arise when implementing distributed clock synchronization schemes, radar autofocus methods, and phaseless signal recovery. This problem is known as vector synchronization and is a variant of the more common angular synchronization problem. In applications with windowed measurements and/or convolutional models - for example, phase retrieval from STFT magnitude data, the outer product measurement matrix is highly incomplete and has a block diagonal structure. We describe a vector synchronization technique which applies an eigenvector computation to blocks of this matrix followed by a block compatibility operation to piece together the final solution. We provide theoretical guarantees (in the noiseless case) and empirical simulations demonstrating the accuracy and efficiency of the method. 
    more » « less
  2. The underlying physics of imaging processes and associated instrumentation limitations mean that blurring artifacts are unavoidable in many applications such as astronomy, microscopy, radar and medical imaging. In several such imaging modalities, convolutional models are used to describe the blurring process; the observed image or function is a convolution of the true underlying image and a point spread function (PSF) which characterizes the blurring artifact. In this work, we propose and analyze a technique - based on convolutional edge detectors and Gaussian curve fitting - to approximate unknown Gaussian PSFs when the underlying true function is piecewise-smooth. For certain simple families of such functions, we show that this approximation is exponentially accurate. We also provide preliminary two dimensional extensions of this technique. These findings - confirmed by numerical simulations - demonstrate the feasibility of recovering accurate approximations to the blurring function, which serves as an important prerequisite to solving deblurring problems. 
    more » « less