A new algorithm is introduced which is related to matching pursuit but allows updating more than one coding coefficient per iteration: the updated coefficients correspond to mutually orthogonal elements of the dictionary. Coding experiments on natural images show that the new method achieves the same trade-off as matching pursuit between number of coding coefficients and reconstruction error, but significantly faster convergence.