Search NASA⌕ Search

Engineering topics

Pezeshki, Ali

Publications and source records attributed to Pezeshki, Ali.

Super-resolution computational saturated absorption microscopy

Imaging beyond the diffraction limit barrier has attracted wide attention due to the ability to resolve previously hidden image features. Of the various super-resolution microscopy techniques available, a particularly simple method called saturated excitation microscopy (SAX) requires only simple modification of a laser scanning microscope: The illumination beam power is sinusoidally modulated and driven into saturation. SAX images are extracted from the harmonics of the modulation frequency and exhibit improved spatial resolution. Unfortunately, this elegant strategy is hindered by the incursion of shot noise that prevents high-resolution imaging in many realistic scenarios. Here, we demonstrate a technique for super-resolution imaging that we call computational saturated absorption (CSA) in which a joint deconvolution is applied to a set of images with diversity in spatial frequency support among the point spread functions (PSFs) used in the image formation with saturated laser scanning fluorescence microscopy. CSA microscopy allows access to the high spatial frequency diversity in a set of saturated effective PSFs, while avoiding image degradation from shot noise.

Murray, Gabe (ORCID:0000000295655485)↗

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗

Submodular optimization problems and greedy strategies: A survey

The greedy strategy is an approximation algorithm to solve optimization problems arising in decision making with multiple actions. How effective is the greedy strategy compared to the optimal solution? In this survey, we mainly consider two classes of optimization problems where the objective function is submodular. The first is set submodular optimization, which is to choose a set of actions to optimize a set submodular objective function, and the second is string submodular optimization, which is to choose an ordered set of actions to optimize a string submodular function. Our emphasis here is on performance bounds for the greedy strategy in submodular optimization problems. Specifically, we review performance bounds for the greedy strategy, more general and improved bounds in terms of curvature, performance bounds for the batched greedy strategy, and performance bounds for Nash equilibria.

97 MATHEMATICS AND COMPUTING↗