New Robust Regularized Shrinkage Regression for High-Dimensional Image Recovery and Alignment via Affine Transformation and Tikhonov Regularization

Likassa, Habte Tadesse; Xian, Wen; Tang, Xuan

doi:https://doi.org/10.1155/2020/1286909

International Journal of Mathematics and Mathematical Sciences

On this page

Abstract Introduction Discussion Conclusion Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Research Article | Open Access

Volume 2020 | Article ID 1286909 | https://doi.org/10.1155/2020/1286909

New Robust Regularized Shrinkage Regression for High-Dimensional Image Recovery and Alignment via Affine Transformation and Tikhonov Regularization

Habte Tadesse Likassa,¹Wen Xian,²and Xuan Tang²

Academic Editor: Attila Gil nyi

Received09 May 2020

Revised18 Jul 2020

Accepted27 Aug 2020

Published06 Nov 2020

Abstract

In this work, a new robust regularized shrinkage regression method is proposed to recover and align high-dimensional images via affine transformation and Tikhonov regularization. To be more resilient with occlusions and illuminations, outliers, and heavy sparse noises, the new proposed approach incorporates novel ideas affine transformations and Tikhonov regularization into high-dimensional images. The highly corrupted, distorted, or misaligned images can be adjusted through the use of affine transformations and Tikhonov regularization term to ensure a trustful image decomposition. These novel ideas are very essential, especially in pruning out the potential impacts of annoying effects in high-dimensional images. Then, finding optimal variables through a set of affine transformations and Tikhonov regularization term is first casted as mathematical and statistical convex optimization programming techniques. Afterward, a fast alternating direction method for multipliers (ADMM) algorithm is applied, and the new equations are established to update the parameters involved and the affine transformations iteratively in the form of the round-robin manner. Moreover, the convergence of these new updating equations is scrutinized as well, and the proposed method has less time computation as compared to the state-of-the-art works. Conducted simulations have shown that the new robust method surpasses to the baselines for image alignment and recovery relying on some public datasets.

1. Introduction

High-dimensional images for alignment and recovery [1–4] arise in different scenarios such as image processing [5] and surveillance [6, 7]. However, analyzing high-dimensional data is a challenging task due to miscellaneous adverse effects of occlusions and illuminations, corruptions, and noises. As a result of this, it is important to develop new robust regression methods to mitigate the adverse influence of these annoying effects in high-dimensional data, which are resilient to various annoying effects.

Since the inception of the pioneering work of robust principal component analysis (RPCA) by Candès et al. [8], a myriad of algorithms have been addressed for robust sparse low-rank image recovery, e.g., [9, 10]. However, these methods do not work well when the outliers and heavy sparse noises are heavily skewed. To overcome this drawback, a myriad of robust algorithms have been addressed to deal with outliers and heavy sparse noises in high-dimensional images. Likassa et al. [11–13] considered new robust algorithms via affine transformations and norms for image recovery and alignment which boosted the performance of the algorithms. Moreover, [14–17] proposed an efficient extension of RPCA using affine transformations. However, it lacks robustness to work well in high-dimensional data to remove the potential impacts of adverse effects. The authors of [18–20] developed robust algorithms to decompose the original corrupted data as clean and sparse errors. However, these algorithms are not scalable and robust when the number of observations becomes large. Podosinnikova et al. [21] developed robust PCA to minimize the reconstruction error, but it is not effective to deal with the adverse effects in high-dimensional data. To circumvent this dilemma, Shahid et al. [22] incorporated the spectral graph regularization into the robust PCA. However, it is unable to recover the images due to the adverse effects of outliers and heavy sparse noises lying in high-dimensional data. Shakeri et al. [23] proposed an online sequential framework to recover the low-rank component by pruning out the sparse corruptions. Zhang and Lerman [24] proposed robust subspace recovery to tackle the influence of outliers and heavy sparse noises; however, due to its computational complexity, it limits its scalability to the high-dimensional data. This work is also reviewed in subspace recovery [25–27]. Moreover, De la Torre and Black [28] proposed a parameterized component analysis algorithm to find the low-rank component and used as a robust fitting function to reduce the impact of outliers. However, it is nonconvex, which lacks a polynomial-time algorithm to solve it. Nevertheless, many real-world corrupted images contain severe intensity distortions which are dense and are thus difficult to be subtracted by RASL [17, 29]. Lu et al. [30] proposed an algorithm for tensor robust principal component analysis to tackle the influence of outliers and heavy sparse noises. To tackle this dilemma, Lu et al. [31] addressed exact low-tubal-rank tensor recovery from Gaussian measurements; however, its performance in image recovery is not promising. Moreover, [30–35] addressed an extended version of RPCA for image representation, where these algorithms did not work well with the adverse effects of outliers and heavy sparse noises. To overcome these aggregated dilemmas, [33, 36, 37] addressed a novel low-rank regularized regression model for facial recognition, which seeks to boost the performance of the algorithm with the potential adverse effects. Additionally, there are non-rigid transformation such as [33, 36, 37] some new transformation estimation algorithms are proposed the estimator and apply it to nonrigid registration rather than dense correspondences, and it better uses sparse image representation. However, these methods cost computationally more due to efficient cross-correlation coefficient for the matching lower level of the hierarchy. Thereby, [38, 39] proposed algorithms to deal with outliers and sparse errors; however, they still need to be improved. Therefore, the search of an affine transformation and Tikhonov regularization term is required to improve the performance of algorithms. To circumvent this dilemma, Likassa [11] proposed a low-rank robust regression (LR-RR) algorithm to clean the outliers and sparse errors from highly contaminated data. Although LR-RR can mitigate the impact of sparse errors inside and outside subspaces, its sensitivity to sparse errors and outliers lying in the disjoint subspaces jeopardizes its performance in some severe scenarios. The recent papers also addressed the issue of sparsity for image representation and decomposition [40, 41]. Likassa and Fang [12] addressed a low-rank sparse subspace representation for robust regression (LRS-RR) approach to find the clean low-rank part by low-rank subspace recovery along with regression to deal with errors or outliers lying in the corrupted disjoint subspaces. The main challenge in image recovery and head pose estimation is to tackle the potential impact of outliers and heavy sparse noises.

In this paper, a new robust shrinkage regression algorithm through affine transformation and Tikhonov regularization is proposed for high-dimensional image alignment and recovery. To be more resilient with occlusions and outliers, the new algorithm incorporates affine transformations and Tikhonov regularization. Thereby, the Tikhonov regularization is considered to mitigate multicollinearity in highly distorted data, which helps to reduce the redundancy and tackles the potential impact of the outliers, heavy sparse noises, and occlusions and illuminations. Consequently, the distorted or misaligned images can be rectified by affine transformations and Tikhonov regularization term to render more accurate image decomposition. The search of the optimal parameters and affine transformations is first cast as convex optimization programming. Afterward, the alternating direction method for multipliers (ADMM) approach is employed, and the newly developed and modified set of equations is established to update the parameters involved and the affine transformations iteratively. In this paper, the low-rank components are decomposed into the product of a basis matrix and a regression coefficient matrix, where the basis matrix consists of previously well-aligned images. To constrain the possible solutions, the new method considers the Tikhonov regularization term and nuclear and Frobenius norms with more regularized penalty parameters. Moreover, the convergence of these new updating equations is scrutinized as well, and the proposed method has less time computation as compared to the state-of-the-art works. Conducted simulations show that the new algorithm excels the state-of-the-art works in terms of accuracy on high-dimensional face image alignment and face recovery on some public datasets. The major contributions of this paper include the following:(1)The affine transformations and Tikhonov regularization term are incorporated into the new model to fix the distorted or misaligned images so as to be robust and resilient with the adverse effects of outliers and heavy sparse noises(2)The ADMM approach is employed to solve the new convex optimization problem, and a set of updating equations is developed to iteratively solve this problem in an iterative process(3)To make more robust with outliers and occlusions, the Tikhonov regularization term and the nuclear norm of the sparse noises are additionally incorporated to relax, regularize, and constrain the representation of images, which leads the problem to have a unique and stable solution(4)The proposed method considers both a set of affine transformations and Tikhonov regularization parameter which perform the error minimization step and the error support step iteratively but cannot guarantee the convergence of the whole algorithm, and our method integrates error minimization and error support into one regression model, and its ADMM algorithm theoretically converges well

This paper is structured as follows. Section 2 indicates the detail problem formulation of the paper. Section 3 develops and describes the updating equations to solve the proposed problem. In Section 4, experimental simulations are conducted to justify the proposed method. Section 5 provides the results of time computation of the new algorithm, and Section 6 provides some concluding remarks to summarize the paper.

2. Problem Formulation

Given images , where and are the width and height of the images, respectively. In many situations, however, high-dimensional images are highly impacted by the potential adverse effect of outliers, occlusions and illuminations, and heavy sparse noises. We can stack these images into a matrix , where denotes the vectorization of stacking operators. In light of the fact that the subspaces of the data are contaminated by large noises, we decompose the original corrupted data matrix into a low-rank component and sparse errors, i.e., [42, 43], where is a clean low-rank dictionary, is a recovery subspace coefficient matrix used to represent , and denotes a sparse error matrix incurred by some adverse effects. When a new image arrives, the main task is to seek an optimal transformation that warps this image with the previously aligned images. Thus, invoked by the potential impacts of outliers, occlusions, illuminations, and heavy images, we need to decompose the corrupted images into the low-rank component and sparse noises. Therefore, this decomposition process can be given bywhere is obtained from a low rank and decomposed into the basis matrix , is the weight regression coefficient vector, and is independently and identically distributed. The main dilemma, in updating parameters corresponding to the constraint , is intractable due to the nonlinearity of the constraint. To solve the nonlinearity in , we can assume that the changes produced by these affine transformations are small and an initial affine transformation of is known; then, we can linearize it by considering the first-order Taylor approximations as follows: , where is being considered as the transformed image, , where indicates the numbers which denote the parameters, represents the Jacobian of the images with respect to , denotes the standard basis for , and the operator denotes the affine transformation incorporated into the highly and linearly illuminated and corrupted data. This linearization process adjusts the misalignment problems in the batches of images via an affine transformation. Following this procedure, we attain approximate transformations to recover the low-rank component and the batch image alignment from the underlying subspaces and all other updating parameters. The pixels of each transformed image are considered in matrix in which the affine transformation tries to align images in a similar way; then, they can be considered as samples drawn from a union of low-dimensional subspaces. Inspired by [44], instead of processing the original images, we seek an alignment in the image such that the aligned images of the newly arrived images can be decomposed as the sum of sparse error and linear composition. To constrain the possible solutions of our algorithm, we add many more parameters to relax the nonconvexity issues. To make the new robust regression more resilient to the potential impact of large outliers and sparse noise, the Tikhonov regularization term regularizes the representation of high-dimensional images to lead to a unique and stable solution for the least squares problem. This also helps to control the effect of the noise on solving the updating parameters. Additionally, when the pixels belong to the smooth regions, the Tikhonov regularization adjusts and eliminates the potential impacts of outliers and heavy sparse noises [45, 46], and it is also preferable to align and recover when the data are dominated with noises and incomplete data [47]. The overall problem can be posted as follows:where , , and are the regularization parameters, is the Tikhonov matrix [48, 49], and is a global regularization parameter which balances the minimization between the reconstruction error and the Tikhonov regularization term. Additionally, is the nuclear norm of , in which indicates the singular values of , .

3. Proposed Method

To solve constrained convex optimization techniques as shown in (2), we consider an alternating direction method for multipliers (ADMM) as follows [50, 51]:

This can be solved by using ADMM. The major necessary condition of ADMM is the convexity issue; we give sufficient conditions under which the algorithm asymptotically reaches the standard first-order necessary conditions for local optimality. Then, employing an augmented Lagrangian function on (3), we can get the following Lagrangian function which is given bywhere is a penalty parameter, is the Lagrange multiplier, and is the trace operator. Afterward, solving (4) directly is a formidable task; thus, we solve each updating parameter independently via the alternating direction method for multipliers (ADMM).

Firstly, to find the optimal of , we fix , , and as constants; then, can be updated by

To get the optimal updating parameter , first let us denote and , where converts the matrix into a vector. Therefore, the subproblem indicated in (5) can also be rewritten as

Therefore, the updates corresponding to the regression coefficient are updated from the following expression. This problem can also be further reduced to the following:

Using product matrix multiplication and the property of Frobenius, the above equation can be rewritten as given in the following equation:

This equation has a form of an ordinary least square regression. So, we can obtain the solution of equation (8) by

Secondly, to find the update of S, we follow along the same line as in: (5):

Following the same procedures as in (6) and ignoring all the irrelevant parameters of the updating parameter , (10) can be reduced to

The above can be solved following [52] the singular value threshold operator; the above optimization problem is solved bywhere .

Thirdly, invoked by an affine transformation, keeping all the other parameters as constant, we obtained an extra updating parameter . Along the same line as above, keeping all the other parameters as constant, we can get the update of :

Solving (13) with the threshold operators as similar as [53, 54], we can get the update of :

Finally, following the same steps as above, the Lagrangian multiplier can be updated based on

These updating equations proceed in a round-robin manner until convergence. For easy reference, the updating equations of the proposed algorithm are summarized in Algorithm 1.

	Input: data matrix , , , , , ,
While not converged Do
(1)	Update: by (9)
(2)	Update: by (14)
(3)	Update: by (15)
(4)	Update: by (16)
(5)	Update: by (17)
End while
Outputs: , , ,

4. Simulations and Discussion

In this section, we need to see the effectiveness of the new algorithm for image alignment and recovery based on public datasets. Four different state-of-the-art works, including [30, 31, 38, 39], and the proposed method are considered for comparisons to examine the robustness of the proposed method. For image alignment and recovery, three public datasets such as Labeled Faces [55] databases, Algore talking video taken from [53], and complicated windows taken from [53] are taken into consideration. The protocols and procedures are directly related to related works [30, 31, 38, 53, 56, 57]. In these simulations, the effectiveness of the proposed method is compared with the aforementioned methods based on natural face images, video face images, and windows. Secondly, we furthermore evaluated checking the effectiveness of the algorithm through using the mean square error [11–13, 58].

4.1. Recovery of Natural Face Images

In this section, the effectiveness of the new proposed robust algorithm on natural face images for solving the problem of image alignment and recovery based on different types of images is evaluated. In this case, first we consider corrupted face images upon which we employ an algorithm to align and recover the corrupted images. Thereby, the simulations on corrupted natural face images are illustrated in Figures 1 and 2 under column 1. We employed the proposed method on these distorted data to see the effectiveness of the proposed method as compared with the aforementioned approaches. The result of the recovered one by the proposed method has improved the natural face images as compared with [30, 31, 38, 39]. This improvement is due to incorporation of an affine transformation and Tikhonov regularization term. This finding is also justified based on the root mean square error result shown in Table 1, entailing the new algorithm is more robust and resilient to outliers and heavy sparse noises in high-dimensional natural face images.

4.2. Recovery of Video Face Images

Next, the effectiveness of the new method is evaluated further based on distorted video face images with size to judge the effectiveness of the proposed method in recovering the corrupted high-dimensional images. Following this, the proposed method is employed on distorted video images as shown in Figures 3 and 4 under column 1. Thereby, the proposed method has improved the performance of the developed algorithm by pruning out the potential impact of outliers and heavy sparse noises as shown in Figures 3 and 4 (column 6). The proposed method is more superior to the others [30, 31, 38, 39]. This entails inclusion of an affine transformation and Tikhonov regularization has boosted the performance of the new method. As it can be seen from Figures 3 and 4, on the last column, the result obtained by our method has improved the visual quality based on the complicated videos as compared with the baselines.

(a)

(b)

(c)

(d)

We can recognize that, by including an extra term both an affine transformation and Tikhonov regularization, the new approach has obtained a minimum mean square error [30, 31, 38, 39], entailing more better image alignment and recovery having a potential to prune out the errors and outliers in high-dimensional video face images (Table 1). The new incorporation of the affine transformation and Tikhonov regularization has boosted the performance of the new approach as compared with the state-of-the-art methods.

4.3. Recovery of Complicated Windows

The effectiveness of the proposed method is further assessed in recovering complicated windows with size as given in Figure 5. As we can see from Figure 5 (column 6), the proposed method perfectly recovers the windows and removes the trees which are considered as occluded. This entails incorporating the affine transformation and Tikhonov regularization term has boosted the visual quality of very complicated and corrupted windows as compared with [30, 31, 38, 39].

Instead of recognizing that invoked by novel ideas of an affine transformation and Tikhonov regularization, the new approach has obtained a minimum mean square error [30, 31, 38, 39], entailing more better image alignment and recovery having a potential to prune out the errors and outliers in high-dimensional and very complicated windows (Table 1).

5. Time Complexity

The time complexity of the proposed method as compared to the state-of-the-art works is described in this section. On a very standard desktop computer, RIVZ [39] has relatively less time computation as compared to TRPCA [30], ELTRT [31], and NRPP [38] as the RIVZ [39] has a less number of parameters involved in updating the parameters. Additionally, our algorithm can handle batches of over one hundred images in a few minutes on a standard PC as the number of parameters involved is small as compared to the state-of-the-art works. The new algorithm is guaranteed faster convergence compared to the state-of-the-art algorithms as shown in Table 2.

6. Conclusion

In this paper, a new robust regularized shrinkage regression method is proposed for high-dimensional image alignment and recovery via considering the issue of an affine transformation and Tikhonov regularization, to be more robust, the dilemma of outliers, heavy sparse noises, and occlusions and illuminations. The newly formulated algorithm is casted as convex optimization techniques. Afterward, the ADMM approach is employed, and a new set of equations is established to update the parameters involved in an iterative manner. The problem is formulated as convex optimization programming, and a set of equations is established to iteratively update the parameters and the affine transformations. The result obtained from the mean square error also reveals that the proposed method outperforms the main state-of-the-art works. This is obtained due to incorporating an affine transformation and Tikhonov regularization term. The proposed method has less time complexity as compared to the state-of-the-art methods. Moreover, the convergence of these new updating equations is scrutinized as well and has less time computation as compared to the state-of-the-art works. The experimental simulation has shown that the proposed method is more superior to the state-of-the-art works.

Data Availability

The data used in this article are freely available for the user.

Conflicts of Interest

The authors declare that there are no conflicts of interest.

Acknowledgments

This work was partially supported by Ambo University and National Science Fund for Young Scholars (Grant no. 61806186), State Key Laboratory of Robotics and System (HIT) (Grant no. SKLRS-2019-KF-15), and the program “Fujian Intelligent Logistics Industry Technology Research Institute” (Grant no. 2018H2001).

References

S. Xia, W. Yang, J. Liu, and Z. Guo, “Dual recovery network with online compensation for image super-resolution,” in Proceedings of the 2018 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1–5, IEEE, Florence, Italy, May 2018.
View at: Google Scholar
J. Yang, L. Luo, J. Qian, Y. Tai, F. Zhang, and Y. Xu, “Nuclear norm based matrix regression with applications to face recognition with occlusion and illumination changes,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 39, no. 1, pp. 156–171, 2017.
View at: Publisher Site | Google Scholar
X. Xiang and T. D. Tran, “Linear disentangled representation learning for facial actions,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 28, no. 12, pp. 3539–3544, 2018.
View at: Publisher Site | Google Scholar
D. Huang, M. Storer, F. De la Torre, and H. Bischof, “Supervised local subspace learning for continuous head pose estimation,” in Proceedings of Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on. IEEE, pp. 2921–2928, IEEE, Colorado Springs, CO, USA, June 2011.
View at: Google Scholar
A. Makadia and K. Daniilidis, “Rotation recovery from spherical images without correspondences,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 7, pp. 1170–1175, 2006.
View at: Publisher Site | Google Scholar
C. G. Nunes De Carvalho, D. Gonçalves Gomes, José Neuman De Souza, and N. Agoulmine, “Multiple linear regression to improve prediction accuracy in wsn data reduction,” in Proceedings of 2011 7th Latin American Network Operations And Management Symposium, pp. 1–8, IEEE, Quito, Ecuador, October 2011.
View at: Google Scholar
J. Han, M. Feng, and H. N. Peter de With, “A real-time video surveillance system with human occlusion handling using nonlinear regression,”,” in Proceedings of 2008 IEEE International Conference on Multimedia and Expo, pp. 305–308, IEEE, Hannover, Germany, June 2008.
View at: Google Scholar
E. J. Candès, X. Li, Yi Ma, and J. Wright, “Robust principal component analysis?” Journal of the ACM, vol. 58, no. 3, p. 11, 2011.
View at: Google Scholar
SE. Ebadi and E. Izquierdo, “Approximated RPCA for fast and efficient recovery of corrupted and linearly correlated images and video frames,” in Proceedings Systems, Signals And Image Processing (IWSSIP), 2015 International Conference on IEEE, pp. 49–52, IEEE, San Francisco, CA, USA, September 2015.
View at: Google Scholar
J. Wright, A. Ganesh, S. Rao, Y. Peng, and Y. Ma, “Robust principal component analysis: exact recovery of corrupted low-rank matrices via convex optimization,” in Proceedings of Advances In Neural Information Processing Systems, pp. 2080–2088, Vancouver, Canada, December 2009.
View at: Google Scholar
H. T. Likassa, “New robust principal component analysis for joint image alignment and recovery via affine transformations and frobenius and norms,” International Journal of Mathematics and Mathematical Sciences, vol. 2020, Article ID 8136384, p. 9, 2020.
View at: Publisher Site | Google Scholar
H. T. Likassa and W.-H. Fang, “Robust regression for image alignment via subspace recovery techniques,” in Proceedings of the 2018 VII International Conference on Network, Communication and Computing, pp. 288–293, Taipei City Taiwan, December 2018.
View at: Google Scholar
H.-T. Likassa, W.-H. Fang, and J.-S. Leu, “Robust image recovery via affine transformation and norm,” IEEE Access, vol. 7, pp. 125011–125021, 2019.
View at: Google Scholar
C.-F. Chen, C.-Po Wei, and Yu-C. F. Wang, “Low-rank matrix recovery with structural incoherence for robust face recognition,” in Proceedings of 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp. 2618–2625, IEEE, Providence, RI, USA, June 2012.
View at: Google Scholar
J.-S. Chang, A. C.-C. Shih, H. Yuan, M. Liao, and W.-H. Fang, “Principal component analysis-based mesh decomposition,” in Proceedings of Multimedia Signal Processing, 2007. MMSP 2007. IEEE 9th Workshop on on Multimedia Signal Processing (MMSP 2007), pp. 292–295, IEEE, Chania, Crete, Greece, October 2007.
View at: Google Scholar
W. Song, J. Zhu, Y. Li, and C. Chen, “Image alignment by online robust PCA via stochastic gradient descent,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 26, no. 7, pp. 1241–1250, 2016.
View at: Publisher Site | Google Scholar
H. T. Likassa, W.-H. Fang, and Y.-A Chuang, “Modified robust image alignment by sparse and low rank decomposition for highly linearly correlated data,” in 2018 3rd International Conference On Intelligent Green Building And Smart Grid (IGBSG), 4 pages, IEEE, Yilan, Taiwan, April 2018.
View at: Google Scholar
I. Lavva, E. Hameiri, and I. Shimshoni, “Robust methods for geometric primitive recovery and estimation from range images,” IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), vol. 38, no. 3, pp. 826–845, 2008.
View at: Publisher Site | Google Scholar
H. Xu, C. Caramanis, and S. Mannor, “Outlier-robust PCA: the high-dimensional case,” IEEE Transactions on Information Theory, vol. 59, no. 1, pp. 546–572, 2013.
View at: Publisher Site | Google Scholar
J. Lee and Y. Choe, “Robust PCA based on incoherence with geometrical interpretation,” IEEE Transactions on Image Processing, vol. 27, no. 4, pp. 1939–1950, 2018.
View at: Publisher Site | Google Scholar
A. Podosinnikova, S. Simon, and M. Hein, “Robust PCA: optimization of the robust reconstruction error over the stiefel manifold,” in Proceedings Of German Conference On Pattern Recognition, pp. 121–131, Springer, Münster, Germany, September 2014.
View at: Google Scholar
N. Shahid, N. Perraudin, V. Kalofolias, G. Puy, and P. Vandergheynst, “Fast robust PCA on graphs,” IEEE Journal of Selected Topics in Signal Processing, vol. 10, no. 4, pp. 740–756, 2016.
View at: Publisher Site | Google Scholar
M. Shakeri, H. Zhang, and “ Corola, “COROLA: a sequential solution to moving object detection using low-rank approximation,” Computer Vision and Image Understanding, vol. 146, pp. 27–39, 2016.
View at: Publisher Site | Google Scholar
T. Zhang and G. Lerman, “A novel m-estimator for robust PCA,” The Journal of Machine Learning Research, vol. 15, no. 1, pp. 749–808, 2014.
View at: Google Scholar
G. Lerman and T. Maunu, “An overview of robust subspace recovery,” Proceedings of the IEEE, vol. 106, no. 8, pp. 1380–1410, 2018.
View at: Publisher Site | Google Scholar
S. Li and Y. Fu, “Learning robust and discriminative subspace with low-rank constraints,” IEEE Transactions on Neural Networks and Learning Systems, vol. 27, no. 11, pp. 2160–2173, 2016.
View at: Publisher Site | Google Scholar
H. Zhang, Z. Lin, C. Zhang, and J. Gao, “Robust latent low rank representation for subspace clustering,” Neurocomputing, vol. 145, pp. 369–373, 2014.
View at: Publisher Site | Google Scholar
F. De la Torre and M. J. Black, “Robust parameterized component analysis: theory and applications to 2d facial appearance models,” Computer Vision and Image Understanding, vol. 91, no. 1-2, pp. 53–71, 2003.
View at: Publisher Site | Google Scholar
Li Zhang, D. Mahapatra, J. A. W. Tielbeek, Jaap Stoker, J. Lucas van Vliet, and F. M Vos, “Image registration based on autocorrelation of local structure,” IEEE Transactions on Medical Imaging, vol. 35, no. 1, pp. 63–75, 2016.
View at: Google Scholar
C. Lu, J. Feng, Y. Chen et al., “Tensor robust principal component analysis: exact recovery of corrupted low-rank tensors via convex optimization,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 5249–5257, Las Vegas, NV, USA, June 2016.
View at: Google Scholar
C. Lu, J. Feng, Z. Lin, and S. Yan, “Exact low tubal rank tensor recovery from gaussian measurements,” 2018, https://arxiv.org/abs/1806.02511.
View at: Google Scholar
Y. Li, C. Chen, F. Yang, and J. Huang, “Deep sparse representation for robust image registration,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4894–4901, IEEE, Boston, MA, USA, June 2015.
View at: Google Scholar
J. Qian, J. Yang, F. Zhang, and Z. Lin, “Robust low-rank regularized regression for face recognition with occlusion,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, pp. 21–26, IEEE, Columbus, OH, USA, June 2014.
View at: Google Scholar
Q. Zheng, Y. Wang, and P.-A. Heng, “Online robust image alignment via subspace learning from gradient orientations,” in Proceedings of the IEEE International Conference on Computer Vision, pp. 1753–1762, IEEE, Venice, Italy, October 2017.
View at: Google Scholar
M. Iliadis, H. Wang, R. Molina, and A. K. Katsaggelos, “Robust and low-rank representation for fast face identification with occlusions,” IEEE Transactions on Image Processing, vol. 26, no. 5, pp. 2203–2218, 2017.
View at: Publisher Site | Google Scholar
J. Ma, J. Zhao, Y. Ma, and J. Tian, “Non-rigid visible and infrared face registration via regularized Gaussian fields criterion,” Pattern Recognition, vol. 48, no. 3, pp. 772–784, 2015.
View at: Publisher Site | Google Scholar
J. Ma, H. Zhou, J. Zhao, Y. Gao, J. Jiang, and J. Tian, “Robust feature matching for remote sensing image registration via locally linear transforming,” IEEE Transactions on Geoscience and Remote Sensing, vol. 53, no. 12, pp. 6469–6481, 2015.
View at: Publisher Site | Google Scholar
J. Jiang, C. Chen, K. Huang, Z. Cai, and R. Hu, “Noise robust position-patch based face super-resolution via tikhonov regularized neighbor representation,” Information Sciences, vol. 367-368, pp. 354–372, 2016.
View at: Publisher Site | Google Scholar
C. Chen, M. N. Do, and J. Wang, “Robust image and video dehazing with visual artifact suppression via gradient residual minimization,” in European Conference on Computer Vision, pp. 576–591, Springer, Amsterdam, The Netherlands, October 2016.
View at: Google Scholar
X. Wei, H. Shen, and M. Kleinsteuber, “Trace quotient with sparsity priors for learning low dimensional image representations,” IEEE transactions on pattern analysis and machine intelligence, vol. 19, no. 7, 2019.
View at: Google Scholar
X. Wei, H. Shen, Y. Li et al., “Reconstructible nonlinear dimensionality reduction via joint dictionary learning,” IEEE Transactions on Neural Networks and Learning Systems, vol. 30, no. 1, pp. 175–189, 2018.
View at: Google Scholar
Z. Lin, M. Chen, and Yi Ma, “The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices,” 2010, https://arxiv.org/abs/1009.5055.
View at: Google Scholar
G. Liu, Z. Lin, and Y. Yu, “Robust subspace segmentation by low-rank representation,” in Proceedings of the International Conference on Machine Learning, pp. 663–670.
View at: Google Scholar
J. He, D. Zhang, L. Balzano, and T. Tao, “Iterative grassmannian optimization for robust image alignment,” Image and Vision Computing, vol. 32, no. 10, pp. 800–813, 2014.
View at: Publisher Site | Google Scholar
K. Liu, J. Tan, and B. Su, “An adaptive image denoising model based on tikhonov and tv regularizations,” Advances in Multimedia, vol. 2014, Article ID 934834, 10 pages, 2014.
View at: Publisher Site | Google Scholar
R. Youmaran and A. Adler, “Combining regularization frameworks for image deblurring: optimization of combined hyper-parameters,” in Proceedings of Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No. 04CH37513), vol. 2, pp. 723–726, IEEE, Niagara Falls, Ontario, Canada, May 2004.
View at: Google Scholar
G. A. G. Cidade, C. Anteneodo, N. C. Roberty, and A. J. Silva Neto, “A generalized approach for atomic force microscopy image restoration with bregman distances as tikhonov regularization terms∗,” Inverse Problems in Engineering, vol. 8, no. 5, pp. 457–472, 2000.
View at: Publisher Site | Google Scholar
J.-T. Chien and T.-W. Lu, “Tikhonov regularization for deep neural network acoustic modeling,,” in Proceedings of 2014 IEEE Spoken Language Technology Workshop (SLT), pp. 147–152, IEEE, South Lake Tahoe, NV, USA, December 2014.
View at: Google Scholar
B. Sun, S. Yue, Z. Hao, Z. Cui, and H. Wang, “An improved tikhonov regularization method for lung cancer monitoring using electrical impedance tomography,” IEEE Sensors Journal, vol. 19, no. 8, pp. 3049–3057, 2019.
View at: Google Scholar
L. Majzoobi, F. Lahouti, and V. Shah-Mansouri, “Analysis of distributed admm algorithm for consensus optimization in presence of node error,” IEEE Transactions on Signal Processing, vol. 67, no. 7, pp. 1774–1784, 2019.
View at: Publisher Site | Google Scholar
S. Boyd, N. Parikh, E. Chu, P. Borja, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends® in Machine Learning, vol. 3, no. 1, pp. 1–122, 2011.
View at: Google Scholar
J.-F. Cai and J. EmmanuelZ. Shen, “A singular value thresholding algorithm for matrix completion,” SIAM Journal on Optimization, vol. 20, no. 4, pp. 1956–1982, 2010.
View at: Google Scholar
Y. Peng, A. Ganesh, J. Wright, W. Xu, Yi Ma, and “ Rasl, “Robust alignment by sparse and low-rank decomposition for linearly correlated images,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 11, pp. 2233–2246, 2012.
View at: Google Scholar
X. Chen, Z. Han, Y. Wang, Y. Tang, and H. Yu, “Nonconvex plus quadratic penalized low-rank and sparse decomposition for noisy image alignment,” Science China Information Sciences, vol. 59, no. 5, Article ID 052107, 2016.
View at: Publisher Site | Google Scholar
G. B. Huang, M. Ramesh, T. Berg, and E. Learned-Miller, Labeled Faces in the Wild: a Database for Studying Face Recognition in Unconstrained Environments, University of Massachusetts, Amherst, MA, USA, 2007.
C. Lu, J. Feng, Y. Chen et al., “Tensor robust principal component analysis with a new tensor nuclear norm,” 2018, https://arxiv.org/abs/1804.03728.
View at: Google Scholar
Z. Pan, C. Lu, Z. Lin, and C. Zhang, “Tensor factorization for low-rank tensor completion,” IEEE Transactions on Image Processing, vol. 27, no. 3, pp. 1152–1163, 2018.
View at: Google Scholar
L. Zhang, L. Zhang, X. Mou, D. Zhang, and “ Fsim, “A feature similarity index for image quality assessment,” IEEE Transactions on Image Processing, vol. 20, no. 8, pp. 2378–2386, 2011.
View at: Google Scholar

Copyright

Copyright © 2020 Habte Tadesse Likassa 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.

PDF Download Citation

Download other formats

Order printed copies

Views

466

Downloads

708

Citations