A new merging process for data integration based ... - Thomas Devogele

layers is a well-known technique, which is efficient in terms of data storage and ... reasonably accurate individually, differences in input errors between the.
207KB taille 8 téléchargements 321 vues
A new merging process for data integration based on the discrete Fréchet distance

! "# "$ ( )

'

! % & *+

ABSTRACT ,

+ ( + ++ * . + / 0 *, ( + ( - / ( - ( * , -- - 0 ( (+ ( + *, / + ! - ( * ( ++ (( (( *

+

Key words 1

(

1

( (

(!

Introduction

, + / ,

+ 2 3* , -

3 - +

+ + - + 5 *6 23 / ( 0 9 0 * : 0

0 5

0

-

+

0 0

+

2 ( 0

0

-*

-

( + 0 + 5 / (

* %

- 4( /7

( ( 0 0 + - /

*, - -

0

-

/

*8( ++ 5 ++

++ -*

+

+

(

-

-

0

/ / ( 31 .323 ##; *

5 (

& -

+

9

+

+

--

+

' •

/ /

0 +

(



++

+

/

* ,

( 0 6

0

++ ++

*%

( -

9 +

/ / 0

-

• •

* 3 -

/7

+ /7

0 (

-

+ -

/ * : 0

* / /7

(

+ + -

*(* +

4 ( -

/7

/

*

( / /7

& + ( ( 0

##; *

+

(

3 : 0 ( -

0 *

## *3

( 1 ( (

/ / 0 / 0 *!

++

/ *(*

,

* +

" ( -

+ (

- 7

*! / +

(-

-

0

- *& 5 9* , + - /7

0 - * ,

-

+

0 + (

+ 23

, -- - 0 ( (- + (+ ! + -( + 0*3 "/ + + --

"

-

/

+

*

* * / /

++

++

+ 7

(

+ + /7

*

++ / /7 *,

+ +

+

* /

+

*

- 7

* / + ( *

* 3 *3 +

/ *, / =

+ /

- ( $ 0 ( (+ 0 9*

2

Overlay process

, 1( &%1

++ , 6 * 3 + *8 - + 4*? + 0 + 0 0 0( + + - ( *

2.1

+

*(* /

+* & 9

+( +

0 9 *(* +

+ "

*(* -

(

-

-

++ *(* -

+

Errors and corrections

& 0

+ -

/

--

-

+ +(

(

+

+/ -

1 ( 9 #; * ,

( ( /

* + +
+ 4

+

4 * / 0 >

(

* 0

*

5 E / /E ∈ ℜ

0

+ H E /H/E + ' = + α 'F G→F

!

β 'F

( *: -

!

9 ( ( + - (

+

6

*

0 ( -

"*

+ -

'

*D

-

*

! (

I

3 J

"

*

+ ! /

+

(

"*

( 0 + ( / A ( ### 0 " *** "* J* , ! / 0 + 0 (' *

"*

(< (< (

< "* *** "* − > )∀ ≠ − > < "* *** "* − > )∀ ≠

/ K

"*

+

"

/ 0 * !

5

*

*# *

"*7

L1.1 L2.1 !(

$6 L2

/ (

!

ε 0 ++

3.2

L1.7

4 +

-

+

(

/ 0

0.5 0 1 0.86 2.52 3.45 6.97 11.54 9.53 5.72

*

1.7 2.3 2 2.33 0.92 0.91 4.70 9.87 8.43 4.85

4.9 3.3 3 5.55 4.18 3.10 1.49 6.60 5.68 3.09

0

"*7

9.6 10.4 10.5 3.4 3.1 2.4 4 5 6 9.97 10.67 10.64 8.85 9.62 9.70 7.80 8.60 8.74 3.83 4.68 5.02 1.90 1.17 1.49 2.63 2.33 1.68 4.47 4.94 4.70

9.5 1.3 7 9.52 8.78 7.93 4.75 2.97 0.71 3.40

( -- 4 / ( 6 43 ( 6 ##$ ' ( 6 43 ( ! " ≤ ! " ≤ ! " D -- 4 ε - ( / -/ ( + +* + ( > + 4 - + - (* ( + ( 0 *

6 1.1 8 6.01 5.39 4.70 3.30 6.00 4.01 0.63

(

+

/ ( - ( +

*

Data matching of line's points /

!

/

4 0 +

4

!

(/

0 ( +

!

/ 0 0 ! +

% $'

0 -

? *

( 0 *

"*

/ 0 (

-

+

!

*



L2

/

(

0 +

L2.8

= 4

L2.j.x L2.j.y i. j 1 2 3 4 5 6 7

L1 L1.i.x L1.i.y 0 0.7 0.8 2.5 1.8 3.2 5.9 4.4 11.5 3.5 10 0.8 6.2 0.5

L1

*"

-

++( / ' "*"

/ 0

/ * *

"*7

0

= *=

0 "*"

*$

L

0 +

*>

+ / "*$

*>

"*>

!

( (

* %+ 0 ( 0

*, 0 / 0 (

"*=

*: *? - -

( *>

"*

• •

*

"*L

% &'

*

*

"*L

% ''

"*;

*L

"*;

*

"*L

"*

*

*

*L

*"

"*

"*

( + "*"

/ 0

*=

"*"

( + *"

"*"

"*"

*$

*

"*7

K * " *>

"*=

( +

"*;

"*7

"*=

/ 0

*=

*L

*$

*

"*$

*>

"*>

*

"*

*>

"*>

*>

"*

K * $ *>

"*$

/ 0

*

"*7

K * ;

(

0 9 ( *! 4 - + 0 / ' ( *> "*> 0 9 ( ( 0 9 ( "* *> * ( 0 9 ( ( / 0 "* * 6 +? / * " + * $ * ;* 3 ? ? / -+ / *!( $ 0 + 0 * "*7 0 * (

L1

L1.7

L2.1 !( ? •

L2

L2.8

L1.1

$ 9

+

*

+

"*7

0

-

/

'

, • • • 2

(

/ ' / 0 / 0 / 0 ( +

*

"* *> *"

+

4

-

"*$

"*>

"*

*=

"*"

+ "

+ 4

4 - * -

0

-- (* • •

( @

,

@

(

+ ( +

9 +

,

3.3

*

0 (

(* 4 +

*2 -

( !

/

-

+

*

Partial data matching of line's points

3

+ + +( > / *6 + *! 4 ( + +( > 0 0 / H "*>I "* $J* , + 9 + ( ! * 3 + H "* I "*>J H "* $I "* LJ + 0 !* ,

;

/ /

!

'

-!

• •

, ,

-

( 5 /( H

- !*

"



H

-!

(/ 0

H !

* 0 ? * , ( *

,

"*/ (

!

I

"*

J*

"*/ (

I

"*

J

"*/ (

"*/ (

I

"*

J

H

"*

*

-

+

L1.9 L2.17

L1 with new intermediary vertices L2 with new intermediary vertices L1.1 L2.1 !( %

> 4 - +( 0 0 ( ' B = {L2.1, L2.2 , …, L2.m-1}; E = {L2.m, L2.m-1 , …, L2.2}; dFdp = + ∞ ; For L2.j in B If dE(L1.1, L2.j) < dFdp then For L2.jj in E If j≤ jj and dE(L1.m, L2.jj) < dFdp then If dFd(,) < dFdp then {dFdp = dFd(,); L2.begin = L2.j ; L2.end = L2.jj ;}

!

++( / " 4 *=

"*;

>

4 +

* / + *$

"*#

4 *>

"*

/ 0 + 5 *""* 8 - *3 ? * "*> -!

*

"*

*L

#

"* "

*;

"* =

+ "*7 (

*

0 *"

"*

*#

"* $

( *=

*

"*L

&6 L

L"

L1.i.x L1.i.y 4.5 3.2 5.15 5.2 5.8 7.2 7.15 8.5 8.5 9.8 9.5 10 10.5 11.3 11.5 12.7 12.5 14

4 +

L2.j.x 4.6 L2.j.y 1.6 i.j 1 2 3 4 5 6 7 8 9

1 1.60 3.64 5.73 7.36 9.08 9.72 11.3 13.0 14.7

/ -

-

(

++(

>

4.8 2.6

3.4 1.8

3.4 2.8

4.1 3.8

5.05 5.15

6 6.5

7 7

8 8.25

9 9.5

10 11 12 13 13.2 13.8 14 9.75 10.5 11.9 13.2 12.6 12.6 11.7

2 0.67 2.62 4.71 6.35 8.10 8.77 10.4 12.1 13.7

3 1.78 3.82 5.91 7.68 9.49 10.2 11.8 13.5 15.2

4 1.17 2.97 5.01 6.82 8.66 9.44 11.0 12.7 14.4

5 0.72 1.75 3.80 5.60 7.44 8.22 9.86 11.5 13.2

6 2.03 0.11 2.18 3.95 5.79 6.58 8.22 9.93 11.5

7 3.62 1.55 0.73 2.31 4.14 4.95 6.58 8.29 9.92

8 4.55 2.58 1.22 1.51 3.18 3.91 5.54 7.26 8.90

9 6.14 4.17 2.44 0.89 1.63 2.30 3.94 5.66 7.30

10 7.74 5.77 3.94 2.10 0.58 0.71 2.34 4.06 5.70

11 8.55 6.65 4.91 3.11 1.50 0.56 1.63 3.31 4.93

( + ( - 4*,

-

3.4

/ 0

12 9.77 7.89 6.16 4.34 2.60 1.58 0.94 2.26 3.81

5

-

+ (

+ *

0 - 4

-

13 11.4 9.58 7.78 5.92 4.08 3.14 1.62 0.94 2.16

/

!

14 13.1 11.2 9.37 7.50 5.64 4.74 3.14 1.58 0.94

15 12.8 10.9 9.16 7.31 5.47 4.52 3.00 1.70 1.57

/ 0

(

16 13.2 11.3 9.65 7.81 5.99 5.02 3.55 2.30 1.91

17 12.7 10.9 9.35 7.56 5.82 4.81 3.52 2.69 2.75

*, + -- *

Data matching of polygon's points

/ -*: 0 + + + 9 0 * . + / * 3 + , - ( / " *3/ - + ! / 0 " / / " " + "*7E K "* "*7D K "* "*7ED K "*7D * % 0 + + 0' (

+ - ( - ( /



, +



, ,

• •

7E 4 + "* "

-

H !

"

"*

"*

I

7E

"*7E

"

*8 /

J

!

+

0 ?

? (

*,

-

+

*

+

"

(

"

P1 P2.9 P2.1

P2 P1.8

P1.1 !(

*3

"

*

(/ 0 ,

"*7ED I

"*7E

+ /( (+ - ( +

4

-

+

(

-

(

'6 L2 L1

4 + !

*#

+

,

?

4

-

(

++(

2 1

1.7 2.3

4.9 4

9.6 3.4

10.4 3.1

10.5 2.4

9.5 1.3

6 1.2

4 1.4

1 2 3 4 5 6 7 8

1 4.23 1.32 0.63 2.32 4.12 5.17 9.82 8.00

2 4.85 2.19 0.86 1.00 3.47 4.70 9.87 8.43

3 3.73 3.58 3.61 3.28 0.36 1.08 6.62 6.02

4 4.47 6.82 7.62 7.90 5.06 3.83 1.90 2.63

5 4.94 7.46 8.34 8.70 5.90 4.68 1.17 2.33

6 4.70 7.38 8.34 8.85 6.17 5.02 1.49 1.68

7 3.40 6.22 7.31 8.05 5.69 4.75 2.97 0.71

8 0.73 2.73 3.82 4.79 3.31 3.20 5.96 4.02

9 2.38 0.92 1.81 2.98 2.86 3.55 7.79 6.03

/ 0 0 * 0 ( /

0

( (-

+( "*7 7E 5 +-

*

4 / * -+ *

- +0 * ,

( +

9

9 !*9

!



(

( ;* 3 (

!

"

/ = 5 + / *

Weighting function of the merging process

,

• •

/ 0

L2.j.x L2.j.y

L1.i.x L1.i.y 6.2 0.5 3.3 0.8 2.2 1.6 1.7 3.3 4.6 4.2 5.9 4.4 11.5 3.5 10 0.8

,

4 +

, ,

+

= +0

0 (

α

+

-

9 +0 ( +

, -

**

*9

(

-9 +

"*7

*

"*7

α"*9

?

5 4 + +0

) = α *9 ×α

- -

+ α "* ×

*

( ( +

? 6

+

0'

"*7

+ α "*

*

'

*,

0 ( + 4 4* % ( A ( ### + * + +? 0 *, 0 ( + ( 0 ( + - * *, ( / * 0

0 ++( = ( ( / 9 +0 +* / $ * ! 4 - 0 -+ 0 ( + *; 0 + "* % + 0 ( + 0 + "* ! + 0 ( / / +0 *? ( ' α *> α * α *L 0 / = 0 ( ' α"*" α"*= *> / "* , ( ( ( + ( L* , 4 0 ( (( / * + ( ( + ?

@

@ ++( • •

*, L

9 ( (

2 /

/

+

"*"

9

-

+

++(

=

Wm

! -

"*=

*$

*>

*

)6 ( (L1.i L1.1 L1.2 L1.3 L1.4 L1.5 L1.5 L1.5 L1.6 L1.7

*

"

*

+-

'

weight L2.j L2.1 L2.2 L2.2 L2.3 L2.4 L2.5 L2.6 L2.7 L2.8

L1.i.x 0 0,8 1,8 5,9 11,5 11,5 11,5 10 6,2

4 * 0 ( +

L1.i y 0,7 2,5 3,2 4,4 3,5 3,5 3,5 0,8 0,5

L2.j x 0,5 1,7 1,7 4,9 9,6 10,4 10,5 9,5 6

L2.j.y 0 2,3 2,3 3,3 3,4 3,1 2,4 1,3 1,1

α1.k 0,80 0,80 0,80 0,80 0,27 0,27 0,27 0,80 0,80

-

α2.k 1,00 0,50 0,50 1,00 1,00 1,00 1,00 1,00 1,00

0 0 -

/

-

+?

+0

Merging line Lmk.x Lmk.y 0,28 0,31 1,15 2,42 1,76 2,85 5,34 3,79 10,00 3,42 10,63 3,18 10,71 2,63 9,72 1,08 6,09 0,83

+ / *;*

L1 L2 LM

+ - - (

!( L6 ( ( / ( ( 9 9 ( +*!( ; / + 6

"

/ -

( (( 9 0 ( (+ + 0 ( 4 - *

4 + 6 *? ( 9 6

6

+

(a)

(b) P1 P2 PM

L1 L2 LM !(

;6 ( ( / ( (- ( /

5

Joining process

?

( (7 - / - ( 9 ( + +( # 9 + +0 + LM

6*7EEI

,0 • 7 •

*7

*7

/

-

( (( (-

/

+

-

/ 7

-

*7

0

9

0

-

+

6*

' /

(

/ +(

+-

*,

( -

+*% # /*

0-

Li

# 4

-

6

Conclusion

,

-+ / 0 (

++

6 *%

(

(b)

+7

/ 0

0 / ++

( ((

+ /7

+

Li

(a) !(

6*7E *7*

( (

/ + (

!

(

/7 * ,

/7

*

(

/7

9

+ & - ( ! / 0 0 - ( * ' M +& 2 N %-> " --L> # & * " 4(2 ( + 3 " M ? N3 * & ?* " 1 ( ( 7 ? + ( ( %&6 , + 3 * ; * = --";; =" 1 ( ,* , M* * ## ( 6 3 1 / 0 3 , 'O 9 6 * 31 : ( --* ==L => 1 ( ,* &* 33* ##; 8 / ( M +2 ( + 3 ' 3' - / 23, N! * " * $ --* ==> =>" 1 ( 9 M*%* #; ?: 88 ' % ( + - ( ( % & $ --* = $ = * : !* A ( !* ## 2 6 (' %-- (6 , 'O 9 6 * 31 : ( --* >> L * 2 / P* 1 P* ##$ % 7 + ' 2 3Q 3 %3 3 --* "== "$ * &* 3- 3* 1 ( ,* ## & + 31 / ( ' 1 / & - (3 --* LL" LL;* 1* ##= & 5 + ( ( * ' % & --* ";; "# * 3* & &* / ,* " % 3, 6 + 6 + ( 6 2 + *> * --* > L * ,& + 0 ### % 7 ' , // 3 ( % &%1 9 & 8 ( F8 G % / ' -'Q Q 000* -* Q R 7 * .323 ##; %/ .323 2 1 & ( F8 G % / + ' -'Q Q * ( *( Q A ( :* ### 1 5 ' ( 2 6 ( 2 ( + M ? N3 --* LL ;#* $