De-interlacing is revisited as the problem of assigning a sequence of interpolation methods (interpolators) to a sequence of missing pixels of an interlaced frame (field). With this assumption, our algorithm undergoes...
详细信息
ISBN:
(纸本)9781467350501
De-interlacing is revisited as the problem of assigning a sequence of interpolation methods (interpolators) to a sequence of missing pixels of an interlaced frame (field). With this assumption, our algorithm undergoes transitions from one interpolator to another as it moves from one missing pixel position to the next one. We assume that the next state depends only on the current state which implies a first-order Markov-chain on the sequence of interpolators. For estimation of the optimum sequence of interpolators our algorithm introduces a novel cost function and then makes use of forward-backward algorithm to find the global optimum sequence of interpolators. Simulation results prove that the proposed method is superior to the well-known de-interlacing algorithms proposed in this field.
This paper presents a method to simultaneously determine the wave velocity and the thickness of an unknown sample in case of overlapped ultrasonic signals. Indeed, the determination of the time delay in an ultrasonic ...
详细信息
This paper presents a method to simultaneously determine the wave velocity and the thickness of an unknown sample in case of overlapped ultrasonic signals. Indeed, the determination of the time delay in an ultrasonic signal can be critical to allow the simultaneous characterization of parameters of the studied material, such as the thickness and the wave velocity. Therefore, a forward-backward algorithm is applied to the overlapped signal using a reference signal in order to retrieve the excitation signal. Firstly, the method is explained and a validation on synthetic signal is performed to observe its robustness. Secondly, a time retrieval is performed on real signals to determine thickness and wave velocity in aluminium plates. The results show that this method is suitable to simultaneously retrieve thickness and wave velocity, even for overlapped signals (up to 65%), with a discrepancy as low as 1%.
We propose an inertial forward-backward splitting algorithm to compute a zero of a sum of two monotone operators allowing for stochastic errors in the computation of the operators. More precisely, we establish almost ...
详细信息
We propose an inertial forward-backward splitting algorithm to compute a zero of a sum of two monotone operators allowing for stochastic errors in the computation of the operators. More precisely, we establish almost sure convergence in real Hilbert spaces of the sequence of iterates to an optimal solution. Then, based on this analysis, we introduce two new classes of stochastic inertial primal-dual splitting methods for solving structured systems of composite monotone inclusions and prove their convergence. Our results extend to the stochastic and inertial setting various types of structured monotone inclusion problems and corresponding algorithmic solutions. Application to minimization problems is discussed.
We design new projective forward-backward algorithms for constrained minimization problems. We then discuss its weak convergence via a new linesearch that the hypothesis on the Lipschitz constant of the gradient of fu...
详细信息
We design new projective forward-backward algorithms for constrained minimization problems. We then discuss its weak convergence via a new linesearch that the hypothesis on the Lipschitz constant of the gradient of functions is avoided. We provide its applications to solve image deblurring and image inpainting. Finally, we discuss the optimal selection of parameters that are proposed in algorithms in terms of PSNR and SSIM. It reveals that our new algorithm outperforms some recent methods introduced in the literature.
In this paper, we analyze a class of nonconvex optimization problems from the viewpoint of abstract convexity. Using the respective generalizations of the subgradient, we propose an abstract notion of a proximal opera...
详细信息
In this paper, we analyze a class of nonconvex optimization problems from the viewpoint of abstract convexity. Using the respective generalizations of the subgradient, we propose an abstract notion of a proximal operator and derive several algorithms, namely abstract proximal point method, abstract forward-backward method, and abstract projected subgradient method. Global convergence results for all algorithms are discussed, and numerical examples are given.
The forward-backward algorithm is a splitting method for solving convex minimization problems of the sum of two objective functions. It has a great attention in optimization due to its broad application to many discip...
详细信息
The forward-backward algorithm is a splitting method for solving convex minimization problems of the sum of two objective functions. It has a great attention in optimization due to its broad application to many disciplines, such as image and signal processing, optimal control, regression, and classification problems. In this work, we aim to introduce new forward-backward algorithms for solving both unconstrained and constrained convex minimization problems by using linesearch technique. We discuss the convergence under mild conditions that do not depend on the Lipschitz continuity assumption of the gradient. Finally, we provide some applications to solving compressive sensing and image inpainting problems. Numerical results show that the proposed algorithm is more efficient than some algorithms in the literature. We also discuss the optimal choice of parameters in algorithms via numerical experiments.
It is well known that many problems in image recovery, signal processing, and machine learning can be modeled as finding zeros of the sum of maximal monotone and Lipschitz continuous monotone operators. Many papers ha...
详细信息
It is well known that many problems in image recovery, signal processing, and machine learning can be modeled as finding zeros of the sum of maximal monotone and Lipschitz continuous monotone operators. Many papers have studied forward-backward splitting methods for finding zeros of the sum of two monotone operators in Hilbert spaces. Most of the proposed splitting methods in the literature have been proposed for the sum of maximal monotone and inverse-strongly monotone operators in Hilbert spaces. In this paper, we consider splitting methods for finding zeros of the sum of maximal monotone operators and Lipschitz continuous monotone operators in Banach spaces. We obtain weak and strong convergence results for the zeros of the sum of maximal monotone and Lipschitz continuous monotone operators in Banach spaces. Many already studied problems in the literature can be considered as special cases of this paper.
This study presents the investigations on the occurrence of multiplicity correlations in the particle multiplicities in forward and backward hemisphere in the multiparticle states produced in 2 8 Si nuclei with variou...
详细信息
This study presents the investigations on the occurrence of multiplicity correlations in the particle multiplicities in forward and backward hemisphere in the multiparticle states produced in 2 8 Si nuclei with various targets at two different energies. The forward-forward and forward-backward dispersions are looked into. The variation of the correlation strength as a function of the pseudorapidity range is investigated and its dependence on target mass as well as the incident energy is studied. In order to estimate the contribution of non-statistical fluctuations, we use the deviation of the value of effective cluster multiplicity from unity as the benchmark.
In this paper, we prove the weak convergence of the iterates generated by the nonlinearly preconditioned forward-backward splitting method for the sum of a maximally hypermonotone operator A and a hypercocoercive oper...
详细信息
In this paper, we prove the weak convergence of the iterates generated by the nonlinearly preconditioned forward-backward splitting method for the sum of a maximally hypermonotone operator A and a hypercocoercive operator B under several suitable conditions. We provide several choices of the nonlinear preconditioners for solving nonlinearly composed inclusions. In particular, the backward-forward splitting method is recovered by the nonlinearly preconditioned forward-backward splitting method with a special choice of the nonlinear preconditioner.
The purpose of this paper is to study a forward-backward algorithm for approximating a zero of the sum of maximally monotone mappings in the setting of Banach spaces. Under some mild conditions, we prove a new strong ...
详细信息
The purpose of this paper is to study a forward-backward algorithm for approximating a zero of the sum of maximally monotone mappings in the setting of Banach spaces. Under some mild conditions, we prove a new strong convergence theorem for the algorithm produced by the method in real reflexive Banach spaces. In addition, we give some applications to the minimization problems. Finally, we provide a numerical example, which supports our main result. Our theorems improve and unify most of the results that have been proved for this important class of nonlinear mappings.
暂无评论