13.3 Graph Matching and Relaxation

Chapter Contents (Back)
Object Recognition. Matching, Graphs. Graph Matching.

13.3.1 Graph Matching Theoretical Issues

Chapter Contents (Back)
Constraint Satisfaction. Matching, Graphs. Graph Matching, Theory. Generally these papers restrict the problem to an exact matching problem, which is the easy case.

Corneil, D.G., and Gotlieb, C.C.,
An Efficient Algorithm for Graph Isomorphism,
JACM(17), No. 1, January 1970, pp. 51-64. Graph Isomorphism. This technique for isomorphism derived two graphs from the input graphs. The original graphs are isomorphic only if the derived graphs are identical. The algorithm, complexity O(N^n ) is more efficient than the early renumbering techniques that were O(N!), because the power is usually no more than 5 (for some special cases, usually it is lower). This technique applies to non-directed graphs and was not extended to bi-directional graphs, except as a part of an O(N!) algorithm. BibRef 7001

Corneil, D.G., and Kirkpatrick, D.G.,
A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem,
SIAM_JC(9), 1980, pp. 281-297. BibRef 8000

Shaw, A.C.,
Parsing of Graph-Representable Pictures,
JACM(17), No. 3, July 1970, pp. 453-481. BibRef 7007

Shaw, A.C.[Alan C.],
A Formal Picture Description Scheme as a Basis for Picture Processing Systems,
InfoControl(14), No. 1, January 1969, pp. 9-52. BibRef 6901

Mallgren, W.R., Shaw, A.C.,
Graphical transformations and hierarchic picture structures,
CGIP(8), No. 2, October 1978, pp. 237-258.
WWW Version. 0501 BibRef

Hopcroft, J.E., and Tarjan, R.E.,
Isomorphism of Planar Graphs,
CCComp(131-152). 1972. BibRef 7200

Tarjan, R.E.,
Depth First Search and Linear Graph Algorithms,
SIAM_JC(1), No. 1, 1972, pp 146-160. BibRef 7200

Miller, R.E., and Thather, J.W., (Eds.),
Complexity of Computer Computation,
Indexed as CCComp1972. BibRef 7200

Pfaltz, J.L.,
Graph Structures,
JACM(19), No. 3, July 1972, pp. 411-422. BibRef 7207

Berztiss, A.T.,
A Backtrack Procedure for Isomorphism of Directed Graphs,
JACM(20), No. 3, July, 1973, pp. 365-372. Graph Isomorphism. This algorithm, applied to directed graphs, first transforms the graph representation into a linear string that describes the connections between nodes. These strings start from strings describing each node and combine to form a single string describing the entire graph. From the combination rules a matching string is formed by a tree search procedure that adds one node at a time and retains only those possible strings that match the pattern. This technique proved effective for most real graphs even though it does not escape the possible worst cases. BibRef 7307

Ullmann, J.R.,
An Algorithm for Subgraph Isomorphism,
JACM(23), No. 1, January 1976, pp. 31-42. Graph Isomorphism. BibRef 7601

Ullmann, J.R.,
Associating Parts of Patterns,
InfoControl(9), 1966, pp. 583-601. BibRef 6600

Berge, C.,
Graphs and Hypergraphs,
North HollandAmsterdam, 1973. BibRef 7300

Bron, C., and Kerbosch, J.,
Algorithm 457: Finding All Cliques in an Undirected Graph (H),
CACM(16), 1973. BibRef 7300

Osteen, R., and Tou, J.T.,
A Clique-Directed Algorithm Based on Neighborhoods in Graphs,
CIS(2), No. 4, December 1973, pp. 257-268. BibRef 7312

van Scoy, F.L.,
The Parallel Recognition of Classes of Graphs,
TC(29), 1980, pp. 563-570. BibRef 8000

Ghahraman, D.E., Wong, A.K.C., Au, T.,
Graph Optimal Monomorphism Algorithm,
SMC(10), April 1980, pp. 181-188. BibRef 8004

Ghahraman, D.E., Wong, A.K.C., Au, T.,
Graph Monomorphism Algorithms,
SMC(10), 1980, pp. 189-196. BibRef 8000

Wong, A.K.C., and Ghahraman, D.E.,
Random Graphs: Structural-Contextual Dichotomy,
PAMI(2), No. 4, July 1980, pp. 341-348. BibRef 8007

Wong, A.K.C., You, M.,
Entropy and Distance of Random Graphs with Application to Structural pattern Recognition,
PAMI(7), No. 5, September 1985, pp. 599-609. BibRef 8509
Earlier: A2, A1:
An Algorithm for Graph Optimal Isomorphism,
ICPR84(316-319). BibRef

Bhat, K.V.S.,
Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism Testing,
SMC(10), 1980, pp. 610-615. BibRef 8000

Forgy, C.L.,
Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem,
AI(19), No. 1, September 1982, pp. 17-37.
WWW Version. Precompute the network to make matching fast. Intended for production rule matching. BibRef 8209

Fowler, G., Haralick, R.M., Gray, F.G., Feustel, C., and Grinstead, C.,
Efficient Graph Automorphism by Vertex Partitioning,
AI(21), No. 1-2, March 1983, pp. 245-269.
HTML Version. BibRef 8303

Mehlhorn, K.,
Data Structure and Algorithms 2: Graphs Algorithms and NP-Completeness,
Springer-Verlag1984. BibRef 8400 Book BibRef

Quinn, M.J., Deo, N.,
Parallel Graph Algorithms,
Surveys(16), No. 3, September 1984, pp. 319-348. Survey, Graph Matching. BibRef 8409

Nyo, H.L., Suk, M.,
A Polynomial Time Algorithm for Subpattern Matching,
PIEEE(74), 1986, pp. 375-377. BibRef 8600

Galil, Z.,
Efficient Algorithms for Finding Maximum Matching in Graphs,
Surveys(18), No. 1, March 1986, pp. 23-38. See also String Matching in Real Time. BibRef 8603

Thathachar, M.A.L., and Sastry, P.S.,
Relaxation Labeling with Learning Automata,
PAMI(8), No. 2, March 1986, pp. 256-268. BibRef 8603

Davies, E.R.,
The Minimal Match Graph and its Use to Speed Identification of Maximal Cliques,
SP(22), 1991, pp. 329-343. BibRef 9100

Davies, E.R.,
Alternative to Abstract Graph Matching for Locating Objects from Their Salient Features,
IVC(9), No. 4, August 1991, pp. 252-261.
WWW Version. BibRef 9108

Simic, P.,
Constrained Nets for Graph matching and Other Quadratic Assignment Problems,
NeurComp(3), 1991, pp. 268-291. BibRef 9100

Almohamad, H.A., and Duffuaa, S.O.,
A Linear Programming Approach fo the Weighted Graph Matching Problem,
PAMI(15), No. 5, May 1993, pp. 522-525.
IEEE Abstract. IEEE Top Reference.
WWW Version. Linear Programming. BibRef 9305

Seong, D.S., Choi, Y.K., Kim, H.S., Park, K.H.,
An Algorithm For Optimal Isomorphism Between 2 Random Graphs,
PRL(15), No. 4, April 1994, pp. 321-327. BibRef 9404

Jeavons, P.G., Cooper, M.C.,
Tractable Constraints on Ordered Domains,
AI(79), No. 2, January 1996, pp. 327-339.
WWW Version. By ordering the domain it is possible to limit the constraints to pairwise constraints, then get a linear solution. Used in See also Linear-time algorithms for testing the realisability of line drawings of curved objects. BibRef 9601

Pedrycz, W.,
Classification of Relational Patterns as a Decomposition Problem,
PRL(17), No. 1, January 10 1996, pp. 91-99. BibRef 9601

Pedrycz, W.,
Neurocomputations in relational systems,
PAMI(13), No. 3, March 1991, pp. 289-297.
IEEE Abstract. IEEE Top Reference.
WWW Version. 0401 BibRef

Shoukry, A., Aboutabl, M.,
Neural-Network Approach for Solving the Maximal Common Subgraph Problem,
SMC-B(26), No. 5, October 1996, pp. 785-790.
IEEE Top Reference. Hopfield network. BibRef 9610

Cucka, P., Netanyahu, N.S., and Rosenfeld, A.,
Learning in Navigation: Goal Finding in Graphs,
PRAI(10), 1996, pp. 429-446. BibRef 9600

Jumarie, G.,
Informational Similarity of Graphs in Syntactic Pattern Recognition,
PRL(15), 1994, pp. 1177-1181. BibRef 9400

Owolabi, O.,
A Graph Canonization Method For Pattern Recognition,
PRL(12), 1991, pp. 701-705. BibRef 9100

Seong, D.S., Kim, H.S., Park, K.H.,
Incremental Clustering of Attributed Graphs,
SMC(23), 1993, pp. 1399-1411. BibRef 9300

Goldman, R.P., Charniak, E.,
A language for construction of belief networks,
PAMI(15), No. 3, March 1993, pp. 196-208.
IEEE Abstract. IEEE Top Reference.
WWW Version. 0401 BibRef

Buckley, M., Yang, J.,
Regularized Shortest Path Extraction,
PRL(18), No. 7, July 1997, pp. 621-629. 9711Shortest path through a graph. BibRef

Barbehenn, M.,
A Note on the Complexity of Dijkstras Algorithm for Graphs with Weighted Vertices,
TC(47), No. 2, February 1998, pp. 263-263. 9803 BibRef

Suganthan, P.N., Yan, H., Teoh, E.K., Mital, D.P.,
Optimal Encoding of Graph Homomorphism Energy Using Fuzzy Information Aggregation Operators,
PR(31), No. 5, May 1998, pp. 623-639.
WWW Version. 9805 BibRef

Messmer, B.T.[Bruno T.], Bunke, H.[Horst],
A New Algorithm for Error Tolerant Subgraph Isomorphism Detection,
PAMI(20), No. 5, May 1998, pp. 493-504.
IEEE Abstract. IEEE Top Reference.
WWW Version. 9806 BibRef
Earlier:
Fast error-correcting graph isomorphism based on model precompilation,
CIAP97(I: 693-700).
WWW Version. 9709 BibRef
Earlier: A2, A1:
Efficient attributed graph matching and its application to image analysis,
CIAP95(44-55).
WWW Version. 9509 BibRef

Wang, J.T.L., Shapiro, B.A., Shasha, D., Zhang, K., and Currey, K.M.,
An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees,
PAMI(20), No. 8, August 1998, pp. 889-895.
IEEE Abstract. IEEE Top Reference.
WWW Version. BibRef 9808

Abdulrahim, M.[Mohammad], Misra, M.[Manavendra],
A Graph Isomorphism Algorithm for Object Recognition,
PAA(1), No. 3, 1998, pp. xx-yy. BibRef 9800

Messmer, B.T., Bunke, H.,
A decision tree approach to graph and subgraph isomorphism detection,
PR(32), No. 12, December 1999, pp. 1979-1998.
WWW Version. BibRef 9912

Bunke, H.,
Error Correcting Graph Matching: On the Influence of the Underlying Cost Function,
PAMI(21), No. 9, September 1999, pp. 917-922.
IEEE Abstract. IEEE Top Reference.
WWW Version. For any cost function, there are an infinite number of others that lead to the same optimal error correcting matching. BibRef 9909

Perlovsky, L.I.,
Conundrum of Combinatorial Complexity,
PAMI(20), No. 6, June 1998, pp. 666-670.
IEEE Abstract. IEEE Top Reference.
WWW Version. 9807 BibRef

Miller, D.A.[Douglas A.], Zucker, S.W.[Steven W.],
Cliques, computation, and computational tractability,
PR(33), No. 4, April 2000, pp. 535-542.
WWW Version. 0002 BibRef

Luo, B., Hancock, E.R.,
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition,
PAMI(23), No. 10, October 2001, pp. 1120-1136.
IEEE Abstract. IEEE Top Reference.
WWW Version. 0110 BibRef
Earlier:
Symbolic Graph Matching Using the EM Algorithm and Singular Value Decomposition,
ICPR00(Vol II: 141-144).
WWW Version.
HTML Version. 0009 See also Multiple Line-Template Matching with the EM Algorithm. See also Registering Incomplete Radar Images Using the EM Algorithm. BibRef

Luo, B., Hancock, E.R.,
A robust eigen-decomposition framework for inexact graph-matching,
CIAP01(465-470).
IEEE Top Reference. 0210 BibRef

Carcassoni, M.[Marco], Hancock, E.R.[Edwin R.],
Weighted Graph-Matching Using Modal Clusters,
CAIP01(142 ff.).
HTML Version. 0210 BibRef

Dickinson, S.J.[Sven J.], Pelillo, M.[Marcello], Zabih, R.[Ramin],
Introduction to the Special Section on Graph Algorithms and Computer Vision,
PAMI(23), No. 10, October 2001, pp. 1049-1052.
IEEE Abstract. IEEE Top Reference.
WWW Version. 0110 BibRef

Ostergard, P.,
A Fast Algorithm for the Maximum Clique Problem,
DiscAppMath(120), 2002, pp. 197-207. BibRef 0200

Wang, J.T.L.[Jason T.L.], Zhang, K.Z.[Kai-Zhong], Chang, G.[George], Shasha, D.[Dennis],
Finding approximate patterns in undirected acyclic graphs,
PR(35), No. 2, February 2002, pp. 473-483.
WWW Version. 0201 BibRef

Raphael, C.[Christopher],
Coarse-to-Fine Dynamic Programming,
PAMI(23), No. 12, December 2001, pp. 1379-1390.
IEEE Abstract. IEEE Top Reference.
WWW Version. 0112 Dynamic Programming. Applied to mine detection. Generalize dynamic programming to hierarchical system. BibRef

Fernandez-Madrigal, J.A.[Juan-Antonio], Gonzalez, J.[Javier],
Multihierarchical Graph Search,
PAMI(24), No. 1, January 2002, pp. 103-113.
IEEE Abstract. IEEE Top Reference.
WWW Version. 0201Applied to path planning. BibRef

de Santo, M., Foggia, P., Sansone, C., Vento, M.,
A large database of graphs and its use for benchmarking graph isomorphism algorithms,
PRL(24), No. 8, May 2003, pp. 1067-1079.
WWW Version. 0304 BibRef

Cordella, L.P., Sansone, C., Tortorella, F., Vento, M.[Mario], Foggia, P.,
Graph Matching: A Fast Algorithm and its Evaluation,
ICPR98(Vol II: 1582-1584).
WWW Version. 9808 BibRef

Cordella, L.P., Foggia, P., Sansone, C., Vento, M.,
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs,
PAMI(26), No. 10, October 2004, pp. 1367-1372.
IEEE Abstract. IEEE Top Reference. 0409 BibRef
Earlier:
Fast Graph Matching for Detecting CAD Image Components,
ICPR00(Vol II: 1034-1037).
WWW Version.
HTML Version. 0009 BibRef
Earlier:
Performance evaluation of the VF graph matching algorithm,
CIAP99(1172-1177).
WWW Version. 9909 BibRef
Earlier:
An Efficient Algorithm for the Inexact Matching of ARG Graphs Using a Contextual Transformational Model,
ICPR96(III: 180-184).
WWW Version. 9608(Univ. di Napoli, I) Earlier version worked on small and medium sized graphs. This works for large graphs. BibRef

Conte, D.[Donatello], Foggia, P.[Pasquale], Jolion, J.M.[Jean-Michel], Vento, M.[Mario],
A graph-based, multi-resolution algorithm for tracking objects in presence of occlusions,
PR(39), No. 4, April 2006, pp. 562-572.
WWW Version. 0604Object tracking; Occlusion problem; Graph pyramid; Multi-resolution segmentation BibRef

Burrus, N.[Nicolas], Bernard, T.M.[Thierry M.], Jolion, J.M.[Jean-Michel],
Bottom-Up and Top-Down Object Matching Using Asynchronous Agents and a Contrario Principles,
CVS08(xx-yy).
WWW Version. 0805hierarchy of independent agents. Strength based on relevance of visual data. BibRef

Foggia, P.[Pasquale], Percannella, G.[Gennaro], Sansone, C.[Carlo], Vento, M.[Mario],
Assessing the Performance of a Graph-Based Clustering Algorithm,
GbRPR07(215-227).
WWW Version. 0706 BibRef

Massaro, A.[Alessio], Pelillo, M.[Marcello],
Matching graphs by pivoting,
PRL(24), No. 8, May 2003, pp. 1099-1106.
WWW Version. 0304 BibRef
Earlier:
A Complementary Pivoting Approach to Graph Matching,
EMMCVPR02(469 ff.).
HTML Version. 0205 BibRef

Luo, B.[Bin], Hancock, E.[Edwin], Wilson, R.[Richard],
Eigenspaces For Graphs,
IJIG(2), No. 2, April 2002, pp. 247-268. 0204 BibRef

Luo, B.[Bin], Wilson, R.C.[Richard C.], Hancock, E.R.[Edwin R.],
Spectral embedding of graphs,
PR(36No. 10, October 2003, pp. 2213-2230.
WWW Version. 0308 BibRef
Earlier:
Graph spectral approach for learning view structure,
ICPR02(III: 785-788).
WWW Version. 0211 BibRef

Wilson, R.C., Hancock, E.R.,
Levenshtein distance for graph spectral features,
ICPR04(II: 489-492).
WWW Version. 0409 BibRef

Luo, B.[Bin], Wilson, R.C.[Richard C.], Hancock, E.R.[Edwin R.],
A Spectral Approach to Learning Structural Variations in Graphs,
PR(39), No. 6, June 2006, pp. 1188-1198.
WWW Version. 0604 BibRef
Earlier: CVS03(407 ff).
HTML Version. 0306 BibRef
Earlier:
Learning modes of structural variation in graphs,
ICIP03(II: 37-40).
IEEE Abstract. IEEE Top Reference. 0312 BibRef
Earlier:
Spectral Clustering of Graphs,
CAIP03(540-548).
WWW Version. 0311Generative model; Graph; Covariance matrix; Clustering BibRef

Luo, B.[Bin], Wilson, R.C., Hancock, E.R.,
The independent and principal component of graph spectra,
ICPR02(II: 164-167).
WWW Version. 0211 BibRef

Fu, Z.Y.[Zhou-Yu], Robles-Kelly, A.[Antonio],
An Energy Minimisation Approach to Attributed Graph Regularisation,
EMMCVPR07(71-86).
WWW Version. 0708 BibRef

Luo, B.[Bin], Robles-Kelly, A.[Antonio], Torsello, A.[Andrea], Wilson, R.C.[Richard C.], Hancock, E.R.[Edwin R.],
A Probabilistic Framework for Graph Clustering,
CVPR01(I:912-919).
IEEE Abstract. IEEE Top Reference. 0110From set of distances between graphs characterize pairwise affinity. Culuster graphs. BibRef

Qiu, H.J.[Huai-Jun], Hancock, E.R.[Edwin R.],
Graph matching and clustering using spectral partitions,
PR(39), No. 1, January 2006, pp. 22-34.
WWW Version. 0512 BibRef
Earlier:
Spectral Simplification of Graphs,
ECCV04(Vol IV: 114-126).
WWW Version. 0405 BibRef

Qiu, H.J.[Huai-Jun], Hancock, E.R.[Edwin R.],
Graph simplification and matching using commute times,
PR(40), No. 10, October 2007, pp. 2874-2889.
WWW Version. 0707 BibRef
Earlier:
Spanning Trees from the Commute Times of Random Walks on Graphs,
ICIAR06(II: 375-385).
WWW Version. 0610 BibRef
And:
Graph Embedding Using Commute Time,
SSPR06(441-449).
WWW Version. 0608 BibRef
And:
Graph Matching using Commute Time Spanning Trees,
ICPR06(III: 1224-1227).
WWW Version. 0609 BibRef
And: ICPR06(IV: 955).
WWW Version. 0609 BibRef
And:
Robust Multi-body Motion Tracking Using Commute Time Clustering,
ECCV06(I: 160-173).
WWW Version. 0608Graph-matching; Graph simplification; Commute time; Graph spectrum BibRef

Qiu, H.J.[Huai-Jun], Hancock, E.R.[Edwin R.],
Clustering and Embedding Using Commute Times,
PAMI(29), No. 11, November 2007, pp. 1873-1890.
WWW Version. 0711 BibRef
Earlier:
Commute Times, Discrete Green's Functions and Graph Matching,
CIAP05(454-462).
WWW Version. 0509 BibRef
And:
Commute Times for Graph Spectral Clustering,
CAIP05(128).
WWW Version. 0509 BibRef

Wilson, R.C.[Richard C.], Hancock, E.R.[Edwin R.], Luo, B.[Bin],
Pattern Vectors from Algebraic Graph Theory,
PAMI(27), No. 7, July 2005, pp. 1112-1124.
IEEE Abstract. IEEE Top Reference. 0506 BibRef
Earlier: A2, A3, A1:
Graph Pattern Spaces from Laplacian Spectral Polynomials,
ICIAR04(I: 327-334).
WWW Version. 0409 BibRef
Earlier: A1, A2, Only:
Pattern Spaces from Graph Polynomials,
CIAP03(480-485).
IEEE Abstract. IEEE Top Reference. 0310Embed graphs in pattern space. BibRef

Robles-Kelly, A.[Antonio], Hancock, E.R.[Edwin R.],
A Riemannian approach to graph embedding,
PR(40), No. 3, March 2007, pp. 1042-1056.
WWW Version. 0611Graph embedding; Riemannian geometry; Combinatorial Laplacian BibRef

Robles-Kelly, A.[Antonio], Hancock, E.R.[Edwin R.],
Graph Matching using Adjacency Matrix Markov Chains,
BMVC01(Session 5: Matching & Retrieval).
HTML Version. University of York 0110 BibRef

Hancock, E.R., Wilson, R.C., Bai, X.,
Characterising Graphs using the Heat Kernel,
BMVC05(xx-yy).
HTML Version. 0509 BibRef

Falcao, A.X.[Alexandre X.], Stolfi, J.[Jorge], de Alencar Lotufo, R.[Roberto],
The Image Foresting Transform: Theory, Algorithms, and Applications,
PAMI(26), No. 1, January 2004, pp. 19-29.
IEEE Abstract. IEEE Top Reference. 0401Graph-based design of image processing operators using connectivity. Minimum-cost path forest in a graph. BibRef

van Wyk, B.J.[Barend J.], and van Wyk, M.A.[Michael A.],
A POCS-Based Graph Matching Algorithm,
PAMI(26), No. 11, November 2004, pp. 1526-1530.
IEEE Abstract. IEEE Top Reference. 0410Projections onto Convex Sets. Solve Attributed Graph Matching. BibRef

Wang, H.F.[Hong Fang], Hancock, E.R.[Edwin R.],
Correspondence matching using kernel principal components analysis and label consistency constraints,
PR(39), No. 6, June 2006, pp. 1012-1025.
WWW Version. Non-rigid motion; Correspondence matching; Graph spectral methods; Kernel PCA; Constraints 0604 BibRef
Earlier:
Improving Correspondence Matching Using Label Consistency Constraints,
IbPRIA05(I:235).
WWW Version. 0509 BibRef
And:
Kernel Spectral Correspondence Matching Using Label Consistency Constraints,
CIAP05(503-510).
WWW Version. 0509 BibRef

Bunke, H.[Horst], Dickinson, P.[Peter], Irniger, C.[Christophe], Kraetzl, M.[Miro],
Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning,
PR(39), No. 4, April 2006, pp. 573-586.
WWW Version. 0604Graph sequence analysis; Recovery of missing information; Computer network analysis; Machine learning; Decision tree classifier; Reference pattern matching BibRef

Bunke, H.[Horst], Irniger, C.[Christophe], Neuhaus, M.[Michel],
Graph Matching: Challenges and Potential Solutions,
CIAP05(1-10).
WWW Version. 0509 BibRef

Bunke, H.[Horst], Dickinson, P.[Peter], Kraetzl, M.[Miro],
Theoretical and Algorithmic Framework for Hypergraph Matching,
CIAP05(463-470).
WWW Version. 0509 BibRef
And:
Comparison of Two Different Prediction Schemes for the Analysis of Time Series of Graphs,
IbPRIA05(II:99).
WWW Version. 0509 BibRef

Huang, R.[Ruihong],
A Schedule-based Pathfinding Algorithm for Transit Networks Using Pattern First Search,
GeoInfo(11), No. 2, June 2007, pp. 269-285.
WWW Version. 0709 BibRef

Wen, G.H.[Gui-Hua], Jiang, L.J.[Li-Jun], Wen, J.[Jun],
Using locally estimated geodesic distance to optimize neighborhood graph for isometric data embedding,
PR(41), No. 7, July 2008, pp. 2226-2236.
WWW Version. 0804Isometric data embedding; Nonlinear neighborhood; Neighborhood graph; Geodesic distance; Manifold learning BibRef


El Ghawalby, H.[Hewayda], Hancock, E.R.[Edwin R.],
Measuring Graph Similarity Using Spectral Geometry,
ICIAR08(xx-yy).
WWW Version. 0806 BibRef

Haxhimusa, Y.[Yll], Kropatsch, W.G.[Walter G.], Pizlo, Z.[Zygmunt], Ion, A.[Adrian], Lehrbaum, A.[Andreas],
Approximating TSP Solution by MST Based Graph Pyramid,
GbRPR07(295-306).
WWW Version. 0706Travelling saleseman. BibRef

Bonev, B.[Boyan], Escolano, F.[Francisco], Lozano, M.A.[Miguel A.], Suau, P.[Pablo], Cazorla, M.A.[Miguel A.], Aguilar, W.[Wendy],
Constellations and the Unsupervised Learning of Graphs,
GbRPR07(340-350).
WWW Version. 0706 BibRef

Bulò, S.R.[Samuel Rota], Torsello, A.[Andrea], Pelillo, M.[Marcello],
A Continuous-Based Approach for Partial Clique Enumeration,
GbRPR07(61-70).
WWW Version. 0706 BibRef

Schellewald, C.[Christian],
A Bound for Non-subgraph Isomorphism,
GbRPR07(71-80).
WWW Version. 0706 BibRef

Suvonvorn, N.[Nikom], Zavidovique, B.[Bertrand],
A Stable Marriages Algorithm to Optimize Satisfaction and Equity,
ICIAR06(II: 422-433).
WWW Version. 0610 BibRef

de Piero, F.W.[Fred W.], Carlin, J.K.[John K.],
Structural Matching Via Optimal Basis Graphs,
ICPR06(III: 449-452).
WWW Version. 0609 BibRef

de Piero, F.W.,
Structural graph matching with polynomial bounds on memory and on worst-case effort,
ICPR04(III: 379-382).
WWW Version. 0409 BibRef

Bai, X.[Xiao], Hancock, E.R.[Edwin R.],
Clustering Shapes Using Heat Content Invariants,
ICIP05(I: 1169-1172).
WWW Version. 0512 BibRef
Earlier:
Graph Clustering Using Heat Content Invariants,
IbPRIA05(II:123).
WWW Version. 0509 BibRef

Hancock, E.R., Wilson, R.C., Bai, X.[Xiao],
Graph Clustering using Symmetric Polynomials and Local Linear Embedding,
BMVC03(xx-yy).
HTML Version. 0409 BibRef

Kropatsch, W.G.[Walter G.], Haxhimusa, Y.[Yll],
Grouping of Non-connected Structures by an Irregular Graph Pyramid,
IbPRIA05(II:107).
WWW Version. 0509 BibRef

Haxhimusa, Y., Glantz, R., Saib, M., Langs, G., Kropatsch, W.G.,
Logarithmic Tapering Graph Pyramid,
DAGM02(117 ff.).
HTML Version. 0303 BibRef

Giugno, R., Shasha, D.,
GraphGrep: a fast and universal method for querying graphs,
ICPR02(II: 112-115).
WWW Version. 0211 BibRef

Hlaoui, A., Wang, S.R.[Sheng-Rui],
A new algorithm for inexact graph matching,
ICPR02(IV: 180-183).
WWW Version. 0211 BibRef

Bunke, H.,
Recent Developments in Graph Matching,
ICPR00(Vol II: 117-124).
WWW Version.
HTML Version. 0009 BibRef

Rizzi, S.[Stefano],
A Genetic Approach to Hierarchical Clustering of Euclidean Graphs,
ICPR98(Vol II: 1543-1545).
WWW Version. 9808 BibRef

Kotzer, T., Cohen, N., Shamir, J.,
Generalized approach to projections onto convex constraint sets,
ICPR94(C:77-81).
WWW Version. 9410 BibRef

Akinniyi, F.A., and Wong, A.K.C.,
A New Product Graph Based Algorithm for Subgraph Isomorphism,
CVPR83(457-467). BibRef 8300

Chapter on Matching and Recognition Using Volumes, High Level Vision Techniques, Invariants continues in
General Structure and Graph Representation and Matching .


Last update:Aug 27, 2008 at 19:16:50