2015 International Conference on Mechanical Engineering, Automation and Control Systems (MEACS) 2015
DOI: 10.1109/meacs.2015.7414876
|View full text |Cite
|
Sign up to set email alerts
|

Clustering using a random walk on graph for head pose estimation

Abstract: In this paper, the problem of head pose estimation is described. The solution consists of several stages. The clustering is a critical step. The clustering of feature points of the image is consuming and important step that needs to simplify and speed up. For this task, it is proposed to use the properties of a random walk on the graph. The random walk can lead to a measure of cluster cohesion. This approach is closely related to spectral graph theory. The paper presents formulas, steps of the algorithm and an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 15 publications
0
5
0
Order By: Relevance
“…In an introductory symmetric random walk on a locally finite lattice, the probability of a location jumping to each of its immediate neighbors is the same as the likelihood of the place jumping to the location's close neighbors. A three-dimensional network of random walks is shown in Figure 1 [ 30 , 31 ].…”
Section: Proposed Approachmentioning
confidence: 99%
See 1 more Smart Citation
“…In an introductory symmetric random walk on a locally finite lattice, the probability of a location jumping to each of its immediate neighbors is the same as the likelihood of the place jumping to the location's close neighbors. A three-dimensional network of random walks is shown in Figure 1 [ 30 , 31 ].…”
Section: Proposed Approachmentioning
confidence: 99%
“…Based on the above formulation, and assuming that the Markov chain is nondegradable, genuinely repetitive, and nonperiodic, then regardless of its initial distribution, we have [ 30 , 32 , 34 ] …”
Section: Proposed Approachmentioning
confidence: 99%
“…Therefore, there are many “open” triangles, and the most suitable ERGM for the occasion is the 2-star model, which is calculated as [ 34 , 38 , 39 ]follows: where a ij is the element of the graph adjacent table A (with value 1 if there is an edge between nodes i and j , and 0 otherwise), m ( G ) is the network statistic that models the number of edges of the graph (whose influence is controlled by the hyperparameter i ), and s ( G ) is the corresponding magnitude for the number of 2 stars (whose influence is controlled by the hyperparameter t, respectively). It should also be noted that in this case, the graph is nondirectional (i.e., for the i and j elements of the neighborhood table, the equation a ij = a ji applies).…”
Section: Proposed Methodologymentioning
confidence: 99%
“…But, for continuous features, we create a new distribution (normal distribution or sum of Gaussian nuclei). Under the previously mentioned conditions (assumptions), the proposed algorithm that we use in this work is as follows [ 15 , 20 22 ].…”
Section: Proposed Methodologymentioning
confidence: 99%