5 research outputs found
ΠΠ½ΡΠ΅Π»Π»Π΅ΠΊΡΡΠ°Π»ΠΈΠ·Π°ΡΠΈΡ ΠΊΠΎΠ½ΡΡΠΎΠ»Ρ Π²Π°Π³ΠΎΠ½ΠΎΠ² Π² ΠΆΠ΅Π»Π΅Π·Π½ΠΎΠ΄ΠΎΡΠΎΠΆΠ½ΠΎΠΌ ΡΠΎΡΡΠΈΡΠΎΠ²ΠΎΡΠ½ΠΎΠΌ ΠΏΠ°ΡΠΊΠ΅
The railway marshalling station occupies a central place in the technological chain of freight transportation processes, since the speed of processing trains at marshalling yards determines the volume and cost of transportation. Therefore, development of automation and computerization of sorting processes results in growing efficiency of freight transportation in general. The objective of the study is to formalize the problem of carsβ monitoring within the railway marshalling yard and to develop a method for solving it with the use of algorithms of recognizing and positioning of dynamic objects through the intelligent data analysis of streaming video. The article presents a new approach to solution of the problem of monitoring moving units in the hump (sorting) yard of marshalling stations. The article suggests core criteria for identifying speed and positioning of the railway wagons when they are running after been separated at the hump. The article specifies that monitoring of moving units at hump yard is less automated in comparison with the monitoring at the hump itself, and that confirms the relevance of the research. To get the problem of the automation monitoring of moving units in the hump yard solved, the authors have suggested an algorithm that is based on the image data intelligent analysis, that is on computer vision, and have described the model of its implementation at a station. The methods used are based on the theory of computer vision and are aimed at recognizing key dynamic objects in streaming video and at their subsequent positioning. The study has resulted in substantiation of acceptability of the use of computer vision in the process of separation and formation of trains. It is planned to proceed with further improvement of the presented approach to develop a software product allowing to objectify information about hump yard in order to increase the efficiency of targeted braking at the hump.ΠΠ΅Π»Π΅Π·Π½ΠΎΠ΄ΠΎΡΠΎΠΆΠ½Π°Ρ ΡΠΎΡΡΠΈΡΠΎΠ²ΠΎΡΠ½Π°Ρ ΡΡΠ°Π½ΡΠΈΡ Π·Π°Π½ΠΈΠΌΠ°Π΅Ρ ΡΠ΅Π½ΡΡΠ°Π»ΡΠ½ΠΎΠ΅ ΠΌΠ΅ΡΡΠΎ Π² ΡΠ΅Ρ
Π½ΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΎΠΉ ΡΠ΅ΠΏΠΎΡΠΊΠ΅ Π³ΡΡΠ·ΠΎΠ²ΡΡ
ΠΏΠ΅ΡΠ΅Π²ΠΎΠ·ΠΎΡΠ½ΡΡ
ΠΏΡΠΎΡΠ΅ΡΡΠΎΠ², ΠΏΠΎΡΠΊΠΎΠ»ΡΠΊΡ ΡΠΊΠΎΡΠΎΡΡΡ ΠΏΠ΅ΡΠ΅ΡΠ°Π±ΠΎΡΠΊΠΈ ΠΆΠ΅Π»Π΅Π·Π½ΠΎΠ΄ΠΎΡΠΎΠΆΠ½ΡΡ
ΡΠΎΡΡΠ°Π²ΠΎΠ² Π½Π° Π½Π΅ΠΉ ΠΎΠΏΡΠ΅Π΄Π΅Π»ΡΠ΅Ρ ΠΎΠ±ΡΡΠΌ ΠΈ ΡΡΠΎΠΈΠΌΠΎΡΡΡ ΠΏΠ΅ΡΠ΅Π²ΠΎΠ·ΠΎΠΊ. ΠΠΎΡΡΠΎΠΌΡ ΡΠ°Π·Π²ΠΈΡΠΈΠ΅ ΡΡΠ΅Π΄ΡΡΠ² Π°Π²ΡΠΎΠΌΠ°ΡΠΈΠ·Π°ΡΠΈΠΈ ΠΈ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠ·Π°ΡΠΈΠΈ ΡΠΎΡΡΠΈΡΠΎΠ²ΠΎΡΠ½ΡΡ
ΠΏΡΠΎΡΠ΅ΡΡΠΎΠ² Π²Π΅Π΄ΡΡ ΠΊ ΠΏΠΎΠ²ΡΡΠ΅Π½ΠΈΡ ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΡΡΠΈ Π³ΡΡΠ·ΠΎΠ²ΡΡ
ΠΏΠ΅ΡΠ΅Π²ΠΎΠ·ΠΎΠΊ Π² ΡΠ΅Π»ΠΎΠΌ. Π¦Π΅Π»ΡΡ ΡΠ°Π±ΠΎΡΡ ΡΠ²Π»ΡΠ΅ΡΡΡ ΡΠΎΡΠΌΠ°Π»ΠΈΠ·Π°ΡΠΈΡ Π·Π°Π΄Π°ΡΠΈ ΠΊΠΎΠ½ΡΡΠΎΠ»Ρ Π²Π°Π³ΠΎΠ½ΠΎΠ² Π² ΠΆΠ΅Π»Π΅Π·Π½ΠΎΠ΄ΠΎΡΠΎΠΆΠ½ΠΎΠΌ ΡΠΎΡΡΠΈΡΠΎΠ²ΠΎΡΠ½ΠΎΠΌ ΠΏΠ°ΡΠΊΠ΅ ΠΈΡΠ°Π·ΡΠ°Π±ΠΎΡΠΊΠ° ΠΌΠ΅ΡΠΎΠ΄Π° Π΅Ρ ΡΠ΅ΡΠ΅Π½ΠΈΡ, ΠΎΡΠ½ΠΎΠ²Π°Π½Π½ΠΎΠ³ΠΎ Π½Π° ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠΈ Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ² ΡΠ°ΡΠΏΠΎΠ·Π½Π°Π²Π°Π½ΠΈΡ ΠΈ ΠΏΠΎΠ·ΠΈΡΠΈΠΎΠ½ΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π΄ΠΈΠ½Π°ΠΌΠΈΡΠ΅ΡΠΊΠΈΡ
ΠΎΠ±ΡΠ΅ΠΊΡΠΎΠ² ΠΏΡΡΡΠΌ ΠΈΠ½ΡΠ΅Π»Π»Π΅ΠΊΡΡΠ°Π»ΡΠ½ΠΎΠ³ΠΎ Π°Π½Π°Π»ΠΈΠ·Π° Π΄Π°Π½Π½ΡΡ
ΠΏΠΎΡΠΎΠΊΠΎΠ²ΠΎΠ³ΠΎ Π²ΠΈΠ΄Π΅ΠΎ. Π ΡΠ°Π±ΠΎΡΠ΅ ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½ Π½ΠΎΠ²ΡΠΉ ΠΏΠΎΠ΄Ρ
ΠΎΠ΄ ΠΊ ΡΠ΅ΡΠ΅Π½ΠΈΡ Π·Π°Π΄Π°ΡΠΈ ΠΊΠΎΠ½ΡΡΠΎΠ»Ρ ΠΏΠΎΠ΄Π²ΠΈΠΆΠ½ΡΡ
Π΅Π΄ΠΈΠ½ΠΈΡ Π² ΠΏΠΎΠ΄Π³ΠΎΡΠΎΡΠ½ΠΎΠΌ (ΡΠΎΡΡΠΈΡΠΎΠ²ΠΎΡΠ½ΠΎΠΌ) ΠΏΠ°ΡΠΊΠ΅ ΠΆΠ΅Π»Π΅Π·Π½ΠΎΠ΄ΠΎΡΠΎΠΆΠ½ΡΡ
ΡΠΎΡΡΠΈΡΠΎΠ²ΠΎΡΠ½ΡΡ
ΡΡΠ°Π½ΡΠΈΠΉ. ΠΡΠΈΠ²ΠΎΠ΄ΡΡΡΡ ΠΎΡΠ½ΠΎΠ²Π½ΡΠ΅ ΠΊΡΠΈΡΠ΅ΡΠΈΠΈ ΠΎΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΈΡ ΡΠΊΠΎΡΠΎΡΡΠΈ Π΄Π²ΠΈΠΆΠ΅Π½ΠΈΡ ΠΈ ΠΏΠΎΠ·ΠΈΡΠΈΠΎΠ½ΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π³ΡΡΠΏΠΏ Π²Π°Π³ΠΎΠ½ΠΎΠ² ΠΏΡΠΈ ΠΈΡ
Π΄Π²ΠΈΠΆΠ΅Π½ΠΈΠΈ ΠΏΠΎΡΠ»Π΅ ΡΠ°ΡΡΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π½Π° ΡΠΎΡΡΠΈΡΠΎΠ²ΠΎΡΠ½ΠΎΠΉ Π³ΠΎΡΠΊΠ΅. ΠΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΎ, ΡΡΠΎ ΠΊΠΎΠ½ΡΡΠΎΠ»Ρ ΠΏΠΎΠ΄Π²ΠΈΠΆΠ½ΡΡ
Π΅Π΄ΠΈΠ½ΠΈΡ Π² ΡΠΎΡΡΠΈΡΠΎΠ²ΠΎΡΠ½ΠΎΠΌ ΠΏΠ°ΡΠΊΠ΅ ΡΠ²Π»ΡΠ΅ΡΡΡ ΠΌΠ΅Π½Π΅Π΅ Π°Π²ΡΠΎΠΌΠ°ΡΠΈΠ·ΠΈΡΠΎΠ²Π°Π½Π½ΡΠΌ ΠΏΡΠΎΡΠ΅ΡΡΠΎΠΌ ΠΏΠΎ ΡΡΠ°Π²Π½Π΅Π½ΠΈΡ Ρ ΠΊΠΎΠ½ΡΡΠΎΠ»Π΅ΠΌ Π½Π° ΡΠΎΡΡΠΈΡΠΎΠ²ΠΎΡΠ½ΠΎΠΉ Π³ΠΎΡΠΊΠ΅. ΠΠ»Ρ ΡΠ΅ΡΠ΅Π½ΠΈΡ ΠΏΠΎΡΡΠ°Π²Π»Π΅Π½Π½ΠΎΠΉ Π·Π°Π΄Π°ΡΠΈ Π°Π²ΡΠΎΠΌΠ°ΡΠΈΠ·Π°ΡΠΈΠΈ ΠΊΠΎΠ½ΡΡΠΎΠ»Ρ ΠΏΠΎΠ΄Π²ΠΈΠΆΠ½ΡΡ
Π΅Π΄ΠΈΠ½ΠΈΡ Π² ΡΠΎΡΡΠΈΡΠΎΠ²ΠΎΡΠ½ΠΎΠΌ ΠΏΠ°ΡΠΊΠ΅ ΠΏΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ Π°Π»Π³ΠΎΡΠΈΡΠΌ Π½Π° Π±Π°Π·Π΅ ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² ΠΈΠ½ΡΠ΅Π»Π»Π΅ΠΊΡΡΠ°Π»ΡΠ½ΠΎΠ³ΠΎ Π°Π½Π°Π»ΠΈΠ·Π° Π²ΠΈΠ΄Π΅ΠΎΠ΄Π°Π½Π½ΡΡ
β ΠΊΠΎΠΌΠΏΡΡΡΠ΅ΡΠ½ΠΎΠ³ΠΎ Π·ΡΠ΅Π½ΠΈΡ β ΠΈ ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½Π° Π΅Π³ΠΎ ΠΌΠΎΠ΄Π΅Π»Ρ ΡΠ΅Π°Π»ΠΈΠ·Π°ΡΠΈΠΈ Π½Π° ΠΊΠΎΠ½ΠΊΡΠ΅ΡΠ½ΠΎΠΌ ΠΎΠ±ΡΠ΅ΠΊΡΠ΅. ΠΠ΅ΡΠΎΠ΄Ρ ΡΠ°Π±ΠΎΡΡ ΠΎΡΠ½ΠΎΠ²Π°Π½Ρ Π½Π° ΡΠ΅ΠΎΡΠΈΠΈ ΠΊΠΎΠΌΠΏΡΡΡΠ΅ΡΠ½ΠΎΠ³ΠΎ Π·ΡΠ΅Π½ΠΈΡ ΠΈ Π½Π°ΠΏΡΠ°Π²Π»Π΅Π½Ρ Π½Π° ΡΠ°ΡΠΏΠΎΠ·Π½Π°Π²Π°Π½ΠΈΠ΅ ΠΊΠ»ΡΡΠ΅Π²ΡΡ
Π΄ΠΈΠ½Π°ΠΌΠΈΡΠ΅ΡΠΊΠΈΡ
ΠΎΠ±ΡΠ΅ΠΊΡΠΎΠ² Π½Π° ΠΏΠΎΡΠΎΠΊΠΎΠ²ΠΎΠΌ Π²ΠΈΠ΄Π΅ΠΎ Ρ ΠΈΡ
ΠΏΠΎΡΠ»Π΅Π΄ΡΡΡΠΈΠΌ ΠΏΠΎΠ·ΠΈΡΠΈΠΎΠ½ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ. Π Π΅Π·ΡΠ»ΡΡΠ°ΡΠΎΠΌ ΠΏΡΠΎΠ²Π΅Π΄ΡΠ½Π½ΠΎΠΉ ΡΠ°Π±ΠΎΡΡ ΡΠ²Π»ΡΠ΅ΡΡΡ ΠΎΠ±ΠΎΡΠ½ΠΎΠ²Π°Π½ΠΈΠ΅ Π°ΠΊΡΡΠ°Π»ΡΠ½ΠΎΡΡΠΈ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΡ ΠΊΠΎΠΌΠΏΡΡΡΠ΅ΡΠ½ΠΎΠ³ΠΎ Π·ΡΠ΅Π½ΠΈΡ Π² ΠΏΡΠΎΡΠ΅ΡΡΠ΅ ΡΠ°ΡΡΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ-ΡΠΎΡΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΆΠ΅Π»Π΅Π·Π½ΠΎΠ΄ΠΎΡΠΎΠΆΠ½ΡΡ
ΡΠΎΡΡΠ°Π²ΠΎΠ². Π Π΄Π°Π»ΡΠ½Π΅ΠΉΡΠ΅ΠΌ ΠΏΠ»Π°Π½ΠΈΡΡΠ΅ΡΡΡ ΡΠΎΠ²Π΅ΡΡΠ΅Π½ΡΡΠ²ΠΎΠ²Π°Π½ΠΈΠ΅ ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½Π½ΡΡ
ΡΠ°Π·ΡΠ°Π±ΠΎΡΠΎΠΊ Π΄Π»Ρ ΠΏΠΎΠ΄Π³ΠΎΡΠΎΠ²ΠΊΠΈ Π³ΠΎΡΠΎΠ²ΠΎΠ³ΠΎ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΠΎΠ³ΠΎ ΠΏΡΠΎΠ΄ΡΠΊΡΠ°, ΠΏΠΎΠ·Π²ΠΎΠ»ΡΡΡΠ΅Π³ΠΎ ΠΎΠ±ΡΠ΅ΠΊΡΠΈΠ²ΠΈΠ·ΠΈΡΠΎΠ²Π°ΡΡ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΡ ΠΎ ΡΠΎΡΡΠΈΡΠΎΠ²ΠΎΡΠ½ΠΎΠΌ ΠΏΠ°ΡΠΊΠ΅ Π΄Π»Ρ ΠΏΠΎΠ²ΡΡΠ΅Π½ΠΈΡ ΡΡΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΡΡΠΈ ΠΏΡΠΈΡΠ΅Π»ΡΠ½ΠΎΠ³ΠΎ ΡΠΎΡΠΌΠΎΠΆΠ΅Π½ΠΈΡ Π½Π° ΡΠΎΡΡΠΈΡΠΎΠ²ΠΎΡΠ½ΠΎΠΉ Π³ΠΎΡΠΊΠ΅
Occlusion handling in multiple people tracking
Object tracking with occlusion handling is a challenging problem in automated video surveillance. Occlusion handling and tracking have always been considered as separate modules. We have proposed an automated video surveillance system, which automatically detects occlusions and perform occlusion handling, while the tracker continues to track resulting separated objects. A new approach based on sub-blobbing is presented for tracking objects accurately and steadily, when the target encounters occlusion in video sequences. We have used a feature-based framework for tracking, which involves feature extraction and feature matching
Online Selection of Tracking Features Using AdaBoost
[[abstract]]Β©2009 IEEE-This paper presents an online feature selection algorithm for video object tracking. Using the object and background pixels from the previous frame as training samples, we model the feature selection problem as finding a good subset of features to better classify object from background in current frame. This paper aims to improve existing methods by taking correlation between features into consideration. We propose to use AdaBoost algorithm to iteratively select one feature which best compensates the previously selected features. Using the selected features, we then construct a compound likelihood image, which shows the ability to discriminate better than the original frame, as the input for the tracking process. We also propose to use ellipse fitting to eliminate mislabeled pixels from our training process. In addition, we propose an online feature validity test to monitor the selected features and only re-select features when the previously selected features become out-of-date. Experimental results demonstrate that the proposed algorithm combined with mean-shift based tracking algorithm achieves very promising results.[[department]]θ³θ¨ε·₯η¨εΈ