constrained point correspondence
DESCRIPTION
Constrained Point Correspondence. Billy Timlen Mentor: Imran Saleemi. Point Correspondence Problem. Relating parts of one image to parts of another image Constraints: 1-1 Correspondence No intersections between correspondences Uses: Comparing two images side by side - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Constrained Point Correspondence](https://reader034.vdocuments.net/reader034/viewer/2022042718/56815ff6550346895dcef4c5/html5/thumbnails/1.jpg)
Constrained Point Correspondence
Billy TimlenMentor: Imran Saleemi
![Page 2: Constrained Point Correspondence](https://reader034.vdocuments.net/reader034/viewer/2022042718/56815ff6550346895dcef4c5/html5/thumbnails/2.jpg)
Relating parts of one image to parts of another image
Constraints:◦ 1-1 Correspondence◦ No intersections between correspondences
Uses:◦ Comparing two images side by side◦ Tracking and Detection
Point Correspondence Problem
![Page 3: Constrained Point Correspondence](https://reader034.vdocuments.net/reader034/viewer/2022042718/56815ff6550346895dcef4c5/html5/thumbnails/3.jpg)
Take key-points from each image to create bipartite graph◦ Bipartite graph: graph where between two sets of
nodes there are adjacencies between sets but none within the sets
Find the maximum flow of the network and apply linear constraint ◦ No intersections◦ Do these two processes simultaneously
Graph Theory Approach
![Page 4: Constrained Point Correspondence](https://reader034.vdocuments.net/reader034/viewer/2022042718/56815ff6550346895dcef4c5/html5/thumbnails/4.jpg)
Maximum Flow Network
![Page 5: Constrained Point Correspondence](https://reader034.vdocuments.net/reader034/viewer/2022042718/56815ff6550346895dcef4c5/html5/thumbnails/5.jpg)
Maximum Matching
![Page 6: Constrained Point Correspondence](https://reader034.vdocuments.net/reader034/viewer/2022042718/56815ff6550346895dcef4c5/html5/thumbnails/6.jpg)
Method of optimizing a linear function applying linear equality/inequality constraints
Want to maximize the number of correspondences while minimizing the number of intersections
Represent the linear constraint using a conflict graph which depicts all possible intersections
Linear Programming
![Page 7: Constrained Point Correspondence](https://reader034.vdocuments.net/reader034/viewer/2022042718/56815ff6550346895dcef4c5/html5/thumbnails/7.jpg)
Have a more correct method of comparing and contrasting images by comparing to other images
Possible use in tracking
Apply algorithm to other graph theory related problems
Use as a tool in other vision related fields
Goals
![Page 8: Constrained Point Correspondence](https://reader034.vdocuments.net/reader034/viewer/2022042718/56815ff6550346895dcef4c5/html5/thumbnails/8.jpg)
Created small data set of images of varying sizes and viewpoints
Function that creates a Bipartite Graph between key-points◦ Returns a matrix of all possible line segments and
weights
Function that creates a conflict matrix based on intersections
Accomplished So Far
![Page 9: Constrained Point Correspondence](https://reader034.vdocuments.net/reader034/viewer/2022042718/56815ff6550346895dcef4c5/html5/thumbnails/9.jpg)
Results So Far
![Page 10: Constrained Point Correspondence](https://reader034.vdocuments.net/reader034/viewer/2022042718/56815ff6550346895dcef4c5/html5/thumbnails/10.jpg)
Results So Far
![Page 11: Constrained Point Correspondence](https://reader034.vdocuments.net/reader034/viewer/2022042718/56815ff6550346895dcef4c5/html5/thumbnails/11.jpg)
![Page 12: Constrained Point Correspondence](https://reader034.vdocuments.net/reader034/viewer/2022042718/56815ff6550346895dcef4c5/html5/thumbnails/12.jpg)
Apply well-known algorithm to find the Maximum Flow of the network while minimizing cost◦ Looked at Hungarian Algorithm – Too specific,
can’t manipulate◦ Looked at Ford-Fulkerson Algorithm◦ Looking at Maximum Matching Algorithms
Apply Conflict Graph Simultaneously◦ Have preliminary results using a naïve approach
Still To Do