In the field of state-of-the-art object detection, the task of object localization is typically accomplished through a dedicated subnet that emphasizes bounding box regression. This subnet traditionally predicts the object's position by regressing the box's center position and scaling factors. Despite the widespread adoption of this approach, we have observed that the localization results often suffer from defects, leading to unsatisfactory detector performance. In this paper, we address the shortcomings of previous methods through theoretical analysis and experimental verification and present an innovative solution for precise object detection. Instead of solely focusing on the object's center and size, our approach enhances the accuracy of bounding box localization by refining the box edges based on the estimated distribution at the object's boundary. Experimental results demonstrate the potential and generalizability of our proposed method.
Citation: Peng Zhi, Haoran Zhou, Hang Huang, Rui Zhao, Rui Zhou, Qingguo Zhou. Boundary distribution estimation for precise object detection[J]. Electronic Research Archive, 2023, 31(8): 5025-5038. doi: 10.3934/era.2023257
[1] | Xiangquan Liu, Xiaoming Huang . Weakly supervised salient object detection via bounding-box annotation and SAM model. Electronic Research Archive, 2024, 32(3): 1624-1645. doi: 10.3934/era.2024074 |
[2] | Tej Bahadur Shahi, Cheng-Yuan Xu, Arjun Neupane, William Guo . Machine learning methods for precision agriculture with UAV imagery: a review. Electronic Research Archive, 2022, 30(12): 4277-4317. doi: 10.3934/era.2022218 |
[3] | Jiayi Yu, Ye Tao, Huan Zhang, Zhibiao Wang, Wenhua Cui, Tianwei Shi . Age estimation algorithm based on deep learning and its application in fall detection. Electronic Research Archive, 2023, 31(8): 4907-4924. doi: 10.3934/era.2023251 |
[4] | Hui Yao, Yaning Fan, Xinyue Wei, Yanhao Liu, Dandan Cao, Zhanping You . Research and optimization of YOLO-based method for automatic pavement defect detection. Electronic Research Archive, 2024, 32(3): 1708-1730. doi: 10.3934/era.2024078 |
[5] | Manal Abdullah Alohali, Mashael Maashi, Raji Faqih, Hany Mahgoub, Abdullah Mohamed, Mohammed Assiri, Suhanda Drar . Spotted hyena optimizer with deep learning enabled vehicle counting and classification model for intelligent transportation systems. Electronic Research Archive, 2023, 31(7): 3704-3721. doi: 10.3934/era.2023188 |
[6] | Yogesh Kumar Rathore, Rekh Ram Janghel, Chetan Swarup, Saroj Kumar Pandey, Ankit Kumar, Kamred Udham Singh, Teekam Singh . Detection of rice plant disease from RGB and grayscale images using an LW17 deep learning model. Electronic Research Archive, 2023, 31(5): 2813-2833. doi: 10.3934/era.2023142 |
[7] | Yaxi Xu, Yi Liu, Ke Shi, Xin Wang, Yi Li, Jizong Chen . An airport apron ground service surveillance algorithm based on improved YOLO network. Electronic Research Archive, 2024, 32(5): 3569-3587. doi: 10.3934/era.2024164 |
[8] | Bin Zhang, Zhenyu Song, Xingping Huang, Jin Qian, Chengfei Cai . A practical object detection-based multiscale attention strategy for person reidentification. Electronic Research Archive, 2024, 32(12): 6772-6791. doi: 10.3934/era.2024317 |
[9] | Yongsheng Lei, Meng Ding, Tianliang Lu, Juhao Li, Dongyue Zhao, Fushi Chen . A novel approach for enhanced abnormal action recognition via coarse and precise detection stage. Electronic Research Archive, 2024, 32(2): 874-896. doi: 10.3934/era.2024042 |
[10] | Jian Liu, Zhen Yu, Wenyu Guo . The 3D-aware image synthesis of prohibited items in the X-ray security inspection by stylized generative radiance fields. Electronic Research Archive, 2024, 32(3): 1801-1821. doi: 10.3934/era.2024082 |
In the field of state-of-the-art object detection, the task of object localization is typically accomplished through a dedicated subnet that emphasizes bounding box regression. This subnet traditionally predicts the object's position by regressing the box's center position and scaling factors. Despite the widespread adoption of this approach, we have observed that the localization results often suffer from defects, leading to unsatisfactory detector performance. In this paper, we address the shortcomings of previous methods through theoretical analysis and experimental verification and present an innovative solution for precise object detection. Instead of solely focusing on the object's center and size, our approach enhances the accuracy of bounding box localization by refining the box edges based on the estimated distribution at the object's boundary. Experimental results demonstrate the potential and generalizability of our proposed method.
Let Rm×n denote the set of all real m×n matrices. O∈Rm×n represents a matrix with all zero elements. For A∈Rm×n, the notation A≥O(A>O) denotes that all elements of matrix A are nonnegative (positive), and in this case matrix A is called nonnegative (positive) matrix. For two matrices A,B∈Rm×n, A≥B(A>B) means that A−B≥O(A−B>O). The nonnegative (positive) vectors, by identifying them with n×1 matrices, are denoted by x≥0(x>0). A real rectangular matrix A is said to be semimonotone if A†≥O [14], here A† is the Moore-Penrose inverse of A, see [2,20] or Section 2.
Real rectangular linear system of the form
Ax=b, | (1.1) |
where A∈Rm×n and b∈Rm×1, appear in many areas of applications, for example, finite difference discretization of partial differential equations with suitable boundary conditions. There are two forms of splitting iteration methods for solving the rectangular linear system (1.1):
(1). Assume A has the single splitting [4]
A=U−V, | (1.2) |
then the approximate solution of (1.1) is generated by
xk+1=U†Vxk+U†b, | (1.3) |
where U† is the Moore-Penrose inverse of U, the matrix U†V is called the iteration matrix of (1.3). The splitting A=U−V is called a proper splitting if R(A)=R(U) and N(A)=N(U) [4], where R(⋅) and N(⋅) is the range and kernel of a given matrix, respectively. It should be remarked that the uniqueness of proper splittings was provided in [13]. Let ρ(C) be the spectral radius of the real square matrix C, then for the proper splitting A=U−V, the iteration scheme (1.3) converges to the minimal norm least squares solution x=A†b of (1.1) for any initial vector x0 if and only if ρ(U†V)<1 [4,Corollary 1]. Note that if A=U−V is not a proper splitting, the iteration scheme (1.3) may not {converge} to the minimal norm least squares solution x=A†b of (1.1) for any initial vector x0 even for ρ(U†V)<1, see [4,11]. If the iteration scheme (1.3) is convergent, then we say that the proper single splitting A=U−V is a convergent splitting. The convergence of the iteration scheme (1.3) for proper splittings of A has been studied extensively in [4,6,7,9,14,11,12].
(2). Assume A has the double splitting
A=P−R−S, | (1.4) |
then the approximate solution of (1.1) is generated by [9]
xk+1=P†Rxk+P†Sxk−1+P†b | (1.5) |
with the aid of the Moore-Penrose inverse of P. It should be remarked that the double splitting was first introduced by Woˊznicki in [19] for nonsingular matrix, and was extended to rectangular matrices in [9,11]. The iteration scheme (1.5) can be rewritten in the following equivalent form
(xk+1xk)=(P†RP†SIO)(xkxk−1)+(P†b0),i=1,2,⋯, | (1.6) |
here I is the identity matrix with appropriate size, and W=(P†RP†SIO) is the iteration matrix of (1.6). The splitting A=P−R−S is called a double proper splitting if R(A)=R(P) and N(A)=N(P) [9]. For double proper splitting (1.4), the iterative method (1.5) or (1.6) converges to the unique least squares solution of minimum norm of (1.1) if and only if ρ(W)<1. The convergence of the iteration scheme (1.6) for double proper splittings of A has been studied in [9,11,16].
Comparison theorems between the spectral radii of iteration matrices are useful tools to analyze the convergence rate of iteration methods or to judge the effectiveness of preconditioners [8,9,10,12,15]. Comparison theorems between the spectral radii of iteration matrices arising from different splittings of one matrix are actually the comparison of convergence rate between the different iteration methods, while comparison theorems between the spectral radii of matrices arising from the splittings of different matrices are in fact the comparison of effectiveness of different preconditioners[12,15]. Some comparison theorems of single proper splittings of a semimonotone matrix are established recently in [3,9,11], and comparison theorems of single proper splittings of different semimonotone matrices are proposed in [3,12]. Comparison theorems for double proper splittings of a rectangular matrix can be found in [1,3], and which for double proper splittings of different rectangular matrices can be found in [3,9,11].
In this paper, we further investigate the proper nonnegative splitting (see Section 2) of a rectangular matrix. New convergence theorems for the single proper nonnegative splitting of a semimonotone matrix are given, and the comparison theorems of proper nonegative splittings of different rectangular matrices are presented. The remainder of the paper is organized as follows. In Section 2, we give some relevant definitions, notations and earlier results, which are used in the paper. In Section 3, we present the new convergence theorems for the single proper nonnegative splitting of a semimonotone matrix and the comparison theorems of single proper {nonnegative} splittings of different semimonotone matrices. In Section 4, some comparison theorems of double proper nonegative splittings of different rectangular matrices are presented. We end this paper with some conclusions in Section 5.
For a matrix A∈Rm×n, the matrix X∈Rn×m, satisfying the four Penrose equations: AXA=A, XAX=X, (AX)T=AX and (XA)T=XA, is called the Moore-Penrose inverse of A (BT denotes the transpose of B). It always exists and is unique, and is denoted by A†, i.e., X=A†, see [2,20].
For nonnegative matrix, there are well known results which are shown next.
Lemma 2.1. [21,Theorem 2.20] Let A be the nonnegaitve n×n matrix, then A has a nonnegative real eigenvalue equal to its spectral radius.
Lemma 2.2. [21,Theorem 2.21] Let A,B be n×n matrices, if A≥B≥O, then ρ(A)≥ρ(B).
Lemma 2.3. [5,Theorem 2-1.11] Let B≥O and x≥0 be such that Bx−αx≥0, then α≤ρ(B).
Lemma 2.4. [21,Theorem 3.16] Let X∈Rn×n and X≥O. Then ρ(X)<1 if and only if (I−X)−1 exists and (I−X)−1=∑∞k=0Xk≥O.
Using the notation of the nonnegative matrix, single proper regular, single proper weak regular and single proper nonnegative splittings of a real rectangular matrix, which are the natural extensions of the regular, weak regular and nonnegative splittings of a real square matrix [5,21], are defined as
Definition 2.5. For A∈Rm×n, the splitting A=U−V is called
(1). a single proper regular splitting if it is a proper splitting such that U†≥O and V≥O [7,Definition 1], [9,Definition 1.2] ;
(2). a single proper weak regular splitting of the first type if it is a proper splitting such that U†≥O and U†V≥O; a proper weak regular splitting of {the second type} if it is a proper splitting such that U†≥O and VU†≥O [7,Definition 1], [9,Definition 1.2] ;
(3). a single proper nonnegative splitting if it is a proper splitting such that U†V≥O [11,Definition 3.1] .
It should be remarked that Jena et al. [9] only considered the proper weak regular splitting of the first type, they name it as proper weak regular splitting. The existence of the proper splitting is discussed in [4], there is an example in [4] to show how to construct such splitting.
For the proper splitting A=U−V of a semimonotone matrix A, the fact that U=A+V is a proper splitting implies that ρ(A†V)<1 and I+A†V is invertible, so we have U†=(I+A†V)−1A† [14,Theorem 2.2] and U†V=(I+A†V)−1A†V. The next lemma shows the relation between the eigenvalues of U†V and A†V.
Lemma 2.6. [14,Lemma 2.6] Let A=U−V be a proper splitting of real m×n matrix A. Let μi,1≤i≤s and λj,1≤j≤s be the eigenvalues of U†V and A†V, respectively. Then for every j, we have 1+λj≠0. Also, for every i, there exists j such that μi=λj1+λj, and for every j, there exists i such that λj=μi1−μi.
The definitions of double proper regular, double proper weak regular and double proper nonnegative splittings for a real rectangular matrix can be given in a similar way.
Definition 2.7. For A∈Rm×n, the splitting A=P−R−S is called
(1). a double proper regular splitting if it is a proper splitting such that P†≥O, R≥O and S≥O [9,Definition 3.4], [1,Definition 2.7];
(2). a double proper weak regular splitting if it is a proper splitting such that P†≥O, P†R≥O and P†S≥O [9,Definition 3.5], [1,Definition 2.7];
(3). a double proper nonnegative splitting if it is a proper splitting such that P†R≥O and P†S≥O [11,Definition 4.1].
The double proper splittings of a rectangular matrix are generalizations of the double splittings of a square matrix. Double splittings of a square nonsingular matrix are given in [17,18,19].
In this section, two convergence theorems of the single proper nonnegative splitting of a semimonotone matrix are given, and the comparison theorems of the single proper nonegative splittings of different semimonotone matrices are presented.
Recall that for the convergent proper nonnegative splitting A=U−V of a semimonotone matrix A∈Rm×n, A†≥U† holds, see [11,Theorem 3.9 (a)]. In fact, for the proper nonnegative splitting A=U−V of a semimonotone matrix A∈Rm×n, we have the same result, which is shown in the following lemma.
Lemma 3.1. Let A=U−V be a proper nonnegative splitting of a semimonotone matrix A∈Rm×n, then A†≥U†.
Proof. Given that A=U−V is a proper nonnegative splitting of a semimonotone matrix A, so we have A†≥O and U†V≥O. The fact A=U−V is a proper splitting yields A†=(I−U†V)−1U†, so U†=(I−U†V)A†=A†−U†VA†[4,Theorem 1]. Therefor A†−U†=U†VA†≥O, i.e., A†≥U†.
Now we are going to the new convergence results.
Theorem 3.2. Let A=U−V be a proper nonnegative splitting of a semimonotone matrix A∈Rm×n, and U≥O, then ρ(U†V)=ρ(A†U)−1ρ(A†U)<1.
Proof. Note that for semimonotone matrix A and U≥O, we have A†U≥O. The following proof is the same as that in [11,Lemma 3.4], we omit it here.
Theorem 3.3. Let A=U−V be a proper nonnegative splitting of a semimonotone matrix A∈Rm×n, and V≥O, then ρ(U†V)=ρ(A†V)1+ρ(A†V)<1.
Proof. Note that A is a semimonotone matrix and V≥O, therefore A†V≥O, the following proof is omitted because it is the same as that in [11,Lemma 3.5].
Remark 3.4. For a general rectangular matrix A, A†U≥O or A†V≥O can guarantee the convergence of the single proper nonnegative splitting [11], while for a semimonotone matrix A, U≥O or V≥O is sufficient to ensure the convergence of the single proper nonnegative splitting. For the single proper regular or single proper weak regular splitting of a semimonotone matrix A, ρ(U†V)=ρ(A†V)1+ρ(A†V)<1 holds without additional conditions [4,9].
The following example shows that even U≥O, ρ(U†V)<1 does not hold for the single proper nonnegative splitting of a general rectangular matrix.
Example 3.5. Let A=(1500120−180) be splitted as A=U−V with U=(1500115140) and V=(000160380). Then we have A†=(502−800), U†=(50−43400) and U†V=(000115320000), so A=U−V is a single proper nonnegative splitting of general rectangular matrix A. Although U≥O, ρ(U†V)=1.5000>1.
Another example given below demonstrates that the condition U≥O or V≥O can not be dropped for the single proper nonnegative splitting of a semimonotone matrix.
Example 3.6. Let A=(5−10−520) be splitted as A=U−V with U=(0−10−800) and V=(−500−3−20). Then A†=(25151100)≥O, U†V=(38140500000)≥O, so A=U−V is a single proper nonnegative splitting of semimonotone matrix A, but U≱O, hence ρ(U†V)<1 does not hold, in fact, ρ(U†V)=1.3211>1.
In what follows, we consider the comparison results between the spectral radii of matrices arising from the single proper nonnegative splittings of different semimonotone matrices. Let A1,A2∈Rm×n be two semimonotone matrices, A1=U1−V1 and A2=U2−V2 be the proper nonnegative splittings of A1 and A2, respectively. Comparing ρ(U†1V1) with ρ(U†2V2), we have the following comparison theorem.
Theorem 3.7. Let A1,A2∈Rm×n be two semimonotone matrices, A1=U1−V1 and A2=U2−V2 be the proper nonnegative splittings of A1 and A2 respectively. If A†2≥A†1 and U2≥U1≥O, then
ρ(U†1V1)≤ρ(U†2V2)<1. |
Proof. As A1 and A2 are semimonotone matrices, A1=U1−V1 and A2=U2−V2 are the proper nonnegative splittings and U2≥U1≥O, it follows from Theorem 3.2 that ρ(U†iVi)<1 for i=1,2. Thus all we need to show is ρ(U†1V1)≤ρ(U†2V2).
For i=1,2, we know that
ρ(U†iVi)=ρ(A†iUi)−1ρ(A†iUi). |
Note that U1≥O, then A†2≥A†1 and U2≥U1≥O leads to A†2U2≥A†1U1≥O, and Lemma 2.2 yields ρ(A†1U1)≤ρ(A†2U2). Let f(λ)=λ−1λ, then f(λ) is a strictly increasing function for λ>0. Hence the inequality ρ(U†1V1)≤ρ(U†2V2) holds.
From Theorem 3.7, the following corollaries can be obtained.
Corollary 3.8. Let A∈Rm×n be a semimonotone matrix, A=U1−V1=U2−V2 be two proper nonnegative splittings of A. If U2≥U1≥O, then
ρ(U†1V1)≤ρ(U†2V2)<1. |
From Corollary 3.8, it is easy to see that for a semimonotone matrix A, the assumption U2≥U1 is equivalent to V2≥V1. Hence, based on Corollary 3.8 and Theorem 3.3, we can give out the similar result for different semimonotone matrices A1 and A2.
Theorem 3.9. Let A1,A2∈Rm×n be two semimonotone matrices, A1=U1−V1 and A2=U2−V2 be the proper nonnegative splittings of A1 and A2 respectively. If A†2≥A†1 and V2≥V1≥O, then
ρ(U†1V1)≤ρ(U†2V2)<1. |
Proof. As A1 and A2 are semimonotone matrices, A1=U1−V1 and A2=U2−V2 are the proper nonnegative splittings and V2≥V1≥O, it follows from Theorem 3.3 that ρ(U†iVi)<1 for i=1,2. Thus all we need to show is ρ(U†1V1)≤ρ(U†2V2).
For i=1,2, it follows from Theorem 3.3 that
ρ(U†iVi)=ρ(A†iVi)1+ρ(A†iVi). |
Note that V1≥O, then A†2≥A†1 and V2≥V1≥O leads to A†2V2≥A†1V1≥O, and Lemma 2.2 yields ρ(A†1V1)≤ρ(A†2V2). Let f(λ)=λ1+λ, then f(λ) is a strictly increasing function for λ>0. Hence the inequality ρ(U†1V1)≤ρ(U†2V2) holds.
If we consider the proper nonnegative splittings A=U1−V1=U2−V2 of a semimonotone matrix A∈Rm×n, we have the next corollary.
Corollary 3.10. Let A∈Rm×n be a semimonotone matrix, A=U1−V1=U2−V2 be two proper nonnegative splittings of A. If V2≥V1≥O, then
ρ(U†1V1)≤ρ(U†2V2)<1. |
Theorem 3.9 extends Theorem 6 in [12] from single proper regular splittings to single proper nonnegative splittings of different semimonotone matrices. Corollary 3.10 extends Theorem 3.2 in [9] from single proper regular splittings to single proper nonnegative splittings of a semimonotone matrix A.
An example given below to shows that ρ(U†1V1)≤ρ(U†2V2)<1 holds under the conditions A†2≥A†1 and V2≥V1≥O for single proper nonnegative splittings instead of single proper regular splittings of semimonotone matrices A1 and A2.
Example 3.11. Let A1=(4−10020) and A2=(2−10020). Set U1=(5−10040), V1=(100020) and U2=(5−10040), V2=(300020). It is easy to see that A†1=(141801200), A†2=(121401200) and U†1V1=(1511000120000), U†2V2=(3511000120000). Moreover, V2≥V1≥O but {U1=U2≱O}. So, A1=U1−V1 and A2=U2−V2 are two single proper nonnegative splittings, instead of single proper regular splittings, of semimonotone matrices A1 and A2. But we still have ρ(U†1V1)=0.5≤ρ(U†2V2)=0.6.
In what follows, we are moving to present a comparison result when both proper nonnegative splittings A1=U1−V1 and A2=U2−V2 are convergent splittings.
Theorem 3.12. Let A1 and A2 be two semimonotone matrices, A1=U1−V1 and A2=U2−V2 be the convergent proper nonnegative splittings of A1 and A2 respectively. Let x≥0 and y≥0 be two nonzero vectors such that U†1V1x=ρ(U†1V1)x and U†2V2y=ρ(U†2V2)y. Suppose that either V1x≥0 with ρ(U†1V1)x>0 or V2y≥0 with y>0 and ρ(U†2V2)y>0. Further, assume that A†1≤A†2 and O≤U†2≤U†1. Then
ρ(U†1V1)≤ρ(U†2V2)<1. |
Proof. Let us consider the case of V1x≥0 with ρ(U†1V1)x>0. It follows from the convergence of the proper nonnegative splitting A2=U2−V2 and Lemma 2.4, we get (I−U†2V2)−1≥O, so that
A†1≤A†2=(U2−V2)†=[U2(I−U†2V2)]†=(I−U†2V2)−1U†2≤(I−U†2V2)−1U†1. |
Multiplying it on the right of both sides by V1x gets
A†1V1x≤(I−U†2V2)−1U†1V1x. |
Note that A†1V1x=(I−U†1V1)−1U†1V1x=ρ(U†1V1)1−ρ(U†1V1)x and U†1V1x=ρ(U†1V1)x, we have
ρ(U†1V1)1−ρ(U†1V1)x≤ρ(U†1V1)(I−U†2V2)−1x, |
i.e.,
11−ρ(U†1V1)x≤(I−U†2V2)−1x, |
which, by Lemma 2.3, implies
11−ρ(U†1V1)≤11−ρ(U†2V2). |
Therefore, the required inequality ρ(U†1V1)≤ρ(U†2V2) holds.
The case of V2y≥0 with y>0 and ρ(U†2V2)y>0 can be proved in a similar way.
When we pay our attention to different convergent proper nonnegative splittings of a semimonotone matrix A, from Theorem 3.12, the next corollary is obtained.
Corollary 3.13. Let A be a semimonotone matrix, A=U1−V1=U2−V2 be convergent proper nonnegative splittings of A. Let x≥0 and y≥0 be two nonzero vectors such that U†1V1x=ρ(U†1V1)x and U†2V2y=ρ(U†2V2)y. Suppose that either V1x≥0 with ρ(U†1V1)x>0 or V2y≥0 with y>0 and ρ(U†2V2)y>0. Further, assume that O≤U†2≤U†1. Then
ρ(U†1V1)≤ρ(U†2V2)<1. |
In addition to the requirement of A be semimonotone, Corollary 3.13 is the same as Theorem 3.11 in [11]. For single proper regular splittings A=U1−V1=U2−V2, [9] has a more concise result, see Theorem 3.3 of [9].
In this part, we will provide the comparison theorem of double proper nonnegative splittings of different rectangular matrices.
Let A1,A2∈Rm×n, A1=P1−R1−S1 and A2=P2−R2−S2 be double proper nonnegative splittings of A1 and A2, respectively. Then, we define
W1=(P†1R1P†1S1I0)andW2=(P†2R2P†2S2I0). |
First result comparing ρ(W1) with ρ(W2) is stated as the following theorem, which concerns the semimonotone matrices A1 and A2.
Theorem 4.1. Let A1,A2∈Rm×n be two semimonotone matrices having the same null space, A1=P1−R1−S1 and A2=P2−R2−S2 be their double proper nonnegative splittings such that P1≥O and P2≥O. If P†1A1≥P†2A2 and P†1S1≤P†2S2, then
ρ(W1)≤ρ(W2)<1. |
Proof. Note that A1 and A2 are semimonotone matrices and P1≥O and P2≥O, then it follows from [11,Theorem 4.5] that both double proper nonnegative splittings are convergent, i.e., ρ(W1)<1 and ρ(W2)<1. Assume that ρ(W1)=0, then the conclusion holds clearly. Assume that ρ(W1)≠0, from {Definition 2.7} we have W1,W2≥O, then by Lemma 2.1 (Perron-Frobenius theorem), there exists a vector
x=(x1x2)≥0,x≠0, |
in conformity with W1 such that W1x=ρ(W1)x, i.e.,
P†1R1x1+P†1S1x2=ρ(W1)x1,x1=ρ(W1)x2. |
Hence, we have
W2x−ρ(W1)x=(P†2R2x1+P†2S2x2−ρ(W1)x1x1−ρ(W1)x2)=((P†2R2−P†1R1)x1−1ρ(W1)(P†1S1−P†2S2)x10):=(Δ0). |
Since A1 and A2 have the same null space, then P†1P1=P†2P2 [9,11]. As P†1S1≤P†2S2 and 0<ρ(W1)<1 then
Δ=(P†2R2−P†1R1)x1−1ρ(W1)(P†1S1−P†2S2)x1≥(P†2(P2−A2)x1−P†1(P1−A1)x1). |
Therefore, in terms of P†1A1≥P†2A2, we have
W2x−ρ(W1)x≥(P†2(P2−A2)x1−P†1(P1−A1)x10)=((P†1A1−P†2A2)x10)≥0. |
Thus, by Lemma 2.3, we have ρ(W1)≤ρ(W2)<1.
When we consider the double proper nonnegative splittings A=P1−R1−S1=P2−R2−S2 of a semimonotone matrix A, the following Corollary is a direct result of Theorem 4.1.
Corollary 4.2. Let A∈Rm×n be a semimonotone matrix, A=P1−R1−S1=P2−R2−S2 be double proper nonnegative splittings such that P1≥O and P2≥O. If P†1≥P†2 and P†1S1≤P†2S2, then
ρ(W1)≤ρ(W2)<1. |
As for general rectangular matrices A1 and A2, comparing ρ(W1) with ρ(W2), we have the following comparison result, which is a slight modification of Theorem 4.1.
Theorem 4.3. Let A1,A2∈Rm×n be two matrices having the same null space, A1=P1−R1−S1 and A2=P2−R2−S2 be their double proper nonnegative splittings such that A†1P1≥O and A†2P2≥O. If P†1A1≥P†2A2 and P†1S1≤P†2S2, then
ρ(W1)≤ρ(W2)<1. |
The next example shows that the converse of Theorem 4.3 is not true.
Example 4.4. Let A1=(−2100−20) and A2=(−2100−40), A1 and A2 have the same null space. If A1 and A2 be splitted as A1=P1−R1−S1 and A2=P2−R2−S2, respectively, here P1=(−5000−40),R1=(−2−100−10),S1=(−1000−10) and P2=(−6000−50),R2=(−3−100−10),S2=(−100000), then we have P†1A1=(25−1500120000),P†2A2=(13−1600450000),P†1R1=(251500140000), P†2R2=(121600150000), P†1S1=(15000140000),P†2S2=(1600000000), A†1P1=(5210020000) and A†2P2=(35800540000). So A1=P1−R1−S1 and A2=P2−R2−S2 are two double proper nonnegative splittings which satisfy the conditions A†1P1≥O and A†2P2≥O. We then have ρ(W1)=0.6899<0.7287=ρ(W2), but P†1S1≰P†2S2, P†1A1≱P†2A2.
For general rectangular matrices A1 and A2, comparing ρ(W1) with ρ(W2), we also have comparison result:
Theorem 4.5. Let A1,A2∈Rm×n be two matrices, A1=P1−R1−S1 and A2=P2−R2−S2 be their double proper nonnegative splittings. If P†1S1≤P†2S2 and P†1S1−P†2S2≤P†2R2−P†1R1, then ρ(W1)≤ρ(W2)<1 for 0<ρ(W2)<1.
Theorem 4.5 is a generalization of [1,Theorem 4.9], the proof is similar to that of [1,Theorem 4.9], hence we omit it.
What we need to pay attention to here is that when A1 and A2 have the same null space, the assumption P†1S1−P†2S2≤P†2R2−P†1R1 in Theorem 4.5 becomes P†1A1≥P†2A2, so we have the following corollary.
Corollary 4.6. Let A1,A2∈Rm×n be two matrices having the same null space, A1=P1−R1−S1 and A2=P2−R2−S2 be their double proper nonnegative splittings. If P†1A1≥P†2A2 and P†1S1≤P†2S2, then ρ(W1)≤ρ(W2)<1 for 0<ρ(W2)<1.
In this paper, new convergence theorems for single proper nonnegative splitting of a semimonotone matrix, and some comparison theorems for single and double proper nonnegative splittings of different rectangular matrices are given. The obtained results generalize the corresponding results in [1,3,9,12] and supplement the comparison results of proper nonnegative spllitings of matrices in [9,11]. Applying the comparison results to judge the efficiency of the preconditioners for rectangular linear systems need further study.
This work was supported by National Natural Science Foundation of China (No. 11861059).
The authors declare no conflict of interest.
[1] |
R. Kaur, S. Singh, A comprehensive review of object detection with deep learning, Digital Signal Process., 132 (2023), 103812. https://doi.org/10.1016/j.dsp.2022.103812 doi: 10.1016/j.dsp.2022.103812
![]() |
[2] |
P. Jiang, D. Ergu, F. Liu, Y. Cai, B. Ma, A Review of Yolo algorithm developments, Proc. Comput. Sci., 199 (2022), 1066–1073. https://doi.org/10.1016/j.procs.2022.01.135 doi: 10.1016/j.procs.2022.01.135
![]() |
[3] |
W. Liu, G. Wu, F. Ren, X. Kang, DFF-ResNet: An insect pest recognition model based on residual networks, Big Data Min. Anal., 3 (2020), 300–310. https://doi.org/10.26599/BDMA.2020.9020021 doi: 10.26599/BDMA.2020.9020021
![]() |
[4] |
A. Mughees, L. Tao, Multiple deep-belief-network-based spectral-spatial classification of hyperspectral images, Tsinghua Sci. Technol., 24 (2019), 183–194. https://doi.org/10.26599/TST.2018.9010043 doi: 10.26599/TST.2018.9010043
![]() |
[5] | T. Y. Lin, M. Maire, S. Belongie, J. Hays, P. Perona, D. Ramanan, et al., Microsoft COCO: Common objects in context, in European Conference on Computer Vision, (2014), 740–755. https://doi.org/10.1007/978-3-319-10602-1_48 |
[6] |
O. Russakovsky, J. Deng, H. Su, J. Krause, S. Satheesh, S. Ma, et al., ImageNet large scale visual recognition challenge, Int. J. Comput. Vis., 115 (2015), 211–252. https://doi.org/10.1007/s11263-015-0816-y doi: 10.1007/s11263-015-0816-y
![]() |
[7] |
Y. Fan, D. Ni, H. Ma, HyperDB: a hyperspectral land class database designed for an image processing system, Tsinghua Sci. Technol., 22 (2017), 112–118. https://doi.org/10.1109/TST.2017.7830901 doi: 10.1109/TST.2017.7830901
![]() |
[8] |
M. Everingham, S. M. A. Eslami, L. Van Gool, C. K. I. Williams, J. Winn, A. Zisserman, The PASCAL visual object classes challenge: A retrospective, Int. J. Comput. Vis., 111 (2015), 98–136. https://doi.org/10.1007/s11263-014-0733-5 doi: 10.1007/s11263-014-0733-5
![]() |
[9] |
S. Ren, K. He, R. Girshick, J. Sun, Faster R-CNN: Towards real-time object detection with region proposal networks, IEEE Trans. Pattern Anal. Mach. Intell., 39 (2017), 1137–1149. https://doi.org/10.1109/TPAMI.2016.2577031 doi: 10.1109/TPAMI.2016.2577031
![]() |
[10] | T. Y. Lin, P. Goyal, R. Girshick, K. He, P. Dollár, Focal loss for dense object detection, in 2017 IEEE International Conference on Computer Vision (ICCV), (2017), 2999–3007. https://doi.org/10.1109/ICCV.2017.324 |
[11] | X. Zhou, D. Wang, P. Krähenbühl, Objects as points, preprint, arXiv: 1904.07850. |
[12] |
K. He, G. Gkioxari, P. Dollár, R. Girshick, Mask R-CNN, IEEE Trans. Pattern Anal. Mach. Intell., 42 (2020), 386–397. https://doi.org/10.1109/TPAMI.2018.2844175 doi: 10.1109/TPAMI.2018.2844175
![]() |
[13] | M. Chen, F. Bai, Z. Gerile, Special object detection based on Mask RCNN, in 2021 17th International Conference on Computational Intelligence and Security (CIS), (2021), 128–132. https://doi.org/10.1109/CIS54983.2021.00035 |
[14] |
Z. Ou, Z. Wang, F. Xiao, B. Xiong, H. Zhang, M. Song, et al., AD-RCNN: Adaptive dynamic neural network for small object detection, IEEE Int. Things J., 10 (2023), 4226–4238. https://doi.org/10.1109/JIOT.2022.3215469 doi: 10.1109/JIOT.2022.3215469
![]() |
[15] |
L. Yang, Y. Xu, S. Wang, C. Yang, Z. Zhang, B. Li, et al., PDNet: Toward better one-stage object detection with prediction decoupling, IEEE Trans. Image Process., 31 (2022), 5121–5133. https://doi.org/10.1109/TIP.2022.3193223 doi: 10.1109/TIP.2022.3193223
![]() |
[16] | J. Redmon, S. Divvala, R. Girshick, A. Farhadi, You only look once: Unified, real-time object detection, in 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (2016), 770–778. https://doi.ieeecomputersociety.org/10.1109/CVPR.2016.91 |
[17] | W. Liu, D. Anguelov, D. Erhan, C. Szegedy, S. Reed, C. Y. Fu, et al., SSD: Single shot multiBox detector, in European Conference on Computer Vision, (2016), 21–37. https://doi.org/10.1007/978-3-319-46448-0_2 |
[18] | J. Redmon, A. Farhadi, YOLOv3: An incremental improvement, preprint, arXiv: 1804.02767. |
[19] |
G. Wang, J. Wu, B. Tian, S. Teng, L. Chen, D. Cao, et al., CenterNet3D: An anchor free object detector for point cloud, IEEE Trans. Intell. Transp. Syst., 23 (2022), 12953–12965. https://doi.org/10.1109/TITS.2021.3118698 doi: 10.1109/TITS.2021.3118698
![]() |
[20] | Z. Tian, C. Shen, H. Chen, T. He, FCOS: Fully convolutional one-stage object detection, in 2019 IEEE/CVF International Conference on Computer Vision (ICCV), (2019), 9626–9635. https://doi.ieeecomputersociety.org/10.1109/ICCV.2019.00972 |
[21] |
H. Law, J. Deng, CornerNet: Detecting objects as paired keypoints, Int. J. Comput. Vis., 128 (2020), 642–656. https://doi.org/10.1007/s11263-019-01204-1 doi: 10.1007/s11263-019-01204-1
![]() |
[22] |
J. Canny, A computational approach to edge detection, IEEE Trans. Pattern Anal. Mach. Intell., 8 (1986), 679–698. https://doi.org/10.1109/TPAMI.1986.4767851 doi: 10.1109/TPAMI.1986.4767851
![]() |
[23] |
D. Marr, E. Hildreth, Theory of edge detection, Proc. R. Soc. Lond. B, 207 (1980), 187–217. https://doi.org/10.1098/rspb.1980.0020 doi: 10.1098/rspb.1980.0020
![]() |
[24] |
J. Kittler, On the accuracy of the Sobel edge detector, Image Vis. Comput., 1 (1983), 37–42. https://doi.org/10.1016/0262-8856(83)90006-9 doi: 10.1016/0262-8856(83)90006-9
![]() |
[25] |
D. R. Martin, C. C. Fowlkes, J. Malik, Learning to detect natural image boundaries using local brightness, color, and texture cues, IEEE Trans. Pattern Anal. Mach. Intell., 26 (2004), 530–549. https://doi.org/10.1109/TPAMI.2004.1273918 doi: 10.1109/TPAMI.2004.1273918
![]() |
[26] |
P. Arbeláez, M. Maire, C. Fowlkes, J. Malik, Contour detection and hierarchical image segmentation, IEEE Trans. Pattern Anal. Mach. Intell., 33 (2011), 898–916. https://doi.org/10.1109/TPAMI.2010.161 doi: 10.1109/TPAMI.2010.161
![]() |
[27] | J. J. Lim, C. L. Zitnick, P. Dollár, Sketch tokens: A learned mid-level representation for contour and object detection, in 2013 IEEE Conference on Computer Vision and Pattern Recognitionn, (2013), 3158–3165. https://doi.org/10.1109/CVPR.2013.406 |
[28] | P. Dollár, C. L. Zitnick, Structured forests for fast edge detection, in 2013 IEEE International Conference on Computer Vision, (2013), 1841–1848. https://doi.org/10.1109/ICCV.2013.231 |
[29] | S. Xie, Z. Tu, Holistically-nested edge detection, in 2015 IEEE International Conference on Computer Vision (ICCV), (2015), 1395–1403. https://doi.org/10.1109/ICCV.2015.164 |
[30] | G. Bertasius, J. Shi, L. Torresani, DeepEdge: A multi-scale bifurcated deep network for top-down contour detection, in 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (2015), 4380–4389. https://doi.org/10.1109/CVPR.2015.7299067 |
[31] | W. Shen, X. Wang, Y. Wang, X. Bai, Z. Zhang, DeepContour: A deep convolutional feature learned by positive-sharing loss for contour detection, in 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), (2015), 3982–3991. https://doi.org/10.1109/CVPR.2015.7299024 |
[32] | Z. Huang, L. Huang, Y. Gong, C. Huang, X. Wang, Mask scoring R-CNN, in 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2019), 6402–6411. https://doi.org/10.1109/CVPR.2019.00657 |
[33] | K. Chen, J. Pang, J. Wang, Y. Xiong, X. Li, S. Sun, et al., Hybrid task cascade for instance segmentation, in 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2019), 4974–4983. https://doi.org/10.1109/CVPR.2019.00511 |
[34] | C. L. Zitnick, P. Dollár, Edge boxes: Locating object proposals from edges, in European Conference on Computer Vision, (2014), 391–405. https://doi.org/10.1007/978-3-319-10602-1_26 |
[35] | J. Dai, H. Qi, Y. Xiong, Y. Li, G. Zhang, H. Hu, et al., Deformable convolutional networks, in 2017 IEEE International Conference on Computer Vision (ICCV), (2017), 764–773. https://doi.org/10.1109/ICCV.2017.89 |
[36] | Y. Kim, T. Kim, B. N. Kang, J. Kim, D. Kim, BAN: Focusing on boundary context for object detection, in Asian Conference on Computer Vision, (2018), 555–570. https://doi.org/10.1007/978-3-030-20876-9_35 |
[37] | J. Wang, W. Zhang, Y. Cao, K. Chen, J. Pang, T. Gong, et al., Side-aware boundary localization for more precise object detection, in European Conference on Computer Vision, (2020), 403–419. https://doi.org/10.1007/978-3-030-58548-8_24 |
[38] | C. Y. Fu, W. Liu, A. Ranga, A. Tyagi, A. C. Berg, DSSD: Deconvolutional single shot detector, preprint, arXiv: 1701.06659. |
[39] | R. Araki, T. Onishi, T. Hirakawa, T. Yamashita, H. Fujiyoshi, MT-DSSD: Deconvolutional single shot detector using multi task learning for object detection, segmentation, and grasping detection, in 2020 IEEE International Conference on Robotics and Automation (ICRA), (2020), 10487–10493. https://doi.org/10.1109/ICRA40945.2020.9197251 |
[40] | C. Y. Fu, M. Shvets, A. C. Berg, RetinaMask: Learning to predict masks improves state-of-the-art single-shot detection for free, preprint, arXiv: 1901.03353. |
[41] | R. K. Meleppat, M. V. Matham, L. K. Seah, Optical frequency domain imaging with a rapidly swept laser in the 1300nm bio-imaging window, in International Conference on Optical and Photonic Engineering, (2015), 721–729. https://doi.org/10.1117/12.2190530 |
[42] |
R. K. Meleppat, C. R. Fortenbach, Y. Jian, E. S. Martinez, K. Wagner, B. S. Modjtahedi, et al., In Vivo Imaging of Retinal and Choroidal Morphology and Vascular Plexuses of Vertebrates Using Swept-Source Optical Coherence Tomography, Transl. Vis. Sci. Technol., 11 (2022), 11. https://doi.org/10.1167/tvst.11.8.11 doi: 10.1167/tvst.11.8.11
![]() |
[43] | H. Huang, Research on Object Detection Based on Improved MASK R-CNN, Master's degree, Lanzhou University in Lanzhou, 2021. https://doi.org/10.27204/d.cnki.glzhu.2021.001818 |