Table - PMC

Skip to main content

View full-text article in PMC

. 2014 Dec 24;15(1):234–247. doi: 10.3390/s150100234

Algorithm 3 Lorentzian peak matching pursuit with a mask.

Input:
- measurement matrix A ∈ M_K_×2_N₊₁(ℂ)
- measurement vector y ∈ ℂ^K
- stopping parameter α > 0
- Lorentzian peaks $L_{l}^{i} \in C^{2 N + 1}$ where j ∈ [0, J], l ∈ [−N, N]
- Mask ⊂ [−N, N]
Output:
- f^ _LPMP ∈ ℂ²^N⁺¹
Initialization:
- f^ _LPMP = 0, j = 0,b = 0,i = 0,δ = ‖y‖₂
The main loop:
while ‖y – Af^_LPMP‖₂ ≤ αδ or i = 0 do
- δ = ‖y – Af^‖₂
- i = i + 1
- $l_{i} ≔ \underset{l \in Mask}{arg max} | A * {(y - A {\hat{f}}_{LPMP})}_{l} |$
- $(b_{l_{i}, j,} b_{l_{i - 1}, j_{i - 1}}, \dots, b_{l_{1}, j_{1}}) = \underset{z \in C^{i}}{argmin} {‖ y - A (z_{i} L_{l_{i}}^{j} + z_{i - 1} L_{l_{i - 1}}^{j_{i - 1}} + \dots + z_{1} L_{l_{1}}^{j_{1}}) ‖}_{2}$
- $j_{i} = \underset{j \in [0, J]}{argmin} {‖ y - A (b_{l_{i}, j} L_{l_{i}}^{j} + b_{l_{i - 1}, j_{i - 1}} L_{l_{i - 1}}^{j_{i - 1}} + \dots b_{l_{1}, j_{1}} L_{l_{1}}^{j_{1}}) ‖}_{2}$
- ${\hat{f}}_{LPMP} = b_{l_{i}, j_{i}} L_{l_{i}}^{j_{i}} + b_{l_{i - 1}, j_{i - 1}} L_{l_{i - 1}}^{j_{i - 1}} + \dots + b_{l_{1}, j_{1}} L_{l_{1}}^{j_{1}}$
end while