Eastern Rwanda consists of a mosaic different land cover types, with agroforestry, forest patches, and shrubland all containing tree cover. Mapping monitoring the landscape is costly time-intensive, creating need for automated methods using openly available satellite imagery. Google Earth Engine random forests algorithm offer potential to use such imagery map types in study area. Sentinel-2 ima...

Many satellite images have a spatial resolution coarser than the extent of land cover patterns on the ground, leading to mixed pixels whose composite spectral response consists of responses from multiple land cover classes. Spectral unmixing procedures only determine the fractions of such classes within a coarse pixel without locating them in space. Super-resolution or sub-pixel mapping aims at...

In several real-world applications (e.g., forestry, agriculture), the objective of change detection is actually limited to one (or few) specific “targeted” land-cover transition(s) affecting a certain area in a given time period. In such cases, ground-truth information is generally available for the only land-cover classes of interest at the two dates, which limits (or hinders) the possibility ...

This document details the structural definition, development process, and functional flow of the MODIS Land-Cover Product. The Land Cover and Land-Cover Change Parameters were proposed by the MODIS Land Team, with Team Member Alan Strahler leading the effort. The Land Cover Parameter is a 1-km product provided on a quarterly basis beginning about one year following the acquisition of a global d...

This study* investigated computer classification performances for forest and other cover types using Thematic Mapper Simulator (TMS) data collected by NASA's NSOOI scanner. Specifically, results based on the use of a common feature selection measure -transformed divergence (TD) were compared to those based on a principal component transformation for the purpose of evaluating the capabilities of...

A graph class has few cliques if there is a polynomial bound on the number of maximal cliques contained in any member of the class. This restriction is equivalent to the requirement that any graph in the class has a polynomial sized intersection representation that satisfies the Helly property. On any such class of graphs some problems that are NP-complete on general graphs, such as the maximum...

A graph is (H1,H2)-free for a pair of graphsH1, H2 if it contains no induced subgraph isomorphic toH1 orH2. In 2001, Král’, Kratochvíl, Tuza, and Woeginger initiated a study into the complexity of Colouring for (H1,H2)free graphs. Since then, others have tried to complete their study, but many cases remain open. We focus on those (H1,H2)-free graphs where H2 is H1, the complement of H1. As thes...

A graph is (H1,H2)-free for a pair of graphsH1, H2 if it contains no induced subgraph isomorphic toH1 orH2. In 2001, Král’, Kratochvíl, Tuza, and Woeginger initiated a study into the complexity of Colouring for (H1,H2)free graphs. Since then, others have tried to complete their study, but many cases remain open. We focus on those (H1,H2)-free graphs where H2 is H1, the complement of H1. As thes...

The paper proposes a problem decomposition method for building optimal cover for a set of functional dependencies to decrease the solving time. At the beginning, the paper includes an overview of the covers of functional dependencies. There are considered definitions and properties of non redundant covers for sets of functional dependencies, reduced and canonical covers as well as equivalence c...