33,583 research outputs found
Reconstruction of the Antenna Near-Field
Cílem disertační práce je navrhnout efektivně pracující algoritmus, který na základě bezfázového měření v blízkém poli antény bude schopen zrekonstruovat komplexní blízké pole antény resp. vyzařovací diagram antény ve vzdáleném poli. Na základě těchto úvah byly zkoumány vlastnosti minimalizačního algoritmu. Zejména byl analyzován a vhodně zvolen minimalizační přistup, optimalizační metoda a v neposlední řadě i optimalizační funkce tzv. funkcionál. Dále pro urychlení celého minimalizačního procesu byly uvažovány prvotní odhady. A na závěr byla do minimalizačního algoritmu zahrnuta myšlenka nahrazující hledané elektrické pole několika koeficienty. Na základě předchozích analýz byla navržená bezfázová metoda pro charakterizaci vyzařovacích vlastností antén. Tato metoda kombinuje globální optimalizaci s obrazovou kompresní metodou a s lokální metodou ve spojení s konvečním amplitudovým měřením na dvou površích. V našem případě je globální optimalizace použita k nalezení globálního minima minimalizovaného funkcionálu, kompresní metoda k redukci neznámých proměnných na apertuře antény a lokální metoda zajišťuje přesnější nalezení minima. Navržená metoda je velmi robustní a mnohem rychlejší než jiné dostupné minimalizační algoritmy. Další výzkum byl zaměřen na možnosti využití měřených amplitud pouze z jednoho měřícího povrchu pro rekonstrukci vyzařovacích charakteristik antén a využití nového algoritmu pro rekonstrukci fáze na válcové geometrii.The aim of this dissertation thesis is to design a very effective algorithm, which is able to reconstruct the antenna near-field and radiation patterns, respectively, from amplitude-only measurements. Under these circumstances, the properties of minimization algorithm were researched. The selection of the minimization approach, optimization technique and the appropriate functional were investigated and appropriately chosen. To reveal the global minimum area faster, the possibilities in the form of initial estimates for accelerating minimization algorithm were also considered. And finally, the idea to represent the unknown electric field distribution by a few coefficients was implicated into the minimization algorithm. The designed near-field phaseless approach for the antenna far-field characterization combines a global optimization, an image compression method and a local optimization in conjunction with conventional two-surface amplitude measurements. The global optimization method is used to minimize the functional, the image compression method is used to reduce the number of unknown variables, and the local optimization method is used to improve the estimate achieved by the previous method. The proposed algorithm is very robust and faster than comparable algorithms available. Other investigations were focused on possibilities of using amplitude from only single scanning surface for reconstruction of radiation patterns and the application of the novel phase retrieval algorithm for cylindrical geometry.
Maskless imaging of dense samples using pixel super-resolution based multi-height lensfree on-chip microscopy.
Lensfree in-line holographic microscopy offers sub-micron resolution over a large field-of-view (e.g., ~24 mm2) with a cost-effective and compact design suitable for field use. However, it is limited to relatively low-density samples. To mitigate this limitation, we demonstrate an on-chip imaging approach based on pixel super-resolution and phase recovery, which iterates among multiple lensfree intensity measurements, each having a slightly different sample-to-sensor distance. By digitally aligning and registering these lensfree intensity measurements, phase and amplitude images of dense and connected specimens can be iteratively reconstructed over a large field-of-view of ~24 mm2 without the use of any spatial masks. We demonstrate the success of this multi-height in-line holographic approach by imaging dense Papanicolaou smears (i.e., Pap smears) and blood samples
Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers
Ptychography has risen as a reference X-ray imaging technique: it achieves
resolutions of one billionth of a meter, macroscopic field of view, or the
capability to retrieve chemical or magnetic contrast, among other features. A
ptychographyic reconstruction is normally formulated as a blind phase retrieval
problem, where both the image (sample) and the probe (illumination) have to be
recovered from phaseless measured data. In this article we address a nonlinear
least squares model for the blind ptychography problem with constraints on the
image and the probe by maximum likelihood estimation of the Poisson noise
model. We formulate a variant model that incorporates the information of
phaseless measurements of the probe to eliminate possible artifacts. Next, we
propose a generalized alternating direction method of multipliers designed for
the proposed nonconvex models with convergence guarantee under mild conditions,
where their subproblems can be solved by fast element-wise operations.
Numerically, the proposed algorithm outperforms state-of-the-art algorithms in
both speed and image quality.Comment: 23 page
A two-step method for retrieving the longitudinal profile of an electron bunch from its coherent radiation
The coherent radiation emitted by an electron bunch provides a diagnostic
signal that can be used to estimate its longitudinal distribution. Commonly
only the amplitude of the intensity spectrum can be measured and the associated
phase must be calculated to obtain the bunch profile. Very recently an
iterative method was proposed to retrieve this phase. However ambiguities
associated with non-uniqueness of the solution are always present in the phase
retrieval procedure. Here we present a method to overcome the ambiguity problem
by first performing multiple independent runs of the phase retrieval procedure
and then second, sorting the good solutions by mean of cross-correlation
analysis. Results obtained with simulated bunches of various shapes and
experimental measured spectra are presented, discussed and compared with the
established Kramers-Kronig method. It is shown that even when the effect of the
ambiguities is strong, as is the case for a double peak in the profile, the
cross-correlation post-processing is able to filter out unwanted solutions. We
show that, unlike the Kramers-Kronig method, the combined approach presented is
able to faithfully reconstruct complicated bunch profiles.Comment: 22 pages, 5 figure
Undersampled Phase Retrieval with Outliers
We propose a general framework for reconstructing transform-sparse images
from undersampled (squared)-magnitude data corrupted with outliers. This
framework is implemented using a multi-layered approach, combining multiple
initializations (to address the nonconvexity of the phase retrieval problem),
repeated minimization of a convex majorizer (surrogate for a nonconvex
objective function), and iterative optimization using the alternating
directions method of multipliers. Exploiting the generality of this framework,
we investigate using a Laplace measurement noise model better adapted to
outliers present in the data than the conventional Gaussian noise model. Using
simulations, we explore the sensitivity of the method to both the
regularization and penalty parameters. We include 1D Monte Carlo and 2D image
reconstruction comparisons with alternative phase retrieval algorithms. The
results suggest the proposed method, with the Laplace noise model, both
increases the likelihood of correct support recovery and reduces the mean
squared error from measurements containing outliers. We also describe exciting
extensions made possible by the generality of the proposed framework, including
regularization using analysis-form sparsity priors that are incompatible with
many existing approaches.Comment: 11 pages, 9 figure
Zero-Shot Hashing via Transferring Supervised Knowledge
Hashing has shown its efficiency and effectiveness in facilitating
large-scale multimedia applications. Supervised knowledge e.g. semantic labels
or pair-wise relationship) associated to data is capable of significantly
improving the quality of hash codes and hash functions. However, confronted
with the rapid growth of newly-emerging concepts and multimedia data on the
Web, existing supervised hashing approaches may easily suffer from the scarcity
and validity of supervised information due to the expensive cost of manual
labelling. In this paper, we propose a novel hashing scheme, termed
\emph{zero-shot hashing} (ZSH), which compresses images of "unseen" categories
to binary codes with hash functions learned from limited training data of
"seen" categories. Specifically, we project independent data labels i.e.
0/1-form label vectors) into semantic embedding space, where semantic
relationships among all the labels can be precisely characterized and thus seen
supervised knowledge can be transferred to unseen classes. Moreover, in order
to cope with the semantic shift problem, we rotate the embedded space to more
suitably align the embedded semantics with the low-level visual feature space,
thereby alleviating the influence of semantic gap. In the meantime, to exert
positive effects on learning high-quality hash functions, we further propose to
preserve local structural property and discrete nature in binary codes.
Besides, we develop an efficient alternating algorithm to solve the ZSH model.
Extensive experiments conducted on various real-life datasets show the superior
zero-shot image retrieval performance of ZSH as compared to several
state-of-the-art hashing methods.Comment: 11 page
- …