Adaptive mean-shift for automated multi object tracking

Date

2012-01-01

Author

Beyan, C.
Temizel, Alptekin

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

208
views

0
downloads

Mean-shift tracking plays an important role in computer vision applications because of its robustness, ease of implementation and computational efficiency. In this study, a fully automatic multiple-object tracker based on mean-shift algorithm is presented. Foreground is extracted using a mixture of Gaussian followed by shadow and noise removal to initialise the object trackers and also used as a kernel mask to make the system more efficient by decreasing the search area and the number of iterations to converge for the new location of the object. By using foreground detection, new objects entering to the field of view and objects that are leaving the scene could be detected. Trackers are automatically refreshed to solve the potential problems that may occur because of the changes in objects' size, shape, to handle occlusion-split between the tracked objects and to detect newly emerging objects as well as objects that leave the scene. Using a shadow removal method increases the tracking accuracy. As a result, a method that remedies problems of mean-shift tracking and presents an easy to implement, robust and efficient tracking method that can be used for automated static camera video surveillance applications is proposed. Additionally, it is shown that the proposed method is superior to the standard mean-shift.

Subject Keywords

Computer Science, Artificial Intelligence, Engineering, Electrical & Electronic

URI

https://hdl.handle.net/11511/30292

Journal

IET COMPUTER VISION

DOI

https://doi.org/10.1049/iet-cvi.2011.0054

Collections

Graduate School of Informatics, Article

Suggestions

OpenMETU
Core

Automatic Description Generation from Images: A Survey of Models, Datasets, and Evaluation Measures Bernardi, Raffaella; Cakici, Ruket; Elliott, Desmond; Erdem, Aykut; Erdem, Erkut; Ikizler-Cinbis, Nazli; Keller, Frank; Muscat, Adrian; Plank, Barbara (AI Access Foundation, 2016-2-23) Automatic description generation from natural images is a challenging problem that has recently received a large amount of interest from the computer vision and natural language processing communities. In this survey, we classify the existing approaches based on how they conceptualize this problem, viz., models that cast description as either generation problem or as a retrieval problem over a visual or multimodal representational space. We provide a detailed review of existing models, highlighting their ad...
A hybrid single-source shortest path algorithm Arslan, Hilal; Manguoğlu, Murat (The Scientific and Technological Research Council of Turkey, 2019-01-01) The single-source shortest path problem arises in many applications, such as roads, social applications, and computer networks. Finding the shortest path is challenging, especially for graphs that contain a large number of vertices and edges. In this work, we propose a novel hybrid method that first sparsifies a given graph by removing most edges that cannot form the shortest path tree and then applies a classical shortest path algorithm to the sparser graph. Removing all the edges that cannot form the shor...
Relaxed Spatio-Temporal Deep Feature Aggregation for Real-Fake Expression Prediction Ozkan, Savas; Akar, Gözde (2017-10-29) Frame-level visual features are generally aggregated in time with the techniques such as LSTM, Fisher Vectors, NetVLAD etc. to produce a robust video-level representation. We here introduce a learnable aggregation technique whose primary objective is to retain short-time temporal structure between frame-level features and their spatial interdependencies in the representation. Also, it can be easily adapted to the cases where there have very scarce training samples. We evaluate the method on a real-fake expr...
Asynchronous design of systolic array architectures in cmos İsmailoğlu, Ayşe Neslin; Aşkar, Murat; Department of Electrical and Electronics Engineering (2008) In this study, delay-insensitive asynchronous circuit design style has been adopted to systolic array architectures to exploit the benefits of both techniques for improved throughput. A delay-insensitivity verification analysis method employing symbolic delays is proposed for bit-level pipelined asynchronous circuits. The proposed verification method allows datadependent early output evaluation to co-exist with robust delay-insensitive circuit behavior in pipelined architectures such as systolic arrays. Reg...
Efficient detection and tracking of salient regions for visual processing on mobile platforms Serhat, Gülhan; Saranlı, Afşar; Department of Electrical and Electronics Engineering (2009) Visual Attention is an interesting concept that constantly widens its application areas in the field of image processing and computer vision. The main idea of visual attention is to find the locations on the image that are visually attractive. In this thesis, the visually attractive regions are extracted and tracked in video sequences coming from the vision systems of mobile platforms. First, the salient regions are extracted in each frame and a feature vector is constructed for each one. Then Scale Invaria...

Citation Formats

C. Beyan and A. Temizel, “Adaptive mean-shift for automated multi object tracking,” IET COMPUTER VISION, pp. 1–12, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/30292.