# IEE Proceedings - Vision, Image and Signal Processing

## Filter Results

Displaying Results 1 - 8 of 8
• ### Motion detection using the randomised Hough transform: exploiting gradient information and detecting multiple moving objects

Publication Year: 1996, Page(s):361 - 369
Cited by:  Papers (1)  |  Patents (1)
| | PDF (1004 KB)

An algorithm to detect one moving object using the randomised Hough transform (RHT) has previously been proposed. This new nonmodel-based method, called motion detection using randomised Hough transform (MDRHT), was shown be to applicable to translational and rotational motion detection of one moving object. The basic, earlier version of the MDRHT utilises edge points only as its features. The MDR... View full abstract»

• ### Object boundary location by region and contour deformation

Publication Year: 1996, Page(s):353 - 360
Cited by:  Papers (10)  |  Patents (2)
| | PDF (1552 KB)

Many applications in image analysis need to distinguish an object from its surroundings. The snake' method (Kass, 1987) is a well known method to solve such problems by locating the object boundary from an initial plan, but it has the limitation that the distance between the initial plan and the object boundary should be very small'. The authors present a two-step method, which combines region a... View full abstract»

• ### Balanced realisations and model reduction of periodically time-varying state-space digital filters

Publication Year: 1996, Page(s):370 - 376
Cited by:  Papers (3)
| | PDF (576 KB)

The authors discuss balanced realisations and model reduction of periodically time-varying (PTV) state-space digital filters. Controllability and observability Grammians of PTV state-space digital filters are discussed. It is extremely interesting to notice that although PTV state-space digital filters can be implemented by using a group of time-invariant coefficient sets, controllability and obse... View full abstract»

• ### Minimax design of recursive digital filters with a lattice denominator

Publication Year: 1996, Page(s):377 - 382
| | PDF (524 KB)

The authors deal with the problem of minimax recursive digital filter design with a lattice structure for the denominator. The design problem is formulated so that the coefficients for the numerator and denominator of a recursive filter can be found by solving the best linear complex Chebyshev approximation (LCCA). A design technique based on the weighted least-squares algorithm previously propose... View full abstract»

• ### Fast algorithm for pseudodiscrete Wigner-Ville distribution using moving discrete Hartley transform

Publication Year: 1996, Page(s):383 - 386
Cited by:  Papers (2)
| | PDF (424 KB)

A new fast algorithm is proposed to compute pseudodiscrete Wigner-Ville distribution (PDWVD) in real-time applications. The proposed algorithm uses the moving discrete Hartley transform to compute the Hilbert transform and thereby implements the PDWVD in real domain. The computational complexity of the proposed algorithm is derived and compared with the existing algorithm to compute the PDWVD View full abstract»

• ### Image coding by multistep, adaptive flux interpolation

Publication Year: 1996, Page(s):337 - 343
| | PDF (1124 KB)

The authors describe and discuss the new technique, multistep adaptive flux interpolation (MAFI), and its application to image data for coding. When applied to an image, MAFI produces an output which is also in an image form, but which has a more uniform feature density and a greatly reduced size. MAFI warps the input image by removing those rows and columns which contain a majority of redundant p... View full abstract»

• ### Regular implementation algorithms of time domain aliasing cancellation

Publication Year: 1996, Page(s):387 - 392
Cited by:  Papers (12)
| | PDF (616 KB)

The authors propose two highly regular algorithms for realising the time domain aliasing cancellation (TDAC) technique. The first TDAC implementation, which is based on the fast discrete cosine transform, effectively adopts analysis and synthesis window functions in the transform structure. This implementation algorithm achieves the least computational complexity in TDAC processes. The second TDAC... View full abstract»

• ### Efficient classification and codebook design for CVQ

Publication Year: 1996, Page(s):344 - 352
Cited by:  Papers (5)  |  Patents (1)
| | PDF (1972 KB)

An efficient block classification and a new codebook design algorithms for classified vector quantisation (CVQ) are presented. The classification method is particularly simple and suited for hardware or software implementation. For each nonshade block, a local threshold is computed and used to binarise the block. The binary block is then compared with a predefined set of binary edge templates to d... View full abstract»

## Aims & Scope

Published from 1994-2006, IEE Proceedings - Vision, Image and Signal Processing contained significant and original contributions on computer vision, image processing and signal processing.

Full Aims & Scope