Abstract Discrete ill‐posed inverse problems arise in many areas of science and engineering. Their solutions are very sensitive to perturbations in the data. Regularization methods aim at reducing this sensitivity. This article considers an iterative regularization method, based on iterated Tikhonov regularization, that was proposed in M. Donatelli and M. Hanke, Fast nonstationary preconditioned iterative methods for ill‐posed problems, with application to image deblurring,Inverse Problems, 29 (2013), Art. 095008, 16 pages. In this method, the exact operator is approximated by an operator that is easier to work with. However, the convergence theory requires the approximating operator to be spectrally equivalent to the original operator. This condition is rarely satisfied in practice. Nevertheless, this iterative method determines accurate image restorations in many situations. We propose a modification of the iterative method, that relaxes the demand of spectral equivalence to a requirement that is easier to satisfy. We show that, although the modified method is not an iterative regularization method, it maintains one of the most important theoretical properties for this kind of methods, namely monotonic decrease of the reconstruction error. Several computed experiments show the good performances of the proposed method.
more »
« less
Learning-based method for full phase reconstruction of biological samples in digital holographic microscopy
A convolutional autoencoder for complete phase reconstruction in Digital Holographic Microscopy is reported. After proper training, this computationally efficient method reconstructs DHM holograms accurately when compared to the traditional approaches. This learning-based method is trained and validated with experimental samples of red blood cells.
more »
« less
- Award ID(s):
- 2042563
- PAR ID:
- 10316828
- Date Published:
- Journal Name:
- 2021 IEEE Photonics Conference (IPC)
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We introduce a Julia implementation of the recently proposed Nevanlinna analytic continuation method. The method is based on Nevanlinna interpolants and inherently preserves the causality of a response function due to its construction. For theoretical calculations without statistical noise, this continuation method is a powerful tool to extract real-frequency information from numerical input data on the Matsubara axis. This method has been applied to first-principles calculations of correlated materials. This paper presents its efficient and full-featured open-source implementation of the method including the Hamburger moment problem and smoothing.more » « less
-
Abstract This paper is concerned with the inverse problem of determining the shape of penetrable periodic scatterers from scattered field data. We propose a sampling method with a novel indicator function for solving this inverse problem. This indicator function is very simple to implement and robust against noise in the data. The resolution and stability analysis of the indicator function is analyzed. Our numerical study shows that the proposed sampling method is more stable than the factorization method and more efficient than the direct or orthogonality sampling method in reconstructing periodic scatterers.more » « less
-
Networks are pervasive in society: infrastructures (e.g., telephone), commercial sectors (e.g., banking), and biological and genomic systems can be represented as networks. Consequently, there are software libraries that analyze networks. Containers (e.g., Docker, Singularity), which hold both runnable codes and their execution environments, are increasingly utilized by analysts to run codes in a platform-independent fashion. Portability is further enhanced by not only providing software library methods, but also the driver code (i.e., main() method) for each library method. In this way, a user only has to know the invocation for the main() method that is in the container. In this work, we describe an automated approach for generating a main() method for each software library method. A single intermediate representation (IR) format is used for all library methods, and one IR instance is populated for one library method by parsing its comments and method signature. An IR for the main() method is generated from that for the library method. A source code generator uses the main() method IR and a set of small, hand-generated source code templates|with variables in the templates that are automatically customized for a particular library method|to produce the source code main() method. We apply our approach to two widely used software libraries, SNAP and NetworkX, as exemplars, which combined have over 400 library methods.more » « less
-
Harris, F.; Wu, R.; Redei, A. (Ed.)Networks are pervasive in society: infrastructures (e.g., telephone), commercial sectors (e.g., banking), and biological and genomic systems can be represented as networks. Con- sequently, there are software libraries that analyze networks. Containers (e.g., Docker, Singularity), which hold both runnable codes and their execution environments, are in- creasingly utilized by analysts to run codes in a platform-independent fashion. Portability is further enhanced by not only providing software library methods, but also the driver code (i.e., main() method) for each library method. In this way, a user only has to know the invocation for the main() method that is in the container. In this work, we describe an automated approach for generating a main() method for each software library method. A single intermediate representation (IR) format is used for all library methods, and one IR instance is populated for one library method by parsing its comments and method signature. An IR for the main() method is generated from that for the library method. A source code generator uses the main() method IR and a set of small, hand-generated source code templates|with variables in the templates that are automatically customized for a particular library method|to produce the source code main() method. We apply our approach to two widely used software libraries, SNAP and NetworkX, as examplars, which combined have over 400 library methods.more » « less
An official website of the United States government

