Name
Abstract | ||
|---|---|---|
Any notion of “closeness” in pattern matching should have the property that if A is close to B, and B is close to C, then A is close to C.Traditionally, this property is attained because ofthe triangle inequality(d(A, C) ≤ d(A, B) + d(B, C), where d represents a notion ofdistance). However, the full power of the triangle inequalityis not needed for this property to hold.Instead, a “relaxed triangle inequality” suffices, of the formd(A, C) ≤ c(d(A, B) + d(B, C)), where c is a constant that is not too large. In this paper, we show that one of the measures used fordistances between shapes in (an experimental version of) IBM‘s QBIC1(“Query by Image Content”) system (Niblack et al., 1993)satisfies a relaxed triangle inequality,although it does not satisfy the triangle inequality. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1023/A:1008023416823 | International Journal of Computer Vision |
Keywords | Field | DocType |
pattern matching,shape matching,triangle inequality,distance measure,image database | Distance measurement,Combinatorics,Minkowski inequality,Image content,Integer triangle,Triangle inequality,Image database,Pattern matching,Mathematics | Journal |
Volume | Issue | ISSN |
30 | 3 | 1573-1405 |
Citations | PageRank | References |
28 | 9.18 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ronald Fagin | 1 | 8808 | 2643.66 |
| Larry J. Stockmeyer | 2 | 4333 | 1077.31 |