A new type of multilevel system for image sparse recovery

Author(s):  
Guomin Sun ◽  
Jinsong Leng ◽  
Carlo Cattani

This work focuses on image sparse recovery problem. First, we construct a new kind of pseudo-directional multilevel system, which forms a tight frame in [Formula: see text]. Different from the widely used directional multilevel transforms curvelts and shearlets, whose subbands are neat and nonsensitive to the energy distribution of signals in Fourier domain, the proposed multilevel system is designed to have subbands with specific shape, the shape is oriented by the energy distribution. Thus, we can obtain more sparse structure of signals and low computation for the multilevel transform. Moreover, to detect directional singularities of signals effectively, a local directional gradient operator is introduced to catch the signal variation along different directions, it can be seen as the generalized gradient. Then we proposed a simple but efficient method for image sparse recovery, the split Bregman algorithm is employed to solve the proposed convex model which guarantees the global optimal solution. Some contrast experiments suggest that the sparse recovery by the proposed method performs well in artifacts’ suppressing and details’ extraction.

2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Jun Zhang ◽  
Mingxi Ma ◽  
Zhaoming Wu ◽  
Chengzhi Deng

In this paper, a new model for image restoration under Poisson noise based on a high-order total bounded variation is proposed. Existence and uniqueness of its solution are proved. To find the global optimal solution of our strongly convex model, a split Bregman algorithm is introduced. Furthermore, a rigorous convergence theory of the proposed algorithm is established. Experimental results are provided to demonstrate the effectiveness and efficiency of the proposed method over the classic total bounded variation-based model.


2019 ◽  
Vol 9 (23) ◽  
pp. 5137 ◽  
Author(s):  
Guomin Sun ◽  
Jinsong Leng ◽  
Carlo Cattani

This work focuses on the problem of rain removal from a single image. The directional multilevel system, Shearlets, is used to describe the intrinsic directional and structure sparse priors of rain streaks and the background layer. In this paper, a Shearlets-based convex rain removal model is proposed, which involves three sparse regularizers: including the sparse regularizer of rain streaks and two sparse regularizers of the Shearlets transform of background layer in the rain drops’ direction and the Shearlets transform of rain streaks in the perpendicular direction. The split Bregman algorithm is utilized to solve the proposed convex optimization model, which ensures the global optimal solution. Comparison tests with three state-of-the-art methods are implemented on synthetic and real rainy images, which suggests that the proposed method is efficient both in rain removal and details preservation of the background layer.


2004 ◽  
Vol 21 (01) ◽  
pp. 9-33
Author(s):  
JAVIER SALMERÓN ◽  
ÁNGEL MARÍN

In this paper, we present an algorithm to solve a particular convex model explicitly. The model may massively arise when, for example, Benders decomposition or Lagrangean relaxation-decomposition is applied to solve large design problems in facility location and capacity expansion. To attain the optimal solution of the model, we analyze its Karush–Kuhn–Tucker optimality conditions and develop a constructive algorithm that provides the optimal primal and dual solutions. This approach yields better performance than other convex optimization techniques.


Author(s):  
Nannan Wu ◽  
Wenjun Wang ◽  
Feng Chen ◽  
Jianxin Li ◽  
Bo Li ◽  
...  

As networks are ubiquitous in the modern era, point anomalies have been changed to graph anomalies in terms of anomaly shapes. However, the specific-shape priors about anomalous subgraphs of interest are seldom considered by the traditional approaches when detecting the subgraphs in attributed graphs (e.g., computer networks, Bitcoin networks, and etc.). This paper proposes a nonlinear approach to specific-shape graph anomaly detection. The nonlinear approach focuses on optimizing a broad class of nonlinear cost functions via specific-shape constraints in attributed graphs. Our approach can be used to many different graph anomaly settings. The traditional approaches can only support linear cost functions (e.g., an aggregation function for the summation of node weights). However, our approach can employ more powerful nonlinear cost functions, and enjoys a rigorous theoretical guarantee on the near-optimal solution with the geometrical convergence rate.


2022 ◽  
Vol 421 ◽  
pp. 126923
Author(s):  
Bin Zhao ◽  
Pengbo Geng ◽  
Wengu Chen ◽  
Zhu Zeng
Keyword(s):  

2013 ◽  
Vol 3 (4) ◽  
pp. 263-282 ◽  
Author(s):  
Yiqiu Dong ◽  
Tieyong Zeng

AbstractA new hybrid variational model for recovering blurred images in the presence of multiplicative noise is proposed. Inspired by previous work on multiplicative noise removal, an I-divergence technique is used to build a strictly convex model under a condition that ensures the uniqueness of the solution and the stability of the algorithm. A split-Bregman algorithm is adopted to solve the constrained minimisation problem in the new hybrid model efficiently. Numerical tests for simultaneous deblurring and denoising of the images subject to multiplicative noise are then reported. Comparison with other methods clearly demonstrates the good performance of our new approach.


2014 ◽  
Vol 13 (05n06) ◽  
pp. 1460006
Author(s):  
Leilei Wang

Considering the sun light nonparallelism, Monte Carlo ray tracing method and specular reflection law are employed to simulate the effects of focal plane position error, pointing error to spot shape and energy distribution on focal plane of a new type of space solar concentrator. The results show that: with the absolute value of focal plane position error increasing, focal spot radius increases and peak energy flux value on focal plane decreases; when absolute value of focal plane position error is same, focal spot shape and energy distribution is almost the same; with pointing error increasing, the deviation of focal spot from the focal plane center increases and round focal spot becomes oval focal spot gradually. This will provide a reference for the new space solar concentrating and absorbing system design.


2020 ◽  
Vol 34 (04) ◽  
pp. 5093-5100
Author(s):  
Wenye Ma

This paper considers online convex optimization (OCO) problems - the paramount framework for online learning algorithm design. The loss function of learning task in OCO setting is based on streaming data so that OCO is a powerful tool to model large scale applications such as online recommender systems. Meanwhile, real-world data are usually of extreme high-dimensional due to modern feature engineering techniques so that the quadratic regression is impractical. Factorization Machine as well as its variants are efficient models for capturing feature interactions with low-rank matrix model but they can't fulfill the OCO setting due to their non-convexity. In this paper, We propose a projective quadratic regression (PQR) model. First, it can capture the import second-order feature information. Second, it is a convex model, so the requirements of OCO are fulfilled and the global optimal solution can be achieved. Moreover, existing modern online optimization methods such as Online Gradient Descent (OGD) or Follow-The-Regularized-Leader (FTRL) can be applied directly. In addition, by choosing a proper hyper-parameter, we show that it has the same order of space and time complexity as the linear model and thus can handle high-dimensional data. Experimental results demonstrate the performance of the proposed PQR model in terms of accuracy and efficiency by comparing with the state-of-the-art methods.


Sign in / Sign up

Export Citation Format

Share Document