1,041 research outputs found

    Computing the output distribution and selection probabilities of a stack filter from the DNF of its positive Boolean function

    Full text link
    Many nonlinear filters used in practise are stack filters. An algorithm is presented which calculates the output distribution of an arbitrary stack filter S from the disjunctive normal form (DNF) of its underlying positive Boolean function. The so called selection probabilities can be computed along the way.Comment: This is the version published in Journal of Mathematical Imaging and Vision, online first, 1 august 201

    Neural Network Models for Nuclear Treaty Monitoring: Enhancing the Seismic Signal Pipeline with Deep Temporal Convolution

    Get PDF
    Seismic signal processing at the IDC is critical to global security, facilitating the detection and identification of covert nuclear tests in near-real time. This dissertation details three research studies providing substantial enhancements to this pipeline. Study 1 focuses on signal detection, employing a TCN architecture directly against raw real-time data streams and effecting a 4 dB increase in detector sensitivity over the latest operational methods. Study 2 focuses on both event association and source discrimination, utilizing a TCN-based triplet network to extract source-specific features from three-component seismograms, and providing both a complimentary validation measure for event association and a one-shot classifier for template-based source discrimination. Finally, Study 3 focuses on event localization, and employs a TCN architecture against three-component seismograms in order to confidently predict backazimuth angle and provide a three-fold increase in usable picks over traditional polarization analysis

    Characteristics of a detail preserving nonlinear filter.

    Get PDF
    by Lai Wai Kuen.Thesis (M.Phil.)--Chinese University of Hong Kong, 1993.Includes bibliographical references (leaves [119-125]).Abstract --- p.iAcknowledgement --- p.iiTable of Contents --- p.iiiChapter Chapter 1 --- IntroductionChapter 1.1 --- Background - The Need for Nonlinear Filtering --- p.1.1Chapter 1.2 --- Nonlinear Filtering --- p.1.2Chapter 1.3 --- Goal of the Work --- p.1.4Chapter 1.4 --- Organization of the Thesis --- p.1.5Chapter Chapter 2 --- An Overview of Robust Estimator Based Filters Morphological FiltersChapter 2.1 --- Introduction --- p.2.1Chapter 2.2 --- Signal Representation by Sets --- p.2.2Chapter 2.3 --- Robust Estimator Based Filters --- p.2.4Chapter 2.3.1 --- Filters based on the L-estimators --- p.2.4Chapter 2.3.1.1 --- The Median Filter and its Derivations --- p.2.5Chapter 2.3.1.2 --- Rank Order Filters and Derivations --- p.2.9Chapter 2.3.2 --- Filters based on the M-estimators (M-Filters) --- p.2.11Chapter 2.3.3 --- Filter based on the R-estimators --- p.2.13Chapter 2.4 --- Filters based on Mathematical Morphology --- p.2.14Chapter 2.4.1 --- Basic Morphological Operators --- p.2.14Chapter 2.4.2 --- Morphological Filters --- p.2.18Chapter 2.5 --- Chapter Summary --- p.2.20Chapter Chapter 3 --- Multi-Structuring Element Erosion FilterChapter 3.1 --- Introduction --- p.3.1Chapter 3.2 --- Problem Formulation --- p.3.1Chapter 3.3 --- Description of Multi-Structuring Element Erosion Filter --- p.3.3Chapter 3.3.1 --- Definition of Structuring Element for Multi-Structuring Element Erosion Filter --- p.3.4Chapter 3.3.2 --- Binary multi-Structuring Element Erosion Filter --- p.3.9Chapter 3.3.3 --- Selective Threshold Decomposition --- p.3.10Chapter 3.3.4 --- Multilevel Multi-Structuring Element Erosion Filter --- p.3.15Chapter 3.3.5 --- A Combination of Multilevel Multi-Structuring Element Erosion Filter and its Dual --- p.3.21Chapter 3.4 --- Chapter Summary --- p.3.21Chapter Chapter 4 --- Properties of Multi-Structuring Element Erosion FilterChapter 4.1 --- Introduction --- p.4.1Chapter 4.2 --- Deterministic Properties --- p.4.2Chapter 4.2.1 --- Shape of Invariant Signal --- p.4.3Chapter 4.2.1.1 --- Binary Multi-Structuring Element Erosion Filter --- p.4.5Chapter 4.2.1.2 --- Multilevel Multi-Structuring Element Erosion Filter --- p.4.16Chapter 4.2.2 --- Rate of Convergence of Multi-Structuring Element Erosion Filter --- p.4.25Chapter 4.2.2.1 --- Convergent Rate of Binary Multi-Structuring Element Erosion Filter --- p.4.25Chapter 4.2.2.2 --- Convergent Rate of Multilevel Multi-Structuring Element Erosion Filter --- p.4.28Chapter 4.3 --- Statistical Properties --- p.4.30Chapter 4.3.1 --- Output Distribution of Multi-Structuring Element Erosion Filter --- p.4.30Chapter 4.3.1.1 --- One-Dimensional Statistical Analysis of Multilevel Multi-Structuring Element Erosion Filter --- p.4.31Chapter 4.3.1.2 --- Two-Dimensional Statistical Analysis of Multilevel Multi-Structuring Element Erosion Filter --- p.4.32Chapter 4.3.2 --- Discussions on Statistical Properties --- p.4.36Chapter 4.4 --- Chapter Summary --- p.4.40Chapter Chapter 5 --- Performance EvaluationChapter 5.1 --- Introduction --- p.5.1Chapter 5.2 --- Performance Criteria --- p.5.2Chapter 5.2.1 --- Noise Suppression --- p.5.5Chapter 5.2.2 --- Subjective Criterion --- p.5.16Chapter 5.2.3 --- Computational Requirement --- p.5.20Chapter 5.3 --- Chapter Summary --- p.5.23Chapter Chapter 6 --- Recapitulation and Suggestions for Further WorkChapter 6.1 --- Recapitulation --- p.6.1Chapter 6.2 --- Suggestions for Further Work --- p.6.4Chapter 6.2.1 --- Probability Measure Function for the Two-Dimensional Filter --- p.6.4Chapter 6.2.2 --- Hardware Implementation --- p.6.5ReferencesAppendice

    GPU Accelerated protocol analysis for large and long-term traffic traces

    Get PDF
    This thesis describes the design and implementation of GPF+, a complete general packet classification system developed using Nvidia CUDA for Compute Capability 3.5+ GPUs. This system was developed with the aim of accelerating the analysis of arbitrary network protocols within network traffic traces using inexpensive, massively parallel commodity hardware. GPF+ and its supporting components are specifically intended to support the processing of large, long-term network packet traces such as those produced by network telescopes, which are currently difficult and time consuming to analyse. The GPF+ classifier is based on prior research in the field, which produced a prototype classifier called GPF, targeted at Compute Capability 1.3 GPUs. GPF+ greatly extends the GPF model, improving runtime flexibility and scalability, whilst maintaining high execution efficiency. GPF+ incorporates a compact, lightweight registerbased state machine that supports massively-parallel, multi-match filter predicate evaluation, as well as efficient arbitrary field extraction. GPF+ tracks packet composition during execution, and adjusts processing at runtime to avoid redundant memory transactions and unnecessary computation through warp-voting. GPF+ additionally incorporates a 128-bit in-thread cache, accelerated through register shuffling, to accelerate access to packet data in slow GPU global memory. GPF+ uses a high-level DSL to simplify protocol and filter creation, whilst better facilitating protocol reuse. The system is supported by a pipeline of multi-threaded high-performance host components, which communicate asynchronously through 0MQ messaging middleware to buffer, index, and dispatch packet data on the host system. The system was evaluated using high-end Kepler (Nvidia GTX Titan) and entry level Maxwell (Nvidia GTX 750) GPUs. The results of this evaluation showed high system performance, limited only by device side IO (600MBps) in all tests. GPF+ maintained high occupancy and device utilisation in all tests, without significant serialisation, and showed improved scaling to more complex filter sets. Results were used to visualise captures of up to 160 GB in seconds, and to extract and pre-filter captures small enough to be easily analysed in applications such as Wireshark

    Modeling the effect of soil meso- and macropores topology on the biodegradation of a soluble carbon substrate

    Get PDF
    Soil structure and interactions between biotic and abiotic processes are increasingly recognized as important for explaining the large uncertainties in the outputs of macroscopic SOM decomposition models. We present a numerical analysis to assess the role of meso- and macropore topology on the biodegradation of a soluble carbon substrate in variably water saturated and pure diffusion conditions . Our analysis was built as a complete factorial design and used a new 3D pore-scale model, LBioS, that couples a diffusion Lattice-Boltzmann model and a compartmental biodegradation model. The scenarios combined contrasted modalities of four factors: meso- and macropore space geometry, water saturation, bacterial distribution and physiology. A global sensitivity analysis of these factors highlighted the role of physical factors in the biodegradation kinetics of our scenarios. Bacteria location explained 28% of the total variance in substrate concentration in all scenarios, while the interactions among location, saturation and geometry explained up to 51% of it

    A sub-threshold cell library and methodology

    Get PDF
    Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.Includes bibliographical references (p. 97-102).Sub-threshold operation is a compelling approach for energy-constrained applications where speed is of secondary concern, but increased sensitivity to process variation must be mitigated in this regime. With scaling of process technologies, random within-die variation has recently introduced another degree of complexity in circuit design. This thesis proposes approaches to mitigate process variation in sub-threshold circuits through device sizing, topology selection and fault-tolerant architecture. This thesis makes several contributions to a sub-threshold circuit design methodology. A formal analysis of device sizing trade-offs between delay, energy, and variability reveals that while minimum size devices provide lowest energy and delay in sub-threshold, their increased sensitivity to random dopant fluctuation may cause functional errors. A proposed variation-driven design approach enables consistent sizing of logic gates and registers for constant functional yield. A yield constraint imposes energy overhead at low power supply voltages and changes the minimum energy operating point of a circuit.(cont.) The optimal supply and device sizing depend on the topology of the circuit and its energy versus VDD characteristic. The analysis resulted in a 56-cell library in 65nm CMOS, which is incorporated in a computer-aided design flow. A test chip synthesized from this library implements a fault-tolerant FIR filter. Algorithmic error detection enables correction of transient timing errors due to delay variability in sub-threshold, and also allows the system frequency to be set more aggressively for the average case instead of the worst case.by Joyce Y.S. Kwong.S.M
    corecore