The University of Southampton
University of Southampton Institutional Repository

Super-resolution target mapping from soft classified remotely sensed imagery

Super-resolution target mapping from soft classified remotely sensed imagery
Super-resolution target mapping from soft classified remotely sensed imagery
A simple, efficient algorithm is presented for super-resolution target mapping from remotely sensed images. Following an initial random allocation of pixel proportions to binary 'hard' sub-pixel classes, the algorithm works in a series of iterations, each of which contains two stages. For each iteration, a distance weighted function of neighbouring pixels is computed for all sub-pixels. Then, on a pixel-by-pixel basis, the '1' with the minimum value of the function is swapped with the '0' with the maximum value of the function, if the swap results in an increase in some objective function. The algorithm is demonstrated to work reasonably well with simple images, opening the way for further research to explore the algorithm, to extend the algorithm to multiple classes and to develop more efficient, but equally simple algorithms.
GeoComputation
Atkinson, P.M.
96e96579-56fe-424d-a21c-17b6eed13b0b
Abrahart, R.J.
Carlisle, B.H.
Atkinson, P.M.
96e96579-56fe-424d-a21c-17b6eed13b0b
Abrahart, R.J.
Carlisle, B.H.

Atkinson, P.M. (2001) Super-resolution target mapping from soft classified remotely sensed imagery. Abrahart, R.J. and Carlisle, B.H. (eds.) In Proceedings of the 5th International Conference on GeoComputation. GeoComputation..

Record type: Conference or Workshop Item (Paper)

Abstract

A simple, efficient algorithm is presented for super-resolution target mapping from remotely sensed images. Following an initial random allocation of pixel proportions to binary 'hard' sub-pixel classes, the algorithm works in a series of iterations, each of which contains two stages. For each iteration, a distance weighted function of neighbouring pixels is computed for all sub-pixels. Then, on a pixel-by-pixel basis, the '1' with the minimum value of the function is swapped with the '0' with the maximum value of the function, if the swap results in an increase in some objective function. The algorithm is demonstrated to work reasonably well with simple images, opening the way for further research to explore the algorithm, to extend the algorithm to multiple classes and to develop more efficient, but equally simple algorithms.

This record has no associated files available for download.

More information

Published date: 2001
Additional Information: CD-Rom
Venue - Dates: 5th International Conference on GeoComputation, University of Greenwich, London, United Kingdom, 2000-08-23 - 2000-08-25

Identifiers

Local EPrints ID: 15694
URI: http://eprints.soton.ac.uk/id/eprint/15694
PURE UUID: 36617a1f-f1db-4f00-aee9-9d3ca3ca661b
ORCID for P.M. Atkinson: ORCID iD orcid.org/0000-0002-5489-6880

Catalogue record

Date deposited: 25 May 2005
Last modified: 20 Feb 2024 02:34

Export record

Contributors

Author: P.M. Atkinson ORCID iD
Editor: R.J. Abrahart
Editor: B.H. Carlisle

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×