File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1002/nla.2224
- Scopus: eid_2-s2.0-85057453665
- WOS: WOS:000457614700005
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A primal-dual method for the Meyer model of cartoon and texture decomposition
| Title | A primal-dual method for the Meyer model of cartoon and texture decomposition |
|---|---|
| Authors | |
| Keywords | Meyer's model total variation primal-dual algorithm G-norm image decomposition |
| Issue Date | 2019 |
| Citation | Numerical Linear Algebra with Applications, 2019, v. 26, n. 2, article no. e2224 How to Cite? |
| Abstract | © 2018 John Wiley & Sons, Ltd. In this paper, we study the original Meyer model of cartoon and texture decomposition in image processing. The model, which is a minimization problem, contains an l1-based TV-norm and an l∞-based G-norm. The main idea of this paper is to use the dual formulation to represent both TV-norm and G-norm. The resulting minimization problem of the Meyer model can be given as a minimax problem. A first-order primal-dual algorithm can be developed to compute the saddle point of the minimax problem. The convergence of the proposed algorithm is theoretically shown. Numerical results are presented to show that the original Meyer model can decompose better cartoon and texture components than the other testing methods. |
| Persistent Identifier | http://hdl.handle.net/10722/276622 |
| ISSN | 2023 Impact Factor: 1.8 2023 SCImago Journal Rankings: 0.932 |
| ISI Accession Number ID |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Wen, You Wei | - |
| dc.contributor.author | Sun, Hai Wei | - |
| dc.contributor.author | Ng, Michael K. | - |
| dc.date.accessioned | 2019-09-18T08:34:10Z | - |
| dc.date.available | 2019-09-18T08:34:10Z | - |
| dc.date.issued | 2019 | - |
| dc.identifier.citation | Numerical Linear Algebra with Applications, 2019, v. 26, n. 2, article no. e2224 | - |
| dc.identifier.issn | 1070-5325 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/276622 | - |
| dc.description.abstract | © 2018 John Wiley & Sons, Ltd. In this paper, we study the original Meyer model of cartoon and texture decomposition in image processing. The model, which is a minimization problem, contains an l1-based TV-norm and an l∞-based G-norm. The main idea of this paper is to use the dual formulation to represent both TV-norm and G-norm. The resulting minimization problem of the Meyer model can be given as a minimax problem. A first-order primal-dual algorithm can be developed to compute the saddle point of the minimax problem. The convergence of the proposed algorithm is theoretically shown. Numerical results are presented to show that the original Meyer model can decompose better cartoon and texture components than the other testing methods. | - |
| dc.language | eng | - |
| dc.relation.ispartof | Numerical Linear Algebra with Applications | - |
| dc.subject | Meyer's model | - |
| dc.subject | total variation | - |
| dc.subject | primal-dual algorithm | - |
| dc.subject | G-norm | - |
| dc.subject | image decomposition | - |
| dc.title | A primal-dual method for the Meyer model of cartoon and texture decomposition | - |
| dc.type | Article | - |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.doi | 10.1002/nla.2224 | - |
| dc.identifier.scopus | eid_2-s2.0-85057453665 | - |
| dc.identifier.volume | 26 | - |
| dc.identifier.issue | 2 | - |
| dc.identifier.spage | article no. e2224 | - |
| dc.identifier.epage | article no. e2224 | - |
| dc.identifier.eissn | 1099-1506 | - |
| dc.identifier.isi | WOS:000457614700005 | - |
| dc.identifier.issnl | 1070-5325 | - |