Name
Abstract | ||
|---|---|---|
Efficient matching methods are crucial in Image Processing. In the present paper we outline a novel algorithm of ”stable marriages” that is also fair and globally satisfactory for both populations to be paired. Our applicative examples here being stereo or motion we match primitives based on level lines segments, known for their robustness to contrast changes. They are separately extracted from images, and we draft the corresponding process too. Then for marriages to be organised each primitive needs to be given a preference list sorting potential mates in the antagonist image: parameters of the resemblance founding preferences are explained. Eventually all operators above are embedded within a recursive least squares method and results are shown and compared with a successful Hough based matching that we had used so far. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11559573_49 | ICIAR |
Keywords | Field | DocType |
preference list,efficient matching method,contrast change,applicative example,potential mate,marrying level line,novel algorithm,corresponding process,antagonist image,image processing,level lines segment,stable marriage | Least squares,Line segment,Pattern recognition,Computer science,Image processing,Algorithm,Sorting,Robustness (computer science),Artificial intelligence,Operator (computer programming),Recursive least squares filter,Stereo image | Conference |
Volume | ISSN | ISBN |
3656 | 0302-9743 | 3-540-29069-9 |
Citations | PageRank | References |
2 | 0.47 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikom Suvonvorn | 1 | 19 | 3.50 |
| Samia Bouchafa | 2 | 64 | 10.64 |
| Bertrand Zavidovique | 3 | 216 | 29.64 |