• Title/Summary/Keyword: L1-norm-based regularization

Search Result 6, Processing Time 0.02 seconds

Resistivity Image Reconstruction Using Interacting Dual-Mode Regularization (상호작용 이중-모드 조정방법을 이용한 저항률 영상 복원)

  • Kang, Suk-In;Kim, Kyung-Youn
    • Journal of IKEEE
    • /
    • v.20 no.2
    • /
    • pp.152-162
    • /
    • 2016
  • Electrical resistivity tomography (ERT) is a technique to reconstruct the internal resistivity distribution using the measured voltages on the surface electrodes. ERT inverse problem suffers from ill-posedness nature, so regularization methods are used to mitigate ill-posedness. The reconstruction performance varies depending on the type of regularization method. In this paper, an interacting dual-mode regularization method is proposed with two different regularization methods, L1-norm regularization and total variation (TV) regularization, to achieve robust reconstruction performance. The interacting dual-mode regularization method selects the suitable regularization method and combines the regularization methods based on computed mode probabilities depending on the actual conditions. The proposed method is tested with numerical simulations and the results demonstrate an improved reconstruction performance.

Signomial Classification Method with 0-regularization (L0-정규화를 이용한 Signomial 분류 기법)

  • Lee, Kyung-Sik
    • IE interfaces
    • /
    • v.24 no.2
    • /
    • pp.151-155
    • /
    • 2011
  • In this study, we propose a signomial classification method with 0-regularization (0-)which seeks a sparse signomial function by solving a mixed-integer program to minimize the weighted sum of the 0-norm of the coefficient vector of the resulting function and the $L_1$-norm of loss caused by the function. $SC_0$ gives an explicit description of the resulting function with a small number of terms in the original input space, which can be used for prediction purposes as well as interpretation purposes. We present a practical implementation of $SC_0$ based on the mixed-integer programming and the column generation procedure previously proposed for the signomial classification method with $SL_1$-regularization. Computational study shows that $SC_0$ gives competitive performance compared to other widely used learning methods for classification.

An Unified Bayesian Total Variation Regularization Method and Application to Image Restoration (통합 베이즈 총변이 정규화 방법과 영상복원에 대한 응용)

  • Yoo, Jae-Hung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.1
    • /
    • pp.41-48
    • /
    • 2022
  • This paper presents the unified Bayesian Tikhonov regularization method as a solution to total variation regularization. The integrated method presents a formula for obtaining the regularization parameter by transforming the total variation term into a weighted Tikhonov regularization term. It repeats until the reconstructed image converges to obtain a regularization parameter and a new weighting factor based on it. The experimental results show the effectiveness of the proposed method for the image restoration problem.

Variational Image Dehazing using a Fuzzy Membership Function

  • Park, Hasil;Park, Jinho;Kim, Heegwang;Paik, Joonki
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.6 no.2
    • /
    • pp.85-92
    • /
    • 2017
  • This paper presents a dehazing method based on a fuzzy membership function and variational method. The proposed algorithm consists of three steps: i) estimate transmission through a pixel-based operation using a fuzzy membership function, ii) refine the transmission using an L1-norm-based regularization method, and iii) obtain the result of haze removal based on a hazy image formation model using the refined transmission. In order to prevent color distortion of the sky region seen in conventional methods, we use a trapezoid-type fuzzy membership function. The proposed method acquires high-quality images without halo artifacts and loss of color contrast.

Regularized Multichannel Blind Deconvolution Using Alternating Minimization

  • James, Soniya;Maik, Vivek;Karibassappa, K.;Paik, Joonki
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.6
    • /
    • pp.413-421
    • /
    • 2015
  • Regularized Blind Deconvolution is a problem applicable in degraded images in order to bring the original image out of blur. Multichannel blind Deconvolution considered as an optimization problem. Each step in the optimization is considered as variable splitting problem using an algorithm called Alternating Minimization Algorithm. Each Step in the Variable splitting undergoes Augmented Lagrangian method (ALM) / Bregman Iterative method. Regularization is used where an ill posed problem converted into a well posed problem. Two well known regularizers are Tikhonov class and Total Variation (TV) / L2 model. TV can be isotropic and anisotropic, where isotropic for L2 norm and anisotropic for L1 norm. Based on many probabilistic model and Fourier Transforms Image deblurring can be solved. Here in this paper to improve the performance, we have used an adaptive regularization filtering and isotropic TV model Lp norm. Image deblurring is applicable in the areas such as medical image sensing, astrophotography, traffic signal monitoring, remote sensors, case investigation and even images that are taken using a digital camera / mobile cameras.

QoS Constrained Optimization of Cell Association and Resource Allocation for Load Balancing in Downlink Heterogeneous Cellular Networks

  • Su, Gongchao;Chen, Bin;Lin, Xiaohui;Wang, Hui;Li, Lemin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1569-1586
    • /
    • 2015
  • This paper considers the optimal cell association and resource allocation for load balancing in a heterogeneous cellular network subject to user's quality-of-service (QoS) constraints. We adopt the proportional fairness (PF) utility maximization formulation which also accommodates the QoS constraints in terms of minimum rate requirements. With equal resource allocation this joint optimization problem is either infeasible or requires relaxation that yields a solution which is difficult to implement. Nevertheless, we show that this joint optimization problem can be effectively solved without any priori assumption on resource allocation and yields a cell association scheme which enforces single BS association for each user. We re-formulated the joint optimization problem as a network-wide resource allocation problem with cardinality constraints. A reweighted heuristic l1-norm regularization method is used to obtain a sparse solution to the re-formulated problem. The cell association scheme is then derived from the sparsity pattern of the solution, which guarantees a single BS association for each user. Compared with the previously proposed method based on equal resource allocation, the proposed framework results in a feasible cell association scheme and yields a robust solution on resource allocation that satisfies the QoS constraints. Our simulations illustrate the impact of user's minimum rate requirements on cell association and demonstrate that the proposed approach achieves load balancing and enforces single BS association for users.