UT
Unclaimed author profile

Utomobong M. Okon

Is this your research profile?

Create or sign in to your KnowledgeTrend account to claim this page. After the claim, this same profile URL and its linked publications will belong to your account. Claiming does not automatically grant a verified badge.

Create account and claim this profile Sign in to claim
3Linked publications
0Citations
0h-index
0i10-index

Metrics are calculated from publications currently linked to this profile.

Researcher overview

About

Utomobong M. Okon is a registered researcher in their academic field.

Research output

Recent Publications

3 research works linked to this profile

▤
Research · 2026 · Ktrend - International Journal of Computational Mathematics and Scientific Computing

Projection and Proximal Operators in Image Denoising

Image denoising is a classical inverse problem in which the recovery of a clean image from its noisy observation is complicated by ill-posedness. This paper develops a functional-analytic framework in which a broad class of denoising methods is expressed as the iteration of firmly nonexpansive or quasi-nonexpansive operators on a Hilbert space. Total variation regularization, wavelet shrinkage, projection onto convex sets (POCS), projection onto epigraph sets (PESC), and regularization by denoising via fixed-point projection (RED-PRO) are each shown to fit this structure, and their convergence is obtained from a single Krasnosel'skii–Mann argument. The proximal nature of wavelet shrinkage is distinguished from metric projection onto the \(\ell^1\)-ball, and the demicontractive hypothesis underlying RED-PRO is stated explicitly. Numerical experiments on standard test images show that RED-PRO with a BM3D denoiser attains the highest PSNR at every noise level tested, that Chambolle's TV projection follows within \(1.2\)–\(1.7\) dB, and that POCS and wavelet shrinkage trade accuracy for speed. The framework clarifies the operator-theoretic content of each method and provides a common language for their analysis and comparison.

▤
Volterra integral equation; strictly pseudo-contractive mapping; Mann iteration; one-sided Lipschitz condition; Banach space; numerical analysis; method of lines. · 2026 · African Journal of Mathematics, Statistics and Computer Science

Strictly Pseudo-Contractive Volterra Integral Operators in Banach Spaces: Weak and Strong Convergence of the Mann Iteration with a Numerical Analysis Extension

We study nonlinear Volterra integral equations in uniformly convex Banach spaces $L^p(\Omega)$ $(1

▤
deterministic modelling; blockchain security; lattice-based cryptography; semigroup reconstruction; stability analysis; numerical simulation; algebraic cryptography · 2026 · African Journal of Mathematics, Statistics and Computer Science

A Hybrid Deterministic Mathematical Model for Secure Blockchain Transaction Dynamics Incorporating Lattice-Based Cryptography and Algebraic Semigroup Reconstruction

Blockchain technology has emerged as a foundational infrastructure for decentralized financial systems and secure digital transactions; however, its resilience against evolving cyber threats remains a significant challenge. This study presents a hybrid deterministic mathematical model that integrates lattice-based cryptography with algebraic semigroup structures to investigate the dynamics of blockchain transaction security. The proposed framework partitions blockchain nodes into four interacting classes: secure, vulnerable, compromised, and recovered. The system dynamics are governed by a coupled system of nonlinear ordinary differential equations that incorporates a lattice cryptographic protection coefficient and a semigroup reconstruction parameter. The blockchain security threshold is derived as $R_s=\dfrac{\beta\gamma}{(\lambda+\mu)(\delta+\sigma+\mu)}$, providing a quantitative criterion for evaluating network resilience. Local stability of the equilibrium points is established using Jacobian matrix analysis, while numerical simulations demonstrate the influence of cryptographic protection and algebraic reconstruction on long-term blockchain security. The results indicate that increasing the lattice protection coefficient $\lambda$ and the semigroup reconstruction efficiency $\sigma$ significantly reduces the proportion of compromised nodes while accelerating system recovery. Sensitivity analysis further identifies the parameters governing cryptographic strength and attack transmission as the primary determinants of blockchain stability. The proposed model extends existing deterministic blockchain security models by unifying mathematical modelling, algebraic semigroup theory, and post-quantum lattice cryptography within a single analytical framework, offering practical insights for the design of secure distributed ledger systems capable of resisting emerging computational and quantum-enabled attacks.