1996
DOI: 10.1006/gmip.1996.0016
|View full text |Cite
|
Sign up to set email alerts
|

Multidimensional Co-occurrence Matrices for Object Recognition and Matching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0
4

Year Published

1997
1997
2021
2021

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 75 publications
(34 citation statements)
references
References 6 publications
(19 reference statements)
0
30
0
4
Order By: Relevance
“…They used a supervised parametric method based on a distribution to guide a forward sequential search algorithm in the object detection phase. Kovalev and Petrou [44] used multidimensional GLCM to perform classification of various images of CT brain scans, several types of microscope images, and photographs of signatures. Haddon and Boyce [32], [33] proposed one interesting application of cooccurrence matrices in which the matrices were used to detect edges and estimate optic flow field.…”
Section: A Applicationsmentioning
confidence: 99%
“…They used a supervised parametric method based on a distribution to guide a forward sequential search algorithm in the object detection phase. Kovalev and Petrou [44] used multidimensional GLCM to perform classification of various images of CT brain scans, several types of microscope images, and photographs of signatures. Haddon and Boyce [32], [33] proposed one interesting application of cooccurrence matrices in which the matrices were used to detect edges and estimate optic flow field.…”
Section: A Applicationsmentioning
confidence: 99%
“…The general form can be limited to different orders to define alternative texture descriptors. For example, co-occurrence matrices (Haralick et al, 1973a;Kovalev and Petrou, 1996;Strand and Taxt, 1994) are defined by considering only two points. That is, f ðc 1 ; c 2 ;sÞ for s ¼ jx 2 À x 1 j ð 1Þ for values of s defining neighbourhoods of 3 · 3 or 4 · 4 pixels.…”
Section: Statistical Characterisation Of Texturesmentioning
confidence: 99%
“…The commonly known histograms of Local Binary Patterns (Pietikäinen, M., 2011) as well as 2D version of extended cooccurrence matrices (Kovalev, V., 1996;Kovalev, V., 2001) which fuse the intensity, gradient magnitude, and anisotropy image properties were used as image descriptors. In addition, we calculated also the commonly known Histograms of Oriented Gradients and Banks of Filters.…”
Section: Conventional Methodsmentioning
confidence: 99%