Relational object recognition from large structural libraries

Pattern Recognition

Volumn 35, Issue 9, 2002, Pages 1895-1915

  Huet, Benoit ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Hansdorff distance; Image retrieval; Relational graphs; Robust statistics

Indexed keywords

ERRORS; PROBABILITY; SENSITIVITY ANALYSIS; VECTORS;

RELATIONAL OBJECT RECOGNITION;

OBJECT RECOGNITION;

PATTERN RECOGNITION;

EID: 0036721690     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(01)00172-8     Document Type: Article

References (54)

1. Interactive indexing into image databases
2. On retrieving textured images from an image database
3. View organisation and matching of free-form objects
4. A bayesian approach to model matching with geometric hashing
5. COSMOS: A representation scheme for 3D free-from objects
6. The use of geometric histograms for model-based object recognition
7. Scene analysis using appearance-based models and relational indexing
8. Organising large structural databases
9. Properties of local geometric constraints
10. Generalizing the Hough transform to detect arbitrary shapes
11. Line pattern retrieval using relational histograms
12. Locating objects using the Hausdorff distance
13. Line-based recognition using a multidimensional Hausdorff distance
14. Similarity measures
15. Features of similarity
16. Geometric hashing: A general and efficient model-based recognition scheme
17. Structural indexing: Efficient 2D object recognition
18. Canonical frames for planar object recognition
19. Object recognition by affine invariant matching
20. Structural description and inexact matching
21. A metric for comparing relational descriptions
22. A distance measure between attributed relational graph
23. Entropy and distance of random graphs with application to structural pattern recognition
24. Structural matching by discrete relaxation
25. Structural matching with active triangulation
26. Matching Delaunay graphs
27. Structural matching in computer vision using probabilistic relaxation
28. Forms: A flexible object recognition and modelling system
29. Visual deconstruction: Recognizing articulated object
30. Boundary detection by minimizing functionals
31. Graphical templates for model registration
32. A process grammar for shape
33. Shock graphs and shape matching
34. An analysis of a good algorithm for the subtree problem
35. Matching hierarchical structures using association graphs
36. Index trees for efficient deformable shape-based retrieval
37. Color- and texture-based image segmentation using em and its application to content-based image retrieval
38. Relational histograms for shape indexing
39. Sensitivity analysis for structural matching
40. Assessing the completeness properties of pairwise geometric histograms
41. Efficient two dimensional object recognition
42. Relative sensitivity of a family of closest-point graphs in computer vision applications
43. Combining evidence in probabilistic relaxation
44. Comparing images using the Hausdorff distance
45. Information combination operators for data fusion: A comparative review with classification
46. Resolving edge-line ambiguities using probabilistic relaxation
47. A computational approach to edge detection
48. Three-dimensional object recognition from two-dimensional images
49. Segmentation of edges into lines and arcs
50. Efficient and effective querying by image content
51. Shape recognition from large image libraries by inexact graph matching
52. Recovering perspective pose with dual step EM algorithm
53. An energy function and continuous edit process for graph matching