Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Reducing Impulse Noise in Images Using an Improved Formula Conjugate Gradient Method
View through CrossRef
The conjugate formula's significance is frequently emphasised by conjugate gradient approaches. In this paper, a novel conjugate coefficient for the conjugate gradient technique is introduced using a quadratic model and conjugacy condition. This coefficient is used to address image restoration issues. The algorithms described in this study exhibit the essential descent property and global convergence. The new approach is far better, as shown by numerical experiments. It has been demonstrated that the innovative conjugate gradient strategy outperforms the conventional FR conjugate gradient method. The great improvement of the new method has been confirmed by numerical testing. It has been demonstrated that the novel conjugate gradient approach outperforms the widely used FR approach.
Salahaddin University - Erbil
Title: Reducing Impulse Noise in Images Using an Improved Formula Conjugate Gradient Method
Description:
The conjugate formula's significance is frequently emphasised by conjugate gradient approaches.
In this paper, a novel conjugate coefficient for the conjugate gradient technique is introduced using a quadratic model and conjugacy condition.
This coefficient is used to address image restoration issues.
The algorithms described in this study exhibit the essential descent property and global convergence.
The new approach is far better, as shown by numerical experiments.
It has been demonstrated that the innovative conjugate gradient strategy outperforms the conventional FR conjugate gradient method.
The great improvement of the new method has been confirmed by numerical testing.
It has been demonstrated that the novel conjugate gradient approach outperforms the widely used FR approach.
.
Related Results
Bounds on the sum of broadcast domination number and strong metric dimension of graphs
Bounds on the sum of broadcast domination number and strong metric dimension of graphs
Let [Formula: see text] be a connected graph of order at least two with vertex set [Formula: see text]. For [Formula: see text], let [Formula: see text] denote the length of an [Fo...
Theoretical study of laser-cooled SH<sup>–</sup> anion
Theoretical study of laser-cooled SH<sup>–</sup> anion
The potential energy curves, dipole moments, and transition dipole moments for the <inline-formula><tex-math id="M13">\begin{document}${{\rm{X}}^1}{\Sigma ^ + }$\end{do...
A saturation problem in meshes
A saturation problem in meshes
Let [Formula: see text] and [Formula: see text] be graphs, where we view [Formula: see text] as the “host” graph and [Formula: see text] as a “forbidden” graph. A spanning subgraph...
When is R[θ] integrally closed?
When is R[θ] integrally closed?
Let [Formula: see text] be an integrally closed domain with quotient field [Formula: see text] and [Formula: see text] be an element of an integral domain containing [Formula: see ...
Environmental History of Oceanic Noise Pollution
Environmental History of Oceanic Noise Pollution
The concept of “ocean noise” precedes the concept of “ocean noise pollution” by about half a century. Those seeking a body of scholarly literature on ocean noise as an environmenta...
Inductive graph invariants and approximation algorithms
Inductive graph invariants and approximation algorithms
We introduce and study an inductively defined analogue [Formula: see text] of any increasing graph invariant [Formula: see text]. An invariant [Formula: see text] is increasing if ...
The Aα-eigenvalues of the generalized subdivision graph
The Aα-eigenvalues of the generalized subdivision graph
Let [Formula: see text] be a graph with an adjacency matrix [Formula: see text] and a diagonal degree matrix [Formula: see text]. For any graph [Formula: see text] and a real numbe...
Ld(2,1)-labeling on T-graphs
Ld(2,1)-labeling on T-graphs
In this paper, we are concerned with the [Formula: see text]-Graphs, which are graphs defined based on the Topological structure of the given set. Precisely, for a given topology [...