2018
DOI: 10.1007/s10915-018-0801-z
|View full text |Cite
|
Sign up to set email alerts
|

A Nonconvex Model with Minimax Concave Penalty for Image Restoration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 43 publications
(21 citation statements)
references
References 40 publications
0
16
0
Order By: Relevance
“…In building ensemble forecasting model, five penalized regressions that consist of Ridge, Lasso, Elastic Net, SCAD, and MCP will be trained and validated by each. Ridge regression widely used for high dimensional data where independendent variables are highly correlated, this method aims to reduce multicollinearity [13], Lasso is a method that used regularization and variable selection to increase interpretability and accuracy [14], Elastic Net is a combination of Ridge and Lasso regressions, so it will retain the advantage of both methods [15], SCAD regression aims to improve Lasso's penalty by reducing the bias in the model because the Lasso penalty tends to be linear in the size of the regression coefficient [16], and MCP is other alternative to give less biased variables in sparse model [17]. Penalized regression parameter will be determined.…”
Section: Methodsmentioning
confidence: 99%
“…In building ensemble forecasting model, five penalized regressions that consist of Ridge, Lasso, Elastic Net, SCAD, and MCP will be trained and validated by each. Ridge regression widely used for high dimensional data where independendent variables are highly correlated, this method aims to reduce multicollinearity [13], Lasso is a method that used regularization and variable selection to increase interpretability and accuracy [14], Elastic Net is a combination of Ridge and Lasso regressions, so it will retain the advantage of both methods [15], SCAD regression aims to improve Lasso's penalty by reducing the bias in the model because the Lasso penalty tends to be linear in the size of the regression coefficient [16], and MCP is other alternative to give less biased variables in sparse model [17]. Penalized regression parameter will be determined.…”
Section: Methodsmentioning
confidence: 99%
“…To promote sparsity of the target signals and images, recent studies show that nonconvex approximations of the l 0 -norm are more efficient, and the nonconvex penalties usually have better performances than l 1 penalty [1,2]. This is because the l 1 regularized model induces bias for large coefficients [3].…”
Section: Comparsion Between L 0 and L 1 Normmentioning
confidence: 99%
“…σ > 1 increases the weights of the penalty parameters β 1,k , β 2,k in each iteration k, thus accelerating the numerical convergence speed of the proposed ADMM algorithm. A similar technique has been used in [14,29,57,58,69].…”
Section: Numerical Algorithmmentioning
confidence: 99%