BAYESIAN FRAMEWORK FOR SOLVING TRANSFORM INVARIANT LOW-RANK TEXTURES

被引:0
|
作者
Hu, Shihui [1 ]
Yu, Lei [1 ]
Zhang, Menglei [1 ]
Lv, Chengcheng [1 ]
机构
[1] Wuhan Univ, Sch Elect & Informat, Wuhan, Peoples R China
关键词
Image feature; transform invariant low-rank textures; rectification; Bayesian framework; corruptions and occlusions;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Comparing to the low level local features, Transform Invariant Low-Rank Textures (TILT) can in some sense globally rectify a large class of low-rank textures in 2D images, and thus more accurate and robust. However, TILT is still rather rudimentary, and have some limitations in applications. In this paper, we proposed a novel algorithm for better solving TILT. Our method is based on the application of Bayesian framework in robust principal component analysis (RPCA), besides less local minima, nonparametric Bayesian method introduces the uncertainty in the parameters, which make our new algorithm can handle more complex situations. Experimental results on both synthetic and real data indicate that our new algorithm outperforms the existing algorithm especially for the case with corruptions and occlusions.
引用
收藏
页码:3588 / 3592
页数:5
相关论文
共 50 条
  • [21] Generating Low-Rank Textures via Generative Adversarial Network
    Zhao, Shuyang
    Li, Jianwu
    NEURAL INFORMATION PROCESSING (ICONIP 2017), PT III, 2017, 10636 : 310 - 318
  • [22] On the Realization of Impulse Invariant Low-Rank Volterra Kernels
    Burt, Phillip M. S.
    de Morais Goulart, Jose Henrique
    IEEE SIGNAL PROCESSING LETTERS, 2022, 29 : 1492 - 1496
  • [23] A Supervised Low-rank Method for Learning Invariant Subspaces
    Siyahjani, Farzad
    Almohsen, Ranya
    Sabri, Sinan
    Doretto, Gianfranco
    2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, : 4220 - 4228
  • [24] Sparse Bayesian Methods for Low-Rank Matrix Estimation
    Babacan, S. Derin
    Luessi, Martin
    Molina, Rafael
    Katsaggelos, Aggelos K.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (08) : 3964 - 3977
  • [25] Bayesian Uncertainty Quantification for Low-Rank Matrix Completion
    Yuchi, Henry Shaowu
    Mak, Simon
    Xie, Yao
    BAYESIAN ANALYSIS, 2023, 18 (02): : 491 - 518
  • [26] A dual framework for low-rank tensor completion
    Nimishakavi, Madhav
    Jawanpuria, Pratik
    Mishra, Bamdev
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [27] Solving PhaseLift by Low-rank Riemannian Optimization Methods
    Huang, Wen
    Gallivan, Kyle A.
    Zhang, Xiangxiong
    INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE 2016 (ICCS 2016), 2016, 80 : 1125 - 1134
  • [28] Solving stochastic systems with low-rank tensor compression
    Matthies, Hermann G.
    Zander, Elmar
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2012, 436 (10) : 3819 - 3838
  • [29] Solving Low-Rank Matrix Completion Problems Efficiently
    Goldfarb, Donald
    Ma, Shiqian
    Wen, Zaiwen
    2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2, 2009, : 1013 - 1020
  • [30] Deep learning framework for solving Fokker-Planck equations with low-rank separation representation
    Zhang, Hao
    Xu, Yong
    Liu, Qi
    Li, Yongge
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 121