Thresholding Methods: Difference between revisions
From Brain Mapping Unit
Jump to navigationJump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
===Global Thresholding=== | ===Global Thresholding=== | ||
A simple filtering technique is to apply a continuously variable threshold,<math> \tau</math>, to the association matrix <math>A</math>, so that <math>A_{i,j} = 1</math> if <math> \rho_{i,j} > \tau</math>, and <math>A_{i,j} = 0</math> otherwise. | |||
===Fixed Cost=== | ===Fixed Cost=== | ||
As <math>\tau</math> is continuously variable, it is possible to use this and related filtering techniques to construct binary graphs of arbitrary connection density or topological cost, <math>0 < \kappa < 1</math>, where <math>\kappa</math> is the number of edges in the graph (or non-zero elements in the adjacency matrix) divided by the maximum possible number of edges, <math>N . (N - 1)</math>. | |||
===MST-based methods=== | ===MST-based methods=== | ||
Revision as of 09:41, 19 May 2011
Global Thresholding
A simple filtering technique is to apply a continuously variable threshold,, to the association matrix , so that if , and otherwise.
Fixed Cost
As is continuously variable, it is possible to use this and related filtering techniques to construct binary graphs of arbitrary connection density or topological cost, , where is the number of edges in the graph (or non-zero elements in the adjacency matrix) divided by the maximum possible number of edges, .
