|
Hybrid Input Output (HIO) Algorithm For Phase Retrieval
Hybrid input-output (HIO) algorithm for phase retrieval is a modification of the error reduction algorithm for retrieving the phases in coherent diffraction imaging. Determining the phases of a diffraction pattern is crucial since the diffraction pattern of an object is its Fourier transform and in order to properly invert transform the diffraction pattern the phases must be known. Only the amplitude however, can be measured from the intensity of the diffraction pattern and can thus be known experimentally. This fact together with some kind of support constraint can be used in order to iteratively calculate the phases. The HIO algorithm uses negative feedback in Fourier space in order to progressively force the solution to conform to the Fourier domain constraints (support). Unlike the error reduction algorithm which alternately applies Fourier and object constraints the HIO "skips" the object domain step and replaces it with negative feedback acting upon the previous solution. A ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Phase Retrieval
Phase retrieval is the process of algorithmically finding solutions to the phase problem. Given a complex signal F(k), of amplitude , F (k), , and phase \psi(k): ::F(k) = , F(k), e^ =\int_^ f(x)\ e^\,dx where ''x'' is an ''M''-dimensional spatial coordinate and ''k'' is an ''M''-dimensional spatial frequency coordinate. Phase retrieval consists of finding the phase that satisfies a set of constraints for a measured amplitude. Important applications of phase retrieval include X-ray crystallography, transmission electron microscopy and coherent diffractive imaging, for which M = 2. Uniqueness theorems for both 1-D and 2-D cases of the phase retrieval problem, including the phaseless 1-D inverse scattering problem, were proven by Klibanov and his collaborators (see References). Problem formulation Here we consider 1-D discrete Fourier transform (DFT) phase retrieval problem. The DFT of a complex signal f /math> is given by F \sum_^ f e^=, F \cdot e^ \quad k=0,1, \ldots, N-1, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Coherent Diffraction Imaging
Coherent diffractive imaging (CDI) is a "lensless" technique for 2D or 3D reconstruction of the image of nanoscale structures such as nanotubes, nanocrystals, porous nanocrystalline layers, defects, potentially proteins, and more. In CDI, a highly coherent beam of X-rays, electrons or other wavelike particle or photon is incident on an object. The beam scattered by the object produces a diffraction pattern downstream which is then collected by a detector. This recorded pattern is then used to reconstruct an image via an iterative feedback algorithm. Effectively, the objective lens in a typical microscope is replaced with software to convert from the reciprocal space diffraction pattern into a real space image. The advantage in using no lenses is that the final image is aberration–free and so resolution is only diffraction and dose limited (dependent on wavelength, aperture size and exposure). Applying a simple inverse Fourier transform to information with only intensities is i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fourier Transform
A Fourier transform (FT) is a mathematical transform that decomposes functions into frequency components, which are represented by the output of the transform as a function of frequency. Most commonly functions of time or space are transformed, which will output a function depending on temporal frequency or spatial frequency respectively. That process is also called ''analysis''. An example application would be decomposing the waveform of a musical chord into terms of the intensity of its constituent pitches. The term ''Fourier transform'' refers to both the frequency domain representation and the mathematical operation that associates the frequency domain representation to a function of space or time. The Fourier transform of a function is a complex-valued function representing the complex sinusoids that comprise the original function. For each frequency, the magnitude (absolute value) of the complex value represents the amplitude of a constituent complex sinusoid with that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Support (mathematics)
In mathematics, the support of a real-valued function f is the subset of the function domain containing the elements which are not mapped to zero. If the domain of f is a topological space, then the support of f is instead defined as the smallest closed set containing all points not mapped to zero. This concept is used very widely in mathematical analysis. Formulation Suppose that f : X \to \R is a real-valued function whose domain is an arbitrary set X. The of f, written \operatorname(f), is the set of points in X where f is non-zero: \operatorname(f) = \. The support of f is the smallest subset of X with the property that f is zero on the subset's complement. If f(x) = 0 for all but a finite number of points x \in X, then f is said to have . If the set X has an additional structure (for example, a topology), then the support of f is defined in an analogous way as the smallest subset of X of an appropriate type such that f vanishes in an appropriate sense on its complement. T ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mean Square Error
In statistics, the mean squared error (MSE) or mean squared deviation (MSD) of an estimator (of a procedure for estimating an unobserved quantity) measures the average of the squares of the errors—that is, the average squared difference between the estimated values and the actual value. MSE is a risk function, corresponding to the expected value of the squared error loss. The fact that MSE is almost always strictly positive (and not zero) is because of randomness or because the estimator does not account for information that could produce a more accurate estimate. In machine learning, specifically empirical risk minimization, MSE may refer to the ''empirical'' risk (the average loss on an observed data set), as an estimate of the true MSE (the true risk: the average loss on the actual population distribution). The MSE is a measure of the quality of an estimator. As it is derived from the square of Euclidean distance, it is always a positive value that decreases as the error a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Crystallography
Crystallography is the experimental science of determining the arrangement of atoms in crystalline solids. Crystallography is a fundamental subject in the fields of materials science and solid-state physics (condensed matter physics). The word "crystallography" is derived from the Greek word κρύσταλλος (''krystallos'') "clear ice, rock-crystal", with its meaning extending to all solids with some degree of transparency, and γράφειν (''graphein'') "to write". In July 2012, the United Nations recognised the importance of the science of crystallography by proclaiming that 2014 would be the International Year of Crystallography. denote a direction vector (in real space). * Coordinates in ''angle brackets'' or ''chevrons'' such as <100> denote a ''family'' of directions which are related by symmetry operations. In the cubic crystal system for example, would mean 00 10 01/nowiki> or the negative of any of those directions. * Miller indices in ''parentheses'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Difference Map Algorithm
The difference-map algorithm is a search algorithm for general constraint satisfaction problems. It is a meta-algorithm in the sense that it is built from more basic algorithms that perform projections onto constraint sets. From a mathematical perspective, the difference-map algorithm is a dynamical system based on a mapping of Euclidean space. Solutions are encoded as fixed points of the mapping. Although originally conceived as a general method for solving the phase problem, the difference-map algorithm has been used for the boolean satisfiability problem, protein structure prediction, Ramsey numbers, diophantine equations, and ''Sudoku'', as well as sphere- and disk-packing problems. Since these applications include NP-complete problems, the scope of the difference map is that of an incomplete algorithm. Whereas incomplete algorithms can efficiently verify solutions (once a candidate is found), they cannot prove that a solution does not exist. The difference-map algorithm ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Footnotes
A note is a string of text placed at the bottom of a page in a book or document or at the end of a chapter, volume, or the whole text. The note can provide an author's comments on the main text or citations of a reference work in support of the text. Footnotes are notes at the foot of the page while endnotes are collected under a separate heading at the end of a chapter, volume, or entire work. Unlike footnotes, endnotes have the advantage of not affecting the layout of the main text, but may cause inconvenience to readers who have to move back and forth between the main text and the endnotes. In some editions of the Bible, notes are placed in a narrow column in the middle of each page between two columns of biblical text. Numbering and symbols In English, a footnote or endnote is normally flagged by a superscripted number immediately following that portion of the text the note references, each such footnote being numbered sequentially. Occasionally, a number between brack ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
