Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,661
unknown title
"... www.hydrol-earth-syst-sci.net/19/125/2015/ doi:10.5194/hess-19-125-2015 © Author(s) 2015. CC Attribution 3.0 License. Where does streamwater come from in low-relief forested watersheds? A dual-isotope approach ..."
Abstract
- Add to MetaCart
www.hydrol-earth-syst-sci.net/19/125/2015/ doi:10.5194/hess-19-125-2015 © Author(s) 2015. CC Attribution 3.0 License. Where does streamwater come from in low-relief forested watersheds? A dual-isotope approach
A Comparison of Existing Surficial Hydrological Data Layers in a Low-Relief Forested Ontario Landscape with those Derived from a LiDAR DEM." The Forestry Chronicle 84
, 2008
"... ABSTRACT The current provincial-extent digital elevation model (DEM) and corresponding hydrological maps for Ontario have been produced using traditional photogrammetry and aerial photograph interpretation. This process is labour-intensive and requires visual interpretation of stereo image pairs. T ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
the ability to represent streams of lower Strahler order to define crisp watershed boundaries, and the more accurate identification of local depressions that form potentially wet sites. This approach identifies wet sites that should be avoided during forest operations (e.g., skidder traffic) and can provide
The Ordered Queue And The Optimality Of The Watershed Approaches
- In Mathematical Morphology and its Applications to Image and Signal Processing
, 2000
"... This work reviews the watershed in the graph framework of a shortest-path forest problem using a lexicographic path cost formulation. This formulation reects the behavior of the ordered queue-based watershed algorithm. This algorithm is compared with our proposed shortest-path forest (IFT{Image Fore ..."
Abstract
-
Cited by 62 (24 self)
- Add to MetaCart
This work reviews the watershed in the graph framework of a shortest-path forest problem using a lexicographic path cost formulation. This formulation reects the behavior of the ordered queue-based watershed algorithm. This algorithm is compared with our proposed shortest-path forest (IFT
Watershed cuts: Thinnings, shortest path forests, and topological watersheds
- PAMI
, 2010
"... We recently introduced watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three algorithmic watershed cut strategies: The first one is well suited to parallel implementations, the second one leads to a flexi ..."
Abstract
-
Cited by 28 (13 self)
- Add to MetaCart
establish the links and differences between watershed cuts, minimum spanning forests, shortest path forests, and topological watersheds. Finally, we present illustrations of the proposed framework to the segmentation of artwork surfaces and diffusion tensor images.
Modeling subsurface stormflow on steeply sloping forested watersheds
- Water Resources Research 20: I8
, 1984
"... Five mathematical models for predicting subsurface flow were compared to discharge measurements made by Hewlett and Hibbert (1963) on a uniform sloping soil trough at the Coweeta Hydrologic Laboratory. The models included one- and two-dimensional finite element models based on the Richards equation, ..."
Abstract
-
Cited by 32 (0 self)
- Add to MetaCart
from the point of view of computational costs. Such models have features that would allow them to be incorporated into more complex watershed models, thus placing hydrologic prediction on a more physically correct and less empirical footing.
Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle
- IEEE TRANS. PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2009
"... We study the watersheds in edge-weighted graphs. We define the watershed cuts following the intuitive idea of drops of water flowing on a topographic surface. We first establish the consistency of these watersheds: they can be equivalently defined by their “catchment basins” (through a steepest des ..."
Abstract
-
Cited by 49 (23 self)
- Add to MetaCart
We study the watersheds in edge-weighted graphs. We define the watershed cuts following the intuitive idea of drops of water flowing on a topographic surface. We first establish the consistency of these watersheds: they can be equivalently defined by their “catchment basins” (through a steepest
Watershed cuts
- IN 8TH INTERNATIONAL SYMPOSIUM ON MATHEMATICAL MORPHOLOGY (ISMM ’07
, 2007
"... We study the watersheds in edge-weighted graphs. Contrarily to previous works, we define the watersheds following the intuitive idea of drops of water flowing on a topographic surface. We establish the consistency (with respect to characterizations of the catchment basins and dividing lines) of the ..."
Abstract
-
Cited by 9 (7 self)
- Add to MetaCart
) of these watersheds, prove their optimality (in terms of minimum spanning forests) and derive a linear-time algorithm. To the best of our knowledge, similar properties are not verified in other frameworks and the proposed algorithm is the most efficient existing algorithm.
Watershed in Tehran)
, 2014
"... Positioning of appropriate land uses for forest management by multi criteria decision methods and GIS (Dareh Vesyeh ..."
Abstract
- Add to MetaCart
Positioning of appropriate land uses for forest management by multi criteria decision methods and GIS (Dareh Vesyeh
Municipal watersheds
"... Abstract The occurrence of wildfires within municipal watersheds can result in signif-icant impacts to water quality and ultimately human health and safety. In this paper, we illustrate the application of geospatial analysis and burn probability modeling to assess the exposure of municipal watershed ..."
Abstract
- Add to MetaCart
-Deerlodge National Forest (BDNF) in Montana, United States. We present simulation results to highlight exposure across watersheds and generally demonstrate vast differences in fire likelihood, fire behavior, and expected area burned among the analyzed municipal watersheds. We describe how this information can
Results 1 - 10
of
1,661
