By Topic

Vision, Image and Signal Processing, IEE Proceedings -

Issue 3 • Date Jun 1997

Filter Results

Displaying Results 1 - 9 of 9
  • Maximum a posteriori spatial probability segmentation

    Publication Year: 1997, Page(s):161 - 167
    Cited by:  Papers (5)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (860 KB)

    An image segmentation algorithm that performs pixel-by-pixel segmentation on an image with consideration of the spatial information is described. The spatial information is the joint grey level values of the pixel to be segmented and its neighbouring pixels. The conditional probability that a pixel belongs to a particular class under the condition that the spatial information has been observed is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rotated texture classification by improved iterative morphological decomposition

    Publication Year: 1997, Page(s):171 - 179
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1028 KB)

    An improved algorithm based on iterative morphological decomposition (IMD) proposed by Wang et al. (1993) is described. The proposed algorithm requires less computation than the original IMD algorithm. The improved iterative morphological decomposition (IIMD) is compared with granulometric moments, multiresolution rotation-invariant SAR (MRRISAR) models and multichannel Gabor filters. It is found ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust rotation-invariant texture classification: wavelet, Gabor filter and GMRF based schemes

    Publication Year: 1997, Page(s):180 - 188
    Cited by:  Papers (52)  |  Patents (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1476 KB)

    Three novel feature extraction schemes for texture classification are proposed. The schemes employ the wavelet transform, a circularly symmetric Gabor filter or a Gaussian Markov random field with a circular neighbour set to achieve rotation-invariant texture classification. The schemes are shown to give a high level of classification accuracy compared to most existing schemes, using both fewer fe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extracting the cliques from a neighbourhood system

    Publication Year: 1997, Page(s):168 - 170
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (264 KB)

    A method is proposed for obtaining the local clique set from a neighbourhood system. The Markov random field model, which is used extensively in image processing, is defined with respect to a neighbourhood system. The mathematical interpretation of the model is defined with respect to the corresponding clique set. A systematic method is presented for extracting the complete local clique set from a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattice filters based on the delta operator

    Publication Year: 1997, Page(s):125 - 128
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (328 KB)

    The delta operator defined by δ=(q-1)/Δ has been proposed as an alternative to the conventional shift operator q for implementing discrete-time estimation and control algorithms for processing data obtained by continuous-time processes, when the rate 1/Δ is rapid relative to the process dynamics. The authors present lattice and ladder filter structures based on the delta operator... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptation of hidden Markov model for telephone speech recognition and speaker adaptation

    Publication Year: 1997, Page(s):129 - 135
    Cited by:  Papers (1)  |  Patents (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (700 KB)

    The authors propose a channel compensation method for the hidden Markov model (HMM) parameters in automatic speech recognition. The proposed approach is to adapt the existing reference models to a new channel environment by using a small amount of adaptation data. The concept of HMM parameter adaptation by incorporating the corresponding phone-dependent channel compensation (PDCC) vectors is appli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Edge oriented block motion estimation for video coding

    Publication Year: 1997, Page(s):136 - 144
    Cited by:  Papers (21)  |  Patents (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1404 KB)

    Intensity-based block motion estimation and compensation algorithms are widely used to exploit temporal redundancies in video coding, although they suffer from several drawbacks. One of the problems is that blocks located on boundaries of moving objects are not estimated accurately. It causes poor motion-compensated prediction along the moving edges to which the human visual system is very sensiti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contour-based correspondence using Fourier descriptors

    Publication Year: 1997, Page(s):150 - 160
    Cited by:  Papers (3)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1268 KB)

    A contour correspondence problem, in which a contour is described in terms of epipolar lines of which the slope and the intercept functions are expressed as Fourier series, is addressed. The Fourier coefficients are computed via an iterative algorithm for which a condition is derived to test convergence. The contour correspondence between two images is solved based on the authors' proposition for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Properties of contour codes

    Publication Year: 1997, Page(s):145 - 149
    Cited by:  Papers (4)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (516 KB)

    Objects within a binary image are efficiently encoded by traversing their outlines to produce a string of codes each of which defines a directed line to the next point on the outline. Most commonly four or eight codes are defined because these are all that are necessary to define a move from one pixel to an adjacent pixel on a square grid. Many features of the binary objects or blobs may be extrac... View full abstract»

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