SlideShare a Scribd company logo
1 of 25
Download to read offline
Introduction                    Methodology                      Results                    Conclusions




         A hierarchical Markov random field
         for road network extraction and its
         application with optical and sar data

         Talita Perciano1,2          Roberto Hirata Jr.1              Roberto M. C. Jr.1
                                       Florence Tupin2

                                   1 Departamento de Computa¸˜o
                                                              ca
                                Instituto de Matem´tica e Estat´
                                                   a            ıstica
                                      Universidade de S˜o Paulo
                                                       a
                          2 D´partement
                             e            Traitement du Signal et des Images
                                           T´l´com ParisTech
                                            ee


                                           IGARSS 2011

        Talita Perciano             Road extraction and data fusion      IGARSS 2011 26/07/2011   1 / 25
Introduction               Methodology                     Results                  Conclusions




Contents



     1   Introduction

     2   Methodology

     3   Results

     4   Conclusions




         Talita Perciano      Road extraction and data fusion    IGARSS 2011 26/07/2011   2 / 25
Introduction                 Methodology                     Results                  Conclusions




Motivations and objective


         • Advent of new optical (QuickBird, Pleiades) and radar
               (TerraSAR-X, Cosmo-Skymed) high-resolution satellite sensors
         • New perspectives for pattern recognition problems as road
               network extraction
         • The number of works in the literature exploring high-resolution
               images and multi-sensor image processing is increasing
     Objective
     Propose a flexible hierarchical Markovian random field based on
     feature extraction and road network structure, exploring
     multi-sensor data fusion



        Talita Perciano         Road extraction and data fusion    IGARSS 2011 26/07/2011   3 / 25
Introduction                    Methodology                     Results                  Conclusions




Problem of road network extraction

         • Problem studied since many years as it is an important
               structure for many applications:
                 •    Urban planning
                 •    Making and updating maps
                 •    Traffic management
                 •    Cartography
         • Difficult task due to the spatial and spectral features of the
               road
         • Different automatic and semiautomatic approaches in the
           literature
         • A two-step approach is explored in this work:
                 1    Low level: features extraction
                 2    High level: road network reconstruction using contextual
                      information

        Talita Perciano            Road extraction and data fusion    IGARSS 2011 26/07/2011   4 / 25
Introduction               Methodology                     Results                  Conclusions




Contents



     1   Introduction

     2   Methodology

     3   Results

     4   Conclusions




         Talita Perciano      Road extraction and data fusion    IGARSS 2011 26/07/2011   5 / 25
Introduction                 Methodology                        Results                  Conclusions




Overview of the method (Tupin et al, 1998 )

        1 Extract linear features
               • Ratio-based detector (D1 (x, y )) and a cross-correlation-based
                  detector (D2 (x, y ))

                                                 D1 (x, y )D2 (x, y )
                     D(x, y ) =                                                       . (1)
                                  1 − D1 (x, y ) − D2 (x, y ) + 2D1 (x, y )D2 (x, y )


                                               r2      r1     r3

                                                      px,y
                                                        1
                                                        0



        Talita Perciano            Road extraction and data fusion    IGARSS 2011 26/07/2011   6 / 25
Introduction                Methodology                     Results                  Conclusions




Overview of the method


        2 Road network reconstruction
               • Graph modeling: map structures and its relations into a graph
                  where each segment is a node and two nodes are connected if
                  their corresponding segments share a extremity

               • Markovian model: search for the optimal binary labeling by
                  minimizing an energy function defined for the MRF that has a
                  data attachment term (likelihood) and a prior term:

                                U(l) = Ulikelihood (l, d) + Uprior (l)                 (2)




        Talita Perciano        Road extraction and data fusion    IGARSS 2011 26/07/2011     7 / 25
Introduction                        Methodology                           Results                        Conclusions




Overview of the method

        2 Road network reconstruction

                                                                                    1
                                                                                    0         1
                                                                                              0
                                                                                    1
                                                                                    0         1 1
                                                                                              0 0
                                                                                        1
                                                                                        0   1 1 1
                                                                                            0 0 0           1
                                                                                                            0
                                                                                        1
                                                                                        0   1 1
                                                                                            0 0
                                                                                             1
                                                                                             0
                                                                                             1
                                                                                             0              1
                                                                                                            0
                                                                                         11
                                                                                         00
               Line detection                                                            11
                                                                                         00
                                                      Polygonal approximation           1
                                                                                        0        Graph
                                                                                        1
                                                                                        0
                                                      and connections
                                                                                    1
                                                                                    0
                                                                                    1
                                                                                    0

                       1
                       1
                       0
                       1
                       0 1
                                  0
                                  1
                                  0
                              0   1 1
                                  01 0
                                     1
                         1
                         0
                         1     1 1 1
                               0 0 0
                         01 1 0 0
                                                 1
                                                 1
                                                 0
                               1 1
                                1
                                0
                                1
                                0                1
                                                 0
                          11
                          00    1
                          11
                          00                                                Final road network
                           10
                            1 1
                              0 Example of labeling
                       10
                        1 1
                          0




        Talita Perciano                 Road extraction and data fusion          IGARSS 2011 26/07/2011         8 / 25
Introduction                   Methodology                          Results                    Conclusions




Features extraction
Proposed radar and optical fusion (Novelty)

         • The ratio and cross-correlation measures are calculated
               simultaneously in the radar and optical images
         • The maximum response for each measure is retained
         • The symmetrical sum is used as before:
                                            D1 (x, y )D2 (x, y )
                D(x, y ) =                                                       . (3)
                             1 − D1 (x, y ) − D2 (x, y ) + 2D1 (x, y )D2 (x, y )

                              r2      r1     r3          r2    r1      r3

                                      px,y                     px,y
                                       1
                                       0                        1
                                                                0


                                   (a) Radar              (b) Optical

        Talita Perciano              Road extraction and data fusion        IGARSS 2011 26/07/2011   9 / 25
Introduction                       Methodology                       Results                     Conclusions




Connected component level (Novelty)
Proposed method


         • Road network reconstruction: the use of connected
               components instead of segments

                                                                                             1
                                                                                             0
                                                                                1
                                                                                0            1
                                                                                             0
                                                                                1
                                                                                0      1
                                                                                       0         1
                                                                                                 0
                                                                                       1
                                                                                       01
                                                                                        0        1
                                                                                                 0
                                                                                     1 1
                                                                                     0 0
                                                                                     1
                                                                                     0
                  Line detection                    Detect components                Graph
                                                    and make connections        1
                                                                                0
                                                                                1
                                                                                0


                                          0
                             1            1
                                          0
                             1
                             0            1
                                          0     1
                             1
                             0       00
                                      1        1
                                               0
                                     1
                                     01
                                      0        1
                                               0
                                   1 1
                                   0 0
                                   1
                                      1
                                   1
                                   0                                 Final road network
                                    Example of labeling
                           10
                            1
                            1
                            0



        Talita Perciano               Road extraction and data fusion      IGARSS 2011 26/07/2011     10 / 25
Introduction                Methodology                     Results                  Conclusions




Connected component level (Novelty)
Proposed method



         • Advantages of using connected components
                  Simplification of the graph by decreasing considerably its
                  number of nodes
                  Deal with more complex structures
                  Take more advantage of the complete structures detected in
                  the low level
         • Process applied in a multi-scale way
             • A pyramid is created by degrading the resolution (average of
               the amplitudes of n × n pixels blocks)
             • Extraction of the roads in the three scales
             • Results of each scale are merged together
             • “Cleaning step” to remove possible redundancies



        Talita Perciano        Road extraction and data fusion   IGARSS 2011 26/07/2011   11 / 25
Introduction                  Methodology                     Results                  Conclusions




Road section level (Novelty)
Additional high-level step



     Built a new graph from the result of the previous road extraction:
         • Image is preprocessed to obtain only crossroads and road
               sections
         • Each road section is a node of the graph and two nodes are
               connected is their corresponding sections share a crossroad
         • MRF model with the same kind of energy function, but the
               best likelihood value is obtained analyzing all three scales of
               the multi-scale pyramid and from both radar and optical
               images
         • Simpler and computationally faster step



        Talita Perciano          Road extraction and data fusion   IGARSS 2011 26/07/2011   12 / 25
Introduction                          Methodology                      Results                        Conclusions




Road section level (Novelty)
Additional high-level step


                                                                             0
                                                                             1
                                                                             111111
                                                                             000000
                                                                               1
                                                                               0    111111
                                                                                    0000001
                                                                                          0
                                                                                          0
                                                                                          1
                                                                             1
                                                                             0
                                                                             111111
                                                                             000000
                                                                               1
                                                                               0    111111
                                                                                    0000001
                                                                                          0
                                                                                          1
                                                                                          0
                                                                             1
                                                                             0
                                                                             111111
                                                                             000000 111111
                                                                                    0000001
                                                                                          0
                                                                             1
                                                                             0
                                                                             111111
                                                                             000000
                                                                             111111
                                                                             000000  1
                                                                                     0
                                                                                    111111
                                                                                    000000
                                                                                     11111
                                                                                     000001
                                                                                          0
                                                                             1
                                                                             0
                                                                             111111
                                                                             000000
                                                                             0       1
                                                                                     0
                                                                                     11111
                                                                                     000001
                                                                                          0
                                                                             1
                                                                             111111
                                                                             000000
                                                                             1
                                                                             0       11111
                                                                                     000000
                                                                                          1
                                                                             111111
                                                                             000000
                                                                           111
                                                                           000
                                                                             11
                                                                             00
                                                                              111
                                                                              000
                                                                               1
                                                                               0     11111
                                                                                     00000
                                                                                     11111
                                                                                     00000
                                                                                         0
                                                                                         1
                                                                                         1
                                                                                         01
                                                                                          0
                                                                             111111
                                                                             000000
                                                                           111
                                                                           000111
                                                                              000
                                                                               1
                                                                               0
                                                                               1
                                                                               0     11111
                                                                                     00000
                                                                                     11111
                                                                                     00000
                                                                                         1
                                                                                         0
                                                                                         1
                                                                                         01
                                                                                          0
                                                                           111
                                                                           000111
                                                                              000
                                                                               1
                                                                               0
                                                                           11111111
                                                                           00000000
                                                                              111 111
                                                                              000 000
                                                                               0
                                                                                     11111
                                                                                     00000
                                                                                         1
                                                                                         0
                                                                               1
                                                                           11111111
                                                                           00000000
                                                                                     11111
                                                                                     00000
                                                                                     0000
                                                                                     11111
                                                                                         0
                                                                            1 111 111
                                                                            0 000 000
                                                                               11
                                                                               00
                                                                           11111111
                                                                           00000000
                                                                                     11111
                                                                                     00000
                                                                                       1
                                                                                       0
                                                                                     1111
                                                                                     00000
                                                                                         1
                                                                            1 111
                                                                            0 000
                                                                           0000
                                                                           11111
                                                                               01
                                                                               11
                                                                               00
                                                                               0 0 000
                                                                               1 111
                                                                           11111
                                                                           00000
                                                                               11
                                                                               00      1
                                                                                       0
                                                                                     1111
                                                                                     00001
                                                                                         0
                                                                                         1
                                                                                         0
                                                                               1
                                                                               0
                                                                           11111111
                                                                           00000000
                                                                               11
                                                                               00    1111
                                                                                     00001
                                                                                         0
                                                                               0
                                                                               1
                                                                           11111111
                                                                           00000000
                                                                               11
                                                                               00    1111
                                                                                     0000
                                                                                     00001
                                                                                         0
                                                                               1
                                                                               0
                                                                           11111
                                                                           00000
                                                                               11
                                                                               00    11110
                                                                                         1
                                                                           11111111
                                                                           00000000
                                                                              1 1 1111
                                                                              0 0 0000
                                                                               1
                                                                               0
                                                                               11 111
                                                                               00 000
                                                                              1 1 1111
                                                                              0 0 0000   1
                                                                                         0
                                                                                         1
                                                                                         0
                                                                                         1
                                                                                         0
                                                                                         1
                                                                                         0
                                                                                   Graph
                                                       Prolongations
               Result from previous
               MRF
                               111111
                               000000
                               1
                               0
                               101     111111
                                       0000001
                                       111111
                                       000000 1
                                              0
                                              1
                                              0
                               0
                               111111
                               000000
                               1 1
                                 0            1
                                              0
                                              1
                                              0
                               1
                               0
                               111111
                               000000  111111
                                       000000
                                        1
                                       111111
                                       000000 0
                                              1
                                              1
                                              0
                               111111
                               000000
                               1
                               0
                               111111
                               000000   1
                                        0
                                       111111
                                       000000
                                        11111
                                        00000 1
                                              0
                               1
                               0
                               111111
                               000000   1
                                        0
                                        11111
                                        00000 1
                                              0
                               1
                               0
                               111111
                               000000   11111
                                        00000 1
                                              0
                               01
                               1
                               111111
                               000000
                             11111
                             00000
                               00
                               10       11111
                                        000001
                                         11111
                                         00000
                                            11
                                            000
                                              1
                                 1
                                 0
                               111111
                               000000
                             11111
                             00000
                                11      11111
                                        000001
                                             0
                                         11111
                                         00000
                                            11
                                            001
                                              0
                                 1
                                 0
                             11111
                             00000
                                 0
                                 1           1
                                             0
                                         11111
                                         00000
                                          1 00
                                            11
                             11111
                             00000
                                 1 1111
                                 0 0000
                                  11111
                                  00000
                                   1     11111
                                         00000
                                            11
                                            00
                                         1111
                                         0000                                    Final road network
                             11111
                             00000
                             00 1 0
                                 01
                              1 00       11111
                                         00000
                                          1 00
                                          0 11
                             11111
                             00000
                              0 0011111
                                  00000
                             00000000
                                 111111
                             11110000
                              1 11
                                 0 1111
                                 1
                             11111
                             0000011
                                  00
                                 11
                                 001111
                                         1111
                                         0000
                                          1 11
                                          0 00
                                         0000
                                         1111
                                            00
                                            11
                                 0 0000
                                 1 0000
                             11111
                             00000
                                 11
                                 00      0000
                                         1111
                                            11
                                            00
                                 1 1111
                                 0 0000
                             11111
                             00000
                                 11
                                 00      0000
                                         1111
                                            11
                                            00
                                 1 1111
                                 0
                             11111
                             00000
                                 11
                                 00      1111
                                         0000
                                            00
                                            11
                               1 0 0000
                                 1 1111
                             00000 0 0000 1
                                 0 0 1111
                                 1 1 0000
                             11111
                                 11
                                 00
                                 1 1111
                                 0 0000     11
                                            00
                                     0 1111
                                     1      00
                                            11
                                             1
                                             0
                                             1
                                             0
                                 Example of labeling



        Talita Perciano                  Road extraction and data fusion    IGARSS 2011 26/07/2011         13 / 25
Introduction               Methodology                     Results                  Conclusions




Contents



     1   Introduction

     2   Methodology

     3   Results

     4   Conclusions




         Talita Perciano      Road extraction and data fusion   IGARSS 2011 26/07/2011   14 / 25
Introduction                  Methodology                     Results                      Conclusions




Results - QuickBird and TerraSAR-X images
(Toulouse)




          (a) Optical image           (b) Radar image                   (c) Ground-truth




        Talita Perciano          Road extraction and data fusion   IGARSS 2011 26/07/2011       15 / 25
Introduction                  Methodology                     Results                    Conclusions




Results - QuickBird image




           (a) Ground-truth           (b) Optical result            (c) Optical result




        Talita Perciano          Road extraction and data fusion   IGARSS 2011 26/07/2011     16 / 25
Introduction                  Methodology                     Results                      Conclusions




Results - TerraSAR-X image




           (a) Ground-truth            (b) Radar result                 (c) Radar result




        Talita Perciano          Road extraction and data fusion   IGARSS 2011 26/07/2011       17 / 25
Introduction                  Methodology                     Results                       Conclusions




Results - Fusion




           (a) Ground-truth           (b) Fusion result                 (c) Fusion result




        Talita Perciano          Road extraction and data fusion   IGARSS 2011 26/07/2011        18 / 25
Introduction                Methodology                       Results                   Conclusions




Results - QuickBird and TerraSAR-X images
(Toulouse)




      (a) Optical image result    (b) Radar image result            (c) Fusion result

     Figure: Correct detection in red, incorrect detection in black and
     absent roads in blue.


        Talita Perciano          Road extraction and data fusion   IGARSS 2011 26/07/2011    19 / 25
Introduction                  Methodology                     Results                      Conclusions




Results - QuickBird and TerraSAR-X images
(Toulouse)




          (a) Optical image           (b) Radar image                   (c) Ground-truth


        Talita Perciano          Road extraction and data fusion   IGARSS 2011 26/07/2011       20 / 25
Introduction                  Methodology                     Results                       Conclusions




Results - QuickBird and TerraSAR-X images
(Toulouse)




           (a) Ground-truth           (b) Fusion result                 (c) Fusion result


        Talita Perciano          Road extraction and data fusion   IGARSS 2011 26/07/2011        21 / 25
Introduction                 Methodology                     Results                  Conclusions




Results


                      Table: Quantitative evaluation of the results.


                      Data           Completeness         Correctness      Quality
               R1   Optical image          41.44%           38.63%        24.99%
                    Radar image            44.42%           50.82%        31.06%
                       Fusion              67.39%           56.55%        44.40%
               R2   Optical image          45.21%           45.72%        31.06%
                    Radar image            53.16%           43.77%        31.59%
                       Fusion              62.69%           57.4%         42.78%




        Talita Perciano         Road extraction and data fusion   IGARSS 2011 26/07/2011   22 / 25
Introduction               Methodology                     Results                  Conclusions




Contents



     1   Introduction

     2   Methodology

     3   Results

     4   Conclusions




         Talita Perciano      Road extraction and data fusion   IGARSS 2011 26/07/2011   23 / 25
Introduction                  Methodology                     Results                  Conclusions




Discussion and conclusions


         • We propose a new framework for road detection composed by
               three steps:
                 • Low-level step (line detection with fusion of optical and radar
                   data)
                 • First high-level step (connected components)
                 • Second high-level step (road sections and crossroads)
         • A hierarchical multi-scale framework that uses information
               from different sources (radar and optical images)
         • The quantitative results show the considerable improvement
               of detection using the fusion approach



        Talita Perciano          Road extraction and data fusion   IGARSS 2011 26/07/2011   24 / 25
Introduction              Methodology                     Results                  Conclusions




Acknowledgements



     Thanks to FAPESP, CAPES (scholarship process number
     0310-10-7) and CNPq Brazilian agencies for funding.


     Contact: talitaperciano@gmail.com



                                  Questions?



        Talita Perciano      Road extraction and data fusion   IGARSS 2011 26/07/2011   25 / 25

More Related Content

More from grssieee

DEVELOPMENT OF ALGORITHMS AND PRODUCTS FOR SUPPORTING THE ITALIAN HYPERSPECTR...
DEVELOPMENT OF ALGORITHMS AND PRODUCTS FOR SUPPORTING THE ITALIAN HYPERSPECTR...DEVELOPMENT OF ALGORITHMS AND PRODUCTS FOR SUPPORTING THE ITALIAN HYPERSPECTR...
DEVELOPMENT OF ALGORITHMS AND PRODUCTS FOR SUPPORTING THE ITALIAN HYPERSPECTR...
grssieee
 
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
grssieee
 
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
grssieee
 
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
grssieee
 
test 34mb wo animations
test  34mb wo animationstest  34mb wo animations
test 34mb wo animations
grssieee
 
2011_Fox_Tax_Worksheets.pdf
2011_Fox_Tax_Worksheets.pdf2011_Fox_Tax_Worksheets.pdf
2011_Fox_Tax_Worksheets.pdf
grssieee
 
DLR open house
DLR open houseDLR open house
DLR open house
grssieee
 
DLR open house
DLR open houseDLR open house
DLR open house
grssieee
 
DLR open house
DLR open houseDLR open house
DLR open house
grssieee
 
Tana_IGARSS2011.ppt
Tana_IGARSS2011.pptTana_IGARSS2011.ppt
Tana_IGARSS2011.ppt
grssieee
 
Solaro_IGARSS_2011.ppt
Solaro_IGARSS_2011.pptSolaro_IGARSS_2011.ppt
Solaro_IGARSS_2011.ppt
grssieee
 
Sakkas.ppt
Sakkas.pptSakkas.ppt
Sakkas.ppt
grssieee
 
Lagios_et_al_IGARSS_2011.ppt
Lagios_et_al_IGARSS_2011.pptLagios_et_al_IGARSS_2011.ppt
Lagios_et_al_IGARSS_2011.ppt
grssieee
 
IGARSS-GlobWetland-II_2011-07-20_v2-0.ppt
IGARSS-GlobWetland-II_2011-07-20_v2-0.pptIGARSS-GlobWetland-II_2011-07-20_v2-0.ppt
IGARSS-GlobWetland-II_2011-07-20_v2-0.ppt
grssieee
 
igarss_2011_breunig_DLR_TDM_water_mask.ppt
igarss_2011_breunig_DLR_TDM_water_mask.pptigarss_2011_breunig_DLR_TDM_water_mask.ppt
igarss_2011_breunig_DLR_TDM_water_mask.ppt
grssieee
 
Liwenchao.ppt
Liwenchao.pptLiwenchao.ppt
Liwenchao.ppt
grssieee
 

More from grssieee (20)

DEVELOPMENT OF ALGORITHMS AND PRODUCTS FOR SUPPORTING THE ITALIAN HYPERSPECTR...
DEVELOPMENT OF ALGORITHMS AND PRODUCTS FOR SUPPORTING THE ITALIAN HYPERSPECTR...DEVELOPMENT OF ALGORITHMS AND PRODUCTS FOR SUPPORTING THE ITALIAN HYPERSPECTR...
DEVELOPMENT OF ALGORITHMS AND PRODUCTS FOR SUPPORTING THE ITALIAN HYPERSPECTR...
 
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
 
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
 
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
EO-1/HYPERION: NEARING TWELVE YEARS OF SUCCESSFUL MISSION SCIENCE OPERATION A...
 
Test
TestTest
Test
 
test 34mb wo animations
test  34mb wo animationstest  34mb wo animations
test 34mb wo animations
 
Test 70MB
Test 70MBTest 70MB
Test 70MB
 
Test 70MB
Test 70MBTest 70MB
Test 70MB
 
2011_Fox_Tax_Worksheets.pdf
2011_Fox_Tax_Worksheets.pdf2011_Fox_Tax_Worksheets.pdf
2011_Fox_Tax_Worksheets.pdf
 
DLR open house
DLR open houseDLR open house
DLR open house
 
DLR open house
DLR open houseDLR open house
DLR open house
 
DLR open house
DLR open houseDLR open house
DLR open house
 
Tana_IGARSS2011.ppt
Tana_IGARSS2011.pptTana_IGARSS2011.ppt
Tana_IGARSS2011.ppt
 
Solaro_IGARSS_2011.ppt
Solaro_IGARSS_2011.pptSolaro_IGARSS_2011.ppt
Solaro_IGARSS_2011.ppt
 
Sakkas.ppt
Sakkas.pptSakkas.ppt
Sakkas.ppt
 
Rocca.ppt
Rocca.pptRocca.ppt
Rocca.ppt
 
Lagios_et_al_IGARSS_2011.ppt
Lagios_et_al_IGARSS_2011.pptLagios_et_al_IGARSS_2011.ppt
Lagios_et_al_IGARSS_2011.ppt
 
IGARSS-GlobWetland-II_2011-07-20_v2-0.ppt
IGARSS-GlobWetland-II_2011-07-20_v2-0.pptIGARSS-GlobWetland-II_2011-07-20_v2-0.ppt
IGARSS-GlobWetland-II_2011-07-20_v2-0.ppt
 
igarss_2011_breunig_DLR_TDM_water_mask.ppt
igarss_2011_breunig_DLR_TDM_water_mask.pptigarss_2011_breunig_DLR_TDM_water_mask.ppt
igarss_2011_breunig_DLR_TDM_water_mask.ppt
 
Liwenchao.ppt
Liwenchao.pptLiwenchao.ppt
Liwenchao.ppt
 

Recently uploaded

Artificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and MythsArtificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and Myths
Joaquim Jorge
 

Recently uploaded (20)

Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
 
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
 
Partners Life - Insurer Innovation Award 2024
Partners Life - Insurer Innovation Award 2024Partners Life - Insurer Innovation Award 2024
Partners Life - Insurer Innovation Award 2024
 
Connector Corner: Accelerate revenue generation using UiPath API-centric busi...
Connector Corner: Accelerate revenue generation using UiPath API-centric busi...Connector Corner: Accelerate revenue generation using UiPath API-centric busi...
Connector Corner: Accelerate revenue generation using UiPath API-centric busi...
 
The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024
 
Artificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and MythsArtificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and Myths
 
Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)
 
presentation ICT roal in 21st century education
presentation ICT roal in 21st century educationpresentation ICT roal in 21st century education
presentation ICT roal in 21st century education
 
GenAI Risks & Security Meetup 01052024.pdf
GenAI Risks & Security Meetup 01052024.pdfGenAI Risks & Security Meetup 01052024.pdf
GenAI Risks & Security Meetup 01052024.pdf
 
HTML Injection Attacks: Impact and Mitigation Strategies
HTML Injection Attacks: Impact and Mitigation StrategiesHTML Injection Attacks: Impact and Mitigation Strategies
HTML Injection Attacks: Impact and Mitigation Strategies
 
GenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day PresentationGenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day Presentation
 
Understanding Discord NSFW Servers A Guide for Responsible Users.pdf
Understanding Discord NSFW Servers A Guide for Responsible Users.pdfUnderstanding Discord NSFW Servers A Guide for Responsible Users.pdf
Understanding Discord NSFW Servers A Guide for Responsible Users.pdf
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected Worker
 
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemkeProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
 
[2024]Digital Global Overview Report 2024 Meltwater.pdf
[2024]Digital Global Overview Report 2024 Meltwater.pdf[2024]Digital Global Overview Report 2024 Meltwater.pdf
[2024]Digital Global Overview Report 2024 Meltwater.pdf
 
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsHandwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed texts
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected Worker
 
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
 
Boost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivityBoost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivity
 
Developing An App To Navigate The Roads of Brazil
Developing An App To Navigate The Roads of BrazilDeveloping An App To Navigate The Roads of Brazil
Developing An App To Navigate The Roads of Brazil
 

AHierarchicalMarkovRandomFieldForRoadNetworkExtractionAndItsApplicationWithOpticalAndSarData.pdf

  • 1. Introduction Methodology Results Conclusions A hierarchical Markov random field for road network extraction and its application with optical and sar data Talita Perciano1,2 Roberto Hirata Jr.1 Roberto M. C. Jr.1 Florence Tupin2 1 Departamento de Computa¸˜o ca Instituto de Matem´tica e Estat´ a ıstica Universidade de S˜o Paulo a 2 D´partement e Traitement du Signal et des Images T´l´com ParisTech ee IGARSS 2011 Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 1 / 25
  • 2. Introduction Methodology Results Conclusions Contents 1 Introduction 2 Methodology 3 Results 4 Conclusions Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 2 / 25
  • 3. Introduction Methodology Results Conclusions Motivations and objective • Advent of new optical (QuickBird, Pleiades) and radar (TerraSAR-X, Cosmo-Skymed) high-resolution satellite sensors • New perspectives for pattern recognition problems as road network extraction • The number of works in the literature exploring high-resolution images and multi-sensor image processing is increasing Objective Propose a flexible hierarchical Markovian random field based on feature extraction and road network structure, exploring multi-sensor data fusion Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 3 / 25
  • 4. Introduction Methodology Results Conclusions Problem of road network extraction • Problem studied since many years as it is an important structure for many applications: • Urban planning • Making and updating maps • Traffic management • Cartography • Difficult task due to the spatial and spectral features of the road • Different automatic and semiautomatic approaches in the literature • A two-step approach is explored in this work: 1 Low level: features extraction 2 High level: road network reconstruction using contextual information Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 4 / 25
  • 5. Introduction Methodology Results Conclusions Contents 1 Introduction 2 Methodology 3 Results 4 Conclusions Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 5 / 25
  • 6. Introduction Methodology Results Conclusions Overview of the method (Tupin et al, 1998 ) 1 Extract linear features • Ratio-based detector (D1 (x, y )) and a cross-correlation-based detector (D2 (x, y )) D1 (x, y )D2 (x, y ) D(x, y ) = . (1) 1 − D1 (x, y ) − D2 (x, y ) + 2D1 (x, y )D2 (x, y ) r2 r1 r3 px,y 1 0 Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 6 / 25
  • 7. Introduction Methodology Results Conclusions Overview of the method 2 Road network reconstruction • Graph modeling: map structures and its relations into a graph where each segment is a node and two nodes are connected if their corresponding segments share a extremity • Markovian model: search for the optimal binary labeling by minimizing an energy function defined for the MRF that has a data attachment term (likelihood) and a prior term: U(l) = Ulikelihood (l, d) + Uprior (l) (2) Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 7 / 25
  • 8. Introduction Methodology Results Conclusions Overview of the method 2 Road network reconstruction 1 0 1 0 1 0 1 1 0 0 1 0 1 1 1 0 0 0 1 0 1 0 1 1 0 0 1 0 1 0 1 0 11 00 Line detection 11 00 Polygonal approximation 1 0 Graph 1 0 and connections 1 0 1 0 1 1 0 1 0 1 0 1 0 0 1 1 01 0 1 1 0 1 1 1 1 0 0 0 01 1 0 0 1 1 0 1 1 1 0 1 0 1 0 11 00 1 11 00 Final road network 10 1 1 0 Example of labeling 10 1 1 0 Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 8 / 25
  • 9. Introduction Methodology Results Conclusions Features extraction Proposed radar and optical fusion (Novelty) • The ratio and cross-correlation measures are calculated simultaneously in the radar and optical images • The maximum response for each measure is retained • The symmetrical sum is used as before: D1 (x, y )D2 (x, y ) D(x, y ) = . (3) 1 − D1 (x, y ) − D2 (x, y ) + 2D1 (x, y )D2 (x, y ) r2 r1 r3 r2 r1 r3 px,y px,y 1 0 1 0 (a) Radar (b) Optical Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 9 / 25
  • 10. Introduction Methodology Results Conclusions Connected component level (Novelty) Proposed method • Road network reconstruction: the use of connected components instead of segments 1 0 1 0 1 0 1 0 1 0 1 0 1 01 0 1 0 1 1 0 0 1 0 Line detection Detect components Graph and make connections 1 0 1 0 0 1 1 0 1 0 1 0 1 1 0 00 1 1 0 1 01 0 1 0 1 1 0 0 1 1 1 0 Final road network Example of labeling 10 1 1 0 Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 10 / 25
  • 11. Introduction Methodology Results Conclusions Connected component level (Novelty) Proposed method • Advantages of using connected components Simplification of the graph by decreasing considerably its number of nodes Deal with more complex structures Take more advantage of the complete structures detected in the low level • Process applied in a multi-scale way • A pyramid is created by degrading the resolution (average of the amplitudes of n × n pixels blocks) • Extraction of the roads in the three scales • Results of each scale are merged together • “Cleaning step” to remove possible redundancies Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 11 / 25
  • 12. Introduction Methodology Results Conclusions Road section level (Novelty) Additional high-level step Built a new graph from the result of the previous road extraction: • Image is preprocessed to obtain only crossroads and road sections • Each road section is a node of the graph and two nodes are connected is their corresponding sections share a crossroad • MRF model with the same kind of energy function, but the best likelihood value is obtained analyzing all three scales of the multi-scale pyramid and from both radar and optical images • Simpler and computationally faster step Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 12 / 25
  • 13. Introduction Methodology Results Conclusions Road section level (Novelty) Additional high-level step 0 1 111111 000000 1 0 111111 0000001 0 0 1 1 0 111111 000000 1 0 111111 0000001 0 1 0 1 0 111111 000000 111111 0000001 0 1 0 111111 000000 111111 000000 1 0 111111 000000 11111 000001 0 1 0 111111 000000 0 1 0 11111 000001 0 1 111111 000000 1 0 11111 000000 1 111111 000000 111 000 11 00 111 000 1 0 11111 00000 11111 00000 0 1 1 01 0 111111 000000 111 000111 000 1 0 1 0 11111 00000 11111 00000 1 0 1 01 0 111 000111 000 1 0 11111111 00000000 111 111 000 000 0 11111 00000 1 0 1 11111111 00000000 11111 00000 0000 11111 0 1 111 111 0 000 000 11 00 11111111 00000000 11111 00000 1 0 1111 00000 1 1 111 0 000 0000 11111 01 11 00 0 0 000 1 111 11111 00000 11 00 1 0 1111 00001 0 1 0 1 0 11111111 00000000 11 00 1111 00001 0 0 1 11111111 00000000 11 00 1111 0000 00001 0 1 0 11111 00000 11 00 11110 1 11111111 00000000 1 1 1111 0 0 0000 1 0 11 111 00 000 1 1 1111 0 0 0000 1 0 1 0 1 0 1 0 Graph Prolongations Result from previous MRF 111111 000000 1 0 101 111111 0000001 111111 000000 1 0 1 0 0 111111 000000 1 1 0 1 0 1 0 1 0 111111 000000 111111 000000 1 111111 000000 0 1 1 0 111111 000000 1 0 111111 000000 1 0 111111 000000 11111 00000 1 0 1 0 111111 000000 1 0 11111 00000 1 0 1 0 111111 000000 11111 00000 1 0 01 1 111111 000000 11111 00000 00 10 11111 000001 11111 00000 11 000 1 1 0 111111 000000 11111 00000 11 11111 000001 0 11111 00000 11 001 0 1 0 11111 00000 0 1 1 0 11111 00000 1 00 11 11111 00000 1 1111 0 0000 11111 00000 1 11111 00000 11 00 1111 0000 Final road network 11111 00000 00 1 0 01 1 00 11111 00000 1 00 0 11 11111 00000 0 0011111 00000 00000000 111111 11110000 1 11 0 1111 1 11111 0000011 00 11 001111 1111 0000 1 11 0 00 0000 1111 00 11 0 0000 1 0000 11111 00000 11 00 0000 1111 11 00 1 1111 0 0000 11111 00000 11 00 0000 1111 11 00 1 1111 0 11111 00000 11 00 1111 0000 00 11 1 0 0000 1 1111 00000 0 0000 1 0 0 1111 1 1 0000 11111 11 00 1 1111 0 0000 11 00 0 1111 1 00 11 1 0 1 0 Example of labeling Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 13 / 25
  • 14. Introduction Methodology Results Conclusions Contents 1 Introduction 2 Methodology 3 Results 4 Conclusions Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 14 / 25
  • 15. Introduction Methodology Results Conclusions Results - QuickBird and TerraSAR-X images (Toulouse) (a) Optical image (b) Radar image (c) Ground-truth Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 15 / 25
  • 16. Introduction Methodology Results Conclusions Results - QuickBird image (a) Ground-truth (b) Optical result (c) Optical result Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 16 / 25
  • 17. Introduction Methodology Results Conclusions Results - TerraSAR-X image (a) Ground-truth (b) Radar result (c) Radar result Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 17 / 25
  • 18. Introduction Methodology Results Conclusions Results - Fusion (a) Ground-truth (b) Fusion result (c) Fusion result Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 18 / 25
  • 19. Introduction Methodology Results Conclusions Results - QuickBird and TerraSAR-X images (Toulouse) (a) Optical image result (b) Radar image result (c) Fusion result Figure: Correct detection in red, incorrect detection in black and absent roads in blue. Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 19 / 25
  • 20. Introduction Methodology Results Conclusions Results - QuickBird and TerraSAR-X images (Toulouse) (a) Optical image (b) Radar image (c) Ground-truth Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 20 / 25
  • 21. Introduction Methodology Results Conclusions Results - QuickBird and TerraSAR-X images (Toulouse) (a) Ground-truth (b) Fusion result (c) Fusion result Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 21 / 25
  • 22. Introduction Methodology Results Conclusions Results Table: Quantitative evaluation of the results. Data Completeness Correctness Quality R1 Optical image 41.44% 38.63% 24.99% Radar image 44.42% 50.82% 31.06% Fusion 67.39% 56.55% 44.40% R2 Optical image 45.21% 45.72% 31.06% Radar image 53.16% 43.77% 31.59% Fusion 62.69% 57.4% 42.78% Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 22 / 25
  • 23. Introduction Methodology Results Conclusions Contents 1 Introduction 2 Methodology 3 Results 4 Conclusions Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 23 / 25
  • 24. Introduction Methodology Results Conclusions Discussion and conclusions • We propose a new framework for road detection composed by three steps: • Low-level step (line detection with fusion of optical and radar data) • First high-level step (connected components) • Second high-level step (road sections and crossroads) • A hierarchical multi-scale framework that uses information from different sources (radar and optical images) • The quantitative results show the considerable improvement of detection using the fusion approach Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 24 / 25
  • 25. Introduction Methodology Results Conclusions Acknowledgements Thanks to FAPESP, CAPES (scholarship process number 0310-10-7) and CNPq Brazilian agencies for funding. Contact: talitaperciano@gmail.com Questions? Talita Perciano Road extraction and data fusion IGARSS 2011 26/07/2011 25 / 25