Semantic segmentation method for myocardial contrast echocardiogram based on DeepLabV3+ deep learning architecture

Huan Cheng; Jucheng Zhang; Yinglan Gong; Zhaoxia Pu; Jun Jiang; Yonghua Chu; Ling Xia; Huan Cheng; Jucheng Zhang; Yinglan Gong; Zhaoxia Pu; Jun Jiang; Yonghua Chu; Ling Xia

doi:10.3934/mbe.2023096

Mathematical Biosciences and Engineering

2023, Volume 20, Issue 2: 2081-2093. doi: 10.3934/mbe.2023096

Previous Article Next Article

Research article Special Issues

Semantic segmentation method for myocardial contrast echocardiogram based on DeepLabV3+ deep learning architecture

1.
Key Laboratory for Biomedical Engineering of Ministry of Education, Institute of Biomedical Engineering, Zhejiang University, Hangzhou 310027, China
2.
Department of Clinical Engineering, School of Medicine, The Second Affiliated Hospital, Zhejiang University, Hangzhou 310009, China
3.
Institute of Wenzhou, Zhejiang University, Wenzhou 325036, China
4.
Department of Cardiology, School of Medicine, The Second Affiliated Hospital, Zhejiang University, Hangzhou 310009, China

Academic Editor: Hao Wang

Received: 01 September 2022 Revised: 18 October 2022 Accepted: 27 October 2022 Published: 14 November 2022

Myocardial contrast echocardiography (MCE) has been proposed as a method to assess myocardial perfusion for the detection of coronary artery diseases in a non-invasive way. As a critical step of automatic MCE perfusion quantification, myocardium segmentation from the MCE frames faces many challenges due to the low image quality and complex myocardial structure. In this paper, a deep learning semantic segmentation method is proposed based on a modified DeepLabV3+ structure with an atrous convolution and atrous spatial pyramid pooling module. The model was trained separately on three chamber views (apical two-chamber view, apical three-chamber view, and apical four-chamber view) on 100 patients' MCE sequences, divided by a proportion of 7:3 into training and testing datasets. The results evaluated by using the dice coefficient (0.84, 0.84, and 0.86 for three chamber views respectively) and Intersection over Union(0.74, 0.72 and 0.75 for three chamber views respectively) demonstrated the better performance of the proposed method compared to other state-of-the-art methods, including the original DeepLabV3+, PSPnet, and U-net. In addition, we conducted a trade-off comparison between model performance and complexity in different depths of the backbone convolution network, which illustrated model application feasibility.

Keywords:

Citation: Huan Cheng, Jucheng Zhang, Yinglan Gong, Zhaoxia Pu, Jun Jiang, Yonghua Chu, Ling Xia. Semantic segmentation method for myocardial contrast echocardiogram based on DeepLabV3+ deep learning architecture[J]. Mathematical Biosciences and Engineering, 2023, 20(2): 2081-2093. doi: 10.3934/mbe.2023096

Related Papers:

[1]	Yinwan Cheng, Chao Yang, Bing Yao, Yaqin Luo . Neighbor full sum distinguishing total coloring of Halin graphs. AIMS Mathematics, 2022, 7(4): 6959-6970. doi: 10.3934/math.2022386
[2]	Baolin Ma, Chao Yang . Distinguishing colorings of graphs and their subgraphs. AIMS Mathematics, 2023, 8(11): 26561-26573. doi: 10.3934/math.20231357
[3]	Ningge Huang, Lily Chen . AVD edge-colorings of cubic Halin graphs. AIMS Mathematics, 2023, 8(11): 27820-27839. doi: 10.3934/math.20231423
[4]	Huifen Ge, Shumin Zhang, Chengfu Ye, Rongxia Hao . The generalized 4-connectivity of folded Petersen cube networks. AIMS Mathematics, 2022, 7(8): 14718-14737. doi: 10.3934/math.2022809
[5]	Kai An Sim, Kok Bin Wong . On the cooling number of the generalized Petersen graphs. AIMS Mathematics, 2024, 9(12): 36351-36370. doi: 10.3934/math.20241724
[6]	Fugang Chao, Donghan Zhang . Neighbor sum distinguishing total choice number of IC-planar graphs with restrictive conditions. AIMS Mathematics, 2023, 8(6): 13637-13646. doi: 10.3934/math.2023692
[7]	Bana Al Subaiei, Ahlam AlMulhim, Abolape Deborah Akwu . Vertex-edge perfect Roman domination number. AIMS Mathematics, 2023, 8(9): 21472-21483. doi: 10.3934/math.20231094
[8]	Yanyi Li, Lily Chen . Injective edge coloring of generalized Petersen graphs. AIMS Mathematics, 2021, 6(8): 7929-7943. doi: 10.3934/math.2021460
[9]	Ali Raza, Mobeen Munir, Tasawar Abbas, Sayed M Eldin, Ilyas Khan . Spectrum of prism graph and relation with network related quantities. AIMS Mathematics, 2023, 8(2): 2634-2647. doi: 10.3934/math.2023137
[10]	Bao-Hua Xing, Nurten Urlu Ozalan, Jia-Bao Liu . The degree sequence on tensor and cartesian products of graphs and their omega index. AIMS Mathematics, 2023, 8(7): 16618-16632. doi: 10.3934/math.2023850

Abstract

1. Preliminaries

Let $G$ be a simple, non-trivial connected graph with vertex set $V(G)$ . For any two distinct vertices $u$ and $v$ in $G$ , $u$ - $v$ geodesic is a shortest walk between $u$ and $v$ without repetition of vertices. Two vertices are said to be adjacent if there is an edge between them, and they are also called neighbors of each other. The collection of all the neighbors of a vertex $v$ in $G$ is called the (open) neighborhood of $v$ , denoted by $N(v)$ .

A vertex $v$ of $G$ distinguishes a pair $(x, y)$ of distinct vertices of $G$ , if the number of edges in $v$ - $x$ geodesic is different from the number of edge in $v$ - $y$ geodesic. If $(x, y)$ is a pair of neighbors in $G$ , then $v$ is said to be adjacently distinguish the pair $(x, y)$ . Equivalently, a vertex $v$ adjacently distinguishes a pair $(x, y)$ of two neighbors if the difference between the number of edges in $v$ - $x$ geodesic and the number of edges in $v$ - $y$ geodesic is one.

A set $D \subseteq V(G)$ is a distinguishing set (metric generator) for $G$ if the members of $D$ distinguish every pair of distinct vertices in $G$ . The cardinality of a smallest distinguishing set for $G$ is called the metric dimension of $G$ , denoted by $dim(G)$ ^[7,23]. The concept of distinguishing set was introduced, very firstly, by Blumenthal ^[5] in the general context of metric spaces. It was later rediscovered and studied, in the context of graphs, by Slater with the name locating set/reference set ^[23]. Independently, Harary and Melter studied distinguishing set as resolving set (metric generator) ^[7,20]. Applications of this notion to the navigation of robots in networks are discussed in ^[13,21], and applications to pharmaceutical chemistry in ^[10,11]. For more details about the theory and applications of this notion, we refer the readers to the papers cited in ^{[3,5,8,9,12,13,14,15,19,22]} and the references therein.

A set $A \subseteq V(G)$ is a neighbor-distinguishing set (local metric generator) for $G$ if the members of $A$ adjacently distinguish every pair of neighboring (adjacent) vertices in $G$ . The cardinality of a smallest neighbor-distinguishing set for $G$ is called the adjacency (local) metric dimension of $G$ , and we denote it by $dim_a(G)$ .

The problem of distinguishing every two neighbors with the aid of distance (the number of edges in a geodesic) in a connected graph was introduced and studied by Okamoto et al. in 2010 ^[16]. Then, up till now, this notion endlessly received remarkable interest of many researchers working with distance in graphs. In 2015 and 2018, every two neighbors in the corona product of graphs are distinguished ^[6,18], while this problem for strong product and lexicographic product of graphs was solved in 2016 ^[4] and in 2018 ^[2,6], respectively. Using the neighbor-distinguishing problem of primary subgraphs, this problem was solved for the super graphs of these subgraphs in 2015 ^[17]. In 2018, Salman et al. proposed linear programming formulation for this problem and distinguished neighbors in two families of convex polytopes ^[19]. Recently, in 2019, split graphs of complete and complete bipartite graphs have been considered in the context of this problem ^[1]. Due to this noteworthy attention of researchers to this problem, we extend this study towards a very renowned family of generalized Petersen graphs in this article. Next, we state two results, proved by Okamoto et al. ^[16], and Salman et al. ^[19], respectively, which will be used in the sequel.

Theorem 1. ^[16] Let $G$ be a non-trivial connected graph of order $n$ . Then $dim_a(G)$ $= n-1$ if and only if $G$ is a complete graph, and $dim_a(G) = 1$ if and only if $G$ is a bipartite graph.

Proposition 2. ^[19] A subset $A$ of vertices in a connected graph $G$ is a neighbor-distinguishing set for $G$ if and only if for every $u\in V(G)$ and for each $v\in N(u)$ , the pair $(u, v)$ adjacently distinguished by some element of $A$ .

Watkins, in $1969$ ^[24], generalized the eminent Petersen graph, and proposed the notation $P(n, m)$ to this generalized family, where $n \geq 3$ and $1 \leq m \leq \lfloor \frac{n-1}{2} \rfloor$ . $P(n, m)$ is a cubic graph having the set

$V(P(n, m)) = \{ u_{1} , u_{2} , \dots, u_{n} , v_{1} , v_{2} , \dots, v_{n} \}$

as the vertex set, and the set

$E(P(n, m)) = \bigcup\limits_{i = 1}^{n}\left\{u_ix, v_iy\; ;\; x\in N(u_i), \; y \in N(v_i)\right\}$

as the edge set, where $N(u_i) = \{u_{i+1}, u_{i-1}, v_i \}$ and $N(v_i) = \{u_i, v_{i+m}, v_{i-m} \}$ for each $1 \leq i \leq n$ , and the indices greater than $n$ or less than $1$ will be taken modulo $n$ . Vertices $u_i$ and $v_i$ $(1 \leq i \leq n)$ are called the outer vertices and inner vertices, respectively, in $P(n, m)$ . Figure 1 depicts graphs to two different families of generalized Petersen graphs.

Figure 1. Generalized Petersen graphs

$P(15, 4)$ and

$P(16, 7)$ .

DownLoad: Full-Size Img PowerPoint

The rest of the paper is divided into two sections: one is on the family of generalized Petersen graphs $P(n, 4)$ ; and the second is on the family of generalized Petersen graphs $P(2n, n-1)$ . These families have been considered in the context of metric dimension problem by Naz et al. ^[15] and Ahmad et al. ^[3], respectively. Here, we solve the neighbor-distinguishing problem for these families.

2. Family of generalized Petersen graphs $P(n, 4)$

In the next result, we show that only two vertices of $P(n, 4)$ perform the neighbor-distinguishing.

Theorem 3. For $n\geq 9$ , let $G$ be a generalized Petersen graph $P(n, 4)$ , then a neighbor-distinguishing set for $G$ is a $2$ -element subset of $V(G)$ .

Proof. For $n = 9$ , it is an easy exercise to see that the set $A = \{v_1, v_2 \}$ is a neighbor-distinguishing set for $G$ . For $n\geq 10$ , let $A$ be a $2$ -element subset of $V(G)$ . Then, according to Proposition 2, we would perform neighbor-distinguishing for each pair $(x, y)$ , where $x \in V(G)$ and $y \in N(x)$ . Note that, if $x \in A$ , then $(x, y)$ is adjacently distinguished, because the number of edges in $y-x$ geodesic is $1$ , while the number of edges in $x-x$ geodesic is $0$ . Now, we discuss the following eight cases:

Case 1: ( $n = 8k$ with $k\geq 2$ )

Let $A = \{v_1 = a_1, v_3 = a_2\}$ , then

● the number of edges in $u_1-a_2$ geodesic is 3,

● the number of edges in $u_2-a_2$ geodesic is 2,

● the number of edges in $v_1-a_2$ geodesic is 4,

● the number of edges in $v_2-a_2$ geodesic is 3.

Further, and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 1. List of the number of edges in geodesics from the outer vertices to

$a \in A$ in

$P(n, 4)$ .

Geodesic	The number of edges in the geodesic
$u_i-a$	$i \equiv 0$ (mod 4)	$i \equiv 1$ (mod 4)	$i \equiv 2$ (mod 4)	$i \equiv 3$ (mod 4)
$n = 8k$ with $k\geq 2$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+1$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+2\leq i \leq n$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$
$u_i- a_2$ , $3\leq i \leq 4k+3$	$\frac{i+4}{4}$	$\frac{i+7}{4}$	$\frac{i+6}{4}$	$\frac{i+1}{4}$
$u_i- a_2$ , $4k+4\leq i \leq n$	$\frac{n-i+12}{4}$	$\frac{n-i+13}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+7}{4}$
$n = 8k+1$ with $k\geq 2$ , and $A = \{v_1 = a_1, v_4 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+1$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+2\leq i \leq n$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$
$u_i- a_2$ , $4\leq i \leq 5k+1$	$\frac{i}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+5}{4}$
$u_i- a_2$ , $5k+2\leq i \leq n$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$	$\frac{n-i+13}{4}$	$\frac{n-i+14}{4}$
$n = 8k+2$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+2$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+3\leq i \leq n$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$
$u_i- a_2$ , $2\leq i \leq 4k+3$	$\frac{i+8}{4}$	$\frac{i+7}{4}$	$\frac{i+2}{4}$	$\frac{i+5}{4}$
$u_i- a_2$ , $4k+4\leq i \leq n$	$\frac{n-i+6}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+9}{4}$
$n = 8k+3$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+2$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+3\leq i \leq n$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$
$u_i- a_2$ , $3\leq i \leq 5k$	$\frac{i+4}{4}$	$\frac{i+7}{4}$	$\frac{i+6}{4}$	$\frac{i+1}{4}$
$u_i- a_2$ , $5k+1\leq i \leq n$	$\frac{n-i+13}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+7}{4}$	$\frac{n-i+12}{4}$
$n = 8k+4$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_4 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+3$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+4\leq i \leq n$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$
$u_i- a_2$ , $3\leq i \leq 5k+2$	$\frac{i}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+5}{4}$
$u_i- a_2$ , $5k+3\leq i \leq n$	$\frac{n-i+8}{4}$	$\frac{n-i+13}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+11}{4}$
$n = 8k+5$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 5k+1$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $5k+2\leq i \leq n$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$
$u_i- a_2$ , $2\leq i \leq 5k+2$	$\frac{i+8}{4}$	$\frac{i+7}{4}$	$\frac{i+2}{4}$	$\frac{i+5}{4}$
$u_i- a_2$ , $5k+3\leq i \leq n$	$\frac{n-i+11}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+9}{4}$	$\frac{n-i+6}{4}$
$n = 8k+6$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+2$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+6\leq i \leq n$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$
$u_i- a_2$ , $1\leq i \leq 4k+3$	$\frac{i+8}{4}$	$\frac{i+7}{4}$	$\frac{i+2}{4}$	$\frac{i+5}{4}$
$u_i- a_2$ , $4k+7\leq i \leq n$	$\frac{n-i+6}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+9}{4}$
$n = 8k+7$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+3$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+6\leq i \leq n$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$
$u_i- a_2$ , $2\leq i \leq 5k+1$	$\frac{i+4}{4}$	$\frac{i+7}{4}$	$\frac{i+6}{4}$	$\frac{i+1}{4}$
$u_i- a_2$ , $5k+4\leq i \leq n$	$\frac{n-i+13}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+7}{4}$	$\frac{n-i+12}{4}$

| Show Table

DownLoad: CSV

Table 2. List of the number of edges in geodesics from the inner vertices to

$a \in A$ in

$P(n, 4)$ .

Geodesic	The number of edges in the geodesic.
$v_i-a$	$i \equiv 0$ (mod 4)	$i \equiv 1$ (mod 4)	$i \equiv 2$ (mod 4)	$i \equiv 3$ (mod 4)
$n = 8k$ with $k\geq 2$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$v_i - a_1$ , $1\leq i \leq 4k+1$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i - a_1$ , $4k+2\leq i \leq n$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$
$v_i - a_2$ , $3\leq i \leq 4k+3$	$\frac{i+8}{4}$	$\frac{i+11}{4}$	$\frac{i+10}{4}$	$\frac{i-3}{4}$
$v_i- a_2$ , $4k+4\leq i \leq n$	$\frac{n-i+16}{4}$	$\frac{n-i+17}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+3}{4}$
$n = 8k+1$ with $k\geq 2$ , and $A = \{v_1 = a_1, v_4 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 3k+1$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $3k+10\leq i \leq n$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$
$v_i- a_2$ , $4\leq i \leq 4k$	$\frac{i-4}{4}$	$\frac{i+7}{4}$	$\frac{i+10}{4}$	$\frac{i+9}{4}$
$v_i- a_2$ , $4k+6\leq i \leq n$	$\frac{n-i+15}{4}$	$\frac{n-i+4}{4}$	$\frac{n-i+17}{4}$	$\frac{n-i+18}{4}$
$n = 8k+2$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 3k+2$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $3k+10\leq i \leq n$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$
$v_i- a_2$ , $2\leq i \leq 3k+3$	$\frac{i+12}{4}$	$\frac{i+11}{4}$	$\frac{i-2}{4}$	$\frac{i+9}{4}$
$v_i- a_2$ , $3k+11\leq i \leq n$	$\frac{n-i+2}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+16}{4}$	$\frac{n-i+13}{4}$
$n = 8k+3$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 3k+3$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $3k+10\leq i \leq n$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$
$v_i- a_2$ , $3\leq i \leq 4k+1$	$\frac{i+8}{4}$	$\frac{i+11}{4}$	$\frac{i+10}{4}$	$\frac{i-3}{4}$
$v_i- a_2$ , $4k+8\leq i \leq n$	$\frac{n-i+17}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+3}{4}$	$\frac{n-i+16}{4}$
$n = 8k+4$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_4 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 4k+3$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $4k+4\leq i \leq n$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$
$v_i- a_2$ , $3\leq i \leq 5k+2$	$\frac{i-4}{4}$	$\frac{i+7}{4}$	$\frac{i+10}{4}$	$\frac{i+9}{4}$
$v_i- a_2$ , $5k+3\leq i \leq n$	$\frac{n-i+4}{4}$	$\frac{n-i+17}{4}$	$\frac{n-i+18}{4}$	$\frac{n-i+15}{4}$
$n = 8k+5$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 4k+1$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $4k+6\leq i \leq n$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$
$v_i- a_2$ , $2\leq i \leq 4k+2$	$\frac{i+12}{4}$	$\frac{i+11}{4}$	$\frac{i-2}{4}$	$\frac{i+9}{4}$
$v_i- a_2$ , $4k+7\leq i \leq n$	$\frac{n-i+15}{4}$	$\frac{n-i+16}{4}$	$\frac{n-i+13}{4}$	$\frac{n-i+2}{4}$
$n = 8k+6$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 3k+2$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $3k+14\leq i \leq n$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$
$v_i- a_2$ , $1\leq i \leq 3k+3$	$\frac{i+12}{4}$	$\frac{i+11}{4}$	$\frac{i-2}{4}$	$\frac{i+9}{4}$
$v_i- a_2$ , $3k+15\leq i \leq n$	$\frac{n-i+2}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+16}{4}$	$\frac{n-i+13}{4}$
$n = 8k+7$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 3k+3$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $3k+14\leq i \leq n$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$
$v_i- a_2$ , $2\leq i \leq 4k+1$	$\frac{i+8}{4}$	$\frac{i+11}{4}$	$\frac{i+10}{4}$	$\frac{i-3}{4}$
$v_i- a_2$ , $4k+12\leq i \leq n$	$\frac{n-i+17}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+3}{4}$	$\frac{n-i+16}{4}$

| Show Table

DownLoad: CSV

Case 2: ( $n = 8k+1$ with $k\geq 2$ )

Let $A = \{v_1 = a_1, v_4 = a_2\}$ , then

● the number of edges in $u_1-a_2$ geodesic is 3,

● the number of edges in $u_2-a_2$ geodesic is 3,

● the number of edges in $u_3-a_2$ geodesic is 2.

Further, – provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 3.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$3k+2 \equiv 2 (mod \ 4)$	$3k+3 \equiv 3 (mod \ 4)$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$
$\lambda_i$	$\frac{5k}{4}$	$\frac{3k+16}{4}$	$\frac{3k+16}{4}$	$\frac{3k+4}{4}$	$\frac{5k-4}{4}$	$\frac{5k+8}{4}$	$\frac{5k+8}{4}$	$\frac{3k+8}{4}$
$j$	$1$	$2$	$3$	$4k+1 \equiv 1 (mod \ 4)$	$4k+2 \equiv 2 (mod \ 4)$	$4k+3 \equiv 3 (mod \ 4)$	$4k+4 \equiv 0 (mod \ 4)$	$4k+5 \equiv 1 (mod \ 4)$
$\lambda_j$	$4$	$4$	$3$	$k+1$	$k+3$	$k+3$	$k$	$k$

| Show Table

DownLoad: CSV

Case 3: ( $n = 8k+2$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_2 = a_2\}$ , then

● the number of edges in $u_2-a_2$ geodesic is 2.

Further, , and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 4.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$3k+3 \equiv 3 (mod \ 4)$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$-$	$-$
$\lambda_i$	$\frac{5k}{4}$	$\frac{3k+16}{4}$	$\frac{3k+4}{4}$	$\frac{3k+16}{4}$	$\frac{5k-4}{4}$	$\frac{5k+8}{4}$	$\frac{3k+8}{4}$	$-$	$-$
$j$	$1$	$2$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$3k+10 \equiv 2 (mod \ 4)$
$\lambda_j$	$3$	$0$	$\frac{5k}{4}$	$\frac{3k+16}{4}$	$\frac{3k+4}{4}$	$\frac{5k+8}{4}$	$\frac{5k-4}{4}$	$\frac{5k+8}{4}$	$\frac{3k+8}{4}$

| Show Table

DownLoad: CSV

Case 4: ( $n = 8k+3$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_3 = a_2\}$ , then

● the number of edges in $u_1-a_2$ geodesic is 3,

● the number of edges in $u_2-a_2$ geodesic is 2.

Further, , and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 5.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$-$	$-$
$\lambda_i$	$\frac{5k}{4}$	$\frac{3k+4}{4}$	$\frac{3k+16}{4}$	$\frac{5k+8}{4}$	$\frac{5k-4}{4}$	$\frac{3k+8}{4}$	$-$	$-$
$j$	$1$	$2$	$4k+2 \equiv 2 (mod \ 4)$	$4k+3 \equiv 3 (mod \ 4)$	$4k+4 \equiv 0 (mod \ 4)$	$4k+5 \equiv 1 (mod \ 4)$	$4k+6 \equiv 2 (mod \ 4)$	$4k+7\equiv 3 (mod \ 4)$
$\lambda_j$	$4$	$3$	$k+1$	$k$	$k+3$	$k+3$	$k$	$k+1$

| Show Table

DownLoad: CSV

Case 5: ( $n = 8k+4$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_4 = a_2\}$ , then

● the number of edges in $v_1-a_2$ geodesic is 4,

● the number of edges in $v_2-a_2$ geodesic is 4,

● the number of edges in $u_1-a_2$ geodesic is 3,

● the number of edges in $u_2-a_2$ geodesic is 3.

Moreover, and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Case 6: ( $n = 8k+5$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_2 = a_2\}$ , then

● the number of edges in $u_1-a_2$ geodesic is 2,

● the number of edges in $v_1-a_2$ geodesic is 3.

Further, , and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 6.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$4k+2 \equiv 2 (mod \ 4)$	$4k+3 \equiv 3 (mod \ 4)$	$4k+4 \equiv 0 (mod \ 4)$	$4k+5 \equiv 1 (mod \ 4)$
$\lambda_i$	$k+1$	$k+4$	$k+4$	$k+1$
$j$	$4k+3 \equiv 3 (mod \ 4)$	$4k+4 \equiv 0 (mod \ 4)$	$4k+5 \equiv 1 (mod \ 4)$	$4k+6 \equiv 2 (mod \ 4)$
$\lambda_j$	$k+1$	$k+4$	$k+4$	$k+1$

| Show Table

DownLoad: CSV

Case 7: ( $n = 8k+6$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_2 = a_2\}$ , then

● the number of edges in $v_{3k+3}-a_1$ geodesic is $\frac{5k+4}{4} \equiv 3 (mod \ 4)$ ,

● the number of edges in $v_{3k+4}-a_2$ geodesic is $\frac{5k+4}{4} \equiv 0 (mod \ 4)$ ,

● the number of edges in $u_{4k+3}-a_1$ geodesic is $k+2$ ,

● the number of edges in $u_{4k+4}-a_1$ geodesic is $k+3$ ,

● the number of edges in $u_{4k+5}-a_1$ geodesic is $k+2$ ,

● the number of edges in $u_{4k+4}-a_2$ geodesic is $k+2$ ,

● the number of edges in $u_{4k+5}-a_2$ geodesic is $k+3$ ,

● the number of edges in $u_{4k+6}-a_2$ geodesic is $k+2$ .

Further, , and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 7.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$3k+10 \equiv 2 (mod \ 4)$	$3k+11 \equiv 3 (mod \ 4)$	$3k+12 \equiv 0 (mod \ 4)$	$3k+13 \equiv 1 (mod \ 4)$
$\lambda_i$	$\frac{3k+16}{4}$	$\frac{3k+4}{4}$	$\frac{3k+16}{4}$	$\frac{5k}{4}$	$\frac{3k+20}{4}$	$\frac{3k+8}{4}$	$\frac{5k+6}{4}$	$\frac{5k-4}{4}$	$\frac{5k+8}{4}$	$\frac{3k+12}{4}$
$j$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$3k+10 \equiv 2 (mod \ 4)$	$3k+11 \equiv 3 (mod \ 4)$	$3k+12 \equiv 0 (mod \ 4)$	$3k+13 \equiv 1 (mod \ 4)$	$3k+14 \equiv 2 (mod \ 4)$
$\lambda_j$	$\frac{3k+16}{4}$	$\frac{3k+4}{4}$	$\frac{3k+16}{4}$	$\frac{5k}{4}$	$\frac{3k+20}{4}$	$\frac{3k+8}{4}$	$\frac{5k+8}{4}$	$\frac{5k-4}{4}$	$\frac{5k+8}{4}$	$\frac{3k+12}{4}$

| Show Table

DownLoad: CSV

Case 8: ( $n = 8k+7$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_3 = a_2\}$ , then

● the number of edges in $v_{1}-a_2$ geodesic is $4$ ,

● the number of edges in $u_{4k+4}-a_1$ geodesic is $k+2$ ,

● the number of edges in $u_{4k+5}-a_1$ geodesic is $k+2$ ,

● the number of edges in $u_{1}-a_2$ geodesic is $3$ ,

● the number of edges in $u_{5k+2}-a_2$ geodesic is $\frac{3k+12}{4} \equiv 2 (mod \ 4)$ ,

● the number of edges in $u_{5k+3}-a_2$ geodesic is $\frac{5k+4}{4} \equiv 3 (mod \ 4)$ .

Moreover, , and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 8.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$3k+10 \equiv 2 (mod \ 4)$	$3k+11 \equiv 3 (mod \ 4)$	$3k+12 \equiv 0 (mod \ 4)$	$3k+13 \equiv 1 (mod \ 4)$
$\lambda_i$	$\frac{5k+4}{4}$	$\frac{3k+4}{4}$	$\frac{3k+16}{4}$	$\frac{3k+20}{4}$	$\frac{5k}{4}$	$\frac{3k+8}{4}$	$\frac{3k+8}{4}$	$\frac{5k+12}{4}$	$\frac{5k+8}{4}$	$\frac{5k-4}{4}$
$j$	$4k+2 \equiv 2 (mod \ 4)$	$4k+3 \equiv 3 (mod \ 4)$	$4k+4 \equiv 0 (mod \ 4)$	$4k+5 \equiv 1 (mod \ 4)$	$4k+6 \equiv 2 (mod \ 4)$	$4k+7 \equiv 3 (mod \ 4)$	$4k+8 \equiv 0 (mod \ 4)$	$4k+9 \equiv 1 (mod \ 4)$	$4k+10 \equiv 2 (mod \ 4)$	$4k+11 \equiv 3 (mod \ 4)$
$\lambda_j$	$k+2$	$k$	$k+3$	$k+4$	$k+1$	$k+1$	$k+4$	$k+3$	$k$	$k+2$

| Show Table

DownLoad: CSV

In all of these eight cases, for $y \in N(x)$ , if we denote

● the number of edges in $x-a_1$ geodesic by $\alpha_1$ ,

● the number of edges in $y-a_1$ geodesic by $\beta_1$ ,

● the number of edges in $x-a_2$ geodesic by $\alpha_2$ ,

● the number of edges in $y-a_2$ geodesic by $\beta_2$ ,

then it can be seen that

$\rm{either}\; \; |\alpha_1-\beta_1| = 1\; \; \rm{whenever}\; \; \alpha_2 = \beta_2, \; \; \rm{or}\; \; |\alpha_2 - \beta_2| = 1\; \; \rm{whenever}\; \; \alpha_1 = \beta_1,$

which implies that either $a_1 \in A$ or $a_2 \in A$ adjacently distinguishes the pair $(x, y)$ . Hence, $A$ is a neighbor-distinguishing set for $G$ .

Theorem 4. For $n\geq 9$ , if $G$ is a generalized Petersen graph $P(n, 4)$ , then $dim_a(G) = 2$ .

Proof. Since $dim_a(G) = 1$ if and only if $G$ is a bipartite graph, by Theorem 1. So $dim_a(G)\geq 2$ , because $G$ is not a bipartite graph. Hence, we get the required result, by Theorem 3.

3. Family of generalized Petersen graphs $P(2n, n-1)$

The results of this section provide the solution of the problem of neighbor-distinguishing in the generalized Petersen graphs $P(2n, n-1)$ .

Theorem 5. For all $n\geq 3$ , if $G$ is a generalized Petersen graph $P(2n, n-1)$ , then the set $A = \{u_1, v_{n-1} \}$ is a neighbor-distinguishing set for $G$ .

Proof. According to Proposition 2, we have to perform neighbor-distinguishing for each pair $(x, y)$ , where $x \in V(G)$ and $y \in N(x)$ . When $x \in A$ , then the pair $(x, y)$ adjacently distinguished by $x$ , because the number of edges in $y-x$ geodesic is $1$ while the number of edges in $x-x$ geodesic is $0$ . Further, provides the list of number of edges in $x-u_1$ and $x-v_{n-1}$ geodesics for all $x \in V(G)-A$ .

Table 9. List of the number of edges in

$x-a$ geodesics for

$x \in V(G)-A$ and

$a \in A$ .

Geodesic	The number of edges in the geodesics
When $n = 2k+1$ , $k\geq 1$
For $i$ /geodesics	$u_i- u_1$	$u_i- v_{n-1}$	$v_i- u_1$ $i$ is odd	$v_i- u_1$ $i$ is even	$v_i- v_{n-1}$ $i$ is odd	$v_i- v_{n-1}$ $i$ is even
$1 \leq i \leq k-1$	$i-1$	$i+2$	$i$	$i$	$i+3$	$i+1$
$k \leq i \leq k+1$	$i-1$	$2k-i+1$	$i$	$i$	$2k-i+2$	$2k-i$
$i = k+2$	$\frac{n+1}{2}$	$k-1$	$\frac{n+1}{2}$	$\frac{n+1}{2}$	$2k-i+2$	$2k-i$
$k+3 \leq i \leq 2k$	$2k-i+4$	$2k-i+1$	$2k-i+3$	$2k-i+3$	$2k-i+2$	$2k-i$
$i = 2k+1$	$i-2k+2$	$i-2k+1$	$i-2k+1$	$i-2k+1$	$i-2k+2$	$i-2k+2$
$i = 2k+2$	$4$	$i-n+2$	$3$	$3$	$i-2k$	$i-2k$
$2k+3 \leq i \leq 3k$	$i-2k$	$i-2k+1$	$i-2k-1$	$i-2k-1$	$i-2k+2$	$i-2k$
$i = 3k+1$	$i-2k$	$i-n+1$	$i-n$	$i-n$	$k+2$	$k$
$i = 3k+2$	$\frac{n+1}{2}$	$k$	$i-n$	$i-n$	$k+1$	$k-1$
$3k+3 \leq i \leq 4k$	$2n-i+1$	$4k-i+2$	$2n-i+2$	$2n-i+2$	$4k-i+3$	$4k-i+1$
$i = 2n-1$	$2$	$3$	$3$	$3$	$4$	$4$
$i = 2n$	$1$	$2$	$2$	$2$	$1$	$1$
When $n = 2k$ , $k\geq 2$
$1 \leq i \leq k-2$	$i-1$	$i+2$	$i$	$i$	$i+3$	$i+1$
$i = k-1$	$i-1$	$n-i$	$i$	$i$	$k$	$k$
$k \leq i \leq k+1$	$i-1$	$n-i$	$i$	$i$	$2k-i-1$	$2k-i+1$
$i = k+2$	$i-1$	$n-i$	$\frac{n}{2}$	$\frac{n}{2}$	$n-i-1$	$n-i+1$
$k+3 \leq i \leq 2k-1$	$2k-i+3$	$2k-i$	$2k-i+2$	$2k-i+2$	$2k-i-1$	$2k-i+1$
$i = 2k$	$3$	$2$	$2$	$2$	$3$	$3$
$i = 2k+1$	$4$	$3$	$3$	$3$	$2$	$2$
$2k+2 \leq i \leq 3k-2$	$i-2k+1$	$i-2k+2$	$i-2k$	$i-2k$	$i-2k+1$	$i-2k+3$
$i = 3k-1$	$i-2k+1$	$i-2k+2$	$i-2k$	$i-2k$	$k$	$k$
$3k \leq i \leq 3k+1$	$2n-i+1$	$4k-i$	$i-2k$	$i-2k$	$4k-i+1$	$4k-i-1$
$i = 3k+2$	$k-1$	$k-2$	$\frac{n}{2}$	$\frac{n}{2}$	$4k-i+1$	$4k-i-1$
$3k+3 \leq i \leq 4k-2$	$2n-i+1$	$4k-i$	$2n-i+2$	$2n-i+2$	$4k-i+1$	$4k-i-1$
$i = 2n-1$	$2$	$3$	$3$	$3$	$4$	$4$
$i = 2n$	$1$	$2$	$2$	$2$	$1$	$1$

| Show Table

DownLoad: CSV

Now, for any $y\in N(x)$ , if we denote

● the number of edges in $x-u_1$ geodesic by $\alpha_1$ ,

● the number of edges in $y-u_1$ geodesic by $\beta_1$ ,

● the number of edges in $x-v_{n-1}$ geodesic by $\alpha_2$ ,

● the number of edges in $y-v_{n-1}$ geodesic by $\beta_2$ ,

then it can be seen that

$\rm{either}\; \; |\alpha_1-\beta_1| = 1\; \; \rm{whenever}\; \; \alpha_2 = \beta_2, \; \; \rm{or}\; \; |\alpha_2 - \beta_2| = 1\; \; \rm{whenever}\; \; \alpha_1 = \beta_1,$

which implies that either $u_1 \in A$ or $v_{n-1} \in A$ adjacently distinguishes the pair $(x, y)$ . Hence, $A$ is a neighbor-distinguishing set for $G$ .

Theorem 6. For $n\geq 3$ , if $G$ is a generalized Petersen graph $P(2n, n-1)$ , then $dim_a(G) = 2$ .

Proof. Since $dim_a(G) = 1$ if and only if $G$ is a bipartite graph, by Theorem 1. So $dim_a(G)\geq 2$ , because $G$ is not a bipartite graph. Hence, we get the required result, by Theorem 5.

4. Conclusions

Distinguishing every two vertices in a graph is an eminent problem in graph theory. Many graph theorists have been shown remarkable interest to solve this problem with the aid of distance (the number of edges in a geodesic) from last four decades. Using the technique of finding geodesics between vertices, we solved the problem of distinguishing every two neighbors in generalized Petersen graphs $P(n, 4)$ and $P(2n, n-1)$ . We investigated that, in both the families of generalized Petersen graphs, only two vertices are adequate to distinguish every two neighbors.

Acknowledgments

The authors are grateful to the editor and anonymous referees for their comments and suggestions to improve the quality of this article. This research is supported by Balochistan University of Engineering and Technology Khuzdar, Khuzdar 89100, Pakistan.

Conflict of interest

The authors declare that they have no conflict of interest.

References

[1]	M. Dewey, M. Siebes, M. Kachelriess, K. Kofoed, P. Maurovich-Horvat, K. Nikolaou, et al., Clinical quantitative cardiac imaging for the assessment of myocardial ischaemia, Nat. Rev. Cardiol., 17 (2020), 427–450. http://dx.doi.org/10.1038/s41569-020-0341-8 doi: 10.1038/s41569-020-0341-8
[2]	G. Q. Du, J. Y. Xue, Y. Guo, S. Chen, P. Du, Y. Wu, et al., Measurement of myocardial perfusion and infarction size using computer-aided diagnosis system for myocardial contrast echocardiography, Ultrasound Med. Biol., 41 (2015), 2466–2477. https://doi.org/10.1016/j.ultrasmedbio.2015.04.012 doi: 10.1016/j.ultrasmedbio.2015.04.012
[3]	Y. Guo, G. Q. Du, W. Q. Shen, C. Du, P. He, S. Siuly, Automatic myocardial infarction detection in contrast echocardiography based on polar residual network, Comput. Methods Programs Biomed., 198 (2021), 105791. https://doi.org/10.1016/j.cmpb.2020.105791 doi: 10.1016/j.cmpb.2020.105791
[4]	J. Cho, S. Her, H. Youn, C. Kim, M. Park, G. Kim, et al., Usefulness of the parameters of quantitative myocardial perfusion contrast echocardiography in patients with chronic total occlusion and collateral flow, Echocardiography, 32 (2015), 475–482. https://doi.org/10.1111/echo.12663 doi: 10.1111/echo.12663
[5]	T. Rutz, S. F. de Marchi, P. Roelli, S. Gloekler, T. Traupe, H. Steck, et al., Quantitative myocardial contrast echocardiography: a new method for the non-invasive detection of chronic heart transplant rejection, Eur. Heart J. Cardiovasc. Imaging, 14 (2014), 1187–1194. https://doi.org/10.1093/ehjci/jet066 doi: 10.1093/ehjci/jet066
[6]	A. L. Klibanov, P. T Rasche, M. S. Hughes, J. K. Wojdyla, K. P. Galen, J. H.Wible, et al., Detection of individual microbubbles of ultrasound contrast agents: imaging of free-floating and targeted bubbles, Invest. Radiol., 39 (2004), 187–195. https://doi.org/10.1097/01.rli.0000115926.96796.75 doi: 10.1097/01.rli.0000115926.96796.75
[7]	M. X. Tang, H. Mulvana, T. Gauthier, A. Lim, D. Cosgrove, R. Eckersley, et al., Quantitative contrast-enhanced ultrasound imaging: a review of sources of variability, Interface Focus, 1 (2011), 520–539. http://doi.org/10.1098/rsfs.2011.0026 doi: 10.1098/rsfs.2011.0026
[8]	M. Kass, A. Witkin, D. Terzopoulos, Snakes: Active contour models, Int. J. Comput. Vision, 1 (1988), 321–331. https://doi.org/10.1007/BF00133570 doi: 10.1007/BF00133570
[9]	T. F. Cootes, C. J. Taylor, D. H. Cooper, J. Graham, Active shape models-their training and application, Comput. Vision Image Understanding, 61 (1995), 38–59. https://doi.org/10.1006/cviu.1995.1004 doi: 10.1006/cviu.1995.1004
[10]	N. Malpica, M. Ledesma-Carbayo, A. Santos, E. Perez-David, M. Garcia-Fernandez, M. Desco, A coupled active contour model for myocardial tracking in contrast echocardiography, Image Understanding and Anal., 2004 (2004).
[11]	J. E. Pickard, J. A. Hossack, S. T. Acton, Shape model segmentation of long-axis contrast enhanced echocardiography, in 3rd IEEE International Symposium on Biomedical Imaging: Nano to Macro, (2006), 1112–1115. https://doi.org/10.1109/ISBI.2006.1625117
[12]	Y. Guo, G. Du, J. Xue, R. Xia, Y. Wang, A novel myocardium segmentation approach based on neutrosophic active contour model, Comput. Methods Programs Biomed., 142 (2017), 109–116. https://doi.org/10.1016/j.cmpb.2017.02.020 doi: 10.1016/j.cmpb.2017.02.020
[13]	Y. Li, C. Ho, M. Toulemonde, N. Chahal, R. Senior, M. Tang, Fully automatic myocardial segmentation of contrast echocardiography sequence using random forests guided by shape model, IEEE Trans. Med. Imaging, 37 (2017), 1081–1091. https://doi.org/10.1109/tmi.2017.2747081 doi: 10.1109/tmi.2017.2747081
[14]	N. Azarmehr, X. Ye, S. Sacchi, J. Howard, D. Francis, M. Zolgharni, Segmentation of left ventricle in 2D echocardiography using deep learning, in Annual Conference on Medical Image Understanding and Analysis, (2019), 497–504. https://doi.org/10.1007/978-3-030-39343-4_43
[15]	G. Veni, M. Moradi, H. Bulu, G. Narayan, T. Syeda-Mahmood, Echocardiography segmentation based on a shape-guided deformable model driven by a fully convolutional network prior, in 2018 IEEE 15th International Symposium on Biomedical Imaging, (2018), 898–902. https://doi.org/10.1109/ISBI.2018.8363716
[16]	Y. Hu, L. Guo, B. Lei, M. Mao, Z. Jin, A. Elazab, et al., Fully automatic pediatric echocardiography segmentation using deep convolutional networks based on BiSeNet, in 2019 41st Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC), (2019), 6561–6564. https://doi.org/10.1109/EMBC.2019.8856457
[17]	M. Li, D. Zeng, Q. Xie, R. Xu, Y. Wang, D. Ma, et al., A deep learning approach with temporal consistency for automatic myocardial segmentation of quantitative myocardial contrast echocardiography, Int. J. Cardiovasc. Imaging, 37 (2021), 1967–1978. https://doi.org/10.1007/s10554-021-02181-8 doi: 10.1007/s10554-021-02181-8
[18]	L. Chen, Y. Zhu, G. Papandreou, F. Schroff, H. Adam, Encoder-decoder with atrous separable convolution for semantic image segmentationm, preprint, arXiv: 1802.02611.
[19]	K. He, X. Zhang, S. Ren, J. Sun, Deep residual learning for image recognition, preprint, arXiv: 1512.03385.
[20]	T. He, Z. Zhang, H. Zhang, Z. Zhang, J. Xie, M. Li, Bag of tricks for image classification with convolutional neural networks, preprint, arXiv: 1812.01187.
[21]	F. Yu, V. Koltun, Multi-scale context aggregation by dilated convolutions, preprint, arXiv: 1511.07122.
[22]	L. Chen, Y. Zhu, G. Papandreou, F. Schroff, H. Adam, Rethinking atrous convolution for semantic image segmentation, preprint, arXiv: 1706.05587.
[23]	F. Milletari, N. Navab, S. Ahmadi, V-net: Fully convolutional neural networks for volumetric medical image segmentation, in 2016 fourth international conference on 3D vision (3DV), (2016), 565–571. https://doi.org/10.1109/3DV.2016.79
[24]	H. Zhao, J. Shi, X. Qi, X. Wang, J. Jia, Pyramid scene parsing network, preprint, arXiv: 1612.01105.
[25]	O. Ronneberger, P. Fischer, T. Brox, U-net: Convolutional networks for biomedical image segmentation, in International Conference on Medical Image Computing and Computer-Assisted Intervention, (2015), 234–241. https://doi.org/10.1007/978-3-319-24574-4_28

This article has been cited by:

莉周, Vertex Reducible Edge (Total) Coloring of Two Classes of Generalized Petersen Graph, 2023, 13, 2160-7583, 1851, 10.12677/PM.2023.136188

Reader Comments

Your name:*

Email:*
© 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)