Research Article | Open Access
Minghe Mao, Tianhe Li, Mingwei Shen, Ning Cao, Rui Shi, Rui Li, "A Truncated Matrix Completion Algorithm Using Prior Information for Wind Turbine Clutter Suppression", Mathematical Problems in Engineering, vol. 2021, Article ID 8814415, 10 pages, 2021. https://doi.org/10.1155/2021/8814415
A Truncated Matrix Completion Algorithm Using Prior Information for Wind Turbine Clutter Suppression
The conventional matrix completion (MC) regularizes each singular value equally, and thus the rank cannot be well approximated, which greatly limits the flexibility and accuracy of MC usage. In this paper, a truncated MC algorithm using prior information to determine the threshold while generating the target rank is proposed for the wind turbine clutter suppression of weather radar. During the singular value shrinking process, an appropriate threshold is selected to obtain the optimal approximation of the sampling matrix. Specifically, the mean value of the diagonal element in the recovered weather matrix is calculated to improve the robustness of the recovery result effectively. Simulation results demonstrate that the proposed algorithm reduces the computational complexity as well as further improves the MC accuracy and realizes the effective suppression of the wind turbine clutter.
In response to the global energy crisis and climate change, countries around the world have a huge demand for renewable and clean energy. As an important form of renewable and clean energy, wind power  generation has attracted great attention all over the world. However, motion clutter caused by the rotation of wind turbine blades has a serious impact on radio signal processing . Many scholars delve into the Doppler characteristics of wind turbine clutter (WTC) on scanning and bunching under two different working modes and propose some algorithms for WTC suppression [3–6]. However, due to the rotation of large blades, the Doppler spectrum of WTC is broadened and even overlapped, and thus, the echo of weather radar is submerged in the WTC. There have been some studies on clutter suppression technologies such as [7, 8], but none of them can simultaneously suppress WTC and recover weather information under lossless weather signal processing.
It is known that the weather echo in the space-time domain meets the stationary distribution features, and the echo signal in the distance-Doppler two-dimensional transform domain has the characteristic of low-rank sparse distribution.
In recent years, with the deepening of research on compressed sensing theory, matrix completion (MC) technology has been widely used in many scientific and engineering fields [7–9] including computer vision , machine learning , image inpainting , radar signal processing, and so on. When the signal is expressed in the form of a matrix, and the singular values of the matrix are sparse (the matrix is low-rank), and the number of samples meets certain conditions, most matrices can accurately restore all elements by solving the kernel norm minimization problem. This is matrix completion (MC). As a new powerful branch of signal and image processing, MC has become another important signal acquisition tool following compressed sensing. In many practical scenarios, the information to be recovered is usually represented by a data matrix. However, these data often encounter problems such as loss, damage, and noise pollution. In order to obtain accurate data in these situations, researchers insightfully extend the compressed sensing theory from the vector space to the matrix space , and then, the sparse characteristic (the low rank of the matrix) is used to recover the target matrix by sampling some elements from the data matrix.
Many optimization algorithms have been proposed to solve the MC problem. They can be summarized into two main categories with respect to the nature of the optimization problem. One of them employs nuclear norm minimization (NNM) such as the accelerated proximal gradient (APG) algorithm  and the augmented Lagrange multiplier (ALM) algorithm . The other minimizes an approximation error objective function on a Grassmann manifold such as the subspace evolution and transfer (SET) algorithm . Compared with the optimization algorithms (SET), a distinct advantage of NNM is that it is the tightest convex relaxation to the nonconvex LRMF problem with certain data fidelity terms, and hence, it has been attracting great research interest in recent years. Therefore, for the matrix completion problem, the subspace evolution and transfer (SET) algorithm is not as efficient as the NNM algorithm. In addition, matrix filling under noise , accelerated singular value threshold method , and so on have also been studied for the MC problem.
Among these algorithms, almost all algorithms need to calculate the singular value decomposition (SVD) of the matrix. However, in order to pursue the convexity of the objective function, the standard NNM equivalently regularizes all singular values. At the same time, because of the nonconvexity and discontinuous nature of the rank function, existing algorithms cannot directly and effectively solve the rank minimization problem. Theoretical studies show that the nuclear norm, the sum of singular values of a matrix, is the tightest convex lower bound of the rank function of matrices . Therefore, a widely used approach is to apply the nuclear norm as a convex surrogate of the nonconvex matrix rank function . Due to the low-rank structure of the sparse matrix, only a few large singular values affect the result of MC. However, when the singular values of the nuclear norm are thresholded with the same constant, the information of large singular values will be lost , and then, the recovered data will generate a low peak signal-to-noise ratio (SNR), which greatly limits its ability and flexibility to deal with many practical problems such as denoising. Therefore, this paper fully integrates the prior information in the matrix to obtain prior knowledge about the weights of different singular values according to the observation matrix, then introduces a truncated nuclear norm in the objective function, and proposes a truncated matrix completion (TMC) algorithm [21, 22] using prior information. This algorithm studies different weight assignment methods of singular value instead of thresholding all singular values with the same constant and ignores unimportant or noisy parts to obtain the optimal approximation of the original matrix on low rank. According to the particularity of Toeplitz observation matrix structure, the mean value method is also used to process the restored data after completion. Simulation results show that the proposed algorithm has better completion performance than conventional MC methods.
The rest of this paper is organized as follows. In Section 2, the signal model is introduced. The rank minimization is performed based on NNM in Section 3. After that, the TMC algorithm is designed using the mean value technique in Section 4. In Section 5, simulation results are presented. At last, the conclusion of this paper is drawn in Section 6.
2. Signal Model
In radar systems, suppose that the range bin contains both WTC and the weather signal. The received signals in a given azimuth-range cell within the coherent integration time (CIT) can be expressed as follows:where is the number of pulses in CIT. represents the weather signal, is the ground clutter, is the WTC, and represents the noise.
Let be the Toeplitz matrix form of weather radar echo signal. Similarly, , , , and are the Toeplitz matrix form of weather signal, ground clutter signal, WTC, and noise, respectively. Therefore, equation (1) can be written as follows:
The weather signal is formed by the coherent superposition of all the scattering echoes in the range bin, assuming that the target is moving with a constant radial speed. The weather signal can be expressed as follows:where denotes the number of all scattering particles, represents the complex amplitude of each scattering particle, and is the time domain angular frequency expressed as follows:where is the pulse repetition frequency, and is the Doppler frequency.
3. Low-Rank Minimization with Truncated Nuclear Norm
3.1. The Construction of the Objective Function Using the Truncated Nuclear Norm
Based on the observation that the visual data probably has a low-rank form, it is natural to assume that the underlying matrix is with low rank or approximately has a low-rank form. Specifically, when the incomplete data matrix of low rank is given, the matrix completion problem can be formulated as follows:where stands for minimization. The constraint condition can also be expressed as , where is the projection operator.
In equation (5), since the is a nonconvex function, it is difficult to be solved directly. Then the nuclear norm of the matrix is introduced, and the following can be obtained:
However, the standard nuclear norm minimization regularizes each singular value equally to pursue the convexity of the objective function, which causes weak fusion ability of prior information, low computational efficiency, and poor flexibility. Therefore, the prior information in the matrix is integrated to obtain different singular values according to the observation matrix. Due to the fast attenuation of singular value sequences, the weight information of the singular value sequence needs to be obtained, and the optimal threshold can be selected. In order to analyze the optimization problem, the truncated nuclear norm for an observation matrix is represented as the sum of its smallest singular values . The following can be obtained:
Then, the matrix completion model of the traditional nuclear norm optimization algorithm in equation (6) can be reconstructed as follows:
In the truncated nuclear norm, is a nonconvex smooth function, which is different from the definition of traditional nuclear norm. Therefore, the extreme value of the objective function in the above equation must be the optimal solution of the corresponding low-rank regularization constraint. Literature  shows that the minimization algorithm based on truncated nuclear norm can effectively solve the rank minimization problem with high efficiency. The following theorem defines the computational efficiency of TMC compared with the traditional method. For any obtained data matrix and any nonnegative integer , it can be written as follows:where , , and . Since the ranks of matrices and are both r, , when , . Therefore, it can be determined that is the eigenvalue of and . Thus, , is true, that is, when , the eigenvalues of the matrix are all 0. Then, the following can be obtained:
Since and , the following can be obtained:
Then the following can be obtained:
After singular value decomposition of the observation matrix Xwhere and denote the subspaces of the matrix . When and
At last, the following can be obtained:
Since the NNM algorithm has been reconstructed into the truncated matrix completion, in order to solve equation (8), the relation between truncated nuclear norm and conventional nuclear norm can be given as follows:
Therefore, equation (8) can be re-expressed as the following nonconvex optimal function:
From the above equation, it can be seen that unlike the conventional NNM algorithm that minimizes the sum of all eigenvalues, truncated nuclear norm only minimizes the sum of the minimum , while the maximum nonzero eigenvalues of the matrix are not restricted by summation in the process of solving, which avoids thresholding all singular values with the same constant and, thus, obtains the optimal approximation of the original matrix with low rank. Then better approximation of the exact solution can be implemented.
3.2. Selection of the Truncated Length
After the matrix passes through the SVD, the singular value sequence of the matrix can be obtained. The amount of information contained in the singular value of the matrix is proportional to the size of the singular value. The larger singular value represents the main component of the matrix, and the smaller singular value mainly contains the noise information used to reconstruct the matrix. Therefore, it is necessary to ensure that the smaller singular values representing noisy data are eliminated as many as possible without losing the larger singular values, which contain the effective information of the matrix while minimizing the nuclear norm. Without changing the size of the first largest singular values, the truncated nuclear norm solves the problem of minimizing the rank of the matrix by minimizing the sum of the smallest singular values.
To select properly, the attenuation point has to be found where the singular value begins to decrease significantly. In order to quickly and accurately determine the truncation position, the last significant jump point of the singular value can be found and used as the value of . A diagonal matrix can be obtained by performing SVD on the matrix . The elements in the diagonal matrix are the singular values of the matrix , being arranged in large-to-small order from, and decay rapidly. The sum of the first 10% or even 5% singular values occupies more than 90% of the sum of all singular values. For the rank operator of the matrix, the number of singular values is equal to the rank of the matrix. As shown in Figure 1, the most significant attenuation point O is observed , and this point is used as the best cutoff position that all the smaller singular values after the O point are cut off.
The above operation can better retain the effective components of the matrix and filter out the noise data from the echo signal interference. Therefore, by choosing a suitable truncation length, r can effectively improve the accuracy of the truncated matrix completion algorithm to recover the weather signal, which is of important significance.
3.3. Weather Signals Recovery Using Truncated Matrix Completion
Compared with NNM, the truncated nuclear norm is a lower-rank constraint that is approximated to the real low-rank matrix. For the TMC problem in equation (8), some efficient algorithms are introduced to optimize it. Since the high-dimensional nuclear norm minimization can effectively solve the rank minimization problem, the RegL1-ALM  algorithm is used to calculate the TMC problem , which is called TMC-IALM for short in this paper. The original low-rank optimization problem is reconstructed by introducing a new relaxation variable. Since each iteration has a closed solution, the calculation efficiency can be higher. In this way, the original regular constrained optimization problem in TMC is reconstructed into a series of unconstrained convex and nonconvex subproblems, so that it can be solved quickly. What is different from equation (8) is that it considers the influence of interference noise. The TMC problem is transformed into a convex optimization solution to the problem of the following formula by introducing a relaxation variable to complete the unknown element :where is the projection to the indicator set with the only nonzero subspace of sparse matrix, it keeps the entries in Ω unchanged and sets those outside Ω (i.e., in ) zeros.
Specifically, for formula (18), firstly, the augmented Lagrange function of TMC-IALM is defined as follows:where represents the truncated nuclear norm of the weather matrix . Y represents the Lagrangian multiplier matrix, the initial value is 0. μ > 0 is the penalty parameter. (·) represents the real part of a complex number. <X, Y> = tr (XHY) represents the inner product of a matrix.
In the reconstruction of TMC-IALM, relaxation variables are used to minimize the truncated nuclear norm to make full use of the target rank information. During the optimization process, the next solution of each iteration can be derived strictly, and the optimal approximation solution is obtained to guarantee the validity of the constraint.
4. TMC Algorithm Design Based on Mean Value Technique
In practice, sampling matrix often has a special structure, such as Toeplitz structure and Hankel structure, so it is very meaningful to study the filling of such special matrices. Many scholars have conducted in-depth research on the special structure and properties of Toeplitz matrix [26–28]. In addition, as an important special matrix, Toeplitz matrix plays an important role in a wide range of scientific and engineering fields especially in signal and image processing [29, 30]. The Toeplitz matrix of one dimension has the following form:
During the whole receiving time, the array elements which contain the WTC can be set to zero, and then construct the signals under each pulse as an Toeplitz matrix as shown below, times in total. In the new matrix, the high-precision completion is realized by the sparseness and strong incoherence property of the Toeplitz matrix.
By observing equation (21), it can be found that the matrix is determined by elements, namely, the first row and the first column. According to the special structure and properties of the above Toeplitz matrix, the mean value method  can be used in the original TMC-IALM iterative algorithm, and the iterative matrix Toeplitz structure is maintained in the recovered weather signal matrix . While ensuring fast SVD, the recovery data of matrix completion is optimized, which reduces the uncertainty of recovery data. Specifically, during the TMC-IALM iteration process in Algorithm 1, the mean value of the elements in the output matrix can be obtained after the weather matrix is updated.
The completed weather signal is generated through the TMC-IALM algorithm and then is processed by the mean value method to obtain a completed weather echo matrix. The flow chart of adaptive clutter suppression for wind turbines based on TMC is shown in Figure 2.
5. Simulation Results
In this section, a computer simulation of the weather signal recovery is built and tested for the performance of the proposed algorithm. For the experiment, 64 pulses and 100 distance units are selected to test the algorithm, assuming the existence of WTC in the 30th range bin; then it has to be set to zero and constructed as a Toeplitz matrix. The remaining 63 pulse signals are simulated successively. The 30th vector element of each pulse extracted constitutes the echo signal after WTC suppression, and the simulation parameters are shown in Table 1. Taking into account the accuracy of the test, the results below are the average of 100 independent Monte Carlo experiments.
In order to verify the effect of inherent prior information such as singular values on recovery performance, a truncated nuclear norm is used in the objective function to filter out the smaller values based on different truncation lengths, which generates different truncated segments. It also verifies the importance of choosing the cutoff length properly.
Figure 3 shows the original curve of the weather signal together with the weather signal recovered by the TMC after gradually adding singular values. It can be seen that when fewer singular values are used, the reconstructed curve is less effective. If the matrix rank is known as , then the first singular value matrices contain more effective information. When the number of singular values increases to , the reconstructed curve is getting closer to the original curve. Since the reduction of the truncated nuclear norm is accompanied by the reduction of the matrix rank when the TMC is minimized, the truncated nuclear norm can better approximate the rank function of the matrix. Meanwhile, in the process of singular value contraction, the part of unimportant noise is ignored, and the largest part of the singular value related to the main component of the matrix is not contracted, which better protects the effective components of the matrix. In addition, the top 1% and 10%, respectively, represent different truncation points in the singular value sequence. Through the comparison of the performance of the two data recovery, it can be seen that the selection of the truncation point is very important for either the advantages of the TMC algorithm can be exerted or the recovery accuracy of the weather signal can be improved.
After properly selecting the truncation length, the TMC-IALM algorithm is used to restore the weather signal sequence sequentially under each pulse and reconstruct it into an equivalent Toeplitz matrix. Figure 4 compares the Doppler spectrum of weather signals after the suppression of WTC based on the NNM and TMC algorithms. When the frequency is between 300 and 400 Hz, the noise interference is weak, and the weather signal recovery accuracy is high. The peak side lobe has a significant effect on suppressing high interference noise, and the fluctuation of noise at the side lobe is reduced, which improves the SNR. It can also be seen that the TMC algorithm based on this paper has better interference suppression performance than the NNM-based algorithm.
Figure 5 shows the estimated mean value of the radial velocity of the weather signal recovered by the TMC-IALM algorithm. When the SNR is low, the radial velocity value fluctuates greatly; the degree of dispersion is high; and there is a large deviation from the true value. However, as the SNR increases, the error of the radial velocity estimation gradually decreases and eventually converges to true value. Comparing the NNM-IALM and TMC-IALM algorithms before and after improvement, it is found that the improved algorithm proposed in this paper fluctuates much more smoothly, and it only has a smaller difference from the original value, which shows its higher convergence and better performance.
Figure 6 shows the signal recovery results under different SNRs. The root-mean-square error (RMSE) of its estimated and true values is defined as . From the average results of 100 independent Monte Carlo experiments, it can be seen that with the increase of the SNR of the input signal, the effect of singular value decomposition and the error of matrix completion are significantly reduced. In addition, compared with the IALM algorithm before and after improvement, the RMSE of matrix completion decreases with the increase of the SNR, and the algorithm proposed by TMC-IALM has smaller recovery errors and better performance. Although the algorithm needs to perform singular value decomposition on the correlation matrix, and noise factors will affect the results of the singular value decomposition, the algorithm proposed in this paper assigns different weights to each singular value in the nuclear norm. While intercepting the small singular values with the noise information used to reconstruct the matrix, the large singular value information is retained, which reduces the negative impact of the noise on the weather data and improves the recovery performance of the signal.
The matrix elements recovered by the TMC-IALM algorithm only contain the vector sequence under the single pulse of the weather signal, and the Toeplitz matrix element values corresponding to the same vector unit are more discrete. Therefore, the mean value method is used to process the recovered data. Figure 7 shows the weather signal under the 10th pulse and the 30th distance unit recovered by the TMC algorithm before and after the mean value method. It can be seen that the weather signal obtained by the TMC-IALM algorithm has obvious fluctuations and the accuracy of the recovered data is relatively low. However, the mean value method is used to optimize the matrix to complete the recovery data, which reduces the uncertainty of the recovery data and has smaller output fluctuation, which improves the stability and accuracy of the recovery results.
Figure 8 shows the estimated mean value of the weather signal radial velocity recovered after the mean value processing TMC-IALM algorithm. Similar to the above analysis, the lower the SNR, the higher the degree of radial velocity value dispersion, and the velocity estimation error gradually converges to the true value as the SNR increases. After the mean value method is processed, the weather data recovered by the TMC algorithm is optimized, which reduces the numerical uncertainty and has better robustness.
Figure 9 shows the recovery error curves of the TMC algorithm before and after the mean value method. Both algorithms decrease with the increase of SNR of the input signal. However, compared with the TMC algorithm before and after the improvement, it can be seen that the influence of noise factor on singular value decomposition is reduced, and the recovery error of the algorithm after the mean treatment is lower, and thus, the performance is better.
Since matrix completion theory is based on low-rank characteristics, it can reduce noise or disturbance and improve SNR in the solving process. Figure 10 shows the denoising results of the three algorithms that can restore the missing data and reduce the noise disturbance in the signal subspace of the weather signal. Comparing the performance curves of the three algorithms, it can be seen that the noise reduction effect based on the TMC algorithm is significantly better than the NNM algorithm. When the input SNR is greater than 10∼15 dB, the ratio of the noise disturbance in the signal subspace and noise subspace changes accordingly. The ratio in the noise subspace increases, and the noise reduction performance is more obvious.
Based on the traditional nuclear norm optimization algorithm, this paper has studied an optimization completion algorithm based on truncated nuclear norm and further deduced the algorithm based on TMC-IALM. The algorithm uses the truncated nuclear norm instead of the nuclear norm and only minimizes the sum of to avoid the problem that the traditional nuclear norm optimization algorithm has insufficient ability to approximate low-rank matrices. In addition, in the process of iteratively performing singular value shrinkage, the unimportant or noise-producing parts are ignored, and the prior knowledge of the observation matrix is fully and flexibly fused, which improves the utilization rate of the prior singular value information to a certain extent. The algorithm better protects the effective singular values related to the main components of the matrix. At the same time, the algorithm aims to pursue the convexity of the objective function, reducing the time complexity of singular value decomposition. The above process has sped up the algorithm convergence and maintained the accuracy and robustness of the recovery results.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
This work was supported in part by the National Natural Science Foundation of China under grant nos. 41830110, 61771182, and 61701167.
- J. G. Slootweg, S. W. H. De Haan, H. Polinder, and W. L. Kling, “Modeling wind turbines in power system dynamics simulations,” in Proceedings of the Power Engineering Society Summer Meeting Conference Proceedings (Cat. No.01CH37262), pp. 22–26, Vancouver, Canada, July 2001.
- B. M. Isom, R. D. Palmer, G. S. Secrest et al., “Detailed observations of wind turbine clutter with scanning weather radars,” Journal of Atmospheric and Oceanic Technology, vol. 26, no. 5, pp. 894–910, 2009.
- W.-Q. Wang, “Detecting and mitigating wind turbine clutter for airspace radar systems,” The Scientific World Journal, vol. 2013, Article ID 385182, 8 pages, 2013.
- J. Yang, C. Pan, C. Wang, D. Jiang, and B. Wen, “Wind turbine clutter mitigation in coastal UHF radar,” The Scientific World Journal, vol. 2014, Article ID 529230, 8 pages, 2014.
- W. K. He, X. Zhang, F. H. Bi, and L. Yang, “Wind farm clutter suppression for air surveillance radar based on a combined method of clutter map and K‐SVD algorithm,” IET Radar, Sonar & Navigation, vol. 14, no. 9, pp. 1354–1364, 2020.
- X. P. Li, L. H. Huang, H. C. So, and B. Zhao, “A survey on matrix completion: perspective of signal processing,” 2019, https://arxiv.org/pdf/1901.10885.
- E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational Mathematics, vol. 9, no. 6, pp. 717–772, 2009.
- E. J. Candès and Y. Plan, “Matrix completion with noise,” Proceedings of the IEEE, vol. 98, no. 6, pp. 925–936, 2010.
- E. J. Candès and T. Tao, “The power of convex relaxation: near-optimal matrix completion,” IEEE Transactions on Information Theory, vol. 56, no. 5, pp. 2053–2080, 2010.
- C. Tomasi and T. Kanade, “Shape and motion from image streams under orthography: a factorization method,” International Journal of Computer Vision, vol. 9, no. 2, pp. 137–154, 1992.
- Y. Amit, M. Fink, and N. Srebro, “Uncovering shared structures in multiclass classification,” in Proceedings of the 24th International Conference on Machine Learning, pp. 17–24, New York, NY, USA, March 2007.
- M. Bertalmio, G. Sapiro, and V. Caselles, “Image Inpainting,” in Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, pp. 417–424, New York, NY, USA, July 2000.
- J.-F. Cai, E. J. Candès, and Z. Shen, “A singular value thresholding algorithm for matrix completion,” SIAM Journal on Optimization, vol. 20, no. 4, pp. 1956–1982, 2010.
- K. C. Toh and S. Yun, “An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems,” Pacific Journal of Optimization, vol. 6, no. 3, pp. 615–640, 2010.
- Z. Lin, M. Chen, L. Wu, and Y. Ma, “The augmented Lagrange multiplier method for exact recovery of corrupted low rank matrices,” 2009, https://arxiv.org/abs/1009.5055.
- W. Dai, O. Milenkovic, and E. Kerman, “Subspace evolution and transfer (SET) for low-rank matrix completion,” IEEE Transactions on Signal Processing, vol. 59, no. 7, pp. 3120–3132, 2011.
- Y. Hu and D. B. Zhang, “Accelerated singular value thresholding for matrix completion,” in Proceedings Of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 298–306, New York, NY, USA, July 2012.
- B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,” SIAM Review, vol. 52, no. 3, pp. 471–501, 2010.
- S. Ma, D. Goldfarb, and L. Chen, “Fixed point and Bregman iterative methods for matrix rank minimization,” Math. Programming, vol. 128, no. 1-2, pp. 321–353, 2011.
- Z. Cui, D. Zhang, K. Wang, H. Zhang, N. Li, and W. Zuo, “Weighted nuclear norm minimization based tongue specular reflection removal,” Mathematical Problems in Engineering, vol. 2015, Article ID 979415, 15 pages, 2015.
- D. Zhang, Y. Hu, and J. Ye, “Matrix completion by truncated nuclear norm regularization,” in Proceedings of the Computer Vision And Pattern Recognition (CVPR), Providence, RI, USA, November 2012.
- Y. Hu, D. Zhang, J. Ye, X. Li, and X. He, “Fast and accurate matrix completion via truncated nuclear norm regularization,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 9, pp. 2117–2130, 2013.
- A. C. Antoulas, “Summary of recent results on the decay rate of the Hankel singular values,” in Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No. 01CH37228), Orlando, FL, USA, December 2001.
- Y. Zheng, G. Liu, S. Sugimoto, S. Yan, and M. Okutomi, “Practical low-rank matrix approximation under robust L1-norm,” in Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp. 1410–1417, Providence, RI, USA, June 2012.
- S. Gu, Q. Xie, D. Meng, W. Zuo, X. Feng, and L. Zhang, “Weighted nuclear norm minimization and its applications to low level vision,” International Journal of Computer Vision, vol. 121, no. 2, pp. 183–208, 2017.
- A. K. Shaw, S. Pokala, and R. Kumaresan, “Toeplitz and Hankel approximation using structured approach,” in Processing of the IEEE International Conference Acoustics, Speech and Signal Processing, pp. 2349–2352, Seattle, WA, USA, May 1998.
- W.-H. Fang and A. E. Yagle, “Two methods for Toeplitz-plus-Hankel approximation to a data covariance matrix,” IEEE Transactions on Signal Processing, vol. 40, no. 6, pp. 1490–1498, 1992.
- G. Cortelazzo, G. A. Mian, and R. Rinaldo, “Toeplitz properties of the block matrices encountered in the processing of spatiotemporal signals,” IEEE Transactions on Signal Processing, vol. 39, no. 7, pp. 1672–1674, 1991.
- W. U. Bajwa, J. D. Haupt, and G. M. Raz, “Toeplitz-structures compressed sensing matrices,” in Processing of the IEEE/SP 14th Workshop on Statistical Signal Processing, Madison, WI, USA, August 2007.
- S. Noschese, L. Pasquini, and L. Reichel, “Tridiagonal Toeplitz matrices: properties and novel applications,” Numerical Linear Algebra with Applications, vol. 20, no. 2, pp. 302–326, 2013.
- C. Wang, C. Li, and J. Wang, “A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion,” Advances in Computational Mathematics, vol. 42, no. 5, pp. 1209–1224, 2016.
Copyright © 2021 Minghe Mao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.