Results 1 - 10
of
6,535
Theoretical investigation of iterative phase retrieval algorithm for quasi-optical millimeter wave RF beams,” IEEE Trans. Plasma Sci. accepted for publication
"... Abstract—In this paper, we present a detailed analysis of the iterative phase retrieval approach (IPRA) for determining the phase profile of the output microwave beam of a gyrotron from known intensity patterns emphasizing the field propagation techniques which are used to propagate the RF field of ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract—In this paper, we present a detailed analysis of the iterative phase retrieval approach (IPRA) for determining the phase profile of the output microwave beam of a gyrotron from known intensity patterns emphasizing the field propagation techniques which are used to propagate the RF field
Improving retrieval performance by relevance feedback
- Journal of the American Society for Information Science
, 1990
"... Relevance feedback is an automatic process, introduced over 20 years ago, designed to produce improved query formulations following an initial retrieval operation. The principal relevance feedback methods described over the years are examined briefly, and evaluation data are included to demonstrate ..."
Abstract
-
Cited by 756 (6 self)
- Add to MetaCart
the effectiveness of the various methods. Prescriptions are given for conducting text re-trieval operations iteratively using relevance feedback. Introduction to Relevance Feedback It is well known that the original query formulation process is not transparent to most information system users. In particular
Greedy Randomized Adaptive Search Procedures
, 2002
"... GRASP is a multi-start metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phas ..."
Abstract
-
Cited by 647 (82 self)
- Add to MetaCart
GRASP is a multi-start metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search
Efficient Variants of the ICP Algorithm
- INTERNATIONAL CONFERENCE ON 3-D DIGITAL IMAGING AND MODELING
, 2001
"... The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minim ..."
Abstract
-
Cited by 718 (5 self)
- Add to MetaCart
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points
Phase retrieval algorithms: a comparison
- Appl. Opt
, 1982
"... Iterative algorithms for phase retrieval from intensity data are compared to gradient search methods. Both the problem of phase retrieval from two intensity measurements (in electron microscopy or wave front sens-ing) and the problem of phase retrieval from a single intensity measurement plus a non- ..."
Abstract
-
Cited by 294 (15 self)
- Add to MetaCart
Iterative algorithms for phase retrieval from intensity data are compared to gradient search methods. Both the problem of phase retrieval from two intensity measurements (in electron microscopy or wave front sens-ing) and the problem of phase retrieval from a single intensity measurement plus a non
ordering in
"... Iterative phase retrieval in one dimension for studying confinement induced ..."
Abstract
- Add to MetaCart
Iterative phase retrieval in one dimension for studying confinement induced
Visibility Preprocessing For Interactive Walkthroughs
- IN: COMPUTER GRAPHICS (SIGGRAPH 91 PROCEEDINGS
, 1991
"... The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g., walls), only a small fraction of atypical model is visible from most viewpoints. We describe a method of visibility pre ..."
Abstract
-
Cited by 332 (16 self)
- Add to MetaCart
nfthesubdivisicm. Next. theccl/-r/~-cc/ / visibility is computed for each cell of the subdivisirrn, by linking pairs of cells between which unobstructed.si,q/~t/inr. ~exist. During an interactive ww/krhrm/,q/~phase, an observer with a known ~~sition and\it)M~~~)~t>mov esthrc>ughthe model. At each frame
Phase retrieval by iterated projections
- J. Opt. Soc. Amer. A
, 2003
"... Several strategies in phase retrieval are unified by an iterative “difference map” constructed from a pair of elementary projections and a single real parameter β. For the standard application in optics, where the two projections implement Fourier modulus and object support constraints respectively, ..."
Abstract
-
Cited by 29 (2 self)
- Add to MetaCart
Several strategies in phase retrieval are unified by an iterative “difference map” constructed from a pair of elementary projections and a single real parameter β. For the standard application in optics, where the two projections implement Fourier modulus and object support constraints respectively
PIMS-Director director@pims.math.ca (604) 822-3922
"... We report on progress in algorithms for iterative phase retrieval. The theory of convex optimization is used to develop and to gain insight into counterparts for the nonconvex problem of phase retrieval. ..."
Abstract
- Add to MetaCart
We report on progress in algorithms for iterative phase retrieval. The theory of convex optimization is used to develop and to gain insight into counterparts for the nonconvex problem of phase retrieval.
Distributed Localization in Wireless Sensor Networks: A Quantitative Comparison
, 2003
"... This paper studies the problem of determining the node locations in ad-hoc sensor networks. We compare three distributed localization algorithms (Ad-hoc positioning, Robust positioning, and N-hop multilateration) on a single simulation platform. The algorithms share a common, three-phase structure: ..."
Abstract
-
Cited by 302 (7 self)
- Add to MetaCart
: (1) determine node--anchor distances, (2) compute node positions, and (3) optionally refine the positions through an iterative procedure. We present a detailed analysis comparing the various alternatives for each phase, as well as a head-to-head comparison of the complete algorithms. The main
Results 1 - 10
of
6,535