  A greedy pursuit strategy which finds a common basis for approximating a set
of similar signals is proposed. The strategy extends the Optimized Orthogonal
Matching Pursuit approach to selecting the subspace containing the
approximation of all the signals in the set. The method, called Simultaneous
Optimized Orthogonal Matching Pursuit, is stepwise optimal in the sense of
minimizing at each iteration the mean error norm of the joint approximation.
When applied to compression of electrocardiograms, significant gains over other
transformation based compression techniques are demonstrated on the MIT-BIH
Arrhythmia dataset.
