We propose an analytical representation of complexity diagrams based on information about the number of discretes in the signal spectrum and the signal-to-noise ratio. This approach provides additional criteria for solving the classification problem. We formulate and prove lemmas on the construction of analytical metric grids for complexity diagrams. The obtained results are verified by numerical experiments, which have confirmed the efficiency of these methods.