22 research outputs found

    A Hierarchical Probabilistic Model for Rapid Object Categorization in Natural Scenes

    Get PDF
    Humans can categorize objects in complex natural scenes within 100–150 ms. This amazing ability of rapid categorization has motivated many computational models. Most of these models require extensive training to obtain a decision boundary in a very high dimensional (e.g., ∼6,000 in a leading model) feature space and often categorize objects in natural scenes by categorizing the context that co-occurs with objects when objects do not occupy large portions of the scenes. It is thus unclear how humans achieve rapid scene categorization

    Algorithmic Construction of Acyclic Partial Matchings for Multidimensional Persistence

    No full text
    Given a simplicial complex and a vector-valued function on its vertices, we present an algorithmic construction of an acyclic partial matching on the cells of the complex. This construction is used to build a reduced filtered complex with the same multidimensional persistent homology as of the original one filtered by the sublevel sets of the function. A number of numerical experiments show a substantial rate of reduction in the number of cells achieved by the algorithm

    Pathological and Test Cases For Reeb Analysis

    Get PDF
    After two decades in computational topology, it is clearly a computationally challenging area. Not only do we have the usual algorithmic and programming difficulties with establishing correctness, we also have a class of problems that are mathematically complex and notationally fragile. Effective development and deployment therefore requires an additional step - construction or selection of suitable test cases. Since we cannot test all possible inputs, our selection of test cases expresses our understanding of the task and of the problems involved. Moreover, the scale of the data sets we work with is such that, no matter how unlikely the behaviour mathematically, it is nearly guaranteed to occur at scale in every run. The test cases we choose are therefore tightly coupled with mathematically pathological cases, and need to be developed using the skills expressed most obviously in the constructing mathematical counterexamples. This paper is therefore a first attempt at reporting, classifying and analysing test cases previously used in computational topology, and the expression of a philosophy of how to test topological code

    The new Algerian Digital Seismic Network (ADSN): towards an earthquake early-warning system

    No full text
    Seismic monitoring in Algeria has seen great changes since the Boumerdes earthquake of 21 May 2003. Indeed, the installation of a new digital seismic network has resulted in a significant upgrade of the previous analog telemetry network. <br><br> During the last four years, the number of stations in operation has increased substantially from 25 to 69, and 20 of these are broadband, 2 are very broadband, 47 are short period. 21 are equipped with accelerometers. They are all managed by Antelope software from Kinemetrics (US Cie), and they are all connected in real time and use various modes of transmission (e.g., satellite, internet, mobile phone). The spatial repartition of the stations now cover most of northern Algeria. In addition, 70 GPS stations have recently been added to this seismological network, most of them collocated with the seismological stations. <br><br> Since the installation of the network, the records of local or distant events have improved significantly. The automatic processing of the data in a few minutes allows alert messages to be distributed to Civil Defense and other national authorities to react promptly to any emergency. The current strategy is to improve the data quality, to increase the density of the network by adding about 50 new stations, to reduce the processing time, and to reduce the time needed to send out an alert message. The result should be greatly improved network performance, which will lead to an effective early-warning system
    corecore