Search:
Computing and Library Services - delivering an inspiring information environment

An algorithm to extract critical points from lattice height data

Scott, Paul J. (2001) An algorithm to extract critical points from lattice height data. International Journal of Machine Tools and Manufacture, 41 (13-14). pp. 1889-1897. ISSN 0890-6955

[img] PDF
Restricted to Registered users only

Download (82kB)

    Abstract

    The data measured on areal surface texture instruments often takes the form of height values on a discrete rectangular lattice. The definitions of critical points (peak, pit and saddle points) for this type of data is a very important issue for definitions and stable algorithms of areal texture parameters. Many of the published algorithms for critical points fail to meet some very simple topological properties which are always true for continuous data. Thus the collection of critical points produced from these published algorithms could not have come from a genuine continuous surface giving difficulties with interpretation of the results. An algorithm for critical points from lattice height data is presented which satisfies these topological properties and represents genuine features from the measured surface.

    Item Type: Article
    Additional Information: UoA 25 (General Engineering) © 2001 Elsevier Science Ltd. All rights reserved.
    Subjects: T Technology > TA Engineering (General). Civil engineering (General)
    Schools: School of Computing and Engineering
    School of Computing and Engineering > Centre for Precision Technologies
    School of Computing and Engineering > Centre for Precision Technologies > Surface Metrology Group
    Related URLs:
    References:

    [1] M. Morse, Relations between the critical points of a real function of n independent variables, Transactions of the
    American Mathematical Society 27 (1925) 345–396.
    [2] S.P. Morse, A mathematical model for the analysis of contour-line data, Journal of the Association for Computing
    Machinery 15 (2) (1968) 205–220.
    [3] M. Henle, A Combinatorial Introduction to Topology, W.H. Freeman and Company, San Francisco, 1979 Dover
    edition, first published in 1994, ISBN 0-486-67966-7.
    [4] I. Stewart, A swift trip over rugged terrain — mathematical recreations, Scientific American June (1991) 89–91.
    [5] V.A. Kovalevsky, Discrete topology and contour definition, Pattern Recognition Letters 2 (1984) 281–288.
    [6] R.S. Sayles, T.R. Thomas, Measurement of the statistical microgeometry of engineering surfaces, in: Proceedings
    of the 1st Joint Polytechnic Symposium on Manufacturing Engineering, Leicester Leicester Polytechnic, 1977.
    [7] D.J. Whitehouse, M.J. Phillips, Two-dimensional discrete properties of random surfaces, Phil. Trans. R. Soc.
    Lond. A 305 (1982) 441–468.
    [8] T.K. Peucker, D.H. Douglas, Detection of surface-specific points by local parallel processing of discrete terrain
    evaluation data, Computer Graphics and Image Processing 4 (1975) 375–385.
    [9] S. Takahashi et al., Algorithms for extracting correct critical points and constructing topological graphs from
    discrete geographical elevation data, Computer Graphics Forum 14 (3) (1995) C181–C192.
    P.J. Scott / International Journal of Machine Tools & Manufacture 41 (2001) 1889–1897 1897
    [10] I.S. Kweon, T. Kanade, Extracting topographic terrain features from elevation maps, CVGIP: Image Understanding
    59 (2) (1994) 171–182.
    [11] P.J. Scott, Foundations of topological characterization of surface texture, in: 7th International Conference on
    Metrology and Properties of Engineering Surfaces, Gothenburg, 1997.

    Depositing User: Briony Heyhoe
    Date Deposited: 04 Oct 2007
    Last Modified: 03 Dec 2010 09:44
    URI: http://eprints.hud.ac.uk/id/eprint/416

    Document Downloads

    Downloader Countries

    More statistics for this item...

    Item control for Repository Staff only:

    View Item

    University of Huddersfield, Queensgate, Huddersfield, HD1 3DH Copyright and Disclaimer All rights reserved ©