Name
Abstract | ||
|---|---|---|
In this article, we address the issue of recovering latent transparent layers from superimposition images. Here, we assume we have the estimated transformations and extracted gradients of latent layers. To rapidly recover high-quality image layers, we propose an Efficient Superimposition Recovering Algorithm (ESRA) by extending the framework of accelerated gradient method. In addition, a key building block (in each iteration) in our proposed method is the proximal operator calculating. Here we propose to employ a dual approach and present our Parallel Algorithm with Constrained Total Variation (PACTV) method. Our recovering method not only reconstructs high-quality layers without color-bias problem, but also theoretically guarantees good convergence performance. |
Year | Venue | Field |
|---|---|---|
2012 | arXiv: Computer Vision and Pattern Recognition | Gradient method,Convergence (routing),Superimposition,Pattern recognition,Computer science,Parallel algorithm,Algorithm,Artificial intelligence,Operator (computer programming) |
DocType | Volume | Citations |
Journal | abs/1211.4307 | 0 |
PageRank | References | Authors |
0.34 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Han Li | 1 | 69 | 11.02 |
| Kun Gai | 2 | 312 | 20.61 |
| Pinghua Gong | 3 | 349 | 15.61 |
| Changshui Zhang | 4 | 5506 | 323.40 |