graph-based deformable matching of 3d line segments with application in protein fitting 12 1 hang...
TRANSCRIPT
![Page 1: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/1.jpg)
1
Graph-based Deformable Matching of 3D Line Segments with
Application in Protein Fitting
HANG DOU1, MATTHEW L BAKER2, TAO JU1
Washington University in St. Louis1
Baylor College of Medicine2
![Page 2: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/2.jpg)
2
Deformation
Applications of Feature Matching
Data alignment
Co-segmentationReconstruction
![Page 3: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/3.jpg)
3
Our Application• Protein fitting• Protein: building blocks of life forms.
…
![Page 4: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/4.jpg)
4
Protein
Atomic structure Low-res structure
![Page 5: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/5.jpg)
5
Protein Fitting
Atomic structure (Cartoon Rendering)
Low-res structure (Volume)
Fitting result
![Page 6: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/6.jpg)
6
Protein Fitting• Secondary structure (alpha helix)
![Page 7: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/7.jpg)
7
Protein Fitting• Secondary structure (alpha helix)
![Page 8: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/8.jpg)
8
Protein Fitting• Secondary structure (alpha helix)
![Page 9: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/9.jpg)
9
Protein Fitting• Our method• Find feature (helix) correspondence
• Deform the protein guided by the helices correspondence
![Page 10: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/10.jpg)
10
Protein Fitting• Our method• Find feature (helix) correspondence
• Deform the protein guided by the helices correspondence
![Page 11: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/11.jpg)
11
Problem Statement
• Input:• Undirected line segments• |Source| <= |Target|
• Output:• One to one correspondence
• Matching Criteria:• Similar length• As rigid as possible deformation Source Target
![Page 12: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/12.jpg)
12
Problem Statement
• Input:• Undirected line segments• |Source| <= |Target|
• Output:• One to one correspondence
• Matching Criteria:• Similar length• As rigid as possible deformation Source Target
![Page 13: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/13.jpg)
13
Problem Statement
• Input:• Undirected line segments• |Source| <= |Target|
• Output:• One to one correspondence
• Matching Criteria:• Similar length• As rigid as possible deformation Source Target
![Page 14: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/14.jpg)
14
Previous Work• Matching points: Lots of work• [Fitzgibbon 2003], [Angulov 2004], [Leordeanu 2005], [Chang 2009], [Chertok 2010], [Duchenne 2011], [TAM 2014], ….
![Page 15: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/15.jpg)
15
Previous Work• Matching line segments: very few work• [Abeysinghe 2010]
TargetSource
![Page 16: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/16.jpg)
16
Previous Work• Matching line segments: very few work• [Abeysinghe 2010]• Need line segments forming rigid body clusters
TargetSource
![Page 17: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/17.jpg)
17
Previous Work• Matching line segments: very few work• [Abeysinghe 2010]• Need line segments forming rigid body clusters• Based on a clique-finding algorithm
TargetSource Matching Result
![Page 18: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/18.jpg)
18
Our Work• A novel method for matching 3D line segments• Allowing fully non-rigid deformations
• Technical contributions• Formulating the problem as graph matching• Improved graph matching using continuous relaxation
![Page 19: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/19.jpg)
19
Our Work• A novel method for matching 3D line segments• Allowing fully non-rigid deformations
• Technical contributions• Formulating the problem as graph matching• Improved graph matching using continuous relaxation
![Page 20: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/20.jpg)
20
Background: Graph Matching• Input• The two graphs: source and target• Affinity score (between node pairs and edge pairs)• Node pair score: fnode(si, tj)• Edge pair score: fedge({si, sj}, {tk, tl})
• Goal• Find mapping π: S -> T that maximize:
• Subject to mapping constraints
Source Target
s2
s1
t2
t1
fnode
fedge
![Page 21: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/21.jpg)
21
Our Graph Construction• Naïve method• Graph nodes:• One undirected segment one node
𝑠1
𝑠2𝑠3
Source
𝑡1
𝑡 2 𝑡 3
𝑡 4
Target
s3s2
s1
t2
t1
t4
t3
![Page 22: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/22.jpg)
22
Our Graph Construction• Naïve method• Graph nodes:• One undirected segment one node
• Node pair affinity• Length similarity
𝑠1
𝑠2𝑠3
Source
𝑡1
𝑡 2 𝑡 3
𝑡 4
Target
s3s2
s1
t2
t1
t4
t3
![Page 23: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/23.jpg)
23
Our Graph Construction• Naïve method• Graph nodes:• One undirected segment one node
• Node pair affinity• Length similarity
𝑠1
𝑠2𝑠3
Source
𝑡1
𝑡 2 𝑡 3
𝑡 4
Target
s3s2
s1
t2
t1
t4
t3
![Page 24: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/24.jpg)
24
Our Graph Construction• Naïve method• Graph nodes:• One segment one node
• Node pair affinity• Length similarity
• Edge pair affinity• Rigidity in deformation
𝑠1
𝑠2𝑠3
Source
𝑡1
𝑡 2 𝑡 3
𝑡 4
Target
s3s2
s1
t2
t1
t4
t3
![Page 25: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/25.jpg)
25
Our Graph Construction• Naïve method• Graph nodes:• One undirected segment one node
• Node pair affinity• Length similarity
• Edge pair affinity• Rigidity in deformation
𝑠1
𝑠2𝑠3
Source
𝑡1
𝑡 2 𝑡 3
𝑡 4
Target
s3s2
s1
t2
t1
t4
t3
![Page 26: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/26.jpg)
26
Our Graph Construction• Issue of ambiguity:
Matching Source Matching Result 1
𝑠1
𝑠2𝑠3
Matching Result 2
𝑠1
𝑠2𝑠3
𝑠1
𝑠2𝑠3
𝑠4 𝑠4
![Page 27: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/27.jpg)
27
Our Graph Construction• Issue of ambiguity:
Matching Source Matching Result 1
𝑠1
𝑠2𝑠3
Matching Result 2
𝑠1
𝑠2𝑠3
𝑠1
𝑠2𝑠3
𝑠4 𝑠4
![Page 28: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/28.jpg)
28
Our Graph Construction• Issue of ambiguity:
Matching Source Matching Result 1
𝑠1
𝑠2𝑠3
Matching Result 2
𝑠1
𝑠2𝑠3
𝑠1
𝑠2𝑠3
𝑠4 𝑠4
![Page 29: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/29.jpg)
29
Our Graph Construction• Issue of ambiguity:
Matching Source Matching Result 1
𝑠1
𝑠2𝑠3
Matching Result 2
𝑠1
𝑠2𝑠3
𝑠1
𝑠2𝑠3
𝑠4 𝑠4
![Page 30: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/30.jpg)
30
Our Graph Construction• Improved graph construction• Graph nodes:• Source• One undirected segment one node
• Target• One undirected segment two nodes
𝑠1
𝑠2 𝑠3
Source Target
𝑡 3
𝑡1
𝑡 2𝑡 2𝑡 3
𝑡1𝑡 4
𝑡 4
S3S2
S1
T1
T2
T3
T4
![Page 31: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/31.jpg)
31
Our Graph Construction• Improved graph construction• Graph nodes:• Source• One undirected segment one node
• Target• One undirected segment two nodes
• Node Affinity• Length similarity
𝑠1
𝑠2 𝑠3
Source Target
𝑡 3
𝑡1
𝑡 2𝑡 2𝑡 3
𝑡1𝑡 4
𝑡 4
S3
S1
S2
T1
T3
T4
T2
![Page 32: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/32.jpg)
32
Our Graph Construction• Improved graph construction• Graph nodes:• Source• One undirected segment one node
• Target• One undirected segment two nodes
• Node Affinity• Length similarity
• Edge Affinity• Rigidity in deformation
𝑠1
𝑠2 𝑠3
Source Target
𝑡 3
𝑡1
𝑡 2𝑡 2𝑡 3
𝑡1𝑡 4
𝑡 4
S3S2
S1
T1
T2
T3
T4
![Page 33: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/33.jpg)
33
Our Graph Construction• Improved graph construction• Graph nodes:• Source• One undirected segment one node
• Target• One undirected segment two nodes
• Node Affinity• Length similarity
• Edge Affinity• Rigidity in deformation
𝑠1
𝑠2 𝑠3
Source Target
𝑡 3
𝑡1
𝑡 2𝑡 2𝑡 3
𝑡1𝑡 4
𝑡 4
S3S2
S1
T1
T2
T3
T4
![Page 34: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/34.jpg)
34
Rigidity Measure• Geometric relation descriptor• Encode each pair of line segments (s, s’) as a vector: (, , )• Rigidity between two pairs are differences in the vector
𝛼𝛽
𝜃
𝑑𝑖𝑠𝑡 (𝐬 ,𝐬 ′)𝐬 𝐬 ′
![Page 35: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/35.jpg)
35
Our Graph Construction• No more ambiguity
𝑠1
𝑠2 𝑠3
Matching Source Matching Result
𝑡1
𝑡 2𝑡 2𝑡 3
𝑡1𝑡 4
𝑡 4
𝑡 3
![Page 36: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/36.jpg)
36
Our Work• A novel method for matching 3D line segments• Allowing fully non-rigid deformations
• Technical contributions• Formulating the problem as graph matching• Improved graph matching using continuous relaxation
![Page 37: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/37.jpg)
37
Our Work• A novel method for matching 3D line segments• Allowing fully non-rigid deformations
• Technical contributions• Formulating the problem as graph matching• Improved graph matching using continuous relaxation
![Page 38: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/38.jpg)
38
Solve Graph Matching (review)• Formulate graph matching as quadratic assignment• Encode graph affinities in a matrix M
s1,t1
s1,t1
Affinity Matrix (M)
s3,t3
s3,t3…. ….
….
…. s3s2
s1
t2
t1
t4
t3
Source Target
![Page 39: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/39.jpg)
39
Solve Graph Matching (review)• Formulate graph matching as quadratic assignment• Encode graph affinities in a matrix M
s1,t1
s1,t1
Affinity Matrix (M)
s3,t3
s3,t3…. ….
….
…. s3s2
s1
t2
t1
t4
t3
Source Target
![Page 40: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/40.jpg)
40
Solve Graph Matching (review)• Formulate graph matching as quadratic assignment• Encode graph affinities in a matrix M• Matching goal:
s3s2
s1
t2
t1
t4
t3
Source Target
s1,t1
s1,t1
Affinity Matrix (M)
s3,t3
s3,t3…. ….
….
….
![Page 41: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/41.jpg)
41
Solve Graph Matching (review)• Formulate graph matching as quadratic assignment• Encode graph affinities in a matrix M• Matching goal:• Find assignment vector x {0,1}|S|x|T|
• Maximize: xT M x (equation 1)• Subject to mapping constraints. Mapping constraint
Integer constraint
![Page 42: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/42.jpg)
42
Solve Graph Matching (review)• Solve quadratic assignment• Combinatorial optimization• Usually time consuming.
• Continuous relaxation• Compute confidence vector X’ R|S|x|T| without some or all the constraints • X’(a) is the confident of the match a (Si -> Tj)
• Binarize X’ to obtain assignment vector X {0,1}|S|x|T| with all constraints• X(a) is 1 if a is an accepted match and 0 otherwise.• Widely used greedy approach [Leordeanu 2005]: sequentially pick matches with descending
confidence, while avoiding conflict based on mapping constraints.
![Page 43: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/43.jpg)
43
Binarize Confidence Vector (Review)
TargetSource
0.4
0
Confidence Vector
![Page 44: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/44.jpg)
44
Binarize Confidence Vector (Review)
0.4
0
Confidence VectorTargetSource
![Page 45: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/45.jpg)
45
Binarize Confidence Vector (Review)
0.66
0
TargetSource
0.4
0
Confidence Vector
![Page 46: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/46.jpg)
46
Binarize Confidence Vector (Review)
0.66
0
TargetSource
0.4
0
Confidence Vector
![Page 47: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/47.jpg)
47
Binarize Continuous Solution (Review)
0.66
0
TargetSource
0.4
0
Confidence Vector
![Page 48: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/48.jpg)
48
Binarize Confidence Vector (Review)
Correct Matches
TargetSource
0.66
0
0.4
0
Confidence Vector
![Page 49: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/49.jpg)
49
Our Continuous Relaxation• Key idea• Only takes the assignments with high confidence• Formulate a smaller matching problem, constrained by the chosen
assignments
• Iterate until we find all the matches• Compute confidence vector (with any chosen continuous method)• Pick matches whose relative confidence (w.r.t. the highest confidence)
value is above a threshold r• Reconstruct the (smaller) affinity matrix with remaining matches• Edge affinity of already picked segments is added to the diagonal of the new matrix
![Page 50: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/50.jpg)
50
0.66
0
Confidence vector in 1st iteration
Our Continuous Relaxation
TargetSource
r = 1
![Page 51: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/51.jpg)
51
Our Continuous Relaxation
0.66
0
r = 1
Confidence vector in 1st iteration
TargetSource
![Page 52: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/52.jpg)
52
Our Continuous Relaxation
0.95
0
r = 1
Confidence vector in 2nd iteration
TargetSource
![Page 53: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/53.jpg)
53
Our Continuous Relaxation
0.95
0
r = 1
Confidence vector in 2nd iteration
TargetSource
![Page 54: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/54.jpg)
54
Our Continuous Relaxation
0.95
0
r = 1
Confidence vector in 3rd iteration
TargetSource
![Page 55: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/55.jpg)
55
Our Continuous Relaxation
0.95
0
r = 1
Confidence vector in 3rd iteration
TargetSource
![Page 56: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/56.jpg)
56
Our Continuous Relaxation
0.71
0
r = 1
Confidence vector in 4th iteration
TargetSource
![Page 57: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/57.jpg)
57
Our Continuous Relaxation
0.71
0
r = 1
Confidence vector in 4th iteration
TargetSource
![Page 58: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/58.jpg)
58
Our Continuous Relaxation
r = 1
Confidence vector in 5th iteration
TargetSource
0.99
0
![Page 59: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/59.jpg)
59
Our Continuous Relaxation
0.99
0
r = 1
Confidence vector in 5th iteration
TargetSource
![Page 60: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/60.jpg)
60
0.99
0
Our Continuous Relaxation
r = 1
Confidence vector in 6th iteration
TargetSource
![Page 61: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/61.jpg)
61
0.99
0
Our Continuous Relaxation
r = 1
Confidence vector in 6th iteration
TargetSource
![Page 62: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/62.jpg)
62
Our Continuous Relaxation
Correct Matching Result
TargetSource
![Page 63: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/63.jpg)
63
Experiment Result• Synthetic data and authentic data• Synthetic data: • generated by thin plate spline (TPS) deformation.
• Authentic data: • 16 pairs of proteins from Protein Data Bank.
• Accuracy and function score• Matching accuracy: • ratio of correct matches over all matches.
• Total affinity ratio: • Function score (xT M x) ratio of our method over a benchmark method [Leordeanu 2005].
![Page 64: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/64.jpg)
64
Experiment Result• Synthetic data• Pick one protein as the matching source• Deform the source line segments at different level of normalized bending
energies as matching targets
Source Bend Energy = 0.2 Bend Energy = 0.7
![Page 65: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/65.jpg)
65
Experiment Result• Synthetic data
Leordeanu[2005]Our, r = 0.6
Our, r = 0.3
Our, r = 1.0
Bending Energy
Tota
l Affi
nity
Rati
o
![Page 66: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/66.jpg)
66
Experiment Result• Synthetic data
Bending Energy
Mat
chin
g Ac
cura
cy
Leordeanu[2005] Our, r = 0.3 Our, r = 0.6
Our, r = 1.0 Abeysinghe[2010]
![Page 67: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/67.jpg)
67
Experiment Result• Synthetic data
Bending Energy
Mat
chin
g Ac
cura
cy
Leordeanu[2005] Our, r = 0.3 Our, r = 0.6
Our, r = 1.0 Abeysinghe[2010]
![Page 68: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/68.jpg)
68
Experiment Result• Authentic data:
1sx4-A 1ss8-A
Source Target(Our) Target(Leordeanu) Target(Abeysinghe)
![Page 69: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/69.jpg)
69
Experiment Result• Authentic data:
Protein
Mat
chin
g Ac
cura
cy
Leordeanu Our, r = 1.0, 0.6, 0.3 Abeysinghe
![Page 70: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/70.jpg)
70
Conclusion• An algorithm for finding correspondence between two
sets of 3D line segments• Allowing fully non-rigid deformations
• Technical contributions• Formulating the problem as graph matching• Solve matching problem using a iterative continuous-discrete paradigm
• Validation• Test on both synthetic and authentic data
![Page 71: Graph-based Deformable Matching of 3D Line Segments with Application in Protein Fitting 12 1 HANG DOU 1, MATTHEW L BAKER 2, TAO JU 1 1 1 Washington University](https://reader036.vdocuments.mx/reader036/viewer/2022062519/5697bfaa1a28abf838c9a999/html5/thumbnails/71.jpg)
71
Questions?