Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 793 records · Page 44

Recursively indexed differential pulse code modulation

The performance of a differential pulse code modulation (DPCM) system with a recursively indexed quantizer (RIQ) under various conditions, with first order Gauss-Markov and Laplace-Markov sources as inputs, is studied. When the predictor is matched to the input, the proposed system performs at or close to the optimum entropy constrained DPCM system. If one is willing to accept a 5 percent increase in the rate, the system is very forgiving of predictor mismatch.

Sayood, Khalid↗

Two generalizations of Kohonen clustering

The relationship between the sequential hard c-means (SHCM), learning vector quantization (LVQ), and fuzzy c-means (FCM) clustering algorithms is discussed. LVQ and SHCM suffer from several major problems. For example, they depend heavily on initialization. If the initial values of the cluster centers are outside the convex hull of the input data, such algorithms, even if they terminate, may not produce meaningful results in terms of prototypes for cluster representation. This is due in part to the fact that they update only the winning prototype for every input vector. The impact and interaction of these two families with Kohonen's self-organizing feature mapping (SOFM), which is not a clustering method, but which often leads ideas to clustering algorithms is discussed. Then two generalizations of LVQ that are explicitly designed as clustering algorithms are presented; these algorithms are referred to as generalized LVQ = GLVQ; and fuzzy LVQ = FLVQ. Learning rules are derived to optimize an objective function whose goal is to produce 'good clusters'. GLVQ/FLVQ (may) update every node in the clustering net for each input vector. Neither GLVQ nor FLVQ depends upon a choice for the update neighborhood or learning rate distribution - these are taken care of automatically. Segmentation of a gray tone image is used as a typical application of these algorithms to illustrate the performance of GLVQ/FLVQ.

Bezdek, James C.↗

Wavelet encoding and variable resolution progressive transmission

Progressive transmission is a method of transmitting and displaying imagery in stages of successively improving quality. The subsampled lowpass image representations generated by a wavelet transformation suit this purpose well, but for best results the order of presentation is critical. Candidate data for transmission are best selected using dynamic prioritization criteria generated from image contents and viewer guidance. We show that wavelets are not only suitable but superior when used to encode data for progressive transmission at non-uniform resolutions. This application does not preclude additional compression using quantization of highpass coefficients, which to the contrary results in superior image approximations at low data rates.

Blanford, Ronald P.↗

Multi-rate, real time image compression for images dominated by point sources

An image compression system recently developed for compression of digital images dominated by point sources is presented. Encoding consists of minimum-mean removal, vector quantization, adaptive threshold truncation, and modified Huffman encoding. Simulations are presented showing that the peaks corresponding to point sources can be transmitted losslessly for low signal-to-noise ratios (SNR) and high point source densities while maintaining a reduced output bit rate. Encoding and decoding hardware has been built and tested which processes 552,960 12-bit pixels per second at compression rates of 10:1 and 4:1. Simulation results are presented for the 10:1 case only.

Huber, A. Kris↗

Quons, an interpolation between Bose and Fermi oscillators

After a brief mention of Bose and Fermi oscillators and of particles which obey other types of statistics, including intermediate statistics, parastatistics, paronic statistics, anyon statistics, and infinite statistics, I discuss the statistics of 'quons' (pronounced to rhyme with muons), particles whose annihilation and creation operators obey the q-deformed commutation relation (the quon algebra or q-mutator) which interpolates between fermions and bosons. I emphasize that the operator for interaction with an external source must be an effective Bose operator in all cases. To accomplish this for parabose, parafermi and quon operators, I introduce parabose, parafermi, and quon Grassmann numbers, respectively. I also discuss interactions of non-relativistic quons, quantization of quon fields with antiparticles, calculation of vacuum matrix elements of relativistic quon fields, demonstration of the TCP theorem, cluster decomposition, and Wick's theorem for relativistic quon fields, and the failure of local commutativity of observables for relativistic quon fields. I conclude with the bound on the parameter q for electrons due to the Ramberg-Snow experiment.

Greenberg, O. W.↗

Phase space localization for anti-de Sitter quantum mechanics and its zero curvature limit

Using techniques of geometric quantization and SO(sub 0)(3,2)-coherent states, a notion of optimal localization on phase space is defined for the quantum theory of a massive and spinning particle in anti-de Sitter space time. It is shown that this notion disappears in the zero curvature limit, providing one with a concrete example of the regularizing character of the constant (nonzero) curvature of the anti-de Sitter space time. As a byproduct a geometric characterization of masslessness is obtained.

Elgradechi, Amine M.↗

The algebra of supertraces for 2+1 super de Sitter gravity

The algebra of the observables for 2+1 super de Sitter gravity, for one genus of the spatial surface is calculated. The algebra turns out to be an infinite Lie algebra subject to non-linear constraints. The constraints are solved explicitly in terms of five independent complex supertraces. These variables are the true degrees of freedom of the system and their quantized algebra generates a new structure which is referred to as a 'central extension' of the quantum algebra SU(2)q.

Urrutia, L. F.↗

Nonlinear modes of the tensor Dirac equation and CPT violation

Recently, it has been shown that Dirac's bispinor equation can be expressed, in an equivalent tensor form, as a constrained Yang-Mills equation in the limit of an infinitely large coupling constant. It was also shown that the free tensor Dirac equation is a completely integrable Hamiltonian system with Lie algebra type Poisson brackets, from which Fermi quantization can be derived directly without using bispinors. The Yang-Mills equation for a finite coupling constant is investigated. It is shown that the nonlinear Yang-Mills equation has exact plane wave solutions in one-to-one correspondence with the plane wave solutions of Dirac's bispinor equation. The theory of nonlinear dispersive waves is applied to establish the existence of wave packets. The CPT violation of these nonlinear wave packets, which could lead to new observable effects consistent with current experimental bounds, is investigated.

Reifler, Frank J.↗

Zone plate lens antennas for millimeter and submillimeter wavelengths

Zone plate lenses are a type of focusing element which function essentially as differential phase shifters, having a relatively few, coarsely quantized phase delays across the incident beam of radiation. The major advantages are ease of fabrication and much reduced thickness, compared to conventional refractive focusing elements. These considerations are both of particular importance for the submillimeter range, in which manufacturing tolerances for curved optical elements can pose significant problems, and where the absorption of readily available dielectric materials is quite large. In this presentation we briefly review the theory of zone plate lens operations, present a relatively simple method for calculating the aperture efficiency of zone plate lenses used as antennas, and show some theoretical and measured results in the 100 GHz range.

Goldsmith, Paul F.↗

Image segmentation using fuzzy LVQ clustering networks

In this note we formulate image segmentation as a clustering problem. Feature vectors extracted from a raw image are clustered into subregions, thereby segmenting the image. A fuzzy generalization of a Kohonen learning vector quantization (LVQ) which integrates the Fuzzy c-Means (FCM) model with the learning rate and updating strategies of the LVQ is used for this task. This network, which segments images in an unsupervised manner, is thus related to the FCM optimization problem. Numerical examples on photographic and magnetic resonance images are given to illustrate this approach to image segmentation.

Tsao, Eric Chen-Kuo↗

Spatial acquisition and tracking for deep-space optical communication packages

The problem of acquiring and tracking a sun-lit earth, which poses a rather stringent demand on the design of the pointing acquisition and tracking subsystem for a deep-space optical communication package, is addressed. The acquisition subsystem must be capable of locating and tracking the receiver location based on a sun-lit earth image that is blurred by the point spread function of the imaging optics and spatially quantized by the detector pixels. Spatial tracking must be performed at bandwidths in excess of 1 kHz to effectively reject platform jitters. A simple solution of locating the earth limb shows a great potential for providing the necessary acquisition and tracking accuracy. By using separate acquisition and tracking detectors, the system can be implemented without extensive technology development. The slow bandwidth required for the acquisition process can be readily accomplished with an available CCD array, and an analog tracking loop can be implemented using a quadrant tracker and calibrated centroid tracking without the excessive computing overhead of the array detector-based spatial tracker.

Chen, Chien-Chung↗

GTARG - The TOPEX/Poseidon ground track maintenance maneuver targeting program

GTARG is a computer program used to design orbit maintenance maneuvers for the TOPEX/Poseidon satellite. These maneuvers ensure that the ground track is kept within +/-1 km with of an = 9.9 day exact repeat pattern. Maneuver parameters are determined using either of two targeting strategies: longitude targeting, which maximizes the time between maneuvers, and time targeting, in which maneuvers are targeted to occur at specific intervals. The GTARG algorithm propagates nonsingular mean elements, taking into account anticipated error sigma's in orbit determination, Delta v execution, drag prediction and Delta v quantization. A satellite unique drag model is used which incorporates an approximate mean orbital Jacchia-Roberts atmosphere and a variable mean area model. Maneuver Delta v magnitudes are targeted to precisely maintain either the unbiased ground track itself, or a comfortable (3 sigma) error envelope about the unbiased ground track.

Shapiro, Bruce E.↗

Neurocomputing strategies in decomposition based structural design

The present paper explores the applicability of neurocomputing strategies in decomposition based structural optimization problems. It is shown that the modeling capability of a backpropagation neural network can be used to detect weak couplings in a system, and to effectively decompose it into smaller, more tractable, subsystems. When such partitioning of a design space is possible, parallel optimization can be performed in each subsystem, with a penalty term added to its objective function to account for constraint violations in all other subsystems. Dependencies among subsystems are represented in terms of global design variables, and a neural network is used to map the relations between these variables and all subsystem constraints. A vector quantization technique, referred to as a z-Network, can effectively be used for this purpose. The approach is illustrated with applications to minimum weight sizing of truss structures with multiple design constraints.

Szewczyk, Z.↗

Learning and optimization with cascaded VLSI neural network building-block chips

To demonstrate the versatility of the building-block approach, two neural network applications were implemented on cascaded analog VLSI chips. Weights were implemented using 7-b multiplying digital-to-analog converter (MDAC) synapse circuits, with 31 x 32 and 32 x 32 synapses per chip. A novel learning algorithm compatible with analog VLSI was applied to the two-input parity problem. The algorithm combines dynamically evolving architecture with limited gradient-descent backpropagation for efficient and versatile supervised learning. To implement the learning algorithm in hardware, synapse circuits were paralleled for additional quantization levels. The hardware-in-the-loop learning system allocated 2-5 hidden neurons for parity problems. Also, a 7 x 7 assignment problem was mapped onto a cascaded 64-neuron fully connected feedback network. In 100 randomly selected problems, the network found optimal or good solutions in most cases, with settling times in the range of 7-100 microseconds.

Duong, T.↗

Improvement in detection of small wildfires

Detecting and imaging small wildfires with an Airborne Scanner is done against generally high background levels. The Airborne Scanner System used is a two-channel thermal IR scanner, with one channel selected for imaging the terrain and the other channel sensitive to hotter targets. If a relationship can be determined between the two channels that quantifies the background signal for hotter targets, then an algorithm can be determined that removes the background signal in that channel leaving only the fire signal. The relationship can be determined anywhere between various points in the signal processing of the radiometric data from the radiometric input to the quantized output of the system. As long as only linear operations are performed on the signal, the relationship will only depend on the system gain and offsets within the range of interest. The algorithm can be implemented either by using a look-up table or performing the calculation in the system computer. The current presentation will describe the algorithm, its derivation, and its implementation in the Firefly Wildfire Detection System by means of an off-the-shelf commercial scanner. Improvement over the previous algorithm used and the margin gained for improving the imaging of the terrain will be demonstrated.

Sleigh, William J.↗

A radar altitude and line of sight attachment

This paper describes a method of overcoming much of the computational expense of finding radar altitude and determining lines of sight in flight simulations over databases built from polygons. Methods are described for quantizing polygonal databases and for searching through them quickly. Various tuning parameters are explained and run-time performance figures are offered.

Sansom, Russell↗

Visual information processing II; Proceedings of the Meeting, Orlando, FL, Apr. 14-16, 1993

Various papers on visual information processing are presented. Individual topics addressed include: aliasing as noise, satellite image processing using a hammering neural network, edge-detetion method using visual perception, adaptive vector median filters, design of a reading test for low-vision image warping, spatial transformation architectures, automatic image-enhancement method, redundancy reduction in image coding, lossless gray-scale image compression by predictive GDF, information efficiency in visual communication, optimizing JPEG quantization matrices for different applications, use of forward error correction to maintain image fidelity, effect of peanoscanning on image compression. Also discussed are: computer vision for autonomous robotics in space, optical processor for zero-crossing edge detection, fractal-based image edge detection, simulation of the neon spreading effect by bandpass filtering, wavelet transform (WT) on parallel SIMD architectures, nonseparable 2D wavelet image representation, adaptive image halftoning based on WT, wavelet analysis of global warming, use of the WT for signal detection, perfect reconstruction two-channel rational filter banks, N-wavelet coding for pattern classification, simulation of image of natural objects, number-theoretic coding for iconic systems.

Huck, Friedrich O.↗

Research on conceptual/innovative design for the life cycle

The goal of this research is developing and integrating qualitative and quantitative methods for life cycle design. The definition of the problem includes formal computer-based methods limited to final detailing stages of design; CAD data bases do not capture design intent or design history; and life cycle issues were ignored during early stages of design. Viewgraphs outline research in conceptual design; the SYMON (SYmbolic MONotonicity analyzer) algorithm; multistart vector quantization optimization algorithm; intelligent manufacturing: IDES - Influence Diagram Architecture; and 1st PRINCE (FIRST PRINciple Computational Evaluator).

Cagan, Jonathan↗