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 TuAT8.54<br />
Hierarchical Anomality Detection based on Situation<br />
Nishio, Shuichi, Advanced Telecommunication Res. Inst. International<br />
Okamoto, Hiromi, Nara Women’s Univ.<br />
Babaguchi, Noboru, Osaka Univ.<br />
In this paper, we propose a novel anomality detection method based on external situational information and hierarchical<br />
analysis of behaviors. Past studies model normal behaviors to detect anomality as outliers. However, normal behaviors tend<br />
to differ by situations. Our method combines a set of simple classifiers with pedestrian trajectories as inputs. As mere path<br />
information is not sufficient for detecting anomality, trajectories are first decomposed into hierarchical features of different<br />
abstract levels and then applied to appropriate classifiers corresponding to the situation it belongs to. Effects of the methods<br />
are tested using real environment data.<br />
09:00-11:10, Paper TuAT8.55<br />
Image Classification using Subgraph Histogram Representation<br />
Ozdemir, Bahadir, Bilkent Univ.<br />
Aksoy, Selim, Bilkent Univ.<br />
We describe an image representation that combines the representational power of graphs with the efficiency of the bag-ofwords<br />
model. For each image in a data set, first, a graph is constructed from local patches of interest regions and their spatial<br />
arrangements. Then, each graph is represented with a histogram of sub graphs selected using a frequent subgraph mining algorithm<br />
in the whole data. Using the sub graphs as the visual words of the bag-of-words model and transforming of the<br />
graphs into a vector space using this model enables statistical classification of images using support vector machines. Experiments<br />
using images cut from a large satellite scene show the effectiveness of the proposed representation in classification<br />
of complex types of scenes into eight high-level semantic classes.<br />
09:00-11:10, Paper TuAT8.56<br />
Oriented Boundary Graph: A Framework to Design and Implement 3D Segmentation Algorithms<br />
Baldacci, Fabien, Univ. de Bordeaux<br />
Braquelaire, Achille, Univ. de Bordeaux<br />
Domenger, Jean Philippe, Univ. de Bordeaux<br />
In this paper we show the interest of a topological model to represent 3D segmented image which is a good compromise between<br />
the complete but time consuming representations and the partial but not expressive enough ones. We show that this<br />
model, called Oriented Boundary Graph, provides an effective framework for both volumic image analysis and segmentation.<br />
The Oriented Boundary Graph provides an efficient implementation of a set of primitives suitable for the design complex<br />
segmentation algorithms and to implement the computation of the segmented image characteristics needed by such algorithms.<br />
We first present the framework and give the time complexity of its main primitives. Then, we give some examples of the use<br />
of this framework in order to efficiently design non-trivial image analysis operations and image segmentation algorithms.<br />
Those examples are applied on 3D CT-scan data.<br />
09:00-11:10, Paper TuAT8.57<br />
Hierarchical Segmentation of Complex Structures<br />
Akcay, Huseyin Gokhan, Bilkent Univ.<br />
Aksoy, Selim, Bilkent Univ.<br />
Soille, Pierre, Ec. Joint Res. Centre<br />
We present an unsupervised hierarchical segmentation algorithm for detection of complex heterogeneous image structures<br />
that are comprised of simpler homogeneous primitive objects. An initial segmentation step produces regions corresponding<br />
to primitive objects with uniform spectral content. Next, the transitions between neighboring regions are modeled and clustered.<br />
We assume that the clusters that are dense and large enough in this transition space can be considered as significant.<br />
Then, the neighboring regions belonging to the significant clusters are merged to obtain the next level in the hierarchy. The<br />
experiments show that the algorithm that iteratively clusters and merges region groups is able to segment high-level complex<br />
structures in a hierarchical manner.<br />
- 94 -