Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.11926 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915918374764544 |
|---|---|
| author | Zhang, Xue Hu, Bingshuo Cheung, Gene |
| author_facet | Zhang, Xue Hu, Bingshuo Cheung, Gene |
| contents | Conventional deep neural nets (DNNs) initialize network parameters at random and then optimize each one via stochastic gradient descent (SGD), resulting in substantial risk of poor-performing local minima. Focusing on image interpolation and leveraging a recent theorem that maps a (pseudo-)linear interpolator Θ to a directed graph filter that is a solution to a corresponding MAP problem with a graph shift variation (GSV) prior, we first initialize a directed graph adjacency matrix A given a known interpolator Θ, establishing a baseline performance. Then, towards further gain, we learn perturbation matrices P and P(2) from data to augment A, whose restoration effects are implemented progressively via Douglas-Rachford (DR) iterations, which we unroll into a lightweight and interpretable neural net. Experiments on different image interpolation scenarios demonstrate state-of-the-art performance, while drastically reducing network parameters and inference complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_11926 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Unrolling Graph-based Douglas-Rachford Algorithm for Image Interpolation with Informed Initialization Zhang, Xue Hu, Bingshuo Cheung, Gene Computer Vision and Pattern Recognition Conventional deep neural nets (DNNs) initialize network parameters at random and then optimize each one via stochastic gradient descent (SGD), resulting in substantial risk of poor-performing local minima. Focusing on image interpolation and leveraging a recent theorem that maps a (pseudo-)linear interpolator Θ to a directed graph filter that is a solution to a corresponding MAP problem with a graph shift variation (GSV) prior, we first initialize a directed graph adjacency matrix A given a known interpolator Θ, establishing a baseline performance. Then, towards further gain, we learn perturbation matrices P and P(2) from data to augment A, whose restoration effects are implemented progressively via Douglas-Rachford (DR) iterations, which we unroll into a lightweight and interpretable neural net. Experiments on different image interpolation scenarios demonstrate state-of-the-art performance, while drastically reducing network parameters and inference complexity. |
| title | Unrolling Graph-based Douglas-Rachford Algorithm for Image Interpolation with Informed Initialization |
| topic | Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/2509.11926 |