Abstract book (pdf) - ICPR 2010

13:30-16:30, Paper WeBCT9.11
Tertiary Hash Tree: Indexing Structure for Content-Based Image Retrieval
Tak, Yoon-Sik, Korea Univ.
Hwang, Eenjun, Korea Univ.
Dominant features for content-based image retrieval usually consist of high-dimensional values. So far, many researches
have been done to index such values for fast retrieval. Still, many existing indexing schemes are suffering from performance
degradation due to the curse of dimensionality problem. As an alternative, heuristic algorithms have been proposed to calculate
the result with high probability at the cost of accuracy. In this paper, we propose a new hash tree-based indexing structure
called tertiary hash tree for indexing high-dimensional feature values. Tertiary hash tree provides several advantages compared
to the traditional extendible hash structure in terms of resource usage and search performance. Through extensive experiments,
we show that our proposed index structure achieves outstanding performance.
13:30-16:30, Paper WeBCT9.12
An Augmented Reality Setup with an Omnidirectional Camera based on Multiple Object Detection
Hayashi, Tomoki, Keio Univ.
Uchiyama, Hideaki, Keio Univ.
Pilet, Julien, Keio Univ.
Saito, Hideo, Keio Univ.
We propose a novel augmented reality (AR) setup with an omni directional camera on a table top display. The table acts as
a mirror on which real playing cards appear augmented with virtual elements. The omni directional camera captures and recognizes
its surrounding based on a feature based image retrieval approach which achieves fast and scalable registration. It
allows our system to superimpose virtual visual effects to the omni directional camera image. In our AR card game, users sit
around a table top display and show a card to the other players. The system recognizes it and augments it with virtual elements
in the omni directional image acting as a mirror. While playing the game, the users can interact with each other directly and
through the display. Our setup is a new, simple, and natural approach to augmented reality. It opens new doors to traditional
card games.
13:30-16:30, Paper WeBCT9.13
Enhancing SVM Active Learning for Image Retrieval using Semi-Supervised Bias-Ensemble
Wu, Jun, Dalian Maritime Univ.
Lu, Ming-Yu, Dalian Maritime Univ.
Wang, Chun-Li, Dalian Maritime Univ.
Support vector machine (SVM) based active learning technique plays a key role to alleviate the burden of labeling in relevance
feedback. However, most SVM-based active learning algorithms are challenged by the small example problem and the asymmetric
distribution problem. This paper proposes a novel active learning scheme that deals with SVM ensemble under the
semi-supervised setting to address the fist problem. For the second problem, a bias-ensemble mechanism is developed to
guide the classification model to pay more attention on the positive examples than the negative ones. An empirical study
shows that the proposed scheme is significantly more effective than some existing approaches.
13:30-16:30, Paper WeBCT9.14
Interactive Browsing of Remote JPEG 2000 Image Sequences
Garcia Ortiz, Juan Pablo, Univ. of Almeria
Ruiz, Gonzalez V., Univ. of Almeria
Garcia, I., Univ. of Almeria
Müller, D., European Space Agency/NASA
Dimitoglou, G., European Space Agency/NASA
This papers studies a novel prefetching scheme for the remote browsing of sequences of high resolution JPEG 2000 images.
Using this scheme, an user is able to select randomly any of the remote images for its analysis, repeating this process with
other images after some undefined time. Our solution has been proposed in a low bit-rate communication context where the
complete transmission of any of the images for its lossless recovery should take too much time for an interactive visualization.
For this reason, quality scalability is used in order to minimize the decoding latency. Frequently, the user can also play a
``video’’, moving sequentially on the neighbour (consecutive in time over previous or following) images of the currently
displayed one. With the objective of hiding also the link latency, the proposed data scheduler transmits in parallel data of the
- 230 -