Quantification of Sub-Pixel Dynamics in High-Speed Neutron Imaging.

The high penetration depth of neutrons through many metals and other common materials makes neutron imaging an attractive method for non-destructively probing the internal structure and dynamics of objects or systems that may not be accessible by conventional means, such as X-ray or optical imaging. While neutron imaging has been demonstrated to achieve a spatial resolution below 10 μm and temporal resolution below 10 μs, the relatively low flux of neutron sources and the limitations of existing neutron detectors have, until now, dictated that these cannot be achieved simultaneously, which substantially restricts the applicability of neutron imaging to many fields of research that could otherwise benefit from its unique capabilities. In this work, we present an attenuation modeling approach to the quantification of sub-pixel dynamics in cyclic ensemble neutron image sequences of an automotive gasoline direct injector at a 5 μs time scale with a spatial noise floor in the order of 5 μm.

An improved Method for Determining Transient Fuel Dilution of Oil in an Internal-Combustion Engine Using Laser-Induced Florescence and Multivariate Least Square Calibration.

An optical diagnostic, based on laser-induced fluorescence (LIF), has been developed for on-engine measurements of real-time fuel dilution of engine oil or fuel in oil (FIO). Fuel dilution of oil is broadly relevant to advancing engine technology including durability, calibration, and catalyst-system management, and believed to promote destructive stochastic pre-ignition (SPI) during high-load engine operations. While standard (e.

Total variation-based neutron computed tomography.

We perform the neutron computed tomography reconstruction problem via an inverse problem formulation with a total variation penalty. In the case of highly under-resolved angular measurements, the total variation penalty suppresses high-frequency artifacts which appear in filtered back projections. In order to efficiently compute solutions for this problem, we implement a variation of the split Bregman algorithm; due to the error-forgetting nature of the algorithm, the computational cost of updating can be significantly reduced via very inexact approximate linear solvers.