3. The method according to claim 1 , wherein M = 1 r ⁢ ∑ h = 1 r ⁢ ⁢ M ( h ) ⁢ S ( h ) is computed and stored, wherein r denotes the number of correspondence matrices.
3. The method according to claim 1 , wherein M = 1 r ⁢ ∑ h = 1 r ⁢ ⁢ M ( h ) ⁢ S ( h ) is computed and stored, wherein r denotes the number of correspondence matrices. 4. The method according to claim 3 , wherein S = arg ⁢ ⁢ min Y ⁢  M - M ( 0 ) ⁢ Y  2 , where ∥·∥ denotes Frobenius matrix norm, and the term added to the consensus function to enforce the column sparseness constraint is αΣ r h=1 ∥S (h) −(1/k h )1 khkh S (h) ∥ 2 and the penalty term added to the consensus function is βΣ r h=1 ∥S (h) 1 kk −1 khk ∥ 2 .