2016
DOI: 10.1016/j.ins.2016.04.052
|View full text |Cite
|
Sign up to set email alerts
|

Texture recognition based on diffusion in networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
25
0
25

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 33 publications
(51 citation statements)
references
References 63 publications
1
25
0
25
Order By: Relevance
“…Another contribution is the use of diffusion in network to dynamic textures characterization, which provides a better characterization than other traditional network measures used in [26], improving the recognition task performance. This follows from the fact that directed diffusion has been used to highlight the diversity and separation of the dynamics in the respective network [24,11]. The dynamic textures are represented in directed complex networks and its activity associated to the spatial and temporal in-degree is used to compose the feature vector.…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…Another contribution is the use of diffusion in network to dynamic textures characterization, which provides a better characterization than other traditional network measures used in [26], improving the recognition task performance. This follows from the fact that directed diffusion has been used to highlight the diversity and separation of the dynamics in the respective network [24,11]. The dynamic textures are represented in directed complex networks and its activity associated to the spatial and temporal in-degree is used to compose the feature vector.…”
Section: Resultsmentioning
confidence: 99%
“…The walker conducts the walk according to Equation 4 until it visits a vertex without outgoing edge or the length of the walking is greater than a given threshold L. The activity α(v i ) of the vertex v i is defined as the number of visits received during the walks. To estimate more accurately the activity, M walks are started at each vertex of the network [24]. According to experimental evaluations in this paper, we define M = 50.…”
Section: Activity Estimation In Dynamic Texturesmentioning
confidence: 99%
See 2 more Smart Citations
“…represents the pixel Euclidean distance. This same modeling approach is also used by the methods proposed in [19,20]. The connection weight inversely represent pixel similarity, where lower values means high similarity.…”
Section: Modeling Of Texture As Cnmentioning
confidence: 99%