By Topic

IEE Proceedings - Vision, Image and Signal Processing

Issue 1 • Date Feb 2001

Filter Results

Displaying Results 1 - 11 of 11
  • Global convergence and mixing parameter selection in the cross-correlation constant modulus algorithm for the multi-user environment

    Publication Year: 2001, Page(s):9 - 20
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (804 KB)

    Surface topography of the mixed cross-correlation and constant modulus algorithm (CC-CMA) is undertaken to provide a suitable range for the mixing parameter to avoid ill-convergence. Previous work indicated that the mixing parameter k should be chosen to be greater than 4/3, but this result was based upon an assumption of perfect equalisation of previous equaliser outputs. The authors relax this p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Second-order adaptive Volterra system identification based on discrete nonlinear Wiener model

    Publication Year: 2001, Page(s):21 - 29
    Cited by:  Papers (7)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (744 KB)

    The authors present the nonlinear LMS adaptive filtering algorithm based on the discrete nonlinear Wiener (1942) model for second-order Volterra system identification application. The main approach is to perform a complete orthogonalisation procedure on the truncated Volterra series. This allows the use of the LMS adaptive linear filtering algorithm for calculating all the coefficients with effici... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VQ-agglomeration: a novel approach to clustering

    Publication Year: 2001, Page(s):36 - 44
    Cited by:  Papers (6)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (860 KB)

    A novel approach called `VQ-agglomeration' capable of performing fast and autonomous clustering is presented. The approach involves a vector quantisation (VQ) process followed by an agglomeration algorithm that treats codewords as initial prototypes. Each codeword is associated with a gravisphere that has a well defined attraction radius. The agglomeration algorithm requires that each codeword be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Retrieval of symmetrical image blur using zero sheets

    Publication Year: 2001, Page(s):65 - 69
    Cited by:  Papers (3)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (768 KB)

    The analytically continued Fourier transform of a two-dimensional image vanishes to zero on a two-dimensional surface embedded in a four-dimensional space. This surface uniquely characteristics the image and is known as a `zero sheet'. Since the manipulation of a function in four-dimensional space is cumbersome, the projections of zero sheets, known as `zero tracks' are calculated. This knowledge ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New algorithm for r-dimensional DCT-II

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

    The paper shows that the type-II r-dimensional discrete cosine transform (rD-DCT-II) of size ql1×ql2x...xq l1, where r>1 and q is an odd prime number, can be converted into a series of one-dimensional reduced DCT-IIs by using the polynomial transform. The number of multiplications for computing an rD-DCT-II is significantly reduced compared to that needed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structuring element decomposition for efficient implementation of morphological filters

    Publication Year: 2001, Page(s):31 - 35
    Cited by:  Papers (3)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (376 KB)

    In order to implement morphological filters on image processing systems. The size of the structuring element must be small due to the architectural constraints of the systems. The decomposition of the structuring element is required for filters with large structuring elements. An algorithm for the decomposition of an arbitrary 4-connected binary structuring element is developed which enables sub-o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • One-pass parallel hexagonal thinning algorithm

    Publication Year: 2001, Page(s):45 - 53
    Cited by:  Papers (8)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (820 KB)

    A comparison between two fully parallel thinning algorithms designed for images sampled on the square and hexagonal grids is reported. Using techniques from mathematical morphology, a hexagonal algorithm has been designed to closely match the operation of a well known square grid algorithm. Proofs of the connectivity and the single pixel limb width of the resulting converged hexagonal skeleton hav... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-camera parameter tracking

    Publication Year: 2001, Page(s):70 - 77
    Cited by:  Papers (2)  |  Patents (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1088 KB)

    The quality of 3-D reconstructions with multi-camera acquisition systems is strongly influenced by the accuracy of the camera calibration procedure. In fact, when acquiring a long sequence of views, mechanical shocks, vibrations and thermal gradients could cause a significant drift of the camera parameters. The authors propose a method for tracking the camera parameters and, whenever possible, cor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Turbo code protection of video watermark channel

    Publication Year: 2001, Page(s):54 - 58
    Cited by:  Papers (5)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (436 KB)

    The operational capacity of a watermark data channel is deduced by examining the correlation distribution at the retrieval end of a spread-spectrum-based watermarking system. This enables capacity to be determined given MPEG-2 compression, geometric attack, visual thresholds and channel coding. Watermarking itself is carried out in the DCT domain using video-dependent and visual perception concept... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vision-based road-traffic monitoring sensor

    Publication Year: 2001, Page(s):78 - 84
    Cited by:  Papers (15)  |  Patents (7)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (684 KB)

    Current techniques for road-traffic monitoring rely on sensors that have limited capabilities and are often both costly and disruptive to install. The use of video cameras (many of which are already installed to survey road networks), coupled with computer vision techniques, offers an attractive alternative to current sensors. Vision-based sensors have the potential to measure a greater variety of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error resilient transmission of SPIHT coded images over fading channels

    Publication Year: 2001, Page(s):59 - 64
    Cited by:  Papers (4)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (528 KB)

    The paper introduces a method of transmitting error resilient SPIHT coded images over highly error prone Rayleigh fading channels. First, the source significance of the SPIHT coded output is obtained. Based on the significance of the bits, the channel coding is varied accordingly. Channel coding consists of a mixture of rate compatible punctured convolutional (RCPC) codes and interleaving to comba... View full abstract»

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