dblp.uni-trier.dewww.uni-trier.de

Richard C. Wilson

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
97EETom S. F. Haines, Richard C. Wilson: Belief Propagation with Directional Statistics for Solving the Shape-from-Shading Problem. ECCV (3) 2008: 780-791
96EEBartosz Ziólko, Suresh Manandhar, Richard C. Wilson, Mariusz Ziólko: Logitboost weka classifier speech segmentation. ICME 2008: 1297-1300
95EETom S. F. Haines, Richard C. Wilson: Combining shape-from-shading and stereo using Gaussian-Markov random fields. ICPR 2008: 1-4
94EEDavid White, Richard C. Wilson: Parts based generative models for graphs. ICPR 2008: 1-4
93EEPeng Ren, Richard C. Wilson, Edwin R. Hancock: Pattern vectors from the Ihara zeta function. ICPR 2008: 1-4
92EEBai Xiao, Richard C. Wilson, Edwin R. Hancock: Quantitative Evaluation on Heat Kernel Permutation Invariants. SSPR/SPR 2008: 217-226
91EEPeng Ren, Richard C. Wilson, Edwin R. Hancock: Graph Characteristics from the Ihara Zeta Function. SSPR/SPR 2008: 257-266
90EEPeng Ren, Richard C. Wilson, Edwin R. Hancock: Spectral Embedding of Feature Hypergraphs. SSPR/SPR 2008: 308-317
89EEDavid Emms, Richard C. Wilson, Edwin R. Hancock: Graph Edit Distance without Correspondence from Continuous-Time Quantum Walks. SSPR/SPR 2008: 5-14
88EERichard C. Wilson, Ping Zhu: A study of graph spectra for comparing graphs and trees. Pattern Recognition 41(9): 2833-2841 (2008)
2007
87EEDavid Emms, Edwin R. Hancock, Richard C. Wilson: Graph Similarity Using Interfering Quantum Walks. CAIP 2007: 823-831
86EEDavid Emms, Richard C. Wilson, Edwin R. Hancock: Graph Embedding Using Quantum Commute Times. GbRPR 2007: 371-382
85EEDavid Emms, Edwin R. Hancock, Richard C. Wilson: A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk. GbRPR 2007: 81-91
84EEDavid White, Richard C. Wilson: Spectral Generative Models for Graphs. ICIAP 2007: 35-42
2006
83EEDavid Emms, Edwin R. Hancock, Richard C. Wilson: Graph Matching using Interference of Coined Quantum Walks. ICPR (3) 2006: 133-136
82EEDavid White, Richard C. Wilson: Mixing spectral representations of graphs. ICPR (4) 2006: 140-144
81EEBartosz Ziólko, Suresh Manandhar, Richard C. Wilson: Phoneme segmentation of speech. ICPR (4) 2006: 282-285
80EEDavid Emms, Edwin R. Hancock, Simone Severini, Richard C. Wilson: A Matrix Representation of Graphs and its Spectrum as a Graph Invariant. Electr. J. Comb. 13(1): (2006)
79EEBin Luo, Richard C. Wilson, Edwin R. Hancock: A spectral approach to learning structural variations in graphs. Pattern Recognition 39(6): 1188-1198 (2006)
2005
78EEPing Zhu, Richard C. Wilson: Stability of the Eigenvalues of Graphs. CAIP 2005: 371-378
77EEDavid Emms, Simone Severini, Richard C. Wilson, Edwin R. Hancock: Coined Quantum Walks Lift the Cospectrality of Graphs and Trees. EMMCVPR 2005: 332-345
76EEDavid Emms, Simone Severini, Richard C. Wilson, Edwin R. Hancock: Towards Unitary Representations for Graph Matching. GbRPR 2005: 153-161
75EEBin Luo, Richard C. Wilson, Edwin R. Hancock: A Linear Generative Model for Graph Structure. GbRPR 2005: 54-62
74EEXiao Bai, Richard C. Wilson, Edwin R. Hancock: Manifold Embedding of Graphs Using the Heat Kernel. IMA Conference on the Mathematics of Surfaces 2005: 34-49
73EERichard C. Wilson, Edwin R. Hancock, Bin Luo: Pattern Vectors from Algebraic Graph Theory. IEEE Trans. Pattern Anal. Mach. Intell. 27(7): 1112-1124 (2005)
2004
72EEBin Luo, Richard C. Wilson, Edwin R. Hancock: Graph Pattern Spaces from Laplacian Spectral Polynomials. ICIAR (1) 2004: 327-334
71EERichard C. Wilson, Edwin R. Hancock: Levenshtein Distance for Graph Spectral Features. ICPR (2) 2004: 489-492
70EEBin Luo, Richard C. Wilson, Edwin R. Hancock: Graph Manifolds from Spectral Polynomials. ICPR (3) 2004: 402-405
69EENiklas Lüdtke, Richard C. Wilson: Contour Segments from Spline Interpolation. SSPR/SPR 2004: 134-142
68EERichard C. Wilson: A Coupled Relaxation Method for Finding Perceptual Structures. SSPR/SPR 2004: 224-232
67EEAlex Hughes, Richard C. Wilson: Scale Descriptors through Phase Unwrapping. SSPR/SPR 2004: 530-537
66EERichard C. Wilson, Edwin R. Hancock: Spectral Analysis of Complex Laplacian Matrices. SSPR/SPR 2004: 57-65
2003
65EEBin Luo, Richard C. Wilson, Edwin R. Hancock: Spectral Clustering of Graphs. CAIP 2003: 540-548
64EEBin Luo, Richard C. Wilson, Edwin R. Hancock: Spectral Clustering of Graphs. GbRPR 2003: 190-201
63EEAlex Hughes, Richard C. Wilson: A spectral analysis of perceptual shape variation. ICIAP 2003: 38-43
62EERichard C. Wilson, Edwin R. Hancock: Pattern spaces from graph polynomials. ICIAP 2003: 480-485
61 Bin Luo, Richard C. Wilson, Edwin R. Hancock: Learning modes of structural variation in graphs. ICIP (2) 2003: 37-40
60EEBin Luo, Richard C. Wilson, Edwin R. Hancock: A Spectral Approach to Learning Structural Variations in Graphs. ICVS 2003: 407-417
59EEAdrian G. Bors, Edwin R. Hancock, Richard C. Wilson: Terrain Analysis Using Radar Shape-from-Shading. IEEE Trans. Pattern Anal. Mach. Intell. 25(8): 974-992 (2003)
58EEBin Luo, Richard C. Wilson, Edwin R. Hancock: Spectral embedding of graphs. Pattern Recognition 36(10): 2213-2230 (2003)
2002
57EENiklas Lüdtke, Richard C. Wilson, Edwin R. Hancock: Population Coding of Multiple Edge Orientation. ICANN 2002: 1261-1267
56 Bin Luo, Richard C. Wilson, Edwin R. Hancock: Object recognition by clustering spectral features. ICIP (1) 2002: 429-432
55 Niklas Lüdtke, Richard C. Wilson, Edwin R. Hancock: Probabilistic population coding of multiple edge orientation. ICIP (2) 2002: 865-868
54EEBin Luo, Richard C. Wilson, Edwin R. Hancock: The Independent and Principal Component of Graph Spectra. ICPR (2) 2002: 164-167
53EENiklas Lüdtke, Bin Luo, Edwin R. Hancock, Richard C. Wilson: Corner Detection Using a Mixture Model of Edge Orientation. ICPR (2) 2002: 574-577
52EEBin Luo, Richard C. Wilson, Edwin R. Hancock: Graph Spectral Approach for Learning View Structure. ICPR (3) 2002: 785-788
51EEEdwin R. Hancock, Richard C. Wilson: Graph-Based Methods for Vision: A Yorkist Manifesto. SSPR/SPR 2002: 31-46
50EEBin Luo, Richard C. Wilson, Edwin R. Hancock: Spectral Feature Vectors for Graph Clustering. SSPR/SPR 2002: 83-93
49EEBin Luo, Edwin R. Hancock, Richard C. Wilson: Eigenspaces for Graphs. Int. J. Image Graphics 2(2): 247-268 (2002)
2001
48EEBin Luo, Antonio Robles-Kelly, Andrea Torsello, Richard C. Wilson, Edwin R. Hancock: Discovering Shape Categories by Clustering Shock Trees. CAIP 2001: 152-160
47EEBin Luo, Antonio Robles-Kelly, Andrea Torsello, Richard C. Wilson, Edwin R. Hancock: A Probabilistic Framework for Graph Clustering. CVPR (1) 2001: 912-919
46EEBin Luo, Richard C. Wilson, Antonio Robles-Kelly, Andrea Torsello, Edwin R. Hancock: Learning shape categories by clustering shock trees. ICIP (3) 2001: 672-675
45 Richard C. Wilson, Edwin R. Hancock: Storage Capacity of the Exponential Correlation Associative Memory. Neural Processing Letters 13(1): 71-80 (2001)
2000
44EENiklas Lüdtke, Richard C. Wilson, Edwin R. Hancock: Tangent Fields from Population Coding. Biologically Motivated Computer Vision 2000: 584-593
43EEAdrian G. Bors, Edwin R. Hancock, Richard C. Wilson: A Bayesian Framework for Radar Shape-from-Shading. CVPR 2000: 1262-1268
42 Adrian G. Bors, Edwin R. Hancock, Richard C. Wilson: Terrain Feature Identification by Modeling Radar Image Statistics. ICIP 2000
41EENiklas Lüdtke, Richard C. Wilson, Edwin R. Hancock: Population Codes for Orientation Estimation. ICPR 2000: 1238-1241
40EEAdrian G. Bors, Edwin R. Hancock, Richard C. Wilson: Terrain Modeling in Synthetic Aperture Radar Images Using Shape-from-Shading. ICPR 2000: 1798-1801
39EERichard C. Wilson, Niklas Lüdtke: Decoding Population Codes. ICPR 2000: 2137-2140
38EERichard C. Wilson, Edwin R. Hancock: Storage Capacity of the Exponential Correlation Associative Memory. ICPR 2000: 2660-2663
37EERichard C. Wilson, Edwin R. Hancock: Optimizing Pattern Recovery in Recurrent Correlation Associative Memories. ICPR 2000: 6005-6009
36EERichard C. Wilson, Edwin R. Hancock: Bias-Variance Analysis for Controlling Adaptive Surface Meshes. Computer Vision and Image Understanding 77(1): 25-47 (2000)
35EERichard Myers, Richard C. Wilson, Edwin R. Hancock: Bayesian Graph Edit Distance. IEEE Trans. Pattern Anal. Mach. Intell. 22(6): 628-635 (2000)
1999
34EERichard C. Wilson, Edwin R. Hancock: A Reflectance Model for Radar Shape From Shading. BMVC 1999
33EERichard Myers, Richard C. Wilson, Edwin R. Hancock: Bayesian Graph Edit Distance. ICIAP 1999: 1166-1171
32EERichard C. Wilson, Edwin R. Hancock: A Radar Reflectance Model for Terrain Analysis Using Shape from Shading. ICIAP 1999: 868-873
31 Richard C. Wilson, Edwin R. Hancock: Storage Capacity of the Exponential Correlation Associative Memory. IWANN (1) 1999: 301-310
30EERichard C. Wilson, Edwin R. Hancock: Consistent topographic surface labelling. Pattern Recognition 32(7): 1211-1223 (1999)
29EEMark L. Williams, Richard C. Wilson, Edwin R. Hancock: Deterministic search for relational graph matching. Pattern Recognition 32(7): 1255-1271 (1999)
28EERichard C. Wilson, Edwin R. Hancock: Graph matching with hierarchical discrete relaxation. Pattern Recognition Letters 20(10): 1041-1052 (1999)
27EESimon Moss, Richard C. Wilson, Edwin R. Hancock: A mixture model for pose clustering. Pattern Recognition Letters 20(11-13): 1093-1101 (1999)
1998
26EERichard C. Wilson, Edwin R. Hancock: Bias-Variance Tradeoff for Adaptive Surface Meshes. ECCV (2) 1998: 449-465
25 Richard C. Wilson, Andrew D. J. Cross, Edwin R. Hancock: Edge Location with Electrostatic Region Attractors. ICIP (2) 1998: 535-539
24EERichard C. Wilson, Andrew D. J. Cross, Edwin R. Hancock: Structural Matching with Active Triangulations. Computer Vision and Image Understanding 72(1): 21-38 (1998)
23 Andrew M. Finch, Richard C. Wilson, Edwin R. Hancock: An Energy Function and Continuous Edit Process for Graph Matching. Neural Computation 10(7): 1873-1894 (1998)
22EEAndrew M. Finch, Richard C. Wilson, Edwin R. Hancock: Symbolic graph matching with the EM algorithm. Pattern Recognition 31(11): 1777-1790 (1998)
1997
21 Mark L. Williams, Richard C. Wilson, Edwin R. Hancock: Multi-sensor Fusion with Bayesian Inference. CAIP 1997: 25-32
20EERichard C. Wilson, Edwin R. Hancock: A Minimum-Variance Adaptive Surface Mesh. CVPR 1997: 634-639
19 Mark L. Williams, Richard C. Wilson, Edwin R. Hancock: Deterministic Search Stragtegies for Relational Graph Matching. EMMCVPR 1997: 261-275
18 Andrew M. Finch, Richard C. Wilson, Edwin R. Hancock: An Expectation-Maximisation Approach to Graph Matching. EMMCVPR 1997: 425-439
17 Richard C. Wilson, Edwin R. Hancock: Refining Surface Curvature with Relaxation Labeling. ICIAP (1) 1997: 150-157
16 Richard C. Wilson, Edwin R. Hancock: Graph Matching with Hierarchical Discrete Relaxation. NIPS 1997
15EERichard C. Wilson, Edwin R. Hancock: Structural Matching by Discrete Relaxation. IEEE Trans. Pattern Anal. Mach. Intell. 19(6): 634-648 (1997)
14EEAndrew M. Finch, Richard C. Wilson, Edwin R. Hancock: Matching delaunay graphs. Pattern Recognition 30(1): 123-140 (1997)
13EEAndrew D. J. Cross, Richard C. Wilson, Edwin R. Hancock: Inexact graph matching using genetic search. Pattern Recognition 30(6): 953-970 (1997)
12EEMark L. Williams, Richard C. Wilson, Edwin R. Hancock: Multiple graph matching with Bayesian inference. Pattern Recognition Letters 18(11-13): 1275-128 (1997)
1996
11EERichard C. Wilson, Edwin R. Hancock: Gauging Relational Consistency and Correcting Structural Errors. CVPR 1996: 47-54
10 Andrew D. J. Cross, Richard C. Wilson, Edwin R. Hancock: Genetic Search for Structural Matching. ECCV (1) 1996: 514-525
9EEAndrew M. Finch, Richard C. Wilson, Edwin R. Hancock: Softening Discrete Relaxation. NIPS 1996: 438-444
8 Richard C. Wilson, Edwin R. Hancock: Hierarchical Discrete Relaxation. SSPR 1996: 120-129
7EERichard C. Wilson, Edwin R. Hancock: A Bayesian compatibility model for graph matching. Pattern Recognition Letters 17(3): 263-276 (1996)
1995
6 Edwin R. Hancock, Richard C. Wilson: Rectifying Structural Matching Errors. ACCV 1995: 353-362
5 Richard C. Wilson, Edwin R. Hancock: Relational Matching with Active Graphs. CAIP 1995: 334-341
4 Andrew M. Finch, Richard C. Wilson, Edwin R. Hancock: Matching Delauny Triangulations by Probabilistic Relaxation. CAIP 1995: 350-358
3EERichard C. Wilson, Edwin R. Hancock: Relational Matching with Dynamic Graph Structures. ICCV 1995: 450-456
2 Richard C. Wilson, Edwin R. Hancock: An Integrated Approach to Grouping and Matching. ICIAP 1995: 62-67
1EERichard C. Wilson, Adrian N. Evans, Edwin R. Hancock: Relational matching by discrete relaxation. Image Vision Comput. 13(5): 411-421 (1995)

Coauthor Index

1Xiao Bai [74]
2Adrian G. Bors [40] [42] [43] [59]
3Andrew D. J. Cross [10] [13] [24] [25]
4David Emms [76] [77] [80] [83] [85] [86] [87] [89]
5Adrian N. Evans [1]
6Andrew M. Finch [4] [9] [14] [18] [22] [23]
7Tom S. F. Haines [95] [97]
8Edwin R. Hancock [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49] [50] [51] [52] [53] [54] [55] [56] [57] [58] [59] [60] [61] [62] [64] [65] [66] [70] [71] [72] [73] [74] [75] [76] [77] [79] [80] [83] [85] [86] [87] [89] [90] [91] [92] [93]
9Alex Hughes [63] [67]
10Niklas Lüdtke [39] [41] [44] [53] [55] [57] [69]
11Bin Luo [46] [47] [48] [49] [50] [52] [53] [54] [56] [58] [60] [61] [64] [65] [70] [72] [73] [75] [79]
12Suresh Manandhar [81] [96]
13Simon Moss [27]
14Richard Myers [33] [35]
15Peng Ren [90] [91] [93]
16Antonio Robles-Kelly [46] [47] [48]
17Simone Severini [76] [77] [80]
18Andrea Torsello [46] [47] [48]
19David White [82] [84] [94]
20Mark L. Williams [12] [19] [21] [29]
21Bai Xiao [92]
22Ping Zhu [78] [88]
23Bartosz Ziólko [81] [96]
24Mariusz Ziólko [96]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)