Edwin Hancock
Born (1956-06-24) 24 June 1956
Alma materDurham University (BSc, PhD, D.Sc.)
AwardsFellow of the Royal Academy of Engineering
Royal Society Wolfson Research Merit Award
IEEE Fellow
FInstP
FIET
Fellow IAPR
Scientific career
Fields
InstitutionsRutherford Appleton Laboratory
Open University
University of York
ThesisThe π π Ʌ channel from K-p reactions in the Ʌ (1690) region (1981)
Websitecs.york.ac.uk/~erh

Edwin Hancock (FREng) (born June 1956) is a British computer scientist at the University of York specialising in computer vision and pattern recognition.

Education

Edwin Hancock graduated with a Bachelor of Science degree in physics in 1977, a PhD in high energy nuclear physics in 1981 and a Doctor of Science degree by publication in 2008 from Durham University.[1][2] His PhD thesis was entitled "The π π Ʌ channel from K-p reactions in the Ʌ (1690) region" and his D.Sc. thesis "Contributions to pattern recognition and computer vision".[3][4]

Career

Hancock is Emeritus Professor of Computer Vision in the Department of Computer Science at the University of York, and Adjunct Professor and Principal Investigator of the Beijing Innovation Centre for Big Data and Brain Computing at Beihang University. He commenced his research career in the field of high energy nuclear physics, working on bubble chamber experiments performed at CERN and SLAC between 1977 and 1984. During this period he used partial wave analysis[3] to study the angular momentum resonances of Ʌ and Σ hyperons and was involved in the first determination of charm quark lifetimes.[5]

In 1985 he changed fields to work in computer science, and currently undertakes research in the use of graph-based methods in computer vision, pattern recognition and complex networks. He focuses on how pattern recognition and machine learning can be performed using data in the form of graphs, trees and strings. He is best known for his work on graph matching[6] and spectral graph theory.[7] He also works on physics based vision, where he has focused on how to recover surface shape and surface sub-structure from information conveyed by the scattering of light and from polarisation measurements.[8] He has published extensively on these topics.[9]

He was elected Fellow of the Royal Academy of Engineering in 2021,[10] named Fellow of the Institute of Electrical and Electronics Engineers (IEEE) in 2016[11] for contributions to pattern recognition and computer vision, and as a Fellow of the International Association for Pattern Recognition in 2000.[12] He was awarded a doctorate honoris causa by the University of Alicante in 2015.[13] In 2016 he was appointed Editor-in-Chief of the journal Pattern Recognition.[14] Between 2016 and 2018 he was second vice-president of the International Association for Pattern Recognition.[15] Between 2009 and 2014, he held a Royal Society Wolfson Research Merit Award.[16] In 1991 he was awarded the Seventeenth Annual Pattern Recognition Award,[17] for his paper titled "Discrete Relaxation", co-authored with Josef Kittler and published in the journal Pattern Recognition,[18] and in 1999 an honourable mention in the Twentyfourth Award[19] for the paper "Matching Delaunay Graphs",[20] with Andrew M. Finch and Richard C. Wilson. The British Machine Vision Association awarded him its Distinguished Fellowship for 2016.[21] In 2018 he received the Pierre Devijver Award from the International Association for Pattern Recognition.[22]

Selected publications

Research Articles
  • Richard C. Wilson, Edwin R. Hancock, Structural Matching by Discrete Relaxation. IEEE Trans. Pattern Anal. Mach. Intell. 19(6): 634–648 (1997).
  • Andrew D. J. Cross, Edwin R. Hancock, Graph Matching With a Dual-Step EM Algorithm. IEEE Trans. Pattern Anal. Mach. Intell. 20(11): 1236–1253 (1998).
  • Philip L. Worthington, Edwin R. Hancock, New Constraints on Data-Closeness and Needle Map Consistency for Shape-from-Shading. IEEE Trans. Pattern Anal. Mach. Intell. 21(12): 1250–1267 (1999).
  • Bin Luo, Edwin R. Hancock, Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition. IEEE Trans. Pattern Anal. Mach. Intell. 23(10): 1120–1136 (2001).
  • Marco Carcassoni, Edwin R. Hancock, Correspondence Matching with Modal Clusters. IEEE Trans. Pattern Anal. Mach. Intell. 25(12): 1609–1615 (2003
  • Richard C. Wilson, Edwin R. Hancock, Bin Luo, Pattern Vectors from Algebraic Graph Theory. IEEE Trans. Pattern Anal. Mach. Intell. 27(7): 1112–1124 (2005).
  • Antonio Robles-Kelly, Edwin R. Hancock, Graph Edit Distance from Spectral Seriation. IEEE Trans. Pattern Anal. Mach. Intell. 27(3): 365–378 (2005).
  • William A. P. Smith, Edwin R. Hancock, Recovering Facial Shape Using a Statistical Model of Surface Normal Direction. IEEE Trans. Pattern Anal. Mach. Intell. 28(12): 1914–1930 (2006).
  • Andrea Torsello, Edwin R. Hancock, Learning Shape-Classes Using a Mixture of Tree-Unions. IEEE Trans. Pattern Anal. Mach. Intell. 28(6): 954–967 (2006).
  • Gary A. Atkinson, Edwin R. Hancock, Shape Estimation Using Polarization and Shading from Two Views. IEEE Trans. Pattern Anal. Mach. Intell. 29(11): 2001–2017 (2007).
  • Huaijun Qiu, Edwin R. Hancock, Clustering and Embedding Using Commute Times. IEEE Trans. Pattern Anal. Mach. Intell. 29(11): 1873–1890 (2007).

References

  1. ↑ "Durham University gazette, XXIII (ns) including supplement". Durham University.
  2. ↑ "Durham University gazette, XXVI (ns) including supplement". Durham University.
  3. 1 2 PhD Thesis Durham University. Retrieved 22 April 2017.
  4. ↑ D.Sc. Thesis Durham University, Palace Green Library: Special Collections Shelfmark SD++ 00842/008843.
  5. ↑ Stanford Linear Accelerator Center Hybrid Facility Photon Collaboration; Abe, K.; Bacon, T. C.; Ballam, J.; Berny, L.; Bevan, A. V.; Bingham, H. H.; Brau, J. E.; Brick, D.; Bugg, W. M.; Butler, J.; Cameron, W.; Carroll, J. T.; Cautis, C. V.; Chima, J. S.; Cohn, H. O.; Colley, D. C.; Condo, G. T.; Dado, S.; Diamond, R.; Dornan, P. J.; Erickson, R.; Fieguth, T.; Field, R. C.; Fortney, L.; Franek, B.; Fujiwara, N.; Gearhart, R.; Goldberg, J.; Gopal, G. P.; Goshaw, A. T.; Hafen, E. S.; Hagopian, V.; Hall, G.; Hancock, E. R.; Handler, T.; Hargis, H. J.; Hart, E. L.; Haridas, P.; Hasegawa, K.; Hayashino, T.; Huang, D. Q.; Hulsizer, R. I.; Isaacson, S.; Jobes, M.; Kalmus, G. E.; Kelsey, D. P.; Kent, J.; Kitagaki, T.; Lang, P.; Lannutti, J.; Levy, A.; Lucas, P. W.; Mann, W. A.; Maruyama, T.; MacDermott, M.; Merenyi, R.; Milburn, R.; Milstene, C.; Moffeit, K. C.; Murray, J. J.; Napier, A.; Noguchi, S.; Ochiai, F.; O'Neale, S.; Palounek, A. P. T.; Pless, I. A.; Rabin, M.; Rankin, P.; Robertson, W. J.; Rogers, A. H.; Ronat, E.; Rudnicka, H.; Sato, T.; Schneps, J.; Shank, J.; Shapiro, A. M.; Sinclair, C.; Sugahara, R.; Suzuki, A.; Takahashi, K.; Tamai, K.; Tanaka, S.; Tether, S.; Wald, H. B.; Walker, W. D.; Widgoff, M.; Wilkins, C. G.; Wolbers, S.; Woods, C. A.; Wu, Y.; Yamaguchi, A.; Yamamoto, R. K.; Yamashita, S.; Yekutieli, G.; Yoshimura, Y.; Yost, G. P.; Yuta, H. (31 May 1982). "Lifetimes of Charmed Particles Produced in a 20-GeV γp Experiment". Physical Review Letters. 48 (22): 1526–1529. doi:10.1103/PhysRevLett.48.1526.
  6. ↑ Conte, D., Foggia, P., Sansone, C., Vento, M. Thirty years of graph matching in pattern recognition (2004) International Journal of Pattern Recognition and Artificial Intelligence, 18 (3), pp. 265–298.
  7. ↑ Barthélemy, M. Spatial networks (2011) Physics Reports, 499 (1–3), pp. 1–101.
  8. ↑ Edwin Hancock publications indexed by Google Scholar Retrieved 22 April 2017.
  9. ↑ Edwin Hancock at DBLP Bibliography Server Retrieved 22 April 2017.
  10. ↑ "New Fellows 2021". Royal Academy of Engineering. Retrieved 23 September 2021.
  11. ↑ "2016 elevated fellow" (PDF). IEEE Fellows Directory.
  12. ↑ IAPR Fellows.. Retrieved 22 April 2017.
  13. ↑ Doctorate honoris causa U. Alicante. Retrieved 22 April 2017.
  14. ↑ "Pattern Recognition".
  15. ↑ IAPR Exco.. Retrieved 22 April 2017.
  16. ↑ Royal Society Research Fellows.. Retrieved 22 April 2017.
  17. ↑ "Announcement". Pattern Recognition. 24 (12): 1225. 1 January 1991. doi:10.1016/0031-3203(91)90148-X.
  18. ↑ Edwin R. Hancock, Josef Kittler: Discrete relaxation. Pattern Recognition 23(7): 711-733 (1990).
  19. ↑ Pattern Recognition 32(1).
  20. ↑ Andrew M. Finch, Richard C. Wilson, Edwin R. Hancock: Matching delaunay graphs. Pattern Recognition 30(1): 123–140 (1997).
  21. ↑ BMVA Distinguished Fellows. Retrieved 10 August 2017.
  22. ↑ Pierre Devijver Award Winners. Retrieved 15 January 2020.

[1]

  1. ↑ "2021 Fellows". Royal Academy of Engineering. Retrieved 22 September 2021.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.