NASA Scientific and Technical Aerospace Reports

extraction, and object recognition. MM has the intrinsic ability to quantitatively analyze object shapes in both 2 and 3
dimensions. Using MM to extract features and recognize objects in range imagery seems particularly appropriate since range
data is a natural source of shape information. We present several experimental results of applying MM techniques to real and
synthetic range imagery, both for noise removal and feature extraction.
Author
Imagery; Morphology
20060001707 British Columbia Univ., Vancouver, British Columbia, Canada
Characterizing V2G Filtered Images by Their Zero Crossings
Reimer, J. A.; Lawrence, P. D.; IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP ‘87);
Volume 1; 1987, pp. 7.12.1 - 7.12.4; In English; See also 20060001583
Contract(s)/Grant(s): NSERC-A4924; Copyright; Avail.: Other Sources
This paper considers the characterization of V2G filtered images by their zero crossings. It has been suggested that V2G
filtered images might be characterized by their zero crossings [1]. It is shown here that V2G filtered images, filtered in I-D
or 2-D are not, in general, uniquely given within a scalar by their zero crossing locations. Two theorems in support of such
a suggestion are considered. We consider the differences between the requirements of Logan’s theorem and V2G filtering, and
show that the zero crossings which result from these two situations differ significantly in number and location. Logan’s
theorem is therefore not applicable to V2G filtered images. A recent theorem by Curtis [8] on the adequacy of zero crossings
of 2-D functions is also considered. It is shown that the requirements of Curtis’ theorem are not satisfied by all V2G filtered
images. An example of two different V2G filtered images with the same zero crossings is presented.
Author
Theorems; Roots of Equations
20060001921 Black River Systems Co., Inc., Utica, NY USA
Parallel Scene Generation/Electromagnetic Modeling of Complex Targets in Complex Clutter and Propagation
Environments
Benincasa, Milissa; Sarkar, Tapan; Card, Christopher; Thomas, Carl; Mokole, Eric; Taylor, Douglas; Schneible, Richard;
Adve, Ravi; Simcoe, Michael; Joiner, Laurie; Oct. 1, 2005; 45 pp.; In English; Original contains color illustrations
Contract(s)/Grant(s): F30602-01-C-0203; Proj-HPCM
Report No.(s): AD-A440581; AFRL-SN-RS-TR-2005-365; No Copyright; Avail.: Defense Technical Information Center
(DTIC)
Under the Department of Defense (DoD) Common High Performance Computing Software Support Initiative (CHSSI),
the goal of this effort was to parallelize the electromagnetic modeling tool WIPL-D (Wires, Plates and Dielectrics). WIPL-D
utilizes a Method of Moments technique to solve Maxwell’s Equations. Three evaluation criteria were used to evaluate the
effort: 1) accuracy of the code as compared to the commercial program WIPL-D; 2) scalability of the code when using
multi-processor High Performance Computing (HPC) resources; and 3) portability of the code, by running on multiple HPC
computers with different computing architectures. A demonstration of a cell phone beside a head was used to demonstrate the
codes utility and performance.
DTIC
Clutter; Parallel Processing (Computers); Scene Generation; Targets
20060002400 Utah Univ., Salt Lake City, UT USA
Minimum Distance Queries for Polygonal and Parametric Models
Johnson, David E.; Cohen, Elaine; Feb. 26, 1997; 22 pp.; In English
Contract(s)/Grant(s): F33615-96-C-5621; ASC-89-20219
Report No.(s): AD-A440300; UUCS-97-003; No Copyright; Avail.: Defense Technical Information Center (DTIC)
Calculation of the minimum distance to a geometric object or the minimum separation between objects is a fundamental
problem that has application in a variety of arenas. Minimum separation queries for sculptured surfaces are believed
particularly difficult, yet are increasingly important as modeling problems grow larger and interactivity demands grow more
stringent. We present a set of algorithms based on easy to compute bounds that allows efficient solution of minimum separation
queries for many types of surface representations. These algorithms have simple and robust implementations and have average
case performance matching the most efficient theoretical algorithms. These algorithms are tested in an interactive application
182