Geology ReportsSearch

USGS · 70026878

An automated approach to mapping corn from Landsat imagery

Abstract

Most land cover maps generated from Landsat imagery involve classification of a wide variety of land cover types, whereas some studies may only need spatial information on a single cover type. For example, we required a map of corn in order to estimate exposure to agricultural chemicals for an environmental epidemiology study. Traditional classification techniques, which require the collection and processing of costly ground reference data, were not feasible for our application because of the large number of images to be analyzed. We present a new method that has the potential to automate the classification of corn from Landsat satellite imagery, resulting in a more timely product for applications covering large geographical regions. Our approach uses readily available agricultural areal estimates to enable automation of the classification process resulting in a map identifying land cover as ‘highly likely corn,’ ‘likely corn’ or ‘unlikely corn.’ To demonstrate the feasibility of this approach, we produced a map consisting of the three corn likelihood classes using a Landsat image in south central Nebraska. Overall classification accuracy of the map was 92.2% when compared to ground reference data.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S.K. Maxwell, J.R. Nuckols, M.H. Ward, R.M. Hoffer. 2004. An automated approach to mapping corn from Landsat imagery. https://doi.org/10.1016/j.compag.2003.09.001

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related USGS reports

Fish body midline segmentation using binary search

Body and caudal fin locomotion is ubiquitous in aquatic vertebrates, and kinematic models describing it are used in robotics, biomechanics and fisheries research. This paper presents a new algorithm to translate continuous body midlines of fish into a series of interconnected segments by identifying favorable joint positions along the body. The algorithm employs binary search to generate parsimonious kinematic models, aiming at minimizing the number of segments yet keeping approximation error below a user-defined threshold. To achieve this, the algorithm maximizes the length of each segment by determining the most distal joint position through repetitive shrinking of the search space. Theoretical and empirical analysis using two different datasets show that the binary search algorithm is substantially faster when compared to segment growing algorithm, which employs linear search to generate its models. There is four-fold improvement in computation time when generating models with less than 10 segments, which are typically sufficient to describe fish and fish-inspired robot movements. Furthermore, the multi-segment models generated by the binary search algorithm matched the ground truth models obtained through dynamic programming in over 97% of cases, and on average, contained one fewer segment than those produced by the Ramer–Douglas–Peucker algorithm, which is widely used in curvature simplification tasks. Our findings suggest that the binary search algorithm provides a computationally efficient approach for generating compact kinematic models and may facilitate the analysis of large datasets with high temporal and spatial resolution.

Computers and Electronics in Agriculture