Tversky, A.,
Features of Similarity,
PsychR(84), No. 4, July 1977, pp. 327-352.
Feature Contrast model.
Relevant to database queries.
BibRef
7707
Price, K.E., and
Reddy, R.,
Matching Segments of Images,
PAMI(1), No. 1, January 1979, pp. 110-116.
BibRef
7901
Earlier:
Symbolic Image Registration and Change Detection,
DARPA77(28-31).
Matching, Regions.
Change Detection.
The original matching paper of this sequence. Image to image matching.
Using graph descriptions where nodes have descriptions (size, location, color,
shape, texture, etc.) and links to other nodes using relations
(above, below, adjacent, inside, etc.)
BibRef
Price, K.E.[Keith E.],
Reddy, R.,
Change Detection and Analysis in Multi-Spectral Images,
IJCAI77(619-625).
BibRef
7700
Earlier: A1 Only:
CMU-CS-TRDecember 1976.
BibRef
Ph.D.Thesis, CS.
Change Detection. Change detection, at the symbolic level applied to aerial images,
color ground level images, and SAR.
BibRef
Nevatia, R., and
Price, K.E.,
Locating Structures in Aerial Images,
PAMI(4), No. 5, September 1982, pp. 476-484.
BibRef
8209
USC Computer Vision
BibRef
Earlier:
ICPR78(686-690).
Matching, Lines. The matching procedure assumes that regions are extracted and property
values such as size, average intensity, position, and shape parameters
are computed. Additionally, relations between regions such as
relative position, adjacency, closeness, etc. are computed. This
description is given in the form of a semantic network where regions
are nodes and relations are the links. These systems find the
matching regions one at a time (without backtracking), with the order
either determined by the user or by sorting on some feature
(e.g. largest first). Features and relations are given three
different weights (strong, average and weak) that determines their
contribution to the match rating function.
BibRef
Sanfeliu, A., and
Fu, K.S.,
A Distance Measure between
Attributed Relational Graphs for Pattern Recognition,
SMC(13), No. 3, May/June 1983, pp. 353-362.
Graph edit matching process.
BibRef
8305
Sanfeliu, A.,
Fu, K.S.,
Prewitt, J.M.S.,
An Application of a Graph Distance Measure to the
Classification of muscle Tissue Patterns,
PRAI(1), 1987, pp. 17-42.
BibRef
8700
Eshera, M.A.,
Fu, K.S.,
A Graph Distance Measure for Image Analysis,
SMC(14), No. 3, May/June 1984, pp. 398-408.
See also Image Understanding System Using Attributed Symbolic Representation and Inexact Graph-Matching, An.
BibRef
8405
Eshera, M.A.,
Fu, K.S.,
A Similarity Measure Between Attributed Relational Graphs for
Image Analysis,
ICPR84(75-77).
BibRef
8400
Rosenfeld, A.,
Distances Between Fuzzy Sets,
PRL(3), 1985, pp. 229-233.
Fuzzy Sets.
BibRef
8500
Chaudhuri, B.B.,
Rosenfeld, A.,
On a Metric Distance Between Fuzzy-Sets,
PRL(17), No. 11, September 16 1996, pp. 1157-1160.
9611
BibRef
Sanfeliu, A.,
Structural Similarity Measures for Classifying 2D and 3D
Partially Hidden, Occluded and Deformed Objects,
ICPR86(1294-1296).
BibRef
8600
Feustel, C.D.,
Shapiro, L.G.,
The Nearest Neighbor Problem in an Abstract Metric Space,
PRL(1), No. 2, 1982, 125-128.
BibRef
8200
Shapiro, L.G., and
Haralick, R.M.,
A Metric for Comparing Relational Descriptions,
PAMI(7), No. 1, January 1985, pp. 90-94.
Distance Metric. The paper discusses a technique for generating a metric which
compares two relational structures. Some background is given, but
it does not mention some that are in use in real programs.
Structural_Error = (Relations in Image A not in Image B) +
(Relations in Image B not in Image A).
BibRef
8501
Shapiro, L.G.,
Relational Matching,
HPRIP-CV94(475-496).
BibRef
9400
Earlier:
With:
Haralick, R.M.,
AppOpt(26), No. 10, May 15, 1987, pp. 1845-1851.
Survey, Matching.
Matching, Survey. A survey (overview) of relational matching with only their references.
BibRef
Shapiro, L.G., and
Haralick, R.M.,
Organization of Relational Models for Scene Analysis,
PAMI(4), No. 6, November 1982, pp. 595-602.
An earlier 2-D version is under the 2-D analysis chapter. A large
data base can be organized by using a simple relational distance
metric, followed by either clustering by similar values of the
metric or a binary decision tree arrangement.
BibRef
8211
Haralick, R.M.,
Camps, O.I.[Octavia I.],
Shapiro, L.G., and
A Probabilistic Matching Algorithm for Computer Vision,
AMAI(10), 1994, pp. 85-124.
BibRef
9400
Shapiro, L.G., and
Lu, H.,
Accumulator-Based Inexact Matching Using Relational Summaries,
MVA(3), No. 3, 1990, pp. 143-158.
BibRef
9000
Shapiro, L.G.,
The Use of Numerical Relational Distance and Symbolic Differences
for Organizing Models and for Matching,
T3DMP86(255-270).
BibRef
8600
Earlier:
Using Symbolic Differences to Organize Relational Models,
CVPR839377-379).
BibRef
Boninsegna, M.,
Rossi, M.,
Similarity Measures In Computer Vision,
PRL(15), No. 12, December 1994, pp. 1255-1260.
BibRef
9412
Oflazer, K.,
Error Tolerant Retrieval of Trees,
PAMI(19), No. 12, December 1997, pp. 1376-1380.
IEEE Abstract. IEEE Top Reference.
WWW Version.
9712Actually matching of trees to find the closest one. Used in
machine translation, NL work.
BibRef
Tanaka, E.,
Takemasa, K.,
Masuda, S.,
A Distance Measure for Molecular Structures and Its Computing Method,
PRL(19), No. 3-4, March 1998, pp. 373-381.
9807
BibRef
Bunke, H.,
Shearer, K.,
A Graph Distance Metric Based on the Maximal Common Subgraph,
PRL(19), No. 3-4, March 1998, pp. 255-259.
9807
BibRef
Sim, D.G.,
Kwon, O.K.,
Park, R.H.,
Object Matching Algorithms Using Robust Hausdorff Distance Measures,
IP(8), No. 3, March 1999, pp. 425-429.
WWW Version.
BibRef
9903
Kwon, O.K.[Oh-Kyu],
Sim, D.G.[Dong-Gyu],
Park, R.H.[Rae-Hong],
Robust Hausdorff distance matching algorithms using pyramidal
structures,
PR(34), No. 10, October 2001, pp. 2005-2013.
WWW Version.
0108
BibRef
Earlier:
Pyramidal Robust Hausdorff Distance for Object Matching,
ICIP99(IV:88-92).
IEEE Abstract. IEEE Top Reference.
BibRef
Foggia, P.,
Sansone, C.,
Tortorella, F.,
Vento, M.,
Definition and Validation of a Distance Measure Between Structural
Primitives,
PAA(2), No. 3, 1999, pp. 215-227.
BibRef
9900
de Stefano, C.,
Foggia, P.,
Tortorella, F.,
Vento, M.,
A Distance Measure for Structural Descriptions Using Circular Arcs
as Primitives,
ICPR96(II: 290-294).
WWW Version.
9608(Univ. di Napoli FedericoII, I)
BibRef
Bunke, H.,
Guidobaldi, C.,
Vento, M.,
Weighted minimum common supergraph for cluster representation,
ICIP03(II: 25-28).
IEEE Abstract. IEEE Top Reference.
0312
BibRef
Wang, J.T.L.[Jason T.L.],
Zhang, K.Z.[Kai-Zhong],
Finding Similar Consensus Between Trees:
An Algorithm and a Distance Hierarchy,
PR(34), No. 1, January 2001, pp. 127-137.
WWW Version.
0010
BibRef
Wallis, W.D.,
Shoubridge, P.,
Kraetz, M.,
Ray, D.,
Graph distances using graph union,
PRL(22), No. 6-7, May 2001, pp. 701-704.
HTML Version.
0105
BibRef
Fernández, M.L.[Mirtha-Lina],
Valiente, G.[Gabriel],
A graph distance metric combining maximum common subgraph and minimum
common supergraph,
PRL(22), No. 6-7, May 2001, pp. 753-758.
HTML Version.
0105
BibRef
Miller, M.I.,
Younes, L.,
Group Actions, Homeomorphisms, and Matching: A General Framework,
IJCV(41), No. 1-2, January-February 2001, pp. 61-84.
WWW Version. Metrics on images for matching.
0105
BibRef
Jiang, X.Y.[Xiao-Yi],
Münger, A.[Andreas],
Bunke, H.[Horst],
On Median Graphs: Properties, Algorithms, and Applications,
PAMI(23), No. 10, October 2001, pp. 1144-1151.
IEEE Abstract. IEEE Top Reference.
WWW Version.
0110Extend the concept of a median to graphs.
BibRef
Le Saux, B.[Bertrand],
Bunke, H.[Horst],
Combining SVM and Graph Matching in a Bayesian Multiple Classifier
System for Image Content Recognition,
SSPR06(696-704).
WWW Version.
0608
BibRef
Huet, B.[Benoit],
Hancock, E.R.[Edwin R.],
Relational object recognition from large structural libraries,
PR(35), No. 9, September 2002, pp. 1895-1915.
WWW Version.
0206
BibRef
Huet, B.,
Hancock, E.R.,
Sensitivity Analysis for Object Recognition from Large Structural
Libraries,
ICCV99(1137-1143).
WWW Version.
BibRef
9900
Huet, B.[Benoit],
Hancock, E.R.[Edwin R.],
Fuzzy Relational Distance for Large-scale Object Recognition,
CVPR98(138-143).
IEEE Abstract. IEEE Top Reference.
BibRef
9800
Huet, B.[Benoit],
Hancock, E.R.[Edwin R.],
Line Pattern Retrieval Using Relational Histograms,
PAMI(21), No. 12, December 1999, pp. 1363-1370.
IEEE Abstract. IEEE Top Reference.
WWW Version.
0001
BibRef
Earlier:
Relational Histograms for Shape Indexing,
ICCV98(563-569).
WWW Version. Shape to retrieve line based patterns from a database.
BibRef
Huet, B.[Benoit],
Hancock, E.R.[Edwin R.],
Shape recognition from large image libraries by inexact graph matching,
PRL(20), No. 11-13, November 1999, pp. 1259-1269.
0001
BibRef
Earlier:
Inexact Graph Retrieval,
CBAIVL99(xx-yy).
BibRef
Huet, B.[Benoit],
Hancock, E.R.[Edwin R.],
Structurally Gated Pairwise Geometric Histograms for Shape Indexing,
BMVC97(xx-yy).
HTML Version.
0209
BibRef
Han, I.S.[In-Seo],
Yun, I.D.[Il Dong],
Lee, S.U.[Sang Uk],
Modified Hausdorff distance for model-based 3-D object recognition from
a single view,
JVCIR(15), No. 1, March 2004, pp. 27-43.
WWW Version.
0402
BibRef
Han, I.S.[In Seo],
Yun, I.D.[Il Dong],
Lee, S.U.[Sang Uk],
Model-based object recognition Using the Hausdorff Distance with
Explicit Pairing,
ICIP99(IV:83-87).
IEEE Abstract. IEEE Top Reference.
BibRef
9900
Guru, D.S.,
Kiranagi, B.B.[Bapu B.],
Nagabhushan, P.,
Multivalued type proximity measure and concept of mutual similarity
value useful for clustering symbolic patterns,
PRL(25), No. 10, 16 July 2004, pp. 1203-1213.
WWW Version.
0407
BibRef
Guru, D.S.,
Kiranagi, B.B.[Bapu B.],
Multivalued type dissimilarity measure and concept of mutual
dissimilarity value for clustering symbolic patterns,
PR(38), No. 1, January 2005, pp. 151-156.
WWW Version.
0410
BibRef
Wang, W.Q.[Wei-Qiong],
Xin, X.[Xiaolong],
Distance measure between intuitionistic fuzzy sets,
PRL(26), No. 13, 1 October 2005, pp. 2063-2069.
WWW Version.
0509
BibRef
Ling, H.B.[Hai-Bin],
Okada, K.[Kazunori],
An Efficient Earth Mover's Distance Algorithm for Robust Histogram
Comparison,
PAMI(29), No. 5, May 2007, pp. 840-853.
WWW Version.
0704
BibRef
Earlier:
EMD-L1: An Efficient and Robust Algorithm for Comparing Histogram-Based
Descriptors,
ECCV06(III: 330-343).
WWW Version.
0608
BibRef
And:
Diffusion Distance for Histogram Comparison,
CVPR06(I: 246-253).
WWW Version.
0606Simplifies original linear programming solution.
Reduce to O(n) from O(n^2)
BibRef
Meng, D.Y.[De-Yu],
Leung, Y.[Yee],
Xu, Z.B.[Zong-Ben],
Fung, T.[Tung],
Zhang, Q.F.[Qing-Fu],
Improving geodesic distance estimation based on locally linear
assumption,
PRL(29), No. 7, 1 May 2008, pp. 862-870.
WWW Version.
0804Isometric feature mapping; Geodesic distance estimation;
Neighborhood graph; Nonlinear dimensionality reduction
BibRef
Chávez, E.[Edgar],
Navarro, G.[Gonzalo],
Baeza-Yates, R.[Ricardo],
Marroquín, J.L.[José Luis],
Searching in metric spaces,
Surveys(33), No. 3, September 2001, pp. 273-321.
WWW Version.
0805
Survey, Distance Measures.
BibRef
Tian, Q.[Qi],
Xue, Q.[Qing],
Yu, J.[Jie],
Sebe, N.,
Huang, T.S.[Thomas S.],
Toward an improved error metric,
ICIP04(IV: 2199-2202).
WWW Version.
0505
BibRef
Kim, D.H.[Duck Hoon],
Yun, I.D.[Il Dong],
Lee, S.U.[Sang Uk],
A new attributed relational graph matching algorithm using the nested
structure of earth mover's distance,
ICPR04(I: 48-51).
WWW Version.
0409
BibRef
Climent, J.,
Aranda, J.,
Grau, A.[Antoni],
Sanfeliu, A.,
Low Cost Architecture for Structure Measure Distance Computation,
ICPR98(Vol II: 1592-1594).
WWW Version.
9808
BibRef
Azencott, R.,
Younes, L.,
Coldefy, F.,
A Distance for Elastic Matching in Object Recognition,
ICPR96(I: 687-691).
WWW Version.
9608(ENS Cachan CMLA, F)
BibRef
Chapter on Matching and Recognition Using Volumes, High Level Vision Techniques, Invariants continues in
Evidence Theory, Combination Techniques, Optimization Techniques .