Abstract book (pdf) - ICPR 2010

13:30-16:30, Paper ThBCT9.12
Image Inpainting based on Local Optimisation
Zhou, Jun, National ICT Australia
Robles-Kelly, Antonio, National ICT Australia
In this paper, we tackle the problem of image in painting which aims at removing objects from an image or repairing damaged
pictures by replacing the missing regions using the information in the rest of the scene. The image in painting method
proposed here builds on an exemplar-based perspective so as to improve the local consistency of the in painted region.
This is done by selecting the optimal patch which maximises the local consistency with respect to abutting candidate
patches. The similarity computation generates weights based upon an edge prior and the structural differences between in
painting exemplar candidates. This treatment permits the generation of an in painting sequence based on a list of factors.
The experiments show that the proposed method delivers a margin of improvement as compared to alternative methods.
13:30-16:30, Paper ThBCT9.13
Image Processing based Approach for Retrieving Data from a Seismic Section in Bitmap Format
Chevion, Dan, IBM Res. Lab. in Haifa
Navon, Yaakov, IBM
Ramm, Dov, former Res. stuff member of IBM Israel Res. Lab.
A new method for retrieving seismic data from a seismic section provided in a bitmap format is described. The method is
based on image processing techniques and includes creating a grey level image of a seismic section, processing the grey
level image (by integration, filtering, etc.) and then reconstructing digitized values of individual seismic traces_ from the
resulting image, thus ending with the data in standard SEG-Y format
13:30-16:30, Paper ThBCT9.14
Visible Entropy: A Measure for Image Visibility
Hou, Zujun, Inst. for Infocomm Res.
Yau, Wei-Yun, Inst. for Infocomm Res.
Image visibility is a fundamental issue in the field of computer vision. This paper investigates the connection between
histogram and image visibility, where the concept of entropy is employed to depict the information content of the histogram.
It turns out that image visibility is more dependent on the observed intensity levels with higher frequencies and the distribution
of their locations in the range of intensity levels. With this in mind, the concept of visible entropy is proposed. The
usefulness of the proposed visibility measure has been evaluated using a number of realistic images.
13:30-16:30, Paper ThBCT9.15
Research the Performance of a Recursive Algorithm of the Local Discrete Wavelet Transform
Kopenkov, Vasiliy, RAS
Myasnikov, Vladislav, RAS
We experimentally compare the performance of two fast algorithms for computing the local discrete wavelet transform of
one-dimensional signals: the Mallatalgorithm and a recursive algorithm. For the comparison purposes, we analyze Haar
wavelet bases for one and two-dimensional signals, an extension of the Haar basis with the scale coefficient 3, and biorthogonal
polynomial spline wavelets with finite support.
13:30-16:30, Paper ThBCT9.16
Auditory Features Revisited for Robust Speech Recognition
Harte, Naomi, Trinity Coll. Dublin
Kelly, Finnian, Trinity Coll. Dublin
Auditory based front-ends for speech recognition have been compared before, but this paper focuses on two of the most
promising algorithms for noise robustness in automatic speech recognition (ASR). The feature sets are Zero-Crossings
with Peak Amplitudes (ZCPA) and the recently introduced Power-Law Nonlinearity and Power-Bias Subtraction (PNCC).
Standard Mel-Frequency Cepstral Coefficients (MFCC) are also tested for reference. The performance of all features is
reported on the TIMIT database using a HMM-based recogniser. It is found that the PNCC features outperform MFCC in
- 317 -