Fundamentals of digital image processing
Fundamentals of digital image processing
Shape measures for content based image retrieval: a comparison
Information Processing and Management: an International Journal
An efficiently computable metric for comparing polygonal shapes
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Content-based trademark retrieval system using visually salient features
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
A pseudo-distance measure for 2D shapes based on turning angle
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 3)-Volume 3 - Volume 3
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Performance Guarantees for the TSP with a Parameterized Triangle Inequality
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
An Efficient Shape-Based Approach to Image Retrieval
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Relaxing stylus typing precision by geometric pattern matching
Proceedings of the 10th international conference on Intelligent user interfaces
Multimedia Tools and Applications
Information distance from a question to an answer
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Object detection by global contour shape
Pattern Recognition
New information distance measure and its application in question answering system
Journal of Computer Science and Technology
Exploring the performance limit of cluster ensemble techniques
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Information distance and its extensions
DS'11 Proceedings of the 14th international conference on Discovery science
Oblivious medians via online bidding
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Information Systems
Information distance between what I said and what it heard
Communications of the ACM
| Hi-index | 0.02 |
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.