Holistic methods for visual navigation of mobile robots in outdoor environments

Differt D. Holistic methods for visual navigation of mobile robots in outdoor environments. Bielefeld: Universität Bielefeld; 2017

On Invariance, Equivariance, Correlation and Convolution of Spherical Harmonic Representations for Scalar and Vectorial Data

The mathematical representations of data in the Spherical Harmonic (SH) domain has recently regained increasing interest in the machine learning community. This technical report gives an in-depth introduction to the theoretical foundation and practical implementation of SH representations, summarizing works on rotation invariant and equivariant features, as well as convolutions and exact correlations of signals on spheres. In extension, these methods are then generalized from scalar SH representations to Vectorial Harmonics (VH), providing the same capabilities for 3d vector fields on spheresComment: 106 pages, tech repor

Big-Data Science in Porous Materials: Materials Genomics and Machine Learning

By combining metal nodes with organic linkers we can potentially synthesize millions of possible metal organic frameworks (MOFs). At present, we have libraries of over ten thousand synthesized materials and millions of in-silico predicted materials. The fact that we have so many materials opens many exciting avenues to tailor make a material that is optimal for a given application. However, from an experimental and computational point of view we simply have too many materials to screen using brute-force techniques. In this review, we show that having so many materials allows us to use big-data methods as a powerful technique to study these materials and to discover complex correlations. The first part of the review gives an introduction to the principles of big-data science. We emphasize the importance of data collection, methods to augment small data sets, how to select appropriate training sets. An important part of this review are the different approaches that are used to represent these materials in feature space. The review also includes a general overview of the different ML techniques, but as most applications in porous materials use supervised ML our review is focused on the different approaches for supervised ML. In particular, we review the different method to optimize the ML process and how to quantify the performance of the different methods. In the second part, we review how the different approaches of ML have been applied to porous materials. In particular, we discuss applications in the field of gas storage and separation, the stability of these materials, their electronic properties, and their synthesis. The range of topics illustrates the large variety of topics that can be studied with big-data science. Given the increasing interest of the scientific community in ML, we expect this list to rapidly expand in the coming years.Comment: Editorial changes (typos fixed, minor adjustments to figures

Subspace Representations for Robust Face and Facial Expression Recognition

Analyzing human faces and modeling their variations have always been of interest to the computer vision community. Face analysis based on 2D intensity images is a challenging problem, complicated by variations in pose, lighting, blur, and non-rigid facial deformations due to facial expressions. Among the different sources of variation, facial expressions are of interest as important channels of non-verbal communication. Facial expression analysis is also affected by changes in view-point and inter-subject variations in performing different expressions. This dissertation makes an attempt to address some of the challenges involved in developing robust algorithms for face and facial expression recognition by exploiting the idea of proper subspace representations for data. Variations in the visual appearance of an object mostly arise due to changes in illumination and pose. So we first present a video-based sequential algorithm for estimating the face albedo as an illumination-insensitive signature for face recognition. We show that by knowing/estimating the pose of the face at each frame of a sequence, the albedo can be efficiently estimated using a Kalman filter. Then we extend this to the case of unknown pose by simultaneously tracking the pose as well as updating the albedo through an efficient Bayesian inference method performed using a Rao-Blackwellized particle filter. Since understanding the effects of blur, especially motion blur, is an important problem in unconstrained visual analysis, we then propose a blur-robust recognition algorithm for faces with spatially varying blur. We model a blurred face as a weighted average of geometrically transformed instances of its clean face. We then build a matrix, for each gallery face, whose column space spans the space of all the motion blurred images obtained from the clean face. This matrix representation is then used to define a proper objective function and perform blur-robust face recognition. To develop robust and generalizable models for expression analysis one needs to break the dependence of the models on the choice of the coordinate frame of the camera. To this end, we build models for expressions on the affine shape-space (Grassmann manifold), as an approximation to the projective shape-space, by using a Riemannian interpretation of deformations that facial expressions cause on different parts of the face. This representation enables us to perform various expression analysis and recognition algorithms without the need for pose normalization as a preprocessing step. There is a large degree of inter-subject variations in performing various expressions. This poses an important challenge on developing robust facial expression recognition algorithms. To address this challenge, we propose a dictionary-based approach for facial expression analysis by decomposing expressions in terms of action units (AUs). First, we construct an AU-dictionary using domain experts' knowledge of AUs. To incorporate the high-level knowledge regarding expression decomposition and AUs, we then perform structure-preserving sparse coding by imposing two layers of grouping over AU-dictionary atoms as well as over the test image matrix columns. We use the computed sparse code matrix for each expressive face to perform expression decomposition and recognition. Most of the existing methods for the recognition of faces and expressions consider either the expression-invariant face recognition problem or the identity-independent facial expression recognition problem. We propose joint face and facial expression recognition using a dictionary-based component separation algorithm (DCS). In this approach, the given expressive face is viewed as a superposition of a neutral face component with a facial expression component, which is sparse with respect to the whole image. This assumption leads to a dictionary-based component separation algorithm, which benefits from the idea of sparsity and morphological diversity. The DCS algorithm uses the data-driven dictionaries to decompose an expressive test face into its constituent components. The sparse codes we obtain as a result of this decomposition are then used for joint face and expression recognition

Fast 4D Ultrasound Registration for Image Guided Liver Interventions

Liver problems are a serious health issue. The common liver problems are hepatitis, fatty liver, liver cancer and liver damage caused by alcohol abuse. Continuous, long term disease may cause a condition of the liver known as the Liver Cirrhosis. Liver cirrhosis makes the liver scarred and hardened up causing portal hypertension. In such a situation the collateral vessels try to bypass the liver as blood cannot freely flow through the liver; causing internal bleeding. One of the treatments of portal hypertension is Transjugular intrahepatic portosystemic shunt (TIPS). In a TIPS procedure a tract in the liver is created that shortcuts two veins in the liver, reducing the portal hypertension. Radiofrequency ablation (RFA) is use for the treatment of liver cancer. In RFA, a needle electrode is placed through the skin into the liver tumor. High-frequency electrical currents are passed through the electrode, creating heat that destroys the cancer cells, without damaging the surrounding liver tissues. TIPS and RFA are minimally invasive procedures, where small incisions are made to perform the surgery and are alternative to open surgery. A minimally invasive alternative has large potential in reducing complication rates, minimizing surgical trauma and reducing hospital stay. However, in these procedures, due to lack of direct eyesight, three-dimensional imaging information about the anatomy and instruments during the intervention is required. The most difficult part of these procedures is the interpretation and selection of oblique views for needle/instrument insertion and target visualization. In our work we develop and evaluate techniques that enable the effective use of 3D ultrasound for image guided interventions. Ultrasound is low cost, mobile and unlike CT and X-rays does not use any harmful radiation in the imaging process. During these procedures, breathing shifts the region of interest and makes it difficult to constantly focus on a region of interest. We provide an approach to correct for the motion due to breathing. Additionally, we propose a method for image fusion of interventional ultrasound and preoperative imaging modalities such as CT for cases where the lesions are visible in CT but not visible in ultrasound. Incorporating CT data during intervention additionally adds greater definition and precision to the ultrasound based navigation system. Concluding, in this thesis, we presented methods and evaluated their accuracies that demonstrate the use of real-time 3D US and its fusion with CT in potentially improving image guidance in minimally invasive US guided liver interventions

30th International Conference on Condition Monitoring and Diagnostic Engineering Management (COMADEM 2017)

Proceedings of COMADEM 201

Observational Probes of Cosmic Acceleration

The accelerating expansion of the universe is the most surprising cosmological discovery in many decades, implying that the universe is dominated by some form of "dark energy" with exotic physical properties, or that Einstein's theory of gravity breaks down on cosmological scales. The profound implications of cosmic acceleration have inspired ambitious experimental efforts to measure the history of expansion and growth of structure with percent-level precision or higher. We review in detail the four most well established methods for making such measurements: Type Ia supernovae, baryon acoustic oscillations (BAO), weak gravitational lensing, and galaxy clusters. We pay particular attention to the systematic uncertainties in these techniques and to strategies for controlling them at the level needed to exploit "Stage IV" dark energy facilities such as BigBOSS, LSST, Euclid, and WFIRST. We briefly review a number of other approaches including redshift-space distortions, the Alcock-Paczynski test, and direct measurements of H_0. We present extensive forecasts for constraints on the dark energy equation of state and parameterized deviations from GR, achievable with Stage III and Stage IV experimental programs that incorporate supernovae, BAO, weak lensing, and CMB data. We also show the level of precision required for other methods to provide constraints competitive with those of these fiducial programs. We emphasize the value of a balanced program that employs several of the most powerful methods in combination, both to cross-check systematic uncertainties and to take advantage of complementary information. Surveys to probe cosmic acceleration produce data sets with broad applications, and they continue the longstanding astronomical tradition of mapping the universe in ever greater detail over ever larger scales.Comment: 289 pages, 55 figures. Accepted for publication in Physics Reports. Description of changes since original version --- fractionally small but significant in total --- is available at http://www.astronomy.ohio-state.edu/~dhw/Revie

Classifiers and machine learning techniques for image processing and computer vision

Orientador: Siome Klein GoldensteinTese (doutorado) - Universidade Estadual de Campinas, Instituto da ComputaçãoResumo: Neste trabalho de doutorado, propomos a utilizaçãoo de classificadores e técnicas de aprendizado de maquina para extrair informações relevantes de um conjunto de dados (e.g., imagens) para solução de alguns problemas em Processamento de Imagens e Visão Computacional. Os problemas de nosso interesse são: categorização de imagens em duas ou mais classes, detecçãao de mensagens escondidas, distinção entre imagens digitalmente adulteradas e imagens naturais, autenticação, multi-classificação, entre outros. Inicialmente, apresentamos uma revisão comparativa e crítica do estado da arte em análise forense de imagens e detecção de mensagens escondidas em imagens. Nosso objetivo é mostrar as potencialidades das técnicas existentes e, mais importante, apontar suas limitações. Com esse estudo, mostramos que boa parte dos problemas nessa área apontam para dois pontos em comum: a seleção de características e as técnicas de aprendizado a serem utilizadas. Nesse estudo, também discutimos questões legais associadas a análise forense de imagens como, por exemplo, o uso de fotografias digitais por criminosos. Em seguida, introduzimos uma técnica para análise forense de imagens testada no contexto de detecção de mensagens escondidas e de classificação geral de imagens em categorias como indoors, outdoors, geradas em computador e obras de arte. Ao estudarmos esse problema de multi-classificação, surgem algumas questões: como resolver um problema multi-classe de modo a poder combinar, por exemplo, caracteríisticas de classificação de imagens baseadas em cor, textura, forma e silhueta, sem nos preocuparmos demasiadamente em como normalizar o vetor-comum de caracteristicas gerado? Como utilizar diversos classificadores diferentes, cada um, especializado e melhor configurado para um conjunto de caracteristicas ou classes em confusão? Nesse sentido, apresentamos, uma tecnica para fusão de classificadores e caracteristicas no cenário multi-classe através da combinação de classificadores binários. Nós validamos nossa abordagem numa aplicação real para classificação automática de frutas e legumes. Finalmente, nos deparamos com mais um problema interessante: como tornar a utilização de poderosos classificadores binarios no contexto multi-classe mais eficiente e eficaz? Assim, introduzimos uma tecnica para combinação de classificadores binarios (chamados classificadores base) para a resolução de problemas no contexto geral de multi-classificação.Abstract: In this work, we propose the use of classifiers and machine learning techniques to extract useful information from data sets (e.g., images) to solve important problems in Image Processing and Computer Vision. We are particularly interested in: two and multi-class image categorization, hidden messages detection, discrimination among natural and forged images, authentication, and multiclassification. To start with, we present a comparative survey of the state-of-the-art in digital image forensics as well as hidden messages detection. Our objective is to show the importance of the existing solutions and discuss their limitations. In this study, we show that most of these techniques strive to solve two common problems in Machine Learning: the feature selection and the classification techniques to be used. Furthermore, we discuss the legal and ethical aspects of image forensics analysis, such as, the use of digital images by criminals. We introduce a technique for image forensics analysis in the context of hidden messages detection and image classification in categories such as indoors, outdoors, computer generated, and art works. From this multi-class classification, we found some important questions: how to solve a multi-class problem in order to combine, for instance, several different features such as color, texture, shape, and silhouette without worrying about the pre-processing and normalization of the combined feature vector? How to take advantage of different classifiers, each one custom tailored to a specific set of classes in confusion? To cope with most of these problems, we present a feature and classifier fusion technique based on combinations of binary classifiers. We validate our solution with a real application for automatic produce classification. Finally, we address another interesting problem: how to combine powerful binary classifiers in the multi-class scenario more effectively? How to boost their efficiency? In this context, we present a solution that boosts the efficiency and effectiveness of multi-class from binary techniques.DoutoradoEngenharia de ComputaçãoDoutor em Ciência da Computaçã

Testing modified gravity theories with weak gravitational lensing

‘Cosmic shear’ is the weak gravitational lensing effect generated by fluctuations of the gravitational tidal fields of the large-scale structure that induce correlations in the distortion of observed galaxy shapes. Being sensitive to spacetime geometry and the growth of cosmic structure, cosmic shear is one of the primary probes to test gravity with current and future surveys. In this thesis we analyse the power of cosmic shear to constrain alternatives to the standard cosmological model that could explain cosmic acceleration. We focus in particular on a large class of alternatives to General Relativity, the Horndeski class, which includes the majority of universally coupled extensions to ΛCDM with one scalar degree of freedom in addition to the metric. Given a fixed background, the evolution of linear perturbations in Horndeski gravity is described by a set of four functions of time only. First, we forecast the sensitivity to these functions that will be achieved by future cosmic shear surveys like Euclid. We produce our forecasts with two methods to analyse a cosmic shear survey: a tomographic approach, based on correlations of the lensing signal in different redshift bins, and a fully 3D spherical Fourier-Bessel decomposition of the shear field. We show how the latter produces tighter constraints on all cosmological parameters with a sensitivity gain of the order of 20% in particular on the ones that describe Horndeski gravity. We then consider the possibility of using cross-correlations of cosmic shear with other probes to constrain Horndeski theories of gravity. We analyse a combination of cosmic shear, galaxy-galaxy lensing and galaxy clustering data from the Kilo Degree Survey and Galaxy And Mass Assembly survey and set constraints on the aforementioned Horndeski parameters. We also forecast the expected sensitivity to the same parameters that could be achieved with future cross-correlations of Stage IV cosmic shear, galaxy clustering and CMB experiments. While current constraints are not very tight, our implementation could be used in the future with data coming from Stage IV surveys, which we show to have great constraining power on these theories. Finally, we present in detail the numerical techniques that we used to produce our 3D cosmic shear forecasts and compare our predictions with an alternative, independent method developed with the same purpose. We find excellent agreement between the two methods and use our simulated 3D cosmic shear covariance matrices within a new algorithm that we develop to generate 3D lensing random fields. We calculate the Minkowski Functionals associated to our random fields and use them to test our field-generation procedure, as well as to demonstrate the possibility of a new approach to cosmological inference leveraging the estimated Minkowski Functionals