ASTM D5714-95(2002)
(Specification)Standard Specification for Content of Digital Geospatial Metadata (Withdrawn 2011)
Standard Specification for Content of Digital Geospatial Metadata (Withdrawn 2011)
SCOPE
1.1 This specification covers the information content of metadata for a set of digital geospatial data. This specification provides a common set of terminology and definitions for concepts related to these metadata.
1.2 The use of the term "geographic information system" and its definition in this specification is not intended to introduce a standard definition.
1.3 This specification covers minimum content and processing requirements for geospatial metadata.
1.4 There are at least three categories of use for geospatial metadata: (1) to accompany data transfers as documentation, (2) internal, on-line documentation of processing steps and data lineage, and (3) as stand-alone data set synopses for use by spatial data catalogs, indexes, and referral services.
WITHDRAWN RATIONALE
This specification covers the information content of metadata for a set of digital geospatial data. This specification provides a common set of terminology and definitions for concepts related to these metadata.
Formerly under the jurisdiction of Committee D18 on Soil and Rock, this specification was withdrawn in 2011 in accordance with section 10.5.3.1 of the Regulations Governing ASTM Technical Committees, which requires that standards shall be updated by the end of the eighth year since the last approval date.
General Information
Relations
Standards Content (Sample)
NOTICE: This standard has either been superseded and replaced by a new version or withdrawn.
Contact ASTM International (www.astm.org) for the latest information
Designation: D5714 – 95 (Reapproved 2002)
Standard Specification for
Content of Digital Geospatial Metadata
This standard is issued under the fixed designation D5714; the number immediately following the designation indicates the year of
original adoption or, in the case of revision, the year of last revision.Anumber in parentheses indicates the year of last reapproval.A
superscript epsilon (´) indicates an editorial change since the last revision or reapproval.
1. Scope MIL-A-89007 Military SpecificationARC Digitized Raster
Graphics (ADRG)
1.1 This specification covers the information content of
metadata for a set of digital geospatial data. This specification
3. Terminology
provides a common set of terminology and definitions for
3.1 abscissa—the coordinate of a point in a plane cartesian
concepts related to these metadata.
coordinate system obtained by measuring parallel to the x-axis
1.2 The use of the term “geographic information system”
(“the 8x’ value”).
and its definition in this specification is not intended to
3.2 accuracy—the degree of conformity of a measured or
introduce a standard definition.
calculated value to some recognized standard or specified
1.3 Thisspecificationcoversminimumcontentandprocess-
value. This concept involves the systematic and random error
ing requirements for geospatial metadata.
of an operation.
1.4 There are at least three categories of use for geospatial
3.3 altitude—elevation above or below a reference datum,
metadata: (1) to accompany data transfers as documentation,
as defined in Federal Information Processing Standard70-1.
(2) internal, on-line documentation of processing steps and
See also elevation.
datalineage,and(3)asstand-alonedatasetsynopsesforuseby
3.4 area—a generic term for a bounded, continuous, two-
spatial data catalogs, indexes, and referral services.
dimensional object that may or may not include its boundary.
2. Referenced Documents 3.5 area chain—a chain that explicitly references left and
right polygons and not start and end nodes. It is a component
2.1 ANSI Standards:
of a two-dimensional manifold.
ANSI X3.51 Representations of Universal Time, Local
3.6 area point—a representative point within an area usu-
Time Differentials, and United States Time Zone Refer-
ally carrying attribute information about that area.
ence for Information Interchange
3.7 attribute—a defined characteristic of an entity type (for
ANSI X3.30 Representation for Calendar Date and Ordinal
example, composition).
Date for Information Interchange
3.8 attribute value—a specific quality or quantity assigned
ANSI Z39.50 Information Retrieval Service Protocol for
to an attribute (for example, steel), for a specific entity
Open Systems Interconnection
instance.
2.2 SDTS Standard:
3.9 chain—a directed non-branching sequence of non-
Federal Information Processing Standard 173 in SDTS
3 intersecting line segments or arcs bounded by nodes, or both,
70-1
not necessarily distinct, at each end. Area chain, complete
2.3 Military Standards:
4 chain, and network chain are special cases of chain, and share
MIL-STD-600006 Vector Product Format
all characteristics of the general case as defined above.
3.10 complete chain—a chain that explicitly references left
and right polygons and start and end nodes. It is a component
This specification is under the jurisdiction of ASTM Committee D18 on Soil
of a two-dimensional manifold.
and Rock and is the direct responsibility of Subcommittee D18.01 on Surface and
Subsurface Characterization.
3.11 compound element—a group of data elements and
Current edition approved April 15, 1995. Published January 1996. DOI:
other compound elements. Compound elements represent
10.1520/D5714-95R02.
2 higher-level concepts that cannot be represented by individual
Available from American National Standards Institute, 11 W. 42nd St., 13th
data elements.
Floor, New York, NY 10036.
Available from Spatial Data Transfer Standard, Washington Department of
3.12 coordinates—pairs of numbers expressing horizontal
Commerce NIST, 11 W. 42nd St., 13th Floor, New York, NY 10036. (Supportive
distances along orthogonal axes; alternatively, triplets of num-
Terminology)
bers measuring horizontal and vertical distances.
AvailablefromStandardizationDocumentsOrderDesk,Bldg.4SectionD,700
Robbins Ave., Philadelphia, PA 19111-5094, Attn: NPODS. 3.13 data element—a logically primitive item of data.
Copyright © ASTM International, 100 Barr Harbor Drive, PO Box C700, West Conshohocken, PA 19428-2959, United States.
D5714 – 95 (2002)
3.14 data set—a file or files that contain related geometric 3.30 grid—(1)asetofgridcellsformingaregular,ornearly
and attribute information; a collection of related data. regular, tessellation of a surface; (2) a set of points arrayed in
a pattern that forms a regular, or nearly regular, tesselation of
3.15 depth—perpendicular distance of an interior point
a surface.The tessellation is regular if formed by repeating the
from the surface of an object.
pattern of a regular polygon, such as a square, equilateral
3.16 developable surface—a surface that can be flattened to
triangle, or regular hexagon. The tessellation is nearly regular
form a plane without compressing or stretching any part of it.
if formed by repeating the pattern of an“ almost” regular
Examples include cones and cylinders.
polygon such as a rectangle, non-square parallelogram, or
3.17 digital image—a two-dimensional array of regularly
non-equilateral triangle.
spaced picture elements (pixels) constituting a picture.
3.31 grid cell—atwo-dimensionalobjectthatrepresentsthe
3.18 digital volume—a three-dimensional array of regularly
smallest non-divisible element of a grid.
spaced volume elements (voxels) constituting a volume.
3.32 GT-polygon—an area that is an atomic two-
3.19 domain—in the definition of the elements in this
dimensional component of one and only one two-dimensional
specification, the domain identifies valid values for a data
manifold. The boundary of a GT-polygon may be defined by
element.
GT-rings created from its bounding chains.AGT-polygon may
3.20 elevation—conforming to Federal Information Pro-
also be associated with its chains (either the bounding set, or
cessing Standard70-1, the term “altitude” is used in this
the complete set) by direct reference to these chains. The
specification, rather than the common term elevation.
complete set of chains associated with a GT-polygon may also
3.21 entity instance—a spatial phenomenon of a defined
be found by examining the polygon references on the chains.
type that is embedded in one or more phenomena of different
3.33 GT-ring—a ring created from complete or area chains,
type, or that has at least one key attribute value different from
or both.
the corresponding attribute values of surrounding phenomena
3.34 horizontal—tangent to the geoid or parallel to a plane
(for example, the 10th Street Bridge).
that is tangent to the geoid.
3.22 entity point—a point used for identifying the location
3.35 implicit position—methodofidentifyingpositionsbya
ofpointfeatures(orarealfeaturescollapsedtoapoint),suchas
place in an array of values.
towers, buoys, buildings, places, etc.
3.36 interior area—an area not including its boundary.
3.23 entity type—the definition and description of a set into
3.37 label point—a reference point used for displaying map
which similar entity instances are classified (for example,
and chart text (for example, feature names) to assist in feature
bridge).
identification.
3.24 explicit position—method of identifying positions di-
3.38 layer—an integrated, areally distributed, set of spatial
rectly by pairs (for horizontal positions) or triplets (for hori-
data usually representing entity instances within one theme, or
zontal and vertical positions) of numbers.
having one common attribute or attribute value in an associa-
3.25 G-polygon—an area consisting of an interior area, one
tion of spatial objects. In the context of raster data, a layer is
outer G-ring and zero or more nonintersecting, non-nested
specificallyatwo-dimensionalarrayofscalervaluesassociated
innerG-rings.Noring,innerorouter,shallbecollinearwithor
with all or part of a grid or image.
intersect any other ring of the same G-polygon.
3.39 line segment—a direct line between two points.
3.26 G-ring—a ring created from strings or arcs, or both.
3.40 link—a topological connection between two nodes. A
3.27 geoid—amathematicalrepresentationofthesurfaceof
link may be directed by ordering its nodes.
the earth accounting for local geodetic and gravity measure-
3.41 media—the physical devices used to record, store, or
ments.
transmit data, or combination thereof.
3.28 geospatial data—information that identifies the geo-
3.42 metadata—data about the content, quality, condition,
graphic location and characteristics of natural or constructed
and other characteristics of data.
features and boundaries on the earth. This information may be
3.43 network—a graph without two-dimensional objects. If
derived from, among other things, remote sensing, mapping,
projected onto a two-dimensional surface, a network can have
and surveying technologies.
either more than one node at a point or intersecting links or
3.29 graph—a set of topologically interrelated zero-
chains, or both, without corresponding nodes.
dimensional (node), one-dimensional (link or chain), and
3.44 network chain—a chain that explicitly references start
sometimes two-dimensional (GT-polygon) objects that con-
and end nodes and not left and right polygons. It is a
form to a set of defined constraint rules. Numerous rule sets
component of a network.
canbeusedtodistinguishdifferenttypesofgraphs.Threesuch
3.45 node—a zero-dimensional object that is a topological
types, planar graph, network, and two-dimensional manifold,
junction of two or more links or chains, or an end point of a
are used in this specification. All three share the following
link or chain.
rules: each link or chain is bounded by an ordered pair of
3.46 object—a digital representation of all or part of an
nodes, not necessarily distinct; a node may bound one or more
entity instance.
linksorchains;andlinksorchainsmayonlyintersectatnodes.
Planar graphs and networks are two specialized types of 3.47 ordinate—thecoordinateofapointinaplanecartesian
graphs, and a two-dimensional manifold is an even more coordinate system obtained by measuring parallel to the y-axis
specific type of planar graph. (“the 8y’ value”).
D5714 – 95 (2002)
3.48 phenomenon—a fact, occurrence, or circumstance. 3.64 two-dimensional manifold—a planar graph and its
Route 10, George Washington National Forest, and Chester- associated two-dimensional objects. Each chain bounds two
field County are all phenomena. and only two, not necessarily distinct, GT-polygons. The
GT-polygons are mutually exclusive and completely exhaust
3.49 pixel—two-dimensional picture element that is the
the surface.
smallest non-divisible element of a digital image.
3.65 type—in the definition of the elements in the metadata
3.50 planar graph—the node and link or chain objects of
standard, a compound element has the type “compound” to
the graph occur or can be represented as though they occur
provide a unique way to identify compound elements. For a
uponaplanarsurface.Notmorethanonenodemayexistatany
data element, the type identifies the kind of value that can be
given point on the surface. Links or chains may only intersect
assigned to the data element. The choices are “integer” for
at nodes.
integer numbers, “real” for real numbers, “text” for ASCII
3.51 point—a zero-dimensional object that specifies geo-
characters,“date”fordayoftheyear,and“time”fortimeofthe
metric location. One coordinate pair or triplet specifies the
day.
location. Area point, entity point, and label point are special
3.66 universe polygon—defines the part of the universe that
implementations of the general case.
is outside the perimeter of the area covered by other GT-
3.52 primitive—thequalityofnotbeingsubdivided;atomic.
polygons (“covered area”) and completes the two-dimensional
3.53 processing step—a discrete unit of processing that
manifold. This polygon completes the adjacency relationships
affects either the data or metadata in a data set.
oftheperimeterlinks.Theboundaryoftheuniversepolygonis
3.53.1 Discussion—DifferentGISsmaydiscretizeprocesses
represented by one or more inner rings and no outer ring.
differently, and so the definition of processing step depends
Attribution of the universe polygon may not exist, or may be
somewhatontheparticularGIS.Processingstepsshallinclude
substantially different from the attribution of the covered area.
allstepsfollowedtoautomatethedataset,suchasdigitizingor
3.67 vector—composed of directed lines.
scanning. Processing steps shall also include data-set reviews.
3.68 vertical—at right angles to the horizontal; includes
Adata set review typically will not alter the basic data, but the
altitude and depth.
review with its results should be documented in the metadata.
3.69 VPF—the vector product format (see 2.3).
3.54 quality—an essential or distinguishing characteristic
3.70 void polygon—defines a part of the two-dimensional
necessary for cartographic data to be fit for use.
manifold that is bounded by other GT-polygons, but otherwise
3.55 raster—one or more overlapping layers for the same
has the same characteristics as the universe polygon. The
grid or digital image.
geometry and topology of a void polygon are those of a
3.56 raster object—one or more images or grids, or both,
GT-polygon. Attribution of a void polygon may not exist, or
each grid or image representing a layer, such that correspond-
may be substantially different from the attribution of the
ing grid cells or pixels, or both, between layers are congruent
covered area.
and registered.
3.71 voxel—athree-dimensionalelementthatisthesmallest
3.57 resolution—the minimum difference between two in-
non-divisible element of a digital volume.
dependently measured or computed values which can be
3.72 Definitions—These definitions are provided to clarify
distinguished by the measurement or analytical method being
terms used in this specification. Definitions are from SDTS,
considered or used.
FIPS 173.
3.58 ring—sequence of nonintersecting chains or strings or
arcs,orboth,withclosure.Aringrepresentsaclosedboundary 4. Data Element Description
but not the interior area inside the closed boundary.
4.1 Adata element is a logically primitive item of data.The
3.59 schema—the definition of table columns, relations,
entryforadataelementincludesthenameofthedataelement,
data, Domain, and other elements of a data base, often
the definition of the data element, a description of the values
illustrated using an entity-relationship
...
Questions, Comments and Discussion
Ask us and Technical Secretary will try to provide an answer. You can facilitate discussion about the standard in here.