- Article
The paper firstly establishes the so-called n-times iterated connected sum of a simple closed k-surface in
The paper firstly establishes the so-called n-times iterated connected sum of a simple closed k-surface in
In this paper, a generalization of fixed-point mappings with an iterate at a point in complete metric spaces is shown, using the notions of T-closed sets and i-P-regularity/d-P-regularity, proving conditions for the existence and uniqueness of the fi...
The registration of point clouds in a three-dimensional space is an important task in many areas of computer vision, including robotics and autonomous driving. The purpose of registration is to find a rigid geometric transformation to align two point...
This paper introduces a higher-order orbital framework in fixed point theory based on a closed four-step orbital functional. Existing approaches, such as triangle-perimeter contractions, mainly rely on three-point configurations and first-order geome...
Laser scan matching with grid-based maps is a promising tool for real-time indoor positioning of mobile Unmanned Ground Vehicles (UGVs). While there are critical implementation problems, such as the ability to estimate the position by sensing the unk...
Point cloud collection forming a 3D scene typically uses information from multiple data scans. The common approach is to register the point cloud pairs consequentially using a variant of the iterative closest point (ICP) algorithm, but most versions...
Point orthogonal projection onto an algebraic surface is a very important topic in computer-aided geometric design and other fields. However, implementing this method is currently extremely challenging and difficult because it is difficult to achieve...
Using three dimensional point clouds from both simulated and real datasets from close and terrestrial laser scanners, the rotational and translational convergence regions of Geometric Primitive Iterative Closest Points (GP-ICP) are empirically evalua...
In this work, two broad classes of iteration functions in n-dimensional vector spaces are introduced. They are called iteration functions of the first and second kind at a fixed point of the corresponding iteration function. Two general local converg...
In each iteration, the projection methods require computing at least one projection onto the closed convex set. However, projections onto a general closed convex set are not easily executed, a fact that might affect the efficiency and applicability o...
The minimum error entropy (MEE) criterion is an important learning criterion in information theoretical learning (ITL). However, the MEE solution cannot be obtained in closed form even for a simple linear regression problem, and one has to search it,...
In 2006, together with D. Butnariu, we showed that if all iterates of a nonexpansive self-mapping of a complete metric space converge, then all its inexact iterates with summable computational errors converge too. In a recent paper of ours, we have e...
Efficient and accurate poroelasticity models are critical in modeling geophysical problems such as oil exploration, gas-hydrate detection, and hydrogeology. We propose an efficient operator splitting method for Biot’s model of linear poroelasti...
The analytical and especially the numerical calculations of the magnetic fields of highly saturated electrical machines require a correctly given magnetizing curve. In practice, professional software may use many points of the magnetizing curve (some...
In regression we can delete outliers based upon a preliminary estimator and re-estimate the parameters by least squares based upon the retained observations. We study the properties of an iteratively defined sequence of estimators based on this idea....
We present a head-to-head evaluation of the Improved Inexact–Newton–Smart (INS) algorithm against a primal–dual interior-point framework for large-scale nonlinear optimization. On extensive synthetic benchmarks, the interior-point m...
Motivated by the close relationship between the matrix square root and the matrix sign function, this paper develops a new high-order iterative framework for computing the principal square root of a matrix and its inverse. The proposed approach is de...
In this paper, we investigate the local and semilocal convergence of an iterative method for solving nonlinear systems of equations. We first establish the conditions under which these methods converge locally to the solution. Then, we extend our ana...
An improved non-convex optimized phase recovery algorithm is used to compensate for wavefront aberrations caused by atmospheric turbulence and pointing errors in the vortex beam. The algorithm is divided into two parts: initialization and iteration....
Filtering from airborne LiDAR datasets in urban area is one important process during the building of digital and smart cities. However, the existing filters encounter poor filtering performance and heavy computational burden when processing large-sca...
Closed-loop pipe systems allow the possibility of the flow of gas from both directions across each route, ensuring supply continuity in the event of a failure at one point, but their main shortcoming is in the necessity to model them using iterative...
The aim of this paper is to study, from a topological and geometrical point of view, the iteration map obtained by the application of iterative methods (Newton or relaxed Newton’s method) to a polynomial equation. In fact, we present a collection of...
This paper presents the research results of hydrogen plasma effect on the surface structure of the TGP-56 beryllium. In the linear simulator, the operating conditions of the first wall of ITER are simulated. Beryllium was irradiated with hydrogen pla...
A grey wolf optimization-based track-before-detect (GWO-TBD) method is developed for extended target detection and tracking. The aim of the GWO-TBD is tracking weak and maneuvering extended targets in a cluttered environment using the measurement poi...
To solve error propagation and exorbitant computational complexity of signal detection in wireless multiple-input multiple-output-orthogonal frequency division multiplexing (MIMO-OFDM) systems, a low-complex and efficient signal detection with iterat...
In this manuscript, we investigate some convergence and stability results for reckoning fixed points using a faster iterative scheme in a Banach space. Also, weak and strong convergence are discussed for close contraction mappings in a Banach space a...
We introduce Dictionary-based Attention (DA), a label-free, support-preserving block that reweights existing vertex–hyperedge memberships using dictionary-code similarity. We evaluate local dictionaries with closed-form hypergraph learning (DA-...
Industrial dimensional inspection relies on accurate registration between scanned point clouds and nominal CAD models to evaluate geometric deviations with respect to engineering datums. Conventional fine registration methods, such as the Iterative C...
Properties of the Voronoi tessellations arising from random 2D distribution points are reported. We applied an iterative procedure to the Voronoi diagrams generated by a set of points randomly placed on the plane. The procedure implied dividing the e...
We study Geraghty-type non-self mappings within the framework of best proximity point theory. By introducing auxiliary functions with subsequential convergence, we establish general conditions ensuring the existence and uniqueness of best proximity p...
In this paper, we study an iterative method for solving the multiple-set split feasibility problem: find a point in the intersection of a finite family of closed convex sets in one space such that its image under a linear transformation belongs to th...
In our recent work we have introduced and studied a notion of a generalized nonexpansive mapping. In the definition of this notion the norm has been replaced by a general function satisfying certain conditions. For this new class of mappings, we have...
Localization and mapping are key requirements for autonomous mobile systems to perform navigation and interaction tasks. Iterative Closest Point (ICP) is widely applied for LiDAR scan-matching in the robotic community. In addition, the standard ICP a...
Though an accurate measurement of entropy, or more generally uncertainty, is critical to the success of human–machine teams, the evaluation of the accuracy of such metrics as a probability of machine correctness is often aggregated and not asse...
In past years, there has been significant progress in the field of indoor robot localization. To precisely recover the position, the robots usually relies on multiple on-board sensors. Nevertheless, this affects the overall system cost and increases...
In this paper, we present a new third-order family of iterative methods in order to compute the multiple roots of nonlinear equations when the multiplicity
To achieve the ability of associating continuous-time laser frames is of vital importance but challenging for hand-held or backpack simultaneous localization and mapping (SLAM). In this study, the complex associating and mapping problem is investigat...
This paper proposes an iterative auto-tuning algorithm for PI controllers in permanent magnet synchronous motor (PMSM) drive systems. The controller gains are initially set using motor-parameter-based formulas derived from pole–zero cancelation...
In this paper, we introduce an automatic room segmentation approach based on morphological processing. The inputs are registered point-clouds obtained from either a static laser scanner or a mobile scanning system, without any required prior informat...
Star trackers commonly suffer from star point trailing during stellar imaging under dynamic observation conditions. Traditional non-blind deconvolution methods rely on a known Point Spread Function (PSF), whereas blind deconvolution approaches are pl...
Laser scanning allows for the rapid acquisition of three-dimensional data in the form of 3D point clouds. However, due to the accumulation of errors in the registration of multiple pairs of point clouds along the sensor’s trajectory, the genera...
This paper studies the convergence of distances between sequences of points and that of sequences of points in metric spaces. This investigation is focused on the iterative processes built with composed self-mappings of a cyclic contraction, which ca...
In our 2014 work with M. Gabour, we introduced a metric space of generalized nonexpansive self-mappings of bounded and closed subsets of a Banach space and studied, using the Baire category approach, the asymptotic behavior of iterates of a generic o...
Training semantic segmentation models is especially costly in remote sensing, since most problems require a new dataset as targets vary with resolution, sensors, and region. Approaches to reduce this cost are increasingly common, but most add machine...
In this paper, a multivalued self-mapping is defined on the union of a finite number of subsets
We introduce
We introduce and study a new class of nonlinear operators on metric spaces, called rational
We study a class of wrapping operators acting on the space of formal languages over a fixed finite alphabet. The underlying space is equipped with a length-based ultrametric, in which two languages are close whenever they coincide on all sufficiently...
The split convex feasibility problem serves as a unified mathematical framework for solving inverse problems, medical image reconstruction, and signal recovery across multiple Hilbert spaces. Traditional iterative schemes, such as hybrid and shrinkin...
The closed-form solution, one of the effective and sufficient optimization methods, is usually less computationally burdensome than iterative and nonlinear minimization in optimization problems of heat source localization. This work presents two-dime...
of 5