Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 2 - Conference B: Computer Vision & Image Processing. (Cat. No.94CH3440-5)

9-13 Oct. 1994

Filter Results

Displaying Results 1 - 25 of 97
  • Proceedings of The12th lAPR International Conference on Pattern Recognition [front matter]

    Publication Year: 1994, Page(s):iii - xi
    Request permission for reuse | PDF file iconPDF (432 KB)
    Freely Available from IEEE
  • Acoustic spectral estimation using higher order statistics

    Publication Year: 1994, Page(s):1 - 5 vol.3
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (442 KB)

    Assuming an autoregressive (AR) filter model driven by a non-Gaussian white noise, we formulate a general parameter estimation problem. A maximum likelihood solution gives an AR estimate of the filter and the probability distribution function parameters for non-Gaussian input. The proposed method is optimal in the information theoretic sense, giving the most probable model for the source and filte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Projected subset least squares for robust linear prediction of speech

    Publication Year: 1994, Page(s):6 - 10 vol.3
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (565 KB)

    A projected subset least squares method is presented as a new method for robust linear prediction of speech. The proposed algorithm combines conventional principal component analysis techniques with subset least squares method to perform robust linear regression. The subset least squares is a univariate estimator which applies the generalized maximum likelihood principles to obtain a proper set of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Peak and power

    Publication Year: 1994, Page(s):11 - 14 vol.3
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (259 KB)

    The estimation of power is problematic when the amplitudes in the discrete spectral component are random. An example of this is a mixed spectrum stationary Gaussian process with mean zero. In this regard, it is shown that the maximum likelihood estimator of the power from a random sample of peaks exceeding a relatively large threshold, the peak estimator is more efficient than the sample variance ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A non-parametric minimax approach for robust speech recognition

    Publication Year: 1994, Page(s):15 - 19 vol.3
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (438 KB)

    Robust statistical procedures are studied and applied to speech recognition. The goal is to improve recognition under general nonparametric mismatch situations between training and testing conditions. Towards this end, we develop an M-hypotheses decision rule for a statistical model related to hidden Markov model. The decision rule employs two hypotheses robust likelihood ratio tests between all p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification of voiced and unvoiced speech by hierarchical stochastic modeling

    Publication Year: 1994, Page(s):20 - 24 vol.3
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (395 KB)

    In this paper, we consider the classification of speech signals by using stochastic models at different scales. The signal at different scales is modeled by a hierarchical autoregressive moving average (ARMA) model, and the features at coarse scales are extracted from the model without performing expensive filtering operation. The hierarchical modeling can increase the accuracy of speech classific... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Very low bit rate video coding using morphological segmentation and contour/texture motion compensation

    Publication Year: 1994, Page(s):25 - 29 vol.3
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (630 KB)

    This paper describes a segmentation-based coding algorithm for very low bit rate. The algorithm involves a segmentation relying on a time recursive morphological segmentation technique. It extracts both large and contrasted regions. Then, a simple region-based motion estimation is performed. Finally, the sequence is coded by contour-texture motion compensation. The proposed method leads to very lo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Videoconferencing using spatially varying sensing with multiple and moving foveae

    Publication Year: 1994, Page(s):30 - 34 vol.3
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    A new method for videoconferencing using the concept of spatially varying sensing is introduced. Various techniques are discussed for combining information obtained from multiple points-of-interest (foveae) in an image. A fovea can be used to follow a moving object of interest as well. A fast videoconferencing prototype for desktop computers is also described. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Texture coding using a Wold decomposition model

    Publication Year: 1994, Page(s):35 - 39 vol.3
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    A novel approach for coding textured images is presented. The texture field is assumed to be a realization of a regular homogeneous random field, which can have a mixed spectral distribution. On the basis of a 2D Wold-like decomposition, the field is represented as a sum of purely indeterministic, harmonic, and a countable number of evanescent fields. We present an algorithm for estimating and cod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lossless image compression algorithm using variable block size segmentation

    Publication Year: 1994, Page(s):40 - 44 vol.3
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (373 KB)

    In this paper, we present an analysis of two image characteristics which give rise to local and global redundancy in image representation. Based on this study, we propose a lossless image compression scheme which exploits both types of redundancy. The algorithm segments the image into variable size blocks and encodes them depending on characteristics exhibited by the pixels within the block. The p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unified time-sequential sampling theory for spatio-temporal signals

    Publication Year: 1994
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (107 KB)

    Summary form only given. We consider the sampling of band-limited spatio-temporal signals subject to the time-sequential constraint that only one spatial sample can be taken at a given time. The question of interest is to design an efficient sampling strategy that will minimise the required sampling rate. Signals with a finite spatial support are considered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning two-dimensional shapes using wavelet local extrema

    Publication Year: 1994, Page(s):48 - 52 vol.3
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (493 KB)

    The basic idea of the method for shape learning is presented. Each shape is hierarchically characterized with singularities (local extrema) of wavelet transform of its tangential orientation function. By taking the common structure of the singularities of two or more shapes, the common characteristics of the input shapes are obtained. Through this operation, not only the rough outline of a shape b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic algorithm approach to the configuration of wavelet packet processing tree

    Publication Year: 1994, Page(s):53 - 56 vol.3
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    The standard wavelet transform can be considered to be a subtree of a complete multiresolution binary tree, in which each branch corresponds to a decomposition step. Any subtree of this multiresolution tree which covers all leaves is a valid wavelet packet processing tree, which specifies the processing steps for a wavelet decomposition of the original data. The present paper describes an adaptati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Matching pursuit filter design

    Publication Year: 1994, Page(s):57 - 61 vol.3
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (567 KB)

    A method has been devised of using localized information to detect objects with varying signatures without prior segmentation. The detection is performed by a new class of nonlinear filters called matching pursuit filters, which are trained on multiple examples of the object of interest. Matching pursuit filters are designed through a generalization of the matching pursuit algorithm that allows fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On multiresolution image restoration

    Publication Year: 1994, Page(s):63 - 67 vol.3
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (535 KB)

    This paper argues that the correct way to use a multiresolution approach to image restoration is to coarsen the posterior distribution of the image via the renormalization group transformation (RGT). It summarises the main results on RGT and points out the difficulties with it. It proposes an alternative transformation which does not have the full properties of the RGT but which preserves the glob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A one-parametric reduced filter for image restoration

    Publication Year: 1994, Page(s):68 - 71 vol.3
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (391 KB)

    The linear algebraic restoration filters for discrete linear degradation models with additive noise are n/sup 2//spl times/n/sup 2/ matrices for n/spl times/n images in general. In this paper, a new reduced filter is derived which is realized by products of n/spl times/n matrices and for which the regularization parameter is easy to obtain. Although being computationally more economic, its restori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Bayesian framework for regularization

    Publication Year: 1994, Page(s):72 - 76 vol.3
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    Regularization looks for an interpolating function which is close to the data and also "smooth". This function is obtained by minimizing an error functional which is the weighted sum of a "fidelity term" and a "smoothness term". However, using only one set of weights does not guarantee that this function will be the MAP estimate. One has to consider all possible weights in order to find the MAP fu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized approach to projections onto convex constraint sets

    Publication Year: 1994, Page(s):77 - 81 vol.3
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (422 KB)

    A generalized algorithm is introduced to mitigate difficulties encountered in practical implementations of the conventional projections-onto-constraint-sets algorithm. The theory and framework of this new procedure are set, accompanied with an illustration from pattern recognition. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal and image reconstruction from partial Fourier phase

    Publication Year: 1994, Page(s):82 - 87 vol.3
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (473 KB)

    A novel approach to signal representation by partial Fourier phase is given. It is shown that an amplitude-dependent bit allocation method preserves most of the signal's structures. Improved reconstruction algorithms are illustrated using imprecise phase and some of the signal's statistical characteristics. A recent complementary study provides a classification algorithm based on partial phase inf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conformal mapping-based image processing: theory and applications

    Publication Year: 1994, Page(s):88 - 92 vol.3
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (714 KB)

    A conformal mapping-based face representation is presented. This face representation technique combined with an eigenface-based method extends and improves the results obtained with other eigenface algorithms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The farthest point strategy for progressive image sampling

    Publication Year: 1994, Page(s):93 - 97 vol.3
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (599 KB)

    A new method of "farthest point strategy" (FPS) for progressive image acquisition is presented. Its main advantage is in retaining its uniformity with the increased density, providing an efficient means for sparse image sampling and display. In contrast to previously presented stochastic approaches, the FPS guarantees the uniformity in a deterministic min-max sense. Within this uniformity criterio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the metric properties of discrete space-filling curves

    Publication Year: 1994, Page(s):98 - 102 vol.3
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (334 KB)

    Discrete space-filling curves are commonly used to reduce a multidimensional problem to a one-dimensional problem, and, as such, are exploited in a variety of image processing applications. The space-filling curve is essentially a linear traversal of the discrete multidimensional space. In order that this traversal be effective, the curve should preserve "locality", namely, that points close in th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of feature extraction criteria for vector field visualization

    Publication Year: 1994, Page(s):103 - 107 vol.3
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    This paper addresses the problem of the visualization of vector-valued images. It is attempted to synthesize a display matched to the capabilities of a human observer. The problem is reduced to the extraction of the best linear feature of the vector field. Several new nonparametric feature extraction criteria (projection indices) that make use of both the spatial and multivariate structures of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A computer implementation of psychoacoustic grouping rules

    Publication Year: 1994, Page(s):108 - 112 vol.3
    Cited by:  Papers (7)  |  Patents (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (555 KB)

    We are building a computer model of sound organization and understanding in human listeners. In particular, we would like to be able to detect and locate acoustic events that will be perceived as separate objects. Our model aims to duplicate this aspect of the auditory system although the level of correspondence is speculative given our current state of knowledge. We describe an implementation of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Primary segmentation of auditory scenes

    Publication Year: 1994, Page(s):113 - 117 vol.3
    Cited by:  Papers (2)  |  Patents (23)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (609 KB)

    This work addresses the problem of separation of a complex auditory scene by humans, a process which is known as auditory scene analysis. From hierarchal point of view, auditory scene analysis can be described as grouping of auditory entities of one level to form entities of higher level of representation. One of the main difficulties in describing this hierarchal construct is to describe the firs... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.