Multidimensional Data Visualization Based on the Shortest Unclosed Path Search

Seredin, Oleg; Surkov, Egor; Kopylov, Andrey; Двоенко, С. Д.

doi:10.1007/978-3-030-97610-1_23

Cited by 3 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Generally, this problem is solved by constructing the shortest unenclosed path (SUP). 53 However, in this case, there are two problems due to the specifics of the applied task being solved.…”

Section: Methodsmentioning

confidence: 99%

Determining the orderliness of carbon materials with nanoparticle imaging and explainable machine learning

Kurbakov,

Sulimova,

Kopylov

et al. 2024

Nanoscale

View full text Add to dashboard Cite

show abstract

Section: Methodsmentioning

confidence: 99%

Determining the orderliness of carbon materials with nanoparticle imaging and explainable machine learning

Kurbakov,

Sulimova,

Kopylov

et al. 2024

Nanoscale

View full text Add to dashboard Cite

show abstract

Section: Ordering Of the Basic Assembly Of Skeletal Modelsmentioning

confidence: 99%

“…To find the shortest unclosed path (SUP) between all the objects of the basic assembly a SUP search algorithm from [34] could be applied. The article [34] proposes 8 algorithms for searching the quasi-shortest unclosed path and provides a comparative analysis on several datasets. Recursive modification of the A4 algorithm makes it possible to find the best result on the data of the basic assembly in a reasonable time [34].…”

Section: Ordering Of the Basic Assembly Of Skeletal Modelsmentioning

confidence: 99%

“…The article [34] proposes 8 algorithms for searching the quasi-shortest unclosed path and provides a comparative analysis on several datasets. Recursive modification of the A4 algorithm makes it possible to find the best result on the data of the basic assembly in a reasonable time [34]. The "ant" algorithm was proposed to improve the solution obtained by modifications of the greedy algorithm.…”

Section: Ordering Of the Basic Assembly Of Skeletal Modelsmentioning

confidence: 99%

“…This algorithm search for the SUP between two terminal points [39]. Such points are assumed to be the terminal points of the SUP found by the A4R algorithm from [34].…”

Section: Ordering Of the Basic Assembly Of Skeletal Modelsmentioning

confidence: 99%

See 2 more Smart Citations

The basic assembly of skeletal models in the fall detection problem

Seredin¹,

Kopylov²,

Surkov³

et al. 2023

Computer Optics

View full text Add to dashboard Cite

The paper considers the appliance of the featureless approach to the human activity recognition problem, which exclude the direct anthropomorphic and visual characteristics of human figure from further analysis and thus increase the privacy of the monitoring system. A generalized pairwise comparison function of two human skeletal models, invariant to the sensor type, is used to project the object of interest to the secondary feature space, formed by the basic assembly of skeletons. A sequence of such projections in time forms an activity map, which allows an application of deep learning methods based on convolution neural networks for activity recognition. The proper ordering of skeletal models in a basic assembly plays an important role in secondary space design. The study of ordering of the basic assembly by the shortest unclosed path algorithm and correspondent activity maps for video streams from the TST Fall Detection v2 database are presented.

show abstract