## 3 Proposed Method
### DEA Process Example  
Given that the first pixel values of the blue color (B in RGB) within an image or image segment are 98, 99, and 100, respectively, their ASCII code equivalents would be b, c, and d. Let us encode the substring \"**bcdi...**\" found within the entire string and consider this part as the starting section of the string. A part of the table displaying the letters following \"b\", \"c\", \"d\" in the visual and their frequencies is presented below. In this example, it is assumed that all the letters following these are represented in the table. Additionally, let us decide the palette number is set to 12 for all characters (assuming that it is calculated with Equation (1)).  
\begin{tabular}{c c} \hline \hline
**Chars** & **The frequency table of the usage of the subsequent characters.** \\ \hline
**b** & (, 66)(a, 65)(d, 59)(, 57)(e, 49)(l, 47)(e, 47)(b, 45)([, 44)(g, 44)(i, 44)(, 42)(f, 41)(, 39)(k, 34)(X, 31)(h, 31)(U, 30)(V, 30)(W, 30)... \\ \hline
**c** & (c, 68)(, 57)(d, 57)(b, 55)(a, 54)(e, 52)(, 47)(, 46)(h, 46)(, 44)(f, 44)(g, 41)(k, 36)(Y, 32)(j, 31)(Z, 30)(i, 28)(W, 26)(X, 26)... \\ \hline
**d** & (, 69)(b, 60)(c, 59)(e, 56)(d, 52)(a, 50)(g, 50)(h, 45)(, 40)(f, 39)(, 35)(], 35)(l, 34)(i, 32)(j, 32)(U, 31)(k, 29)(Y, 27)(m, 27)... \\ \hline \hline \end{tabular}  
The data indicate that there are 20 different letters and their respective frequencies following the letters \"b\", \"c\", and \"d\". For instance, it can be observed that the letter \"a\" appears 65 times after the letter \"b\" throughout the segment or entire image. It is apparent that the character \"i\" is not listed within the first 20 characters.  
\begin{tabular}{c c l} \hline \hline
**Group 1** & b & (, 66)(a, 65)(d, 59)(, 57)(e, 49)(l, 47)(c, 47)(b, 45)(l, 44)(g, 44)(i, 44)(?, 1187) \\ \multirow{2}{*}{**characters**} & d & (c, 68)(, 57)(d, 57)(b, 55)(a, 54)(e, 52)(, 47)(, 47)(, 46)(h, 46)(, 46)(, 44)(?, 1206) \\  & & (, 69)(b, 60)(c, 59)(e, 56)(d, 52)(a, 50)(g, 50)(h, 45)(, 40)(f, 39)(, 35)(?, **1137**) \\ \hline
**Group 2** & b & (, 42)(f, 41)(, 39)(k, 34)(X, 31)(h, 31)(U, 30)(V, 30)(W, 30) \\ \multirow{2}{*}{**characters**} & c & (f, 44)(g, 41)(k, 36)(Y, 32)(j, 31)(Z, 30)(i, 28)(W, 26)(X, 26) \\  & d & (, 35)(l, 35)([, 34)(i, **32**)(j, 32)(U, 31)(k, 29)(Y, 27)(m, 27) \\ \hline \hline \end{tabular}  
The frequency value of the last element in Group 1 is the sum of the frequencies of the elements that come after the palette number. This value is represented by the \"?\" character in this example. For the Group 1 and Group 2 sections of the letters b, c, and d, different Huffman trees are generated before. Let us encode the \"**b**cdi**\" characters.  
1. Since the letter \"b\" is the first character in the image, it is encoded according to its 8-bit ASCII-code representation.
2. The character \"c\" follows the character \"b\" and, as observed, since it belongs to Group 1, the code word created for the character \"c\" in the Group 1 Huffman tree is used.
3. The character \"d\" follows the character \"c\" and, since the character \"d\" also belongs to Group 1, the code word from the Group 1 Huffman tree is used for the character \"d\".
4. The situation is different for the character \"i\" that follows the character \"d\". When examining the tables for the character \"d\", it is observed that the character \"i\" belongs to Group 2, not Group 1. Therefore, we cannot write the code word for the character \"i\" from the Group 1 Huffman tree. First, the code word for the character \"?\" is added, followed immediately by the code word for the character \"i\" from the Group 2 Huffman tree.  
In this manner, this encoding process is repeated iteratively until the original image or image segments have been completely processed. The flowchart presented in Figure 8 provides a detailed visual representation of the steps summarized above.