Francisco, Nelson C.M. M. Rodrigues, NunoSilva, Eduardo A. B. daCarvalho, Murilo B. deFaria, Sergio2025-11-272025-11-272011-04N. C. Francisco, N. M. M. Rodrigues, E. A. B. da Silva, M. B. de Carvalho and S. M. M. de Faria, "Computational complexity reduction methods for multiscale recurrent pattern algorithms," 2011 IEEE EUROCON - International Conference on Computer as a Tool, Lisbon, Portugal, 2011, pp. 1-4, doi: 10.1109/EUROCON.2011.5929396.978-1-4244-7486-8http://hdl.handle.net/10400.8/14753The Multidimensional Multiscale Parser algorithm was originally proposed as a generic lossy data compression algorithm. An high degree of adaptivity and versatility allowed it to outperform state-of-the-art transform-based compression methods for a wide range of applications, from still images, compound documents, or even ECG's, just to name a few. However, as other pattern matching algorithms, it presents a high computational complexity. In this paper, we investigated several techniques that allowed to considerably reduce both the encoder's and the decoder's computational complexity, with marginal R-D performance losses. The most important reduction was achieved on the decoder, that reduced up to 95% the time required by the previous method. These improvements contribute to affirm MMP as an alternative to traditional transform-based encoders, approaching its computational complexity with that of transform-based algorithms.engImage CodingPattern MatchingData Compressionconference paper10.1109/eurocon.2011.5929396