Logo GISdevelopment.net

GISdevelopment > Proceedings > ACRS > 1995


1989 | 1990 | 1991 | 1992 | 1994 | 1995 | 1996 | 1997 | 1998 | 1999 | 2000 | 2002
Sessions

Plenary Session

Forest / Vegetation Mapping

Agriculture/Soil

Mapping from Space

Water / Marine Resources

Disital Image Processing

Global / Regional Change Study

Land Degradation

Workshop on Education and Traning

Workshop on Spatial Information Processing

Poster Sessions
  • Poster Session 1
  • Poster Session 2
  • Poster Session 3
  • Poster Session 4



  • ACRS 1995


    Digital Image Processing

    Printer Friendly Format

    Page 1 of 2
    | Next |

    Adaptive Cubic Convolution Of High Resolution Remotely Sensed Image Data

    Raveentheran Suntheralingam
    Sime Darby Systems, Wisma Sime Darby
    Jalan Raja Laut, 50490 Kuala Lumpur, Malaysia
    E-mail: rsl@sds.po.my

    Abstract
    Cubic convolution of high resolution Airborne Thematic Mapper (ATM) images usually result in overshoot artefacts that are created on either side of boundaries or edges between spectrally different entities. The severity of these artefacts has previously been minimised by applying hybrid techniques that involve resampling by nearest neighbour assignment across edges, and cubic convolution in other regions of the image.

    It is suggested that a form of cubic convolution that modifies its a and b parameters across an edge can be used to resample A TM images. In this scheme, an edge within a cross-section of an A TM image is firstly identified. Values of a and b that generate resampled grey level values obtained by nearest neighbour assignment are evaluated for each pixel across the edge. Experimental results are used to show that linear relationships exist between a and b for each pixel across the selected edge, suggesting that this adaptive cubic convolution scheme can be used to resample edges in A TM images.

    I. Introduction
    In most remote sensing applications, images are frequently resampled and subsequently interpolated by the nearest neighbour assignment, bilinear interpolation or cubic convolution resampling techniques. Each of these resampling schemes generate artefacts and introduce a characteristic comlption into the resampled image. Nearest neighbour assignment, for example, tends to degrade the structure of the image, but is particularly useful for resampling edges. Cubic convolution introduces overshoots at image edges, but depending on its parameters, can geoorate acceptable resampled images.

    It is desirable to resample edges in high resolution images by cubic convolution without creating any overshoots. One approach is to use different interpolators to resample across an edge Devereux et al. 1989]. This hybrid form of resampling can, for example, use nearest neighbour assignment to resample across edges thereby eliminating overshoot artefacts, and cubic convolution to resample other regions in the image. However if the cubic convolution function can be made to preserve grey level values across edges in the same way as nearest neighbour assignment, it would not be necessary to use hybrid schemes to resample A TM images. In this paper, it will be shown that cubic convolution parameters that do not generate overshoot can be evaluated thereby suggesting that an adaptive form of cubic convolution that uses different parameters can be used to resample across edges. This paper is organised as follows. The relationship between cubic convolution parameters, and the resulting overshoots is presented in section 2. Estimation of these parameters that generate minimal overshoot is outlined in section 3. Conclusions are drawn in section 4.

    2 Analysis of Overshoots Generated by Cubic convolution
    Cubic convolution calculates resampled pixel grey level values from sets of sixteen neighbouring pixels in the original image (four along the x-direction) by using a reconstruction kernel that was expressed by Reichenbach and Park [1989] as,


    where

    Here, the value of the first derivative of the kernel, and the value of the kernel at I are represented by the a. and paramete respectively .The cubic convolution function is continuous and symmetrical, and satisfies the concavity conditions of being concave upward at x = 0, and concave downward at I x = I when -3 < a. < 0 (with 13 = 0) (Bernstein 1976]. A severe shortcoming of cubic convolution however, is its tendency to create overshoots on either side of resampled edges. Previous work on cubic convolution by Keys (1981], Park and Schowengerdt (1983], and Mitchell and Netravali (1988] showed that the magnitude of these artefacts and quality of resampled low resolution images clearly depended on the values of a. and 13.

    It is desirable to establish the relationship between a. and 13, and the magnitude of overshoot that it generates in order to develop a cubic convolution scheme that minimises the severity of these artefacts. This relationship is best illustrated by unifomlly resampling one-dimensional arrays of integers representing grey level values of selected cross-sections of test or real image data. Subtle changes in resampled grey level values, which would otherwise be unnoticeable in resampled images can be easily observed. Results presented in this section are based on resampling a synthetic edge comprising 24 integers with values { 50, 50, 50, 50, 50, 200, 200, 200, 200,200, 185, 170, 155, 140, 125, 110, 95, 80,65, 50, 50, 50, 50, 50 }. These integer values were deliberately selected to represent the steep edge and gradual variations in grey level values found in remotely sensed images. The test data set was resampled at 25 equally spaced intervals for a range of a. and 13 values. Percentage overshoot generated at specific pixel positions around the steep edge in the resampled test data set were calculated as~where q and p denotes pixel grey level values before and after resampling respectively .

    The percentage overshoot generated at pixel position 3 (with q = 50) for a range of values of a. (with 13 kept constant) is illustrated in figure I. It can be seen that percentage overshoot at pixel position 3 increases linearly with a., and that there exists several values of a. and 13 which do not generate any overshoot. Sets of 0. and 13 values that generate zero percentage overshoot at pixel position 3 were used to resample the original test data set at 25 equally spaced intervals. Figure 2 shows the grey level values generated between pixel positions 2 and 6 for these combinations of a. and 13 values. It can be seen that overshoots are not found at pixel position 3 for the different values of a. and 13 that were used. However a large range of grey level values are observed at pixel position 4. Smaller variations of grey level values are noted at pixel position 5.


    Figure 1: Plot of percentage overshoot at pixel position 3. Values of @ and @ that generate zero percentage overshoot can be found.


    Figure: 2 Plot of grey level values for @ and @ that generate zero percentage overshoot at pixel position 3. A large range of grey level values are observed at pixel position 4. Smaller variations of grey level values occur at pixel position 5.

    It has been shown that specific values of a. and 13 can be found to minimise overshoot or undershoot at certain pixel positions. This is achieved however at the expense of excessive smoothing or poor reconstruction generated at other pixel positions. These results also suggest that cubic convolution at specific pixels on either side of edges can be achieved without generating any overshoot at the particular pixel if appropriate values of a. and 13 can be found. Consequently, it would seem that if a. and 13 can be appropriately modified across the edge, cubic convolution can be applied to resample edges without generating any overshoot or undershoot.

    Page 1 of 2
    | Next |

    Applications | Technology | Policy | History | News | Tenders | Events | Interviews | Career | Companies | Country Pages | Books | Publications | Education | Glossary | Tutorials | Downloads | Site Map | Subscribe | GIS@development Magazine | Updates | Guest Book