Skip to main content
. Author manuscript; available in PMC: 2012 Jul 24.
Published in final edited form as: IEEE Trans Med Imaging. 2011 Feb 14;30(8):1441–1454. doi: 10.1109/TMI.2011.2114362

TABLE III.

Algorithm of Graph-assistanted Greedy Neighborhoods Cover

Input: X, F, a, k, G
Output: B
1. Select arbitrary ℕiF
2. B ← {ℕi}
3. UX − ℕi
4. while U ≠ Ø
5.   do B̃ = ∪ℕ∈B
6.      get L according to (19)
7.      Gsub = G (L, B̃)
8.      T = Gsub · e⃗
9.      let imin denote the index of element which is the
      minimum in T wich constraint: T(imin) ≥ a · k
10.      UX − ℕL{imin}
11.      BB ∪{ℕL{imin}}
12. end while