Non-Iterative, Feature-Preserving Mesh Smoothing

With the increasing use of geometry scanners to create 3D models, there is a rising need for fast and robust mesh smoothing to remove inevitable noise in the measurements. While most previous work has favored diffusion-based iterative techniques for feature-preserving smoothing, we propose a radically different approach, based on robust statistics and local first-order predictors of the surface. The robustness of our local estimates allows us to derive a non-iterative feature-preserving filtering technique applicable to arbitrary "triangle soups". We demonstrate its simplicity of implementation and its efficiency, which make it an excellent solution for smoothing large, noisy, and non-manifold meshes.Singapore-MIT Alliance (SMA

Feature preserving smoothing of 3D surface scans

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2004.Includes bibliographical references (p. 63-70).With the increasing use of geometry scanners to create 3D models, there is a rising need for effective denoising of data captured with these devices. This thesis presents new methods for smoothing scanned data, based on extensions of the bilateral filter to 3D. The bilateral filter is a non-linear, edge-preserving image filter; its extension to 3D leads to an efficient, feature preserving filter for a wide class of surface representations, including points and "polygon soups."by Thouis Raymond Jones.S.M

Graph Spectral Image Processing

Recent advent of graph signal processing (GSP) has spurred intensive studies of signals that live naturally on irregular data kernels described by graphs (e.g., social networks, wireless sensor networks). Though a digital image contains pixels that reside on a regularly sampled 2D grid, if one can design an appropriate underlying graph connecting pixels with weights that reflect the image structure, then one can interpret the image (or image patch) as a signal on a graph, and apply GSP tools for processing and analysis of the signal in graph spectral domain. In this article, we overview recent graph spectral techniques in GSP specifically for image / video processing. The topics covered include image compression, image restoration, image filtering and image segmentation

A mathematical and numerical framework for ultrasonically-induced Lorentz force electrical impedance tomography

We provide a mathematical analysis and a numerical framework for Lorentz force electrical conductivity imaging. Ultrasonic vibration of a tissue in the presence of a static magnetic field induces an electrical current by the Lorentz force. This current can be detected by electrodes placed around the tissue; it is proportional to the velocity of the ultrasonic pulse, but depends nonlinearly on the conductivity distribution. The imaging problem is to reconstruct the conductivity distribution from measurements of the induced current. To solve this nonlinear inverse problem, we first make use of a virtual potential to relate explicitly the current measurements to the conductivity distribution and the velocity of the ultrasonic pulse. Then, by applying a Wiener filter to the measured data, we reduce the problem to imaging the conductivity from an internal electric current density. We first introduce an optimal control method for solving such a problem. A new direct reconstruction scheme involving a partial differential equation is then proposed based on viscosity-type regularization to a transport equation satisfied by the current density field. We prove that solving such an equation yields the true conductivity distribution as the regularization parameter approaches zero. We also test both schemes numerically in the presence of measurement noise, quantify their stability and resolution, and compare their performance

Graph Signal Processing: Overview, Challenges and Applications

Research in Graph Signal Processing (GSP) aims to develop tools for processing data defined on irregular graph domains. In this paper we first provide an overview of core ideas in GSP and their connection to conventional digital signal processing. We then summarize recent developments in developing basic GSP tools, including methods for sampling, filtering or graph learning. Next, we review progress in several application areas using GSP, including processing and analysis of sensor network data, biological data, and applications to image processing and machine learning. We finish by providing a brief historical perspective to highlight how concepts recently developed in GSP build on top of prior research in other areas.Comment: To appear, Proceedings of the IEE

NEXT-CRAB-0: A High Pressure Gaseous Xenon Time Projection Chamber with a Direct VUV Camera Based Readout

The search for neutrinoless double beta decay ($0\nu\beta\beta$) remains one of the most compelling experimental avenues for the discovery in the neutrino sector. Electroluminescent gas-phase time projection chambers are well suited to $0\nu\beta\beta$ searches due to their intrinsically precise energy resolution and topological event identification capabilities. Scalability to ton- and multi-ton masses requires readout of large-area electroluminescent regions with fine spatial resolution, low radiogenic backgrounds, and a scalable data acquisition system. This paper presents a detector prototype that records event topology in an electroluminescent xenon gas TPC via VUV image-intensified cameras. This enables an extendable readout of large tracking planes with commercial devices that reside almost entirely outside of the active medium.Following further development in intermediate scale demonstrators, this technique may represent a novel and enlargeable method for topological event imaging in $0\nu\beta\beta$.Comment: 32 Pages, 22 figure

Forecasting Time Series with VARMA Recursions on Graphs

Graph-based techniques emerged as a choice to deal with the dimensionality issues in modeling multivariate time series. However, there is yet no complete understanding of how the underlying structure could be exploited to ease this task. This work provides contributions in this direction by considering the forecasting of a process evolving over a graph. We make use of the (approximate) time-vertex stationarity assumption, i.e., timevarying graph signals whose first and second order statistical moments are invariant over time and correlated to a known graph topology. The latter is combined with VAR and VARMA models to tackle the dimensionality issues present in predicting the temporal evolution of multivariate time series. We find out that by projecting the data to the graph spectral domain: (i) the multivariate model estimation reduces to that of fitting a number of uncorrelated univariate ARMA models and (ii) an optimal low-rank data representation can be exploited so as to further reduce the estimation costs. In the case that the multivariate process can be observed at a subset of nodes, the proposed models extend naturally to Kalman filtering on graphs allowing for optimal tracking. Numerical experiments with both synthetic and real data validate the proposed approach and highlight its benefits over state-of-the-art alternatives.Comment: submitted to the IEEE Transactions on Signal Processin