Batch image alignment via subspace recovery based on alternative sparsity pursuit
- 422 Downloads
The problem of robust alignment of batches of images can be formulated as a low-rank matrix optimization problem, relying on the similarity of well-aligned images. Going further, observing that the images to be aligned are sampled from a union of low-rank subspaces, we propose a new method based on subspace recovery techniques to provide more robust and accurate alignment. The proposed method seeks a set of domain transformations which are applied to the unaligned images so that the resulting images are made as similar as possible. The resulting optimization problem can be linearized as a series of convex optimization problems which can be solved by alternative sparsity pursuit techniques. Compared to existing methods like robust alignment by sparse and low-rank models, the proposed method can more effectively solve the batch image alignment problem, and extract more similar structures from the misaligned images.
Keywordsimage alignment subspace recovery sparse representation convex optimization image similarity
This work was partly supported by the National Natural Science Foundation of China (Grant Nos. 61573150, 61573152, 61370185, 61403085, and 51275094), and Guangzhou Project Nos. 201604016113 and 201604046018.
- Candès, E. J.; Li, X.; Ma, Y.; Wright, J. Robust principal component analysis? Journal of the ACM Vol. 58, No. 3, Article No. 11, 2011.Google Scholar
- Elhamifar, E.; Vidal, R. Sparse subspace clustering. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2790–2797, 2009.Google Scholar
- Bian, X.; Krim, H. BI-sparsity pursuit for robust subspace recovery. In: Proceedings of the IEEE International Conference on Image Processing, 3535–3539, 2015.Google Scholar
- Rubinstein, R.; Faktor, T.; Elad, M. K-SVD dictionary-learning for the analysis sparse model. In: Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, 5405–5408, 2012.Google Scholar
- Bian, X.; Krim, H. Robust subspace recovery via bi-sparsity pursuit. arXiv preprint arXiv:1403.8067, 2014.Google Scholar
- Vedaldi, A.; Guidi, G.; Soatto, S. Joint data alignment up to (lossy) transformations. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 1–8, 2008.Google Scholar
- Liu, G.; Lin, Z.; Yu, Y. Robust subspace segmentation by low-rank representation. In: Proceedings of the 27th International Conference on Machine Learning, 663–670, 2010.Google Scholar
- Lin, Z.; Liu, R.; Su, Z. Linearized alternating direction method with adaptive penalty for low-rank representation. In: Proceedings of the Advances in Neural Information Processing Systems 24, 612–620, 2011.Google Scholar
- Huang, G. B.; Ramesh, M.; Berg, T.; Learned-Miller, E. Labeled faces in the wild: A database for studying face recognition in unconstrained environments. Technical Report 07-49, University of Massachusetts, Amherst, 2007.Google Scholar
- Hore, A.; Ziou, D. Image quality metrics: PSNR vs. SSIM. In: Proceedings of the 20th International Conference on Pattern Recognition, 2366–2369, 2010.Google Scholar
- LeCun, Y.; Cortes, C.; Burges, C. J. C. The MNIST database of handwritten digits. 2010. Available at http://yann.lecun.com/exdb/mnist.Google Scholar
Open Access The articles published in this journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Other papers from this open access journal are available free of charge from http://www.springer.com/journal/41095. To submit a manuscript, please go to https://www.editorialmanager.com/cvmj.