Earthquake Arrival Association with Backprojection and Graph Theory

The association of seismic wave arrivals with causative earthquakes becomes progressively more challenging as arrival detection methods become more sensitive, and particularly when earthquake rates are high. For instance, seismic waves arriving across a monitoring network from several sources may overlap in time, false arrivals may be detected, and some arrivals may be of unknown phase (e.g., P- or S-waves). We propose an automated method to associate arrivals with earthquake sources and obtain source locations applicable to such situations. To do so we use a pattern detection metric based on the principle of backprojection to reveal candidate sources, followed by graph-theory-based clustering and an integer linear optimization routine to associate arrivals with the minimum number of sources necessary to explain the data. This method solves for all sources and phase assignments simultaneously, rather than in a sequential greedy procedure as is common in other association routines. We demonstrate our method on both synthetic and real data from the Integrated Plate Boundary Observatory Chile (IPOC) seismic network of northern Chile. For the synthetic tests we report results for cases with varying complexity, including rates of 500 earthquakes/day and 500 false arrivals/station/day, for which we measure true positive detection accuracy of > 95%. For the real data we develop a new catalog between January 1, 2010 - December 31, 2017 containing 817,548 earthquakes, with detection rates on average 279 earthquakes/day, and a magnitude-of-completion of ~M1.8. A subset of detections are identified as sources related to quarry and industrial site activity, and we also detect thousands of foreshocks and aftershocks of the April 1, 2014 Mw 8.2 Iquique earthquake. During the highest rates of aftershock activity, > 600 earthquakes/day are detected in the vicinity of the Iquique earthquake rupture zone

Playing with Duality: An Overview of Recent Primal-Dual Approaches for Solving Large-Scale Optimization Problems

Optimization methods are at the core of many problems in signal/image processing, computer vision, and machine learning. For a long time, it has been recognized that looking at the dual of an optimization problem may drastically simplify its solution. Deriving efficient strategies which jointly brings into play the primal and the dual problems is however a more recent idea which has generated many important new contributions in the last years. These novel developments are grounded on recent advances in convex analysis, discrete optimization, parallel processing, and non-smooth optimization with emphasis on sparsity issues. In this paper, we aim at presenting the principles of primal-dual approaches, while giving an overview of numerical methods which have been proposed in different contexts. We show the benefits which can be drawn from primal-dual algorithms both for solving large-scale convex optimization problems and discrete ones, and we provide various application examples to illustrate their usefulness

Aligning English Sentences with Abstract Meaning Representation Graphs using Inductive Logic Programming

abstract: In this thesis, I propose a new technique of Aligning English sentence words with its Semantic Representation using Inductive Logic Programming(ILP). My work focusses on Abstract Meaning Representation(AMR). AMR is a semantic formalism to English natural language. It encodes meaning of a sentence in a rooted graph. This representation has gained attention for its simplicity and expressive power. An AMR Aligner aligns words in a sentence to nodes(concepts) in its AMR graph. As AMR annotation has no explicit alignment with words in English sentence, automatic alignment becomes a requirement for training AMR parsers. The aligner in this work comprises of two components. First, rules are learnt using ILP that invoke AMR concepts from sentence-AMR graph pairs in the training data. Second, the learnt rules are then used to align English sentences with AMR graphs. The technique is evaluated on publicly available test dataset and the results are comparable with state-of-the-art aligner.Dissertation/ThesisMasters Thesis Computer Science 201