For the particular selected type of fractals, i.e., the Kronecker product based fractals, the introductory common classification is proposed. It essentially relies on the size and content of the initial fractal matrix. In turn, it gives one of the possible explanation of the phenomenal ability to produce a few of the most popular fractals using many different algorithms, languages and tools. Also, it paves the way to discover on the regular basis thousands of the new fractals, and this gives researchers a wider range of fractal models to choose from.

Kronecker products of matrices have some striking operation properties, one of which is called the mixed-product property $(A \!\otimes\! B)(C \!\otimes\! D) = AC \!\otimes\! BD$. In view of this property, the two-term Kronecker product $A_1 \otimes A_2$ can be rewritten as $A_1 \otimes A_2 = (A_1 \otimes I_{m_2})(I_{m_1} \otimes A_2)$ of dilation forms of $A_1$ and $A_2$, and three-term Kronecker product $A_1 \otimes A_2 \otimes A_3$ can be rewritten as the products $A_1 \otimes A_2 \otimes A_3 = (A_1\otimes I_{m_2} \otimes I_{m_3})(I_{m_1} \otimes A_2 \otimes I_{m_3})(I_{m_1} \otimes I_{m_2} \otimes A_3)$ of the dilation forms of $A_1$, $A_2$, and $A_3$, respectively, where the matrices on the right-hand sides of the two factorizations are commutative. In this note, we approach the commutative Kronecker products on the right-hand sides of the two factorization equalities, and present a variety of new and useful analytical formulas for calculating the ranks, dimensions, orthogonal projectors, and ranges of matrices composed of these Kronecker products.

For massive multiple-input multiple-output (MIMO) communications, the minimum mean square error (MMSE) scheme provides close to optimal recognition but involves inverting the high-dimensional matrix. A Gauss-Seidel (GS) detector based on conjugate gradient and Jacobi iteration (CJ) joint processing is introduced to address this problem. Firstly, the signal is initialized with the best of the three initialization regimes for faster algorithm convergence. Secondly, the signal is processed together with CJ. Finally, the pre-processed result is transferred to the GS detector. The simulation results indicate that the proposed iterative algorithm has a lower BER performance than the GS and improved iterative scheme based on GS in channels with different correlation levels.

Multimodal medical image fusion is a fundamental but challenging problem in the fields of brain science research and brain disease diagnosis, and it is challenging for sparse representation (SR)-based fusion to characterize activity level with single measurement and no loss of effective information. In this paper, the Kronecker-criterion-based SR framework is applied for medical image fusion with a patch-based activity level integrating salient features of multiple domains. Inspired by the formation process of vision system, the spatial saliency is characterized by textural contrast (TC), which is composed of luminance and orientation contrasts to promote more highlighted texture information to participate in the fusion process. As substitution of the conventional l1-norm-based sparse saliency, a metric of sum of sparse salient features (SSSF) is used for promoting more significant coefficients to participate in the composition of activity level measure. The designed activity level measure is verified to be more conducive to maintain the integrity and sharpness of detailed information. Various experiments on multiple groups of clinical medical images verify the effectiveness of the proposed fusion method on both visual quality and objective assessment. Furthermore, the research work of this paper is helpful for further detection and segmentation of medical images.