The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrew D. J. Cross: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kwang Nam Choi, Andrew D. J. Cross, Edwin R. Hancock
    Localising Facial Features with Matched Filters. [Citation Graph (0, 0)][DBLP]
    AVBPA, 1997, pp:11-20 [Conf]
  2. Bin Luo, Andrew D. J. Cross, Edwin R. Hancock
    Corner Detection Via Topographic Analysis of Vector Potential. [Citation Graph (0, 0)][DBLP]
    BMVC, 1998, pp:- [Conf]
  3. Andrew D. J. Cross, Edwin R. Hancock
    Scale-Space Vector Fields for Feature Analysis. [Citation Graph (0, 0)][DBLP]
    CVPR, 1997, pp:738-743 [Conf]
  4. Andrew D. J. Cross, Edwin R. Hancock
    Holistic Matching. [Citation Graph (0, 0)][DBLP]
    ECCV (2), 1998, pp:140-155 [Conf]
  5. Andrew D. J. Cross, Richard C. Wilson, Edwin R. Hancock
    Genetic Search for Structural Matching. [Citation Graph (0, 0)][DBLP]
    ECCV (1), 1996, pp:514-525 [Conf]
  6. Andrew D. J. Cross, Edwin R. Hancock
    Convergence of a Hill Climbing Genetic Algorithm for Graph Matching. [Citation Graph (0, 0)][DBLP]
    EMMCVPR, 1999, pp:221-236 [Conf]
  7. Andrew D. J. Cross, Edwin R. Hancock
    Perspective Matching Using the EM Algorithm. [Citation Graph (0, 0)][DBLP]
    ICIAP (1), 1997, pp:406-413 [Conf]
  8. Richard C. Wilson, Andrew D. J. Cross, Edwin R. Hancock
    Edge Location with Electrostatic Region Attractors. [Citation Graph (0, 0)][DBLP]
    ICIP (2), 1998, pp:535-539 [Conf]
  9. Benoit Huet, Andrew D. J. Cross, Edwin R. Hancock
    Shape Retrieval by Inexact Graph Matching. [Citation Graph (0, 0)][DBLP]
    ICMCS, Vol. 1, 1999, pp:772-776 [Conf]
  10. Andrew D. J. Cross, Edwin R. Hancock
    Recovering Perspective Pose with a Dual Step EM Algorithm. [Citation Graph (0, 0)][DBLP]
    NIPS, 1997, pp:- [Conf]
  11. Benoit Huet, Andrew D. J. Cross, Edwin R. Hancock
    Graph Matching for Shape Retrieval. [Citation Graph (0, 0)][DBLP]
    NIPS, 1998, pp:896-902 [Conf]
  12. Andrew D. J. Cross, Edwin R. Hancock
    Inexact Graph Matching with Genetic Search. [Citation Graph (0, 0)][DBLP]
    SSPR, 1996, pp:150-159 [Conf]
  13. Paolo Bergamini, Luigi Cinque, Andrew D. J. Cross, Edwin R. Hancock, Stefano Levialdi, Richard Myers
    Efficient Alignment and Correspondence Using Edit Distance. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2000, pp:246-255 [Conf]
  14. Richard C. Wilson, Andrew D. J. Cross, Edwin R. Hancock
    Structural Matching with Active Triangulations. [Citation Graph (0, 0)][DBLP]
    Computer Vision and Image Understanding, 1998, v:72, n:1, pp:21-38 [Journal]
  15. Andrew D. J. Cross, Edwin R. Hancock
    Scale space vector fields for symmetry detection. [Citation Graph (0, 0)][DBLP]
    Image Vision Comput., 1999, v:17, n:5-6, pp:337-345 [Journal]
  16. Andrew D. J. Cross, Edwin R. Hancock
    Graph Matching With a Dual-Step EM Algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1998, v:20, n:11, pp:1236-1253 [Journal]
  17. Andrew D. J. Cross, Richard Myers, Edwin R. Hancock
    Convergence of a hill-climbing genetic algorithm for graph matching. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2000, v:33, n:11, pp:1863-1880 [Journal]
  18. Andrew D. J. Cross, Richard C. Wilson, Edwin R. Hancock
    Inexact graph matching using genetic search. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1997, v:30, n:6, pp:953-970 [Journal]
  19. Bin Luo, Andrew D. J. Cross, Edwin R. Hancock
    Corner detection via topographic analysis of vector-potential. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1999, v:20, n:6, pp:635-650 [Journal]

Search in 0.040secs, Finished in 0.041secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002