Groupwise Multimodal Image Registration using Joint Total Variation

In medical imaging it is common practice to acquire a wide range of modalities (MRI, CT, PET, etc.), to highlight different structures or pathologies. As patient movement between scans or scanning session is unavoidable, registration is often an essential step before any subsequent image analysis. In this paper, we introduce a cost function based on joint total variation for such multimodal image registration. This cost function has the advantage of enabling principled, groupwise alignment of multiple images, whilst being insensitive to strong intensity non-uniformities. We evaluate our algorithm on rigidly aligning both simulated and real 3D brain scans. This validation shows robustness to strong intensity non-uniformities and low registration errors for CT/PET to MRI alignment. Our implementation is publicly available at https://github.com/brudfors/coregistration-njtv

A Second Order TV-type Approach for Inpainting and Denoising Higher Dimensional Combined Cyclic and Vector Space Data

In this paper we consider denoising and inpainting problems for higher dimensional combined cyclic and linear space valued data. These kind of data appear when dealing with nonlinear color spaces such as HSV, and they can be obtained by changing the space domain of, e.g., an optical flow field to polar coordinates. For such nonlinear data spaces, we develop algorithms for the solution of the corresponding second order total variation (TV) type problems for denoising, inpainting as well as the combination of both. We provide a convergence analysis and we apply the algorithms to concrete problems.Comment: revised submitted versio

Groupwise Multimodal Image Registration Using Joint Total Variation

In medical imaging it is common practice to acquire a wide range of modalities (MRI, CT, PET, etc.), to highlight different structures or pathologies. As patient movement between scans or scanning session is unavoidable, registration is often an essential step before any subsequent image analysis. In this paper, we introduce a cost function based on joint total variation for such multimodal image registration. This cost function has the advantage of enabling principled, groupwise alignment of multiple images, whilst being insensitive to strong intensity non-uniformities. We evaluate our algorithm on rigidly aligning both simulated and real 3D brain scans. This validation shows robustness to strong intensity non-uniformities and low registration errors for CT/PET to MRI alignment. Our implementation is publicly available at https://github.com/brudfors/coregistration-njtv

Image inversion analysis of the HST OTA (Hubble Space Telescope Optical Telescope Assembly), phase A

Technical work during September-December 1990 consisted of: (1) analyzing HST point source images obtained from JPL; (2) retrieving phase information from the images by a direct (noniterative) technique; and (3) characterizing the wavefront aberration due to the errors in the Hubble Space Telescope (HST) mirrors, in a preliminary manner. This work was in support of JPL design of compensating optics for the next generation wide-field planetary camera on HST. This digital technique for phase retrieval from pairs of defocused images, is based on the energy transport equation between these image planes. In addition, an end-to-end wave optics routine, based on the JPL Code 5 prescription of the unaberrated HST and WFPC, was derived for output of the reference phase front when mirror error is absent. Also, the Roddier routine unwrapped the retrieved phase by inserting the required jumps of +/- 2(pi) radians for the sake of smoothness. A least-squares fitting routine, insensitive to phase unwrapping, but nonlinear, was used to obtain estimates of the Zernike polynomial coefficients that describe the aberration. The phase results were close to, but higher than, the expected error in conic constant of the primary mirror suggested by the fossil evidence. The analysis of aberration contributed by the camera itself could be responsible for the small discrepancy, but was not verified by analysis

Approximating Nash Equilibria in Normal-Form Games via Stochastic Optimization

We propose the first, to our knowledge, loss function for approximate Nash equilibria of normal-form games that is amenable to unbiased Monte Carlo estimation. This construction allows us to deploy standard non-convex stochastic optimization techniques for approximating Nash equilibria, resulting in novel algorithms with provable guarantees. We complement our theoretical analysis with experiments demonstrating that stochastic gradient descent can outperform previous state-of-the-art approaches

Complex Neural Networks for Audio

Audio is represented in two mathematically equivalent ways: the real-valued time domain (i.e., waveform) and the complex-valued frequency domain (i.e., spectrum). There are advantages to the frequency-domain representation, e.g., the human auditory system is known to process sound in the frequency-domain. Furthermore, linear time-invariant systems are convolved with sources in the time-domain, whereas they may be factorized in the frequency-domain. Neural networks have become rather useful when applied to audio tasks such as machine listening and audio synthesis, which are related by their dependencies on high quality acoustic models. They ideally encapsulate fine-scale temporal structure, such as that encoded in the phase of frequency-domain audio, yet there are no authoritative deep learning methods for complex audio. This manuscript is dedicated to addressing the shortcoming. Chapter 2 motivates complex networks by their affinity with complex-domain audio, while Chapter 3 contributes methods for building and optimizing complex networks. We show that the naive implementation of Adam optimization is incorrect for complex random variables and show that selection of input and output representation has a significant impact on the performance of a complex network. Experimental results with novel complex neural architectures are provided in the second half of this manuscript. Chapter 4 introduces a complex model for binaural audio source localization. We show that, like humans, the complex model can generalize to different anatomical filters, which is important in the context of machine listening. The complex model\u27s performance is better than that of the real-valued models, as well as real- and complex-valued baselines. Chapter 5 proposes a two-stage method for speech enhancement. In the first stage, a complex-valued stochastic autoencoder projects complex vectors to a discrete space. In the second stage, long-term temporal dependencies are modeled in the discrete space. The autoencoder raises the performance ceiling for state of the art speech enhancement, but the dynamic enhancement model does not outperform other baselines. We discuss areas for improvement and note that the complex Adam optimizer improves training convergence over the naive implementation

Reaction Based Grasp Force Assignment

An iterative method is developed by which the contact forces required to apply an arbitrary wrench (six elements of force and moment) to a stably grasped object may be calculated quickly. The assignment of contact forces, given a required object wrench, is accomplished with the use of fuzzy logic. This concept is referred to as the fuzzy logic reactive system (FLRS). The solution is versatile with respect to goals inherent in the rulebase and the input parameters, and is also applicable for an arbitrary number of contacts. The goal presented in this research, to illustrate the concept of the FLRS, is the minimization of the norm of the contact forces using point contacts with friction. The results comparing the contact force assignment for this method and the optimal method proposed by Nakamura are presented. The results show that FLRS will satisfy the object wrench and frictional contacts while achieving near optimal contact force assignment. This method is shown to require significantly fewer floating point operations than the solution calculated using numerical constrained optimization techniques

Consideration of interdependencies in the relational database system, and, A proposal and evaluation of an expert system for the relational database structure

This thesis addresses the issue of interdependencies in Distributed and non-Distributed Relational Database Management Systems and proposes a design and development of an Expert System to manage and enhance the current available Database Structures; In the first part, we study, compare and evaluate the interdependencies found in the operating environment relevant to the Distributed Relational structure. Hardware and software configurations are grouped and compared in an attempt to understand the interdependencies of the system so that an optimal configuration may be obtained; In the second part, we designed and developed an Expert System configuration with ease of use and functionality as foremost concerns. The system reuses the transient tables used to service queries to achieve a performance improvement without explicit user knowledge. Basic fragmentation principles are also used to aid in performance by implicitly restructuring the tables within a database to balance access time. (Abstract shortened with permission of author.)