Contextual classification of remotely sensed images with integer linear programming

Proceedings of the International Symposium CompIMAGE 2006 - Computational Modelling of Objects Represented in Images: Fundamentals, Methods and Applications

Volumn , Issue , 2007, Pages 123-128

  Campagnolo, Manuel Lameiras ^a   Cerdeira, Jorge Orestes ^a  

^a INSTITUTO SUPERIOR DE AGRONOMIA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; LAND USE; LINEARIZATION; PARTICLE SIZE ANALYSIS; PIXELS; REMOTE SENSING; SATELLITE IMAGERY; STATISTICAL TESTS;

CONTEXTUAL CLASSIFICATIONS; DATA SETS; INTEGER LINEAR PROGRAMMING; INTEGER LINEAR PROGRAMMING FORMULATIONS; LAND COVER MAPS; MULTISPECTRAL SATELLITE IMAGERIES; REMOTELY SENSED IMAGES; SPATIAL RELATIONSHIPS; SUPERVISED CLASSIFICATIONS;

INTEGER PROGRAMMING;

EID: 60749088361     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. Kruskal, J. B. (1956). On the shortest spanning-subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7, 48-50.
2. Landgrebe, D. (2003). Signal Theory Methods in Multispectral Remote Sensing. John Wiley and Sons.
3. Pulleyblank, W. R. (1983). Polyhedral combinatorics. In Mathematical Programming - The State of the Art, pp. 312-345. Springer, Berlin.
4. Schrijver, A. (1995). Polyhedral combinatorics. In Handbook of Combinatorics, Volume II, pp. 1649-1704. Elsevier, Amsterdam.
5. Tso, B. and P. Mather (1999). Classification of multisource remote sensing images using a Markov random field. IEEE Transactions on Geoscience and Remote Sensing 37, 1255-1260.