Algorithmic Complexity, SPeed and Architectural Parallelism in Low data-rate Visual Communications


Martinez, K. and Pearson, D. E. (1985) Algorithmic Complexity, SPeed and Architectural Parallelism in Low data-rate Visual Communications. UNSPECIFIED IEE/IERE, 185-191.

Download

Full text not available from this repository.

Description/Abstract

Consideration is given to the tradeoff between algorithmic complexity and processing speed in primitive extraction for low data-rate visual communication. Initial experiments with serially-implemented algorithms on an MC68000 processor indicated the need for a high degree of parallelism in order to meet the requirements of real-time, moving-picture data rates. However, insight gained by trials on CLIP4, which typically showed speed gains of 40%, points to window-based architectures implemented using look-up tables.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Web & Internet Science
ePrint ID: 256303
Date Deposited: 04 Feb 2002
Last Modified: 27 Mar 2014 19:58
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/256303

Actions (login required)

View Item View Item