TY - GEN
T1 - Epigraphical reformulation for non-proximable mixed norms
AU - Kyochi, Seisuke
AU - Ono, Shunsuke
AU - Selesnick, Ivan
N1 - Publisher Copyright:
© 2020 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.
PY - 2020/5
Y1 - 2020/5
N2 - This paper proposes an epigraphical reformulation (ER) technique for non-proximable mixed norm regularization. Various regulariza- tion methods using mixed norms have been proposed, where their optimization relies on efficient computation of the proximity opera- tor of the mixed norms. Although the sophisticated design of mixed norms significantly improves the performance of regularization, the proximity operator of such a mixed norm is often unavailable. Our ER decouples a non-proximable mixed norm function into a prox- imable norm and epigraphical constraints. Thus, it can handle a wide range of non-proximable mixed norms as long as the proximal oper- ator of the outermost norm, and the projection onto the epigraphical constraints can be efficiently computed. Moreover, we prove that our ER does not change the minimizer of the original problem de- spite using a certain inequality approximation. We also provide a new structure-tensor-based regularization as an application of our framework, which illustrates the utility of ER.
AB - This paper proposes an epigraphical reformulation (ER) technique for non-proximable mixed norm regularization. Various regulariza- tion methods using mixed norms have been proposed, where their optimization relies on efficient computation of the proximity opera- tor of the mixed norms. Although the sophisticated design of mixed norms significantly improves the performance of regularization, the proximity operator of such a mixed norm is often unavailable. Our ER decouples a non-proximable mixed norm function into a prox- imable norm and epigraphical constraints. Thus, it can handle a wide range of non-proximable mixed norms as long as the proximal oper- ator of the outermost norm, and the projection onto the epigraphical constraints can be efficiently computed. Moreover, we prove that our ER does not change the minimizer of the original problem de- spite using a certain inequality approximation. We also provide a new structure-tensor-based regularization as an application of our framework, which illustrates the utility of ER.
KW - Convex optimization
KW - Epigraph
KW - Epigraphical projection
KW - Image recovery
KW - Structure tensor total variation
UR - http://www.scopus.com/inward/record.url?scp=85091273178&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85091273178&partnerID=8YFLogxK
U2 - 10.1109/ICASSP40776.2020.9054650
DO - 10.1109/ICASSP40776.2020.9054650
M3 - Conference contribution
AN - SCOPUS:85091273178
T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
SP - 5400
EP - 5404
BT - 2020 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2020 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2020 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2020
Y2 - 4 May 2020 through 8 May 2020
ER -