Home Articles FAQs XREF Games Software Instant Books BBS About FOLDOC RFCs Feedback Sitemap

cooccurrence matrix

You are here: irt.org | FOLDOC | cooccurrence matrix

<mathematics> Given a position operator P(i,j), let A be a nxn matrix whose element A[i][j] is the number of times that points with grey level (intensity) g[i] occur, in the position specified by P, relative to points with grey level g[j]. Let C be the nxn matrix that is produced by dividing A with the total number of point pairs that satisfy P. C[i][j] is a measure of the joint probability that a pair of points satisfying P will have values g[i], g[j]. C is called a cooccurrence matrix defined by P. Examples for the operator P are: "i above j", "i one position to the right and two below j", etc.


Nearby terms: Conway's Law « Conway's Life « cooC « cooccurrence matrix » cookbook » cooked mode » cookie

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL

©2018 Martin Webb