By Topic

IEE Proceedings - Vision, Image and Signal Processing

Issue 2 • Date Apr 1998

Filter Results

Displaying Results 1 - 10 of 10
  • PLiNC algorithm: pattern location in noisy contexts

    Publication Year: 1998, Page(s):109 - 115
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1288 KB)

    The problem that is addressed can be likened to that of detecting the position of a random dot leopard continually and incoherently changing its spots against a continually and also incoherently changing similar (but not stochastically identical) spotted background. An algorithm has been developed, which can locate near-rigid targets consisting of spatially separated patches presented against a ba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast codeword search technique for the encoding of variable-rate vector quantisers

    Publication Year: 1998, Page(s):103 - 108
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (624 KB)

    The authors present a fast search algorithm for the encoding of variable-rate vector quantisers (VQs). The optimal encoder for the variable-rate full-search VQs considers both the squared distance and channel index length for the search of codewords. Therefore, the existing fast search algorithms for the fixed-rate full-search VQs might not be able to effectively reduce the computational complexit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast codebook search algorithm for unconstrained vector quantisation

    Publication Year: 1998, Page(s):97 - 102
    Cited by:  Papers (2)  |  Patents (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (660 KB)

    Vector quantisation (VQ) is a well known data compression technique which maps an ordered set of real numbers into a single integer. However, it is difficult to achieve accurate compression with the use of unconstrained Voronoi VQ when the codebook level and vector dimensionality are very large, due to the extremely high real-time computational complexity involved in full codebook search. To overc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis and performance of a new class of implementation for high-order recursive digital filters

    Publication Year: 1998, Page(s):73 - 81
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (816 KB)

    The authors investigate a new class of approaches to the synthesis of high-order recursive digital filters. These are all characterised by partitioning the overall filter into a set of parallel subfilters, each of which is of moderate order. The subfilters may be any of the classical implementations: direct form, parallel, cascade or lattice. The authors investigate cascade and lattice implementat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimax design of two-channel nonuniform-division FIR filter banks

    Publication Year: 1998, Page(s):88 - 96
    Cited by:  Papers (8)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (748 KB)

    The paper deals with the minimax design of two-channel nonuniform-division filter (NDF) banks. Based on a linearisation scheme, the design problem is formulated as an optimisation problem with linear constraints. The authors present a method to design a two-channel NDF bank using a modified dual-affine scaling variant of Karmarkar's (1984) algorithm. This method provides the optimal results that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint quantisation and error diffusion of colour images using competitive learning

    Publication Year: 1998, Page(s):137 - 140
    Cited by:  Papers (1)  |  Patents (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (528 KB)

    A competitive learning scheme for colour image quantisation is elaborated, in which the dithering process to eliminate contouring effects is embedded in the quantisation process instead of performed a posteriori. Quantisation is performed by clustering in colour space. The dithering process is a simple error diffusion, in which the quantisation error made by one pixel is diffused to its local neig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Continuous quality assessment of digitally-coded television pictures

    Publication Year: 1998, Page(s):116 - 123
    Cited by:  Papers (4)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (768 KB)

    Experimental tests are reported of the use of the ITU-R single-stimulus continuous quality evaluation (SSCQE) method to measure the quality of long (24 min) sequences of digitally coded constant bit-rate video, with and without audio. The results indicate that the method is reliable and free from drift and fatigue effects. The relationship between continuously-judged quality and overall quality ju... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust sequential detectors employing an order statistic prefilter

    Publication Year: 1998, Page(s):82 - 87
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (512 KB)

    The authors propose robust detection schemes for detecting signals corrupted by additive non-Gaussian noise by employing an order statistic filter (OSF) as a preprocessor. The OSF can effectively suppress non-Gaussian noise components, but its output characteristics are not easy for mathematical manipulation due to its nonlinear operation. To alleviate the difficulty in the analytical design of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error-sensitivity assessment of vision algorithms

    Publication Year: 1998, Page(s):124 - 130
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (600 KB)

    A methodology is proposed for the computation of output-data errors from given input-data errors for a given computational precision for vision algorithms. The approach is based on replacement of the arithmetic types of the object-oriented language used for coding of the tested algorithm by structures describing the values and error models of the numbers represented. The method is useful both for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feature-directed spiral coding of magnetic resonance images

    Publication Year: 1998, Page(s):131 - 136
    Cited by:  Patents (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (672 KB)

    The authors investigate the encoding of magnetic resonance (MR) images of the human body using various lossless techniques, and presents a new form of spiral encoding. The algorithm used relies partially on the overall shape of the bounding contour of the image in achieving the compression and uses a traditional run-based technique combined with an adaptive Huffman coder to encode the complete ima... View full abstract»

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