Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Laplacian”

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 19 records

Improved Discrete Approximation of Laplacian of Gaussian

An improved method of computing a discrete approximation of the Laplacian of a Gaussian convolution of an image has been devised. The primary advantage of the method is that without substantially degrading the accuracy of the end result, it reduces the amount of information that must be processed and thus reduces the amount of circuitry needed to perform the Laplacian-of- Gaussian (LOG) operation. Some background information is necessary to place the method in context. The method is intended for application to the LOG part of a process of real-time digital filtering of digitized video data that represent brightnesses in pixels in a square array. The particular filtering process of interest is one that converts pixel brightnesses to binary form, thereby reducing the amount of information that must be performed in subsequent correlation processing (e.g., correlations between images in a stereoscopic pair for determining distances or correlations between successive frames of the same image for detecting motions). The Laplacian is often included in the filtering process because it emphasizes edges and textures, while the Gaussian is often included because it smooths out noise that might not be consistent between left and right images or between successive frames of the same image.

Shuler, Robert L., Jr.↗

Enhanced orbital geochemical images by the Laplacian subtraction method

Orbital geochemical studies of the moon based on X-ray fluorescence and gamma-ray spectroscopy have been successful. There are, however, difficulties if geologic units or other features to be investigated are too small. Investigations have been conducted with the objective to improve with the aid of image enhancement methods both spatial resolution and contrast for the geochemical experiments. A description is provided of the Laplacian subtraction method of enhancement. It was found that the application of a least-squares version of this method to the Mg/Al ratios obtained by orbital X-ray fluorescence improved geochemical images considerably. The spatial resolution increased by about a factor of 2 and the contrast also increased. The Laplacian of an image can also be used to detect very small 'hot' or 'cold' spots in an image.

Schonfeld, E.↗

Galerkin finite difference Laplacian operators on isolated unstructured triangular meshes by linear combinations

The Galerkin weighted residual technique using linear triangular weight functions is employed to develop finite difference formulae in Cartesian coordinates for the Laplacian operator on isolated unstructured triangular grids. The weighted residual coefficients associated with the weak formulation of the Laplacian operator along with linear combinations of the residual equations are used to develop the algorithm. The algorithm was tested for a wide variety of unstructured meshes and found to give satisfactory results.

Baumeister, Kenneth J.↗

Eigenvalues of the Laplacian of a graph

Let G be a finite undirected graph with no loops or multiple edges. The Laplacian matrix of G, Delta(G), is defined by Delta sub ii = degree of vertex i and Delta sub ij = -1 if there is an edge between vertex i and vertex j. The structure of the graph G is related to the eigenvalues of Delta(G); in particular, it is proved that all the eigenvalues of Delta(G) are nonnegative, less than or equal to the number of vertices, and less than or equal to twice the maximum vertex degree. Precise conditions for equality are given.

Anderson, W. N., Jr.↗

Orbital inclination of Iapetus and the rotation of the Laplacian plane

This paper explores the possibility that the orbit of Iapetus, with its relatively large inclination but small eccentricity, was generated by a rapid dispersal of a gaseous circumplanetary disk, assumed to be the progenitor of the satellite system. The orientation of the local Laplacian plane is shown to be a sensitive function of the disk's structure. Modification of the disk on a time scale comparable to the precession of the orbit's nodal line can produce a large inclination from one that is initially zero, while leaving the eccentricity unchanged. This time scale is of the same order of magnitude as the viscous evolution time scale for a fully turbulent disk. Hence, Iapetus need not be a captured satellite to account for its curious orbital signature.

Ward, W. R.↗

The computation of Laplacian smoothing splines with examples

Laplacian smoothing splines (LSS) are presented as generalizations of graduation, cubic and thin plate splines. The method of generalized cross validation (GCV) to choose the smoothing parameter is described. The GCV is used in the algorithm for the computation of LSS's. An outline of a computer program which implements this algorithm is presented along with a description of the use of the program. Examples in one, two and three dimensions demonstrate how to obtain estimates of function values with confidence intervals and estimates of first and second derivatives. Probability plots are used as a diagnostic tool to check for model inadequacy.

Wendelberger, J. G.↗

The Laplacian resonance and tidal dissipation

The Laplacian resonance amongst Io, Europa, and Ganymede was examined, taking into account tidal dissipation in Jupiter, Io and Europa. In equilibrium, it is not possible to neglect dissipation in Europa nor the torques of Jupiter on Europa and Ganymede. A formal calculation was made on the assumption that the tidal torques and the torques in orbit-orbit resonance reached an equilibrium such that the rates of decrease of the mean motions of the satellites are in the ratios 4:2:1. Q(j)/k(j)=167 Q(1)/k(1), Q(2)/k(2) = 0.44 Q(1)/K(1), where Q denotes the quality at the body's frequency of rotation, k its second degree Love number and the subscripts J, 1 and 2 denote Jupiter, Io, and Europa. The Q(J) found is at Jupiter's frequency of rotation. The rate of tidal dissipation in Europa comes to 1/5 that of Io. Such a low value of Q(2)/K(2) is plausible if dissipation in both Io and Europa is due to tidal friction in fluid against underlying and overlying solid layers.

Cook, A. F.↗

Permutation codes for the Laplacian source

Permutation codes for the Laplacian source are developed. The performance of these codes is evaluated and compared with other quantizers and the rate-distortion function. It is shown that there is a bit-rate region in which the permutation codes outperform certain single-sample quantizers.

Townes, S. A.↗

Structural stereo matching of Laplacian-of-Gaussian contour segments for 3D perception

The stereo correspondence problem is solved using Laplacian-of-Gaussian zero-crossing contours as a source of primitives for structural stereopsis, as opposed to traditional point-based algorithms. Up to 74 percent matching of candidate zero crossing points are being achieved on 240 x 246 images at small scales and large ranges of disparity, without coarse-to-fine tracking and without precise knowledge of the epipolar geometry. This approach should prove particularly useful in recovering the epipolar geometry automatically for stereo pairs for which it is unavailable a priori. Such situations occur in the extraction of terrain models from stereo aerial photographs.

Boyer, K. L.↗

The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian

We introduce the path resistance method for lower bounds on the smallest nontrivial eigenvalue of the Laplacian matrix of a graph. The method is based on viewing the graph in terms of electrical circuits; it uses clique embeddings to produce lower bounds on lambda(sub 2) and star embeddings to produce lower bounds on the smallest Rayleigh quotient when there is a zero Dirichlet boundary condition. The method assigns priorities to the paths in the embedding; we show that, for an unweighted tree T, using uniform priorities for a clique embedding produces a lower bound on lambda(sub 2) that is off by at most an 0(log diameter(T)) factor. We show that the best bounds this method can produce for clique embeddings are the same as for a related method that uses clique embeddings and edge lengths to produce bounds.

Guattery, Stephen↗

Analysis of the SOR iteration for the 9-point Laplacian

The SOR iteration for solving linear systems of equations depends upon an overrelaxation factor omega. A theory for determining omega was given by Young (1950) for consistently ordered matrices. Here the optimal omega is determined for the 9-point stencil for the model problem of Laplace's equation on a square. Several orderings of the equations are considered, including the natural rowwise and multicolor orderings, all of which lead to non-consistently ordered matrices, and two equivalence classes of orderings are found with different convergence behavior and optimal omega's. The results for the natural rowwise ordering are compared to those of Garabedian (1956) and it is explained why both results are, in a sense, correct, even though they differ. Also analyzed is a pseudo SOR method for the model problem and it is shown that it is not as effective as the SOR methods. Finally, the point SOR methods are compared to known results for line SOR methods for this problem.

Loyce M. Adams↗

Edge detection - Image-plane versus digital processing

To optimize edge detection with the familiar Laplacian-of-Gaussian operator, it has become common to implement this operator with a large digital convolution mask followed by some interpolation of the processed data to determine the zero crossings that locate edges. It is generally recognized that this large mask causes substantial blurring of fine detail. It is shown that the spatial detail can be improved by a factor of about four with either the Wiener-Laplacian-of-Gaussian filter or an image-plane processor. The Wiener-Laplacian-of-Gaussian filter minimizes the image-gathering degradations if the scene statistics are at least approximately known and also serves as an interpolator to determine the desired zero crossings directly. The image-plane processor forms the Laplacian-of-Gaussian response by properly combining the optical design of the image-gathering system with a minimal three-by-three lateral-inhibitory processing mask. This approach, which is suggested by Marr's model of early processing in human vision, also reduces data processing by about two orders of magnitude and data transmission by up to an order of magnitude.

Huck, Friedrich O.↗

Partitioning sparse matrices with eigenvectors of graphs

The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.

Pothen, Alex↗

A Spectral Algorithm for Envelope Reduction of Sparse Matrices

The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelope-reducing reordering is obtained by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. This Laplacian eigenvector solves a continuous relaxation of a discrete problem related to envelope minimization called the minimum 2-sum problem. The permutation vector computed by the spectral algorithm is a closest permutation vector to the specified Laplacian eigenvector. Numerical results show that the new reordering algorithm usually computes smaller envelope sizes than those obtained from the current standard algorithms such as Gibbs-Poole-Stockmeyer (GPS) or SPARSPAK reverse Cuthill-McKee (RCM), in some cases reducing the envelope by more than a factor of two.

Barnard, Stephen T.↗

An equivalent body surface charge model representing three-dimensional bioelectrical activity

A new surface-source model has been developed to account for the bioelectrical potential on the body surface. A single-layer surface-charge model on the body surface has been developed to equivalently represent bioelectrical sources inside the body. The boundary conditions on the body surface are discussed in relation to the surface-charge in a half-space conductive medium. The equivalent body surface-charge is shown to be proportional to the normal component of the electric field on the body surface just outside the body. The spatial resolution of the equivalent surface-charge distribution appears intermediate between those of the body surface potential distribution and the body surface Laplacian distribution. An analytic relationship between the equivalent surface-charge and the surface Laplacian of the potential was found for a half-space conductive medium. The effects of finite spatial sampling and noise on the reconstruction of the equivalent surface-charge were evaluated by computer simulations. It was found through computer simulations that the reconstruction of the equivalent body surface-charge from the body surface Laplacian distribution is very stable against noise and finite spatial sampling. The present results suggest that the equivalent body surface-charge model may provide an additional insight to our understanding of bioelectric phenomena.

NASA Discipline Regulatory Physiology↗

Dynamic Stability And Adaptive Control of Networked Evolving Formations with Weak Nonlinearities

The dynamic stability of formation geometry is vital to the design of large scale multiagent systems. In this paper, we probe into the structure of the formation system matrix using the Laplacian of a digraph to develop several fundamental theoretical results on the stability of formation geometry. Our key-results include the integration of the graph Laplacian into linear and weak-nonlinear relative dynamics, the development of several new coordinate transformations that expose the influence of the graph Laplacian matrix on the control laws of the agents, and the use of direct adaptive control as stability restoring devices. We also develop two fundamental results that provide upper bounds for stable formation evolution under nonlinear perturbations of agent dynamics. Finally, we use an illustrative example to demonstrate our theoretical findings.

Gehlot, Vinod P.↗