Results 61 to 70 of about 435,592 (297)
Color Image Recovery Using Low-Rank Quaternion Matrix Completion Algorithm [PDF]
As a new color image representation tool, quaternion has achieved excellent results in color image processing problems. In this paper, we propose a novel low-rank quaternion matrix completion algorithm to recover missing data of a color image.
Jifei Miao, K. Kou
semanticscholar +1 more source
Matrix pencils completion problems II
[For part I see the author, ibid. 428, No.~1, 259--304 (2008; Zbl 1131.15010).] The paper deals with the matrix pencils completion problem. This problem analyzes the existence of a matrix pencil with prescribed Kronecker invariants and a regular subpencil. Specifically, the author studies the following problem: Let \(A(\lambda) \in F[\lambda]^{n \times
openaire +1 more source
The P_0^+-matrix completion problem
A real n by n matrix B is a P_0^+ -matrix if for each k in {1, 2, . . . , n} every k by k principal minor of B is nonnegative, and at least one k by k principal minor is positive. A digraph D is said to have P_0^+-completion if every partial P_0^+-matrix specifying D can be completed to a P_0^+ -matrix.
Bhaba Sarma, Kalyan Sinha
openaire +1 more source
Objective Somatic items used in depression assessments can potentially overlap with symptoms related to physical illness, including systemic sclerosis (SSc). No studies have looked at whether somatic depression items may be influenced by diffuse versus limited SSc disease subtypes, which are associated with varying degrees of symptom presentation.
Sophie Hu +109 more
wiley +1 more source
A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems
A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam +2 more
wiley +1 more source
The nonsingular matrix completion problem
An n × n matrix is called a principally nonsingular matrix (NSmatrix) if all its principal minors are different from zero and it is called a totally nonsingular matrix (TNS-matrix) if all its minors are different from zero. In this paper, we are interested in the NS-matrix (TNSmatrix) completion problem: whether a partial NS-matrix (TNS-matrix) has a ...
J. R. Torregrosa +2 more
openaire +1 more source
Current Tracking Adaptive Control of Brushless DC Motors
In this paper, the current tracking for Brushless Direct Current motors is approached considering uncertainty in the parameters of the motor's model. An adaptive control scheme to compensate electrical parameters uncertainty is proposed without requiring any knowledge of the mechanical parameters.
Fernanda Ramos‐García +3 more
wiley +1 more source
This work introduces an adaptive human pilot model that captures pilot time‐delay effects in adaptive control systems. The model enables the prediction of pilot–controller interactions, facilitating safer integration and improved design of adaptive controllers for piloted applications.
Abdullah Habboush, Yildiray Yildiz
wiley +1 more source
Matrix Completion of Adaptive Jumping Graph Neural Networks for Recommendation Systems
Using graph neural networks to model recommendation scenarios can effectively capture high-order relationship features between objects, thereby helping the model better handle recommendation problems.
Xiaodong Zhu, Junyu Fu, Chen Chen
doaj +1 more source
Some matrix completion problems
Let F be a field and let n,p1,p2,p3 be positive integers such that n=p1+p2+p3. LetA=[A1,1A1,2A1,3A2,1A2,2A2,3A3,1A3,2A3,3]∈Fn×n, where the blocks Ai,j are of type pi×pj,i,j∈{1,2,3}, and the blocks in the positions (i,i) are square. We describe the characteristic polynomial of A, when:(i) A1,1, A1,2 and A3,3 are fixed and the other blocks vary;(ii) A1,1,
openaire +1 more source

