학과 세미나 및 콜로퀴엄




2025-01
Sun Mon Tue Wed Thu Fri Sat
      1 2 3 4
5 6 7 8 9 10 11
12 13 14 15 16 17 1 18
19 20 21 22 23 24 25
26 27 28 29 30 31  
2025-02
Sun Mon Tue Wed Thu Fri Sat
            1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28  

로그인 시, 세미나를 이메일로 구독할 수 있습니다.

We propose a general learning based framework for solving nonsmooth and nonconvex inverse problems with application to low-dose CT (LDCT) reconstruction. We model the regularization function as the combination of a sparsity enhancing and a non-local smoothing regularization. We develop an efficient learned descent-type algorithm (ELDA) to solve the nonsmooth nonconvex minimization problem by leveraging the Nesterov’s smoothing technique and incorporating the residual learning structure. We proved the convergence of the algorithm and generate the network, whose architecture follows the algorithm exactly. Our method is versatile as one can employ various modern network structures into the regularization, and the resulting network inherits the convergence properties, and hence is interpretable. We also show that the proposed network is parameter-efficient and its performance compares favorably to the state-of-the-art methods.
https://kaist.zoom.us/j/82680768716?pwd=4jDj5hW70PKYbTcYq1nbkEa9Gsarhi.1 Meeting ID: 826 8076 8716 Passcode: 933841 참고: Jan 16, 2025 07:00 PM Eastern Time (US and Canada) https://kaist.zoom.us/j/82680768716?pwd=4jDj5hW70PKYbTcYq1nbkEa9Gsarhi.1 Meeting ID: 826 8076 8716 Passcode: 933841
Host: 임미경     영어     2025-01-13 10:56:25