# Stripe-Based Futurism-like Image--A New Type of Art and Its Application to Cover Communication
## 2 Creation of Stripe-Based Futurism-like Images
### Proposed Art Image Creation Process  
The details of the process described in the previous section for creating a stripe-based Futurism-like art image from a given image are described as Algorithm 1 in the following. ```
0: a source image \(S\), the threshold \(T_{\text{m}}\) for controlling merging of image blocks with similar colors, the threshold \(A_{\text{m}}\) for controlling merging of neighboring image regions close by, and the value \(W_{s}\) for setting the stripe width. 0: a stripe-based Futurism-like art image \(F\). Steps. Stage 1--Finding the region direction. Step 1. Compute the 1-D \(h\)-color of the RGB color values of each pixel in source image \(S\) according to Equation (1). Step 2. Perform the following region growing and merging steps to segment \(S\) into regions \(R_{1}\), \(R_{2}\),..., \(R_{n}\) in \(S\). 2.1 Divide \(S\) into \(8\times 8\) blocks. 2.2 Calculate the average \(h\)-color of each block. 2.3 Merge every two neighboring blocks into one if the difference between their average \(h\)-colors is smaller than the image-block merging threshold \(T_{\text{m}}\). 2.4 Apply the erosion operation and then the dilation operation to the resulting blocks to delete isolated points as illustrated by Figure 6b,c. 2.5 Merge every two resulting regions into one if the Euclidean distance between them is smaller than the image-region merging threshold \(A_{\text{m}}\). Step 3. For each resulting region, set the point in its boundary nearest to the origin point in the upper-left corner of image \(S\) as its _start point_ that will be used for extracting the chain codes of the region in the Step 5. Step 4. Raster scan the entire source image \(S\) to access the start points of all the regions, rearrange the regions according to the raster-scan order of accessing the start points, and name the regions as \(R_{1}\), \(R_{2}\),..., \(R_{n}\) and their respective start points as \((S_{x1}\), \(S_{y1})\), \((S_{x2}\), \(S_{y2}),..., \((S_{x\omega}\), \(S_{y\omega})\). ```  
Figure 10: Two examples of the results of region direction finding and stripe creation. (**a**) Three results of different abstractions of the image by [PERSON] shown in Figure 9a. (**b**) Three results of different abstractions of the image by [PERSON] shown in Figure 9d. Step 5. Perform the following steps to find the coherent chain codes of each region \(R_{i}\), \(i=1,2,\ldots,n\). 5.1 Trace the boundary of \(R_{i}\) to obtain the sequences \(S_{1}\), \(S_{2}\),..., \(S_{k}\) of the chain codes of \(R_{i}\) by the directions illustrated in Figure 7b until the tracing point reaches the start point (\(S_{\text{xi}}\), \(S_{\text{yi}}\)). 5.2 Transform the sequence \(S_{1}\), \(S_{2}\),..., \(S_{k}\) into a sequence of coherent chain code segments \(E_{i}=\{(D_{1},L_{1})\), \((D_{2},L_{2})\),..., \((D_{m},L_{m})\)]. 6. Perform the following steps to conduct polygon approximation using the sequence of coherent chain code segments of each region \(R_{i}\), \(i=1\), \(2\),..., \(n\). 6.1 Analyze the values of the chain codes of the sequence of coherent chain code segments \(E_{i}=\{(D_{1},L_{1})\), \((D_{2},L_{2})\),..., \((D_{m},L_{m})\)] of \(R_{i}\) to obtain the DCC (direction-change code) sequences \(X_{1}\), \(X_{2}\),..., \(X_{m}\) and \(Y_{1}\), \(Y_{2}\),..., \(Y_{m}\) of the X- and Y-coordinate directions, respectively, according to Table 1. 6.2 Acquire the corner points in \(R_{i}\) by the following operations. 1. Create a corner point sequence \(P_{i}=\{(P_{\text{xxi}},P_{\text{yi}})\), \((P_{\text{xxi}},P_{\text{yi}})\), \(\ldots,(P_{\text{xxi}},P_{\text{yi}})\}\) to record to the positions of the corner points of \(R_{i}\) to be found. 2. Assume that the start point (\(S_{\text{xi}}\), \(S_{\text{yi}}\)) of \(R_{i}\) is the first corner point, i.e., the position (\(P_{\text{xxi}}\), \(P_{\text{yi}}\)) is (\(S_{\text{xi}}\), \(S_{\text{yi}}\)). 3. Set a segment, for example the \(c\)-th segment, in \(E_{i}\) as a corner segment when one of the following conditions is met. 1.