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:00-11:10, Paper ThAT8.49<br />
Visibility of Multiple Cameras in a Scene with Unknown Geometry<br />
Zhang, Liuxin, Beijing Inst. of Tech.<br />
Jia, Yunde, Beijing Inst. of Tech.<br />
In this paper, we investigate the problem of determining the visible regions of multiple cameras in a 3D scene without a<br />
priori knowledge of the scene geometry. Our approach is based on a variational energy functional where both the unresolved<br />
visibility information of multiple cameras and the unknown scene geometry are included. We cast visibility estimation<br />
and scene geometry reconstruction as an optimization of the variational energy functional amenable for minimization with<br />
the Euler-Lagrange driven evolution. Starting from any initial value, the accurate visibility of multiple cameras as well as<br />
the true scene geometry can be obtained at the end of the evolution. Experimental results show the validity of our approach.<br />
09:00-11:10, Paper ThAT8.50<br />
Low-Level Image Segmentation based Scene Classification<br />
Akbas, Emre, Univ. of Illinois<br />
Ahuja, Narendra, Univ. of Illinois<br />
This paper is aimed at evaluating the semantic information content of multiscale, low-level image segmentation. As a<br />
method of doing this, we use selected features of segmentation for semantic classification of real images. To estimate the<br />
relative measure of the information content of our features, we compare the results of classifications we obtain using them<br />
with those obtained by others using the commonly used patch/grid based features. To classify an image using segmentation<br />
based features, we model the image in terms of a probability density function, a Gaussian mixture model (GMM) to be<br />
specific, of its region features. This GMM is fit to the image by adapting a universal GMM which is estimated so it fits<br />
all images. Adaptation is done using a maximum-aposteriori criterion. We use kernelized versions of Bhattacharyya distance<br />
to measure the similarity between two GMMs and support vector machines to perform classification. We outperform previously<br />
reported results on a publicly available scene classification dataset. These results suggest further experimentation<br />
in evaluating the promise of low level segmentation in image classification.<br />
09:00-11:10, Paper ThAT8.51<br />
Learning Scene Semantics using Fiedler Embedding<br />
Liu, Jingen, Univ. of Michigan<br />
Ali, Saad, Carnegie Mellon Univ.<br />
We propose a framework to learn scene semantics from surveillance videos. Using the learnt scene semantics, a video analyst<br />
can efficiently and effectively retrieve the hidden semantic relationship between homogeneous and heterogeneous<br />
entities existing in the surveillance system. For learning scene semantics, the algorithm treats different entities as nodes<br />
in a graph, where weighted edges between the nodes represent the “initial” strength of the relationship between entities.<br />
The graph is then embedded into a k-dimensional space by Fiedler Embedding.<br />
09:00-11:10, Paper ThAT8.52<br />
Counting Vehicles in Highway Surveillance Videos<br />
Tamersoy, Birgi, The Univ. of Texas at Austin<br />
Aggarwal, J. K., The Univ. of Texas at Austin<br />
This paper presents a complete system for accurately and efficiently counting vehicles in a highway surveillance video.<br />
The proposed approach employs vehicle detection and tracking modules. In the detection module, an automatically trained<br />
binary classifier detects vehicles while providing robustness against view-point, poor quality videos and clutter. Efficient<br />
tracking is then achieved by a simplified multi-hypothesis approach. First an over-complete set of tracks is created considering<br />
every observed detection within a time interval. As needed, hypothesized detections are generated to force continuous<br />
tracks. Finally, a scoring function is used to separate the valid tracks in the over-complete set. Our tracking system<br />
achieved accurate results in significantly challenging highway surveillance videos.<br />
- 262 -