Abstract book (pdf) - ICPR 2010
Abstract book (pdf) - ICPR 2010
Abstract book (pdf) - ICPR 2010
- TAGS
- abstract
- icpr
- icpr2010.org
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
09:40-10:00, Paper ThAT3.3<br />
Crowd Motion Analysis using Linear Cyclic Pursuit<br />
Viswanathan, Srikrishnan, I.I.T Bombay<br />
Chaudhuri, Subhasis, IIT<br />
Crowd motion analysis, where there is interdependence amongst the constituent elements, is a relatively unexplored application<br />
area in computer vision. In this work, we propose a fast method for short-term crowd motion prediction using a<br />
sparse set of particles. We study the dynamics of a crowd motion model and linear cyclic pursuit. We show that linear<br />
cyclic pursuit naturally captures the repulsive and attractive forces acting on the individual crowd member. The pursuit<br />
parameters are estimated from videos in an online manner using a feature tracker. Short term trajectory prediction is done<br />
by numerical solution of estimated cyclic pursuit equation. We demonstrate the suitability of the proposed technique<br />
through extensive experimentations.<br />
10:00-10:20, Paper ThAT3.4<br />
Integrating Object Detection with 3D Tracking towards a Better Driver Assistance System<br />
Prisacariu, Victor Adrian, Univ. of Oxford<br />
Timofte, Radu, Katholieke Univ. Leuven<br />
Zimmermann, Karel, Katholieke Univ. Leuven<br />
Reid, Ian,<br />
Van Gool, Luc<br />
Driver assistance helps save lives. Accurate 3D pose is required to establish if a traffic sign is relevant to the driver. We<br />
propose a real-time system that integrates single view detection with region-based 3D tracking of road signs. The optimal<br />
set of candidate detections is found, followed by AdaBoost cascades and SVMs. The 2D detections are then employed in<br />
simultaneous 2D segmentation and 3D pose tracking, using the known 3D model of the recognised traffic sign. We demonstrate<br />
the abilities of our system by tracking multiple road signs in real world scenarios.<br />
10:20-10:40, Paper ThAT3.5<br />
Real-Time Automatic Traffic Accident Recognition using HFG<br />
Bakheet, Samy, Otto-von-Guericke Univ. Magdeburg<br />
Al-Hamadi, Ayoub, Otto-von-Guericke Univ. Magdeburg<br />
Michaelis, Bernd, Otto-von-Guericke Univ. Magdeburg<br />
Sayed, Usama, Otto-von-Guericke Univ. Magdeburg<br />
Recently, the problem of automatic traffic accident recognition has appealed to the machine vision community due to its<br />
implications on the development of autonomous Intelligent Transportation Systems (ITS). In this paper, a new framework<br />
for real-time automated traffic accidents recognition using Histogram of Flow Gradient (HFG) is proposed. This framework<br />
performs two major steps. First, HFG-based features are extracted from video shots. Second, logistic regression is employed<br />
to develop a model for the probability of occurrence of an accident by fitting data to a logistic curve. In case of occurrence<br />
of an accident, the trajectory of vehicle by which the accident was occasioned is determined. Preliminary results on real<br />
video sequences confirm the effectiveness and the applicability of the proposed approach, and it can offer delay guarantees<br />
for real-time surveillance and monitoring scenarios.<br />
ThAT4 Dolmabahçe Hall A<br />
Semi-Supervised and Metric Learning Regular Session<br />
Session chair: Sanfeliu, Alberto (Universitat Politecnica de Catalunya)<br />
09:00-09:20, Paper ThAT4.1<br />
Semi-Supervised Distance Metric Learning by Quadratic Programming<br />
Cevikalp, Hakan, Eskisehir Osmangazi Univ.<br />
This paper introduces a semi-supervised distance metric learning algorithm which uses pair-wise equivalence (similarity<br />
and dissimilarity) constraints to improve the original distance metric in lower-dimensional input spaces. We restrict ourselves<br />
to pseudo-metrics that are in quadratic forms parameterized by positive semi-definite matrices. The proposed method<br />
works in both the input space and kernel in-duced feature space, and learning distance metric is formulated as a quadratic<br />
- 244 -