Search NASA⌕ Search

SEARCH · Search NASA

Results for “dimensional”

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 757 records · Page 42

Three-dimensional co-culture process

The present invention relates to a 3-dimensional co-culture process, more particularly to methods or co-culturing at least two types of cells in a culture environment, either in space or in unit gravity, with minimum shear stress, freedom for 3-dimensional spatial orientation of the suspended particles and localization of particles with differing or similar sedimentation properties in a similar spatial region to form 3-dimensional tissue-like structures. Several examples of multicellular 3-dimensional experiences are included. The protocol and procedure are also set forth. The process allows simultaneous culture of multiple cell types and supporting substrates in a manner which does not disrupt the 3-dimensional spatial orientation of these components. The co-cultured cells cause a mutual induction effect which mimics the natural hormonal signals and cell interactions found in the intact organism. This causes the tissues to differentiate and form higher 3-dimensional structures such as glands, junctional complexes polypoid geometries, and microvilli which represent the corresponding in-vitro structures to a greater degree than when the cell types are cultured individually or by conventional processes. This process was clearly demonstrated for the case of two epithelial derived colon cancer lines, each co-cultured with normal human fibroblasts and with microcarrier bead substrates. The results clearly demonstrate increased 3-dimensional tissue-like structure and biochemical evidence of an increased differentiation state. With the present invention a variety of cells may be co-cultured to produce tissue which has 3-dimensionality and has some of the characteristics of in-vitro tissue. The process provides enhanced 3-dimensional tissue which create a multicellular organoid differentiation model.

Wolf, David A.↗

Three-dimensional aerodynamic shape optimization using discrete sensitivity analysis

An aerodynamic shape optimization procedure based on discrete sensitivity analysis is extended to treat three-dimensional geometries. The function of sensitivity analysis is to directly couple computational fluid dynamics (CFD) with numerical optimization techniques, which facilitates the construction of efficient direct-design methods. The development of a practical three-dimensional design procedures entails many challenges, such as: (1) the demand for significant efficiency improvements over current design methods; (2) a general and flexible three-dimensional surface representation; and (3) the efficient solution of very large systems of linear algebraic equations. It is demonstrated that each of these challenges is overcome by: (1) employing fully implicit (Newton) methods for the CFD analyses; (2) adopting a Bezier-Bernstein polynomial parameterization of two- and three-dimensional surfaces; and (3) using preconditioned conjugate gradient-like linear system solvers. Whereas each of these extensions independently yields an improvement in computational efficiency, the combined effect of implementing all the extensions simultaneously results in a significant factor of 50 decrease in computational time and a factor of eight reduction in memory over the most efficient design strategies in current use. The new aerodynamic shape optimization procedure is demonstrated in the design of both two- and three-dimensional inviscid aerodynamic problems including a two-dimensional supersonic internal/external nozzle, two-dimensional transonic airfoils (resulting in supercritical shapes), three-dimensional transport wings, and three-dimensional supersonic delta wings. Each design application results in realistic and useful optimized shapes.

Burgreen, Gregory W.↗

Direct Simulation of Evolution and Control of Three-Dimensional Instabilities in Attachment-Line Boundary Layers

The spatial evolution of three-dimensional disturbances in an attachment-line boundary layer is computed by direct numerical simulation of the unsteady, incompressible Navier-Stokes equations. Disturbances are introduced into the boundary layer by harmonic sources that involve unsteady suction and blowing through the wall. Various harmonic- source generators are implemented on or near the attachment line, and the disturbance evolutions are compared. Previous two-dimensional simulation results and nonparallel theory are compared with the present results. The three-dimensional simulation results for disturbances with quasi-two-dimensional features indicate growth rates of only a few percent larger than pure two-dimensional results; however, the results are close enough to enable the use of the more computationally efficient, two-dimensional approach. However, true three-dimensional disturbances are more likely in practice and are more stable than two-dimensional disturbances. Disturbances generated off (but near) the attachment line spread both away from and toward the attachment line as they evolve. The evolution pattern is comparable to wave packets in at-plate boundary-layer flows. Suction stabilizes the quasi-two-dimensional attachment-line instabilities, and blowing destabilizes these instabilities; these results qualitatively agree with the theory. Furthermore, suction stabilizes the disturbances that develop off the attachment line. Clearly, disturbances that are generated near the attachment line can supply energy to attachment-line instabilities, but suction can be used to stabilize these instabilities.

Joslin, Ronald D.↗

Dimensionality Reduction Library v 0.2

Dimensionality Reduction Library is a C++ library for dimensionality reduction. In the context of this library, dimensionality reduction is considered to consist of 1)estimation of the intrinsic dimensionality using sampled data, 2) Finding maps that reduce the diemsionality of data (forward map) or increase the dimensionality of data (reverse map) and 3) mapping arbitray coordiantes to high and low dimensionalities. The library is intended toprovide a consistent interface to multiple dimensionality reduction algorithms with an efficient C++ interface that runs efficiently on multicore architectures. A few routines have been optimized with an option for GPU acceleration or distributed computation. Currently the library offers intrinsic dimensionality estimation using point-PCA reconstruction error and/ residual variance. The following dimensionality reduction methods have been implemented: Principal Component Analysis Multidimensional Scaling Locally Linear Embedding IsoMap Autoencoder Neutral Networks An executable is also supplied that can be built to allow for command-line access to the library routines. A description for an applciation of the library for molecular structure analysis has been published.

BROWN, WILLIAM↗

A co-kurtosis PCA based dimensionality reduction with nonlinear reconstruction using neural networks

For turbulent reacting flow systems, identification of low-dimensional representations of the thermo-chemical state space is vitally important, primarily to significantly reduce the computational cost of device-scale simulations. Principal component analysis (PCA), and its variants, are a widely employed class of methods. Recently, an alternative technique that focuses on higher-order statistical interactions, co-kurtosis PCA (CoK-PCA), has been shown to effectively provide a low-dimensional representation by capturing the stiff chemical dynamics associated with spatiotemporally localized reaction zones. While its effectiveness has only been demonstrated based on a priori analyses with linear reconstruction, in this work, we employ nonlinear techniques to reconstruct the full thermo-chemical state and evaluate the efficacy of CoK-PCA compared to PCA. Specifically, we combine a CoK-PCA-/PCA-based dimensionality reduction (encoding) with an artificial neural network (ANN) based reconstruction (decoding) and examine, a priori, the reconstruction errors of the thermo-chemical state. In addition, we evaluate the errors in species production rates and heat release rates, which are nonlinear functions of the reconstructed state, as a measure of the overall accuracy of the dimensionality reduction technique. We employ four datasets to assess CoK-PCA/PCA coupled with ANN-based reconstruction: zero-dimensional (homogeneous) reactor for autoignition of an ethylene/air mixture that has conventional single-stage ignition kinetics, a dimethyl ether (DME)/air mixture which has two-stage (low and high temperature) ignition kinetics, a one-dimensional freely propagating premixed ethylene/air laminar flame, and a two-dimensional dataset representing turbulent autoignition of ethanol in a homogeneous charge compression ignition (HCCI) engine. Finally, results from the analyses demonstrate the robustness of the CoK-PCA based low-dimensional manifold with ANN reconstruction in accurately capturing the data, specifically from the reaction zones.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Dynamic colloidal assembly pathways via low dimensional models

Here we construct a low-dimensional Smoluchowski model for electric field mediated colloidal crystallization using Brownian dynamic simulations, which were previously matched to experiments. Diffusion mapping is used to infer dimensionality and confirm the use of two order parameters, one for degree of condensation and one for global crystallinity. Free energy and diffusivity landscapes are obtained as the coefficients of a low-dimensional Smoluchowski equation to capture the thermodynamics and kinetics of microstructure evolution. The resulting low-dimensional model quantitatively captures the dynamics of different assembly pathways between fluid, polycrystal, and single crystals states, in agreement with the full N-dimensional data as characterized by first passage time distributions. Numerical solution of the low-dimensional Smoluchowski equation reveals statistical properties of the dynamic evolution of states vs. applied field amplitude and system size. The low-dimensional Smoluchowski equation and associated landscapes calculated here can serve as models for predictive control of electric field mediated assembly of colloidal ensembles into two-dimensional crystalline objects.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

POLARIZED LINE FORMATION IN MULTI-DIMENSIONAL MEDIA. I. DECOMPOSITION OF STOKES PARAMETERS IN ARBITRARY GEOMETRIES

The solution of the polarized line radiative transfer (RT) equation in multi-dimensional geometries has been rarely addressed and only under the approximation that the changes of frequencies at each scattering are uncorrelated (complete frequency redistribution). With the increase in the resolution power of telescopes, being able to handle RT in multi-dimensional structures becomes absolutely necessary. In the present paper, our first aim is to formulate the polarized RT equation for resonance scattering in multi-dimensional media, using the elegant technique of irreducible spherical tensors T{sub Q}{sup K}(i, {Omega}). Our second aim is to develop a numerical method of a solution based on the polarized approximate lambda iteration (PALI) approach. We consider both complete frequency redistribution and partial frequency redistribution (PRD) in the line scattering. In a multi-dimensional geometry, the radiation field is non-axisymmetrical even in the absence of a symmetry breaking mechanism such as an oriented magnetic field. We generalize here to the three-dimensional (3D) case, the decomposition technique developed for the Hanle effect in a one-dimensional (1D) medium which allows one to represent the Stokes parameters I, Q, U by a set of six cylindrically symmetrical functions. The scattering phase matrix is expressed in terms of T{sub Q}{sup K}(i, {Omega}) (i=0,1,2, K=0,1,2, -K {<=} Q {<=} +K), with {Omega} being the direction of the outgoing ray. Starting from the definition of the source vector, we show that it can be represented in terms of six components S{sup K}{sub Q} independent of {Omega}. The formal solution of the multi-dimensional transfer equation shows that the Stokes parameters can also be expanded in terms of T{sub Q}{sup K}(i, {Omega}). Because of the 3D geometry, the expansion coefficients I{sup K}{sub Q} remain {Omega}-dependent. We show that each I{sup K}{sub Q} satisfies a simple transfer equation with a source term S{sup K}{sub Q} and that this transfer equation provides an efficient approach for handling the polarized transfer in multi-dimensional geometries. A PALI method for 3D, associated with a core-wing separation method for treating PRD, is developed. It is tested by comparison with 1D solutions, and several benchmark solutions in the 3D case are given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

3D scalar model as a 4D perfect conductor limit: Dimensional reduction and variational boundary conditions

Under dimensional reduction, a system in D spacetime dimensions will not necessarily yield its D-1-dimensional analog version. Among other things, this result will depend on the boundary conditions and the dimension D of the system. We investigate this question for scalar and Abelian gauge fields under boundary conditions that obey the symmetries of the action. We apply our findings to the Casimir piston, an ideal system for detecting boundary effects. Our investigation is not limited to extra dimensions and we show that the original piston scenario proposed in 2004, a toy model involving a scalar field in 3D (2+1) dimensions, can be obtained via dimensional reduction from a more realistic 4D electromagnetic (EM) system. We show that for perfect conductor conditions, a D-dimensional EM field reduces to a D-1 scalar field and not its lower-dimensional version. For Dirichlet boundary conditions, no theory is recovered under dimensional reduction and the Casimir pressure goes to zero in any dimension. This ''zero Dirichlet'' result is useful for understanding the EM case. We then identify two special systems where the lower-dimensional version is recovered in any dimension: systems with perfect magnetic conductor (PMC) and Neumann boundary conditions. We show that these two boundary conditions can be obtained from a variational procedure in which the action vanishes outside the bounded region. The fields are free to vary on the surface and have zero modes, which survive after dimensional reduction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement Cost for Infinite-Dimensional Physical Systems

We prove that the entanglement cost equals the regularized entanglement of formation for any infinite-dimensional quantum state ρ ΑΒ with finite quantum entropy on at least one of the subsystems A or B. This generalizes a foundational result in quantum information theory that was previously formulated only for operations and states on finite-dimensional systems. The extension to infinite-dimensional systems is nontrivial because the conventional tools for establishing both the direct and converse bounds, i.e., strong typicality, monotonicity, and asymptotic continuity, are no longer directly applicable. To address this problem, we construct a new entanglement dilution protocol for infinite-dimensional states implementable by local operations and a finite amount of one-way classical communication (one-way LOCC), using weak and strong typicality multiple times. We also prove the optimality of this protocol among all protocols, even under infinite-dimensional separable operations, by developing an argument based on alternative forms of monotonicity and asymptotic continuity of the entanglement of formation for infinite-dimensional states. Along the way, we derive a new integral representation for the quantum entropy of infinite-dimensional states, which we believe to be of independent interest. Our results allow us to fully characterize an important operational entanglement measure—the entanglement cost—for all infinite-dimensional physical systems.

Complexity↗

Separable physics-informed DeepONet: Breaking the curse of dimensionality in physics-informed machine learning

The deep operator network (DeepONet) has shown remarkable potential in solving partial differential equations (PDEs) by mapping between infinite-dimensional function spaces using labeled datasets. However, in scenarios lacking labeled data, the physics-informed DeepONet (PI-DeepONet) approach, which utilizes the residual loss of the governing PDE to optimize the network parameters, faces significant computational challenges, particularly due to the curse of dimensionality. This limitation has hindered its application to high-dimensional problems, making even standard 3D spatial with 1D temporal problems computationally prohibitive. Additionally, the computational requirement increases exponentially with the discretization density of the domain. Here, to address these challenges and enhance scalability for high-dimensional PDEs, we introduce the Separable physics-informed DeepONet (Sep-PI-DeepONet). This framework employs a factorization technique, utilizing sub-networks for individual one-dimensional coordinates, thereby reducing the number of forward passes and the size of the Jacobian matrix required for gradient computations. By incorporating forward-mode automatic differentiation (AD), we further optimize computational efficiency, achieving linear scaling of computational cost with discretization density and dimensionality, making our approach highly suitable for high-dimensional PDEs. We demonstrate the effectiveness of Sep-PI-DeepONet through three benchmark PDE models: the viscous Burgers’ equation, Biot’s consolidation theory, and a parameterized heat equation. Our framework maintains accuracy comparable to the conventional PI-DeepONet while reducing training time by two orders of magnitude. Notably, for the heat equation solved as a 4D problem, the conventional PI-DeepONet was computationally infeasible (estimated 289.35 h), while the Sep-PI-DeepONet completed training in just 2.5 h. These results underscore the potential of Sep-PI-DeepONet in efficiently solving complex, high-dimensional PDEs, marking a significant advancement in physics-informed machine learning.

Neural operator↗

CFD modeling of two-stage ignition in a rapid compression machine: Assessment of zero-dimensional approach

In modeling rapid compression machine (RCM) experiments, zero-dimensional approach is commonly used along with an associated heat loss model. The adequacy of such approach has not been validated for hydrocarbon fuels. The existence of multi-dimensional effects inside an RCM due to the boundary layer, roll-up vortex, non-uniform heat release, and piston crevice could result in deviation from the zero-dimensional assumption, particularly for hydrocarbons exhibiting two-stage ignition and strong thermokinetic interactions. The objective of this investigation is to assess the adequacy of zero-dimensional approach in modeling RCM experiments under conditions of two-stage ignition and negative temperature coefficient (NTC) response. Computational fluid dynamics simulations are conducted for n-heptane ignition in an RCM and the validity of zero-dimensional approach is assessed through comparisons over the entire NTC region. Results show that the zero-dimensional model based on the approach of 'adiabatic volume expansion' performs very well in adequately predicting the first-stage ignition delays, although quantitative discrepancy for the prediction of the total ignition delays and pressure rise in the first-stage ignition is noted even when the roll-up vortex is suppressed and a well-defined homogeneous core is retained within an RCM. Furthermore, the discrepancy is pressure dependent and decreases as compressed pressure is increased. Also, as ignition response becomes single-stage at higher compressed temperatures, discrepancy from the zero-dimensional simulations reduces. Despite of some quantitative discrepancy, the zero-dimensional modeling approach is deemed satisfactory from the viewpoint of the ignition delay simulation. (author)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A comparison of two- and three-dimensional single-mode reshocked Richtmyer–Meshkov instability growth

The growth dynamics of two- and three-dimensional single-mode reshocked Richtmyer–Meshkov instability are compared systematically using data from high-resolution implicit large-eddy simulations of a model of the Mach 1.3 air(acetone) and sulfur hexafluoride (Jacobs and Krivets, 2005) shock tube experiment. The vorticity deposition by the incident shock and the dynamics of interface evolution are examined quantitatively and qualitatively. The perturbation amplitudes from the two- and three-dimensional simulations are compared to the experimental data and to the predictions of several nonlinear instability growth models. It is shown that the perturbation amplitudes from the two- and three-dimensional simulations with matching initial Richtmyer velocity are in excellent agreement with the experimental data. In addition, the dynamics of reshock (not considered in the experiment) are described in detail, and the post-reshock mixing layer amplitude growth rate is compared to the predictions of several reshock models. It is shown that using two-dimensional simulations to understand three-dimensional dynamics is valid only at early-to-intermediate times before reshock; at intermediate-to-late times after reshock the three-dimensional growth is generally larger than the corresponding two-dimensional growth. Furthermore, the reshock dynamics are also different between two and three dimensions. The quantitative results, together with visualizations of the flow field, were also used to contrast the difference between two- and three-dimensional vorticity and enstrophy dynamics.

42 ENGINEERING↗

Cost function for low-dimensional manifold topology assessment

Abstract In reduced-order modeling, complex systems that exhibit high state-space dimensionality are described and evolved using a small number of parameters. These parameters can be obtained in a data-driven way, where a high-dimensional dataset is projected onto a lower-dimensional basis. A complex system is then restricted to states on a low-dimensional manifold where it can be efficiently modeled. While this approach brings computational benefits, obtaining a good quality of the manifold topology becomes a crucial aspect when models, such as nonlinear regression, are built on top of the manifold. Here, we present a quantitative metric for characterizing manifold topologies. Our metric pays attention to non-uniqueness and spatial gradients in physical quantities of interest, and can be applied to manifolds of arbitrary dimensionality. Using the metric as a cost function in optimization algorithms, we show that optimized low-dimensional projections can be found. We delineate a few applications of the cost function to datasets representing argon plasma, reacting flows and atmospheric pollutant dispersion. We demonstrate how the cost function can assess various dimensionality reduction and manifold learning techniques as well as data preprocessing strategies in their capacity to yield quality low-dimensional projections. We show that improved manifold topologies can facilitate building nonlinear regression models.

42 ENGINEERING↗

Secondary instability in three-dimensional magnetic reconnection

We consider the transition to turbulence in three-dimensional reconnection of a magnetic neutral sheet. We find that the transition can occur via a three-step process. First, the sheet undergoes the usual tearing instability. Second, the tearing mode saturates to form a two-dimensional quasi-steady state. Third, this secondary equilibrium is itself unstable when it is perturbed by three-dimensional disturbances. Most of this paper is devoted to the analysis and simulation of the three-dimensional linear stability properties of the two-dimensional saturated tearing layer. The numerical simulations are performed with a semi-implicit, pseudospectral-Fourier collocation algorithm. We identify a three-dimensional secondary linear stability which grows on the ideal timescale. An examination of the modal energetics reveals that the largest energy transfer is from the mean field to the three-dimensional field, with the two-dimensional field acting as a catalyst.

Dahlburg, R. B.↗

Experiments on near-wall structure of three-dimensional boundary layers

Investigations of three-dimensional turbulent boundary layers have shown basic differences between two- and three-dimensional flows. These differences can significantly impact the modeling of three-dimensional flows since many flow models are based on results from two-dimensional boundary layers. In many cases the shear stress vector direction has been shown to lag relative to the direction of the mean velocity gradient as the cross flow grows downstream. Coincidence of these vectors is necessary for a scalar eddy viscosity modeling assumption. A second effect is a reduction in magnitude of the shear stress and/or the shear stress to turbulence energy ratio, a(sub 1). This reduction has been observed in several experiments. Recent numerical simulations also indicate wall-layer structural differences between two- and three-dimensional boundary layers. The differences in structure between two- and three-dimensional boundary layers was also addressed in the experiment of Littell & Eaton. The experiment used two-point correlations to investigate the vortical structures in a three dimensional boundary layer on a spinning disk. It was found that each sign of longitudinal vortex is equally likely to exist, but one sign of vorticity is associated with a structure which is better at producing ejections. The goal of the current investigation is to study the structure of the inner layers. Among other questions, the differences between the effects deduced from the three-dimensional flow simulations and the effects seen in experiments can be examined. The research concentrates on the structure of the wall-layer through flow visualization and direct turbulence measurements down to y(+) = 5.

Flack, Karen A.↗

Feature extraction and classification algorithms for high dimensional data

Feature extraction and classification algorithms for high dimensional data are investigated. Developments with regard to sensors for Earth observation are moving in the direction of providing much higher dimensional multispectral imagery than is now possible. In analyzing such high dimensional data, processing time becomes an important factor. With large increases in dimensionality and the number of classes, processing time will increase significantly. To address this problem, a multistage classification scheme is proposed which reduces the processing time substantially by eliminating unlikely classes from further consideration at each stage. Several truncation criteria are developed and the relationship between thresholds and the error caused by the truncation is investigated. Next an approach to feature extraction for classification is proposed based directly on the decision boundaries. It is shown that all the features needed for classification can be extracted from decision boundaries. A characteristic of the proposed method arises by noting that only a portion of the decision boundary is effective in discriminating between classes, and the concept of the effective decision boundary is introduced. The proposed feature extraction algorithm has several desirable properties: it predicts the minimum number of features necessary to achieve the same classification accuracy as in the original space for a given pattern recognition problem; and it finds the necessary feature vectors. The proposed algorithm does not deteriorate under the circumstances of equal means or equal covariances as some previous algorithms do. In addition, the decision boundary feature extraction algorithm can be used both for parametric and non-parametric classifiers. Finally, some problems encountered in analyzing high dimensional data are studied and possible solutions are proposed. First, the increased importance of the second order statistics in analyzing high dimensional data is recognized. By investigating the characteristics of high dimensional data, the reason why the second order statistics must be taken into account in high dimensional data is suggested. Recognizing the importance of the second order statistics, there is a need to represent the second order statistics. A method to visualize statistics using a color code is proposed. By representing statistics using color coding, one can easily extract and compare the first and the second statistics.

Lee, Chulhee↗

Optimal Padding for the Two-Dimensional Fast Fourier Transform

One-dimensional Fast Fourier Transform (FFT) operations work fastest on grids whose size is divisible by a power of two. Because of this, padding grids (that are not already sized to a power of two) so that their size is the next highest power of two can speed up operations. While this works well for one-dimensional grids, it does not work well for two-dimensional grids. For a two-dimensional grid, there are certain pad sizes that work better than others. Therefore, the need exists to generalize a strategy for determining optimal pad sizes. There are three steps in the FFT algorithm. The first is to perform a one-dimensional transform on each row in the grid. The second step is to transpose the resulting matrix. The third step is to perform a one-dimensional transform on each row in the resulting grid. Steps one and three both benefit from padding the row to the next highest power of two, but the second step needs a novel approach. An algorithm was developed that struck a balance between optimizing the grid pad size with prime factors that are small (which are optimal for one-dimensional operations), and with prime factors that are large (which are optimal for two-dimensional operations). This algorithm optimizes based on average run times, and is not fine-tuned for any specific application. It increases the amount of times that processor-requested data is found in the set-associative processor cache. Cache retrievals are 4-10 times faster than conventional memory retrievals. The tested implementation of the algorithm resulted in faster execution times on all platforms tested, but with varying sized grids. This is because various computer architectures process commands differently. The test grid was 512 512. Using a 540 540 grid on a Pentium V processor, the code ran 30 percent faster. On a PowerPC, a 256x256 grid worked best. A Core2Duo computer preferred either a 1040x1040 (15 percent faster) or a 1008x1008 (30 percent faster) grid. There are many industries that can benefit from this algorithm, including optics, image-processing, signal-processing, and engineering applications.

Dean, Bruce H.↗

Methods, apparatuses, and computer-readable media for projectional morphological analysis of N-dimensional signals

Embodiments discussed herein in the form of methods, systems, and computer-readable media deal with the application of advanced "projectional" morphological algorithms for solving a broad range of problems. In a method of performing projectional morphological analysis, an N-dimensional input signal is supplied. At least one N-dimensional form indicative of at least one feature in the N-dimensional input signal is identified. The N-dimensional input signal is filtered relative to the at least one N-dimensional form and an N-dimensional output signal is generated indicating results of the filtering at least as differences in the N-dimensional input signal relative to the at least one N-dimensional form.

97 MATHEMATICS AND COMPUTING↗