A comparison of different time-frequency atoms in both ambiguity and time-frequency domains

It is possible to employ different dictionaries for signal decomposition by using the matching pursuit algorithm. In this paper the atoms of four different dictionaries are compared together. The comparisons have been done in both the ambiguity and time-frequency domains, resulting in an identification of those atoms most suitable for time-frequency signal decomposition.