A Fast Algorithm for Learning the Overcomplete Image Prior
スポンサーリンク
概要
- 論文の詳細を見る
In this letter, we learned overcomplete filters to model rich priors of nature images. Our approach extends the Gaussian Scale Mixture Fields of Experts (GSM FOE), which is a fast approximate model based on Fields of Experts (FOE). In these previous image prior model, the overcomplete case is not considered because of the heavy computation. We introduce the assumption of quasi-orthogonality to the GSM FOE, which allows us to learn overcomplete filters of nature images fast and efficiently. Simulations show these obtained overcomplete filters have properties similar with those of Fields of Experts, and denoising experiments also show the superiority of our model.
著者
-
LUO Siwei
School of Computer and Information Technology, Beijing Jiaotong University
-
WANG Zhe
School of Computer and Information Technology, Beijing Jiaotong University
-
WANG Liang
School of Computer and Information Technology, Beijing Jiaotong University
関連論文
- A Fast Algorithm for Learning the Overcomplete Image Prior
- Contour Grouping and Object-Based Attention with Saliency Maps
- A Fast Algorithm for Learning the Overcomplete Image Prior
- Contour Grouping and Object-Based Attention with Saliency Maps
- A QoS-Enabled Double Auction Protocol for the Service Grid
- Visual Attention Guided Multi-Scale Boundary Detection in Natural Images for Contour Grouping
- Complex Cell Descriptor Learning for Robust Object Recognition
- Combining Boundary and Region Information with Bolt Prior for Rail Surface Detection
- Thresholding Based on Maximum Weighted Object Correlation for Rail Defect Detection
- An Efficient Wide-Baseline Dense Matching Descriptor