Deals with detection of road networks in aerial imagery. In natural images, roadlike segments extracted by low level operators are highly fragmented. The main focus of this work is the development of an intermediate processing stage that addresses the task of partitioning and connecting the roadlike fragments. Heuristics based upon generally observed properties of roadlike features are used to cluster and integrate segments that appear perceptually continuous. The segments are represented as lists and processed symbolically. The proposed methodology is exemplified using three data sets: a suite of four synthetic segment sets which were used to test the sensitivity of the algorithm to thresholds and noise; a circularly polarized millimeter wave (TABILS 5) radar pseudo image, and a thematic mapper (LANDSAT) image.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Heuristics for intermediate level road finding algorithms


    Additional title:

    Heuristisches Verfahren zur Erkennung von Fahrstrassen in Luftbildern


    Contributors:
    Vasudevan, S. (author) / Cannon, R.L. (author) / Bezdek, J.C. (author)

    Published in:

    Publication date :

    1988


    Size :

    16 Seiten, 15 Quellen



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    New heuristics for finding optimal routes for vehicle platoons in road networks

    Steinmetz, Dietrich / Technische Universität Clausthal | TIBKAT | 2020

    Free access

    New heuristics for finding optimal routes for vehicle platoons in road networks

    Steinmetz, Dietrich / Technische Universität Clausthal | TIBKAT | 2020



    Road finding for road-network extraction

    Aviad, Z. / Carnine, P.D. jun. | Tema Archive | 1988


    INCREASING RUNWAY CAPACITY USING GENETIC ALGORITHMS AND ENHANCED HEURISTICS

    Kovacs, A. / International Council of the Aeronautical Sciences | British Library Conference Proceedings | 2006