35 research outputs found

    Stream implementation of serial morphological filters with approximated polygons

    Get PDF
    ISBN : 978-142448157-6International audienceThis paper describes an original stream implementation of serially composed morphological filters using approximated flat polygons. It strictly respects a sequential data access. Results are obtained with minimal latency while operating within minimal memory space; even for very large neighborhoods. This is interesting for serially composed advanced filters, such as Alternating Sequential Filters or granulometries. We show how the dedicated implementation on an FPGA allows obtaining a previously unequaled performance, opening an opportunity to use these operators in time-critical, high-end applications

    Parallel Implementation of Sequential Morphological Filters

    Get PDF
    International audienceMany useful morphological filters are built as more or less long concatenations of erosions and dilations: openings, closings, size distributions, sequential filters, etc. An efficient implementation of such concatenation would allow all the sequentially concatenated operators run simultaneously, on the time-delayed data. A recent algorithm (see below) for the morphological dilation/erosion allows such inter-operator parallelism. This paper introduces an additional, intra-operator level of parallelism in this dilation/erosion algorithm. Realized in a dedicated hardware, for rectangular structuring elements with programmable size, such an implementation allows to obtain previously unachievable, real-time performances for these traditionally costly operators. Low latency and memory requirements are the main benefits when the performance is not deteriorated even for long concatenations or high-resolution images

    Pipeline architecture for compound morphological operators

    No full text
    ISBN: 978-142447994-8International audienceIn this paper we present a new pipeline HW architecture for fast 2-D erosions/dilations. The implementation is based on a recently proposed algorithm allowing to process 2-D data in a stream, minimizing the use of memory and drastically reducing the computing latency. These elementary operators can be chained in an efficient pipeline to realize compound morphological operators (opening, closing, ASF filters, etc.) with no intermediate image storage and minimal latency

    The ATLAS Forward Proton Real-Time Time-of-Flight Trigger and Trigger Decoder for LHC Run 3

    No full text
    This poster describes the in-line real time Digital Trigger Module (DTM) that provides a majority trigger decision for the ATLAS Forward Proton detector (AFP). A forward proton traverses a sequence of four successive Cherenkov radiators (a “Train”) connected to a fast multi-anode MCP Photomultiplier (PMT). Four such trains are mounted next to one another and subdivide the AFP acceptance for diffractive protons is “slices” with roughly equal occupancy. Every Train that passes the majority trigger encodes a “bit” in the 5-bit trigger word (the first bit is an “OR” of all trains firing) that is sent over a 265 m foam-core coax cable towards the ATLAS Central Trigger Processor (CTP). The fast real-time DTM is described, including the Trigger Decoder (TD) that interfaces with the CTP

    Morphological Classification of Particles Recorded by the Timepix Detector

    Get PDF
    International audienceThe Timepix is a pixel detector that records energy deposited by charged particles. Different particles leave a different trace. These traces can be analysed in order to identify the particles, and consequently, analyze the sources of the radiation. We propose an image processing approach to the classification of particles based on the shape of traces, using only a few basic morphological operations. This method-implemented in an FPGA-achieves a performance and latency allowing a high acquisition rate. Embedded with Timepix, it can beneficially analyse radioactive fluxes of unknown sources and spectra
    corecore