AVALIAÇÃO DA ACURÁCIA DE ALGORITMOS DE CLASSIFICAÇÃO DE IMAGENS ORBITAIS NA BAÍA DA BABITONGA, NORDESTE DE SANTA CATARINA

O objetivo deste trabalho foi a avaliação da acurácia de algoritmos de classificação do uso e cobertura do solo, quando aplicados a uma imagem orbital de média resolução espacial. Para esse estudo foram utilizadas as bandas espectrais da faixa do visível e infravermelho próximo, do sensor Operational Land Imager – OLI na Baía da Babitonga/SC. Foram propostas nove classes de cobertura do solo, que serviram como controle para testar 11 algoritmos classificadores: Binary Encoding, Example Based Feature Extraction, IsoData, K-Means, Mahalanobis Distance, Maximum Likelihood, Minimum Distance, Neural Net, Parallelepiped, Spectral Angle Mapper e Spectral Information Divergence. O classificador Maximum Likelihood foi o que apresentou o melhor desempenho, obtendo um índice Kappa de 0,89 e acurácia global de 95,5%, sendo capaz de distinguir as nove classes de cobertura do solo propostas. Evaluation of the Accuracy of Orbital Image Classification Algorithms in Babitonga Bay, northeast of Santa Catarina A B S T R A C TThe objective of this work was to evaluate the classification algorithms accuracy of the soil use and cover when applied to a spatial mean orbital image. For this study we used the visible and near infrared spectral bands of the Operational Land Imager - OLI sensor in Babitonga Bay / SC. Nine classes of soil cover were proposed, which served as control to test 11 classifier algorithms: Binary Encoding, Example Based Feature Extraction, IsoData, K-Means, Mahalanobis Distance, Maximum Likelihood, Minimum Distance, Neural Net, Parallelepiped, Spectral Angle Mapper and Spectral Information Divergence. The Maximum Likelihood classifier presented the best performance, obtaining a Kappa index of 0.89 and a global accuracy of 95.5%, being able to distinguish the nine proposed classes of soil cover.Keywords: Algorithms Accuracy, Babitonga Bay, Orbital image, Remote sensing, Soil Use and Cover.

Information Geometry of Reversible Markov Chains

We analyze the information geometric structure of time reversibility for parametric families of irreducible transition kernels of Markov chains. We define and characterize reversible exponential families of Markov kernels, and show that irreducible and reversible Markov kernels form both a mixture family and, perhaps surprisingly, an exponential family in the set of all stochastic kernels. We propose a parametrization of the entire manifold of reversible kernels, and inspect reversible geodesics. We define information projections onto the reversible manifold, and derive closed-form expressions for the e-projection and m-projection, along with Pythagorean identities with respect to information divergence, leading to some new notion of reversiblization of Markov kernels. We show the family of edge measures pertaining to irreducible and reversible kernels also forms an exponential family among distributions over pairs. We further explore geometric properties of the reversible family, by comparing them with other remarkable families of stochastic matrices. Finally, we show that reversible kernels are, in a sense we define, the minimal exponential family generated by the m-family of symmetric kernels, and the smallest mixture family that comprises the e-family of memoryless kernels.

Comparative Study of Optimization Models for Evaluation of EDM Process Parameters on Ti-6Al-4V

In this paper, different optimization techniques such as multi-objective optimization based on ratio analysis, the -nD angle, information divergence and multi-angle optimization methods were considered for comparative study in order to check their variation in results. These four techniques were considered asthese techniques were made from completely different methodologies, such as MOORA, is one of the latest multi-criteria decision-making methods that cover the weakness of other older methods and the latter three (-nD angle, Information Divergence and MAOT) methods are based on trigonometric methodologies. These optimization techniques were carried out using the effect of EDM process parameters viz., material removal rate and surface roughness as output parameters and current, pulse on time, pulse off time and different electrode materials as input process parameters. These parameters were obtained from the experiments modelled according to the Taguchi experimental design procedure in which the L18 orthogonal array was used to perform experimentation with the material of titanium alloy (Ti-6Al-4V). All the optimization techniques have obtained similar results among which -nD angle and Information Divergence technique tend to be easier and understandable for any similar application. The latter two methods avoid complexity and can be used for optimizing any relevant manufacturing process parameters such as the parameters of EDM, additive manufacturing, etc.

An Objective Prior from a Scoring Rule

In this paper, we introduce a novel objective prior distribution levering on the connections between information, divergence and scoring rules. In particular, we do so from the starting point of convex functions representing information in density functions. This provides a natural route to proper local scoring rules using Bregman divergence. Specifically, we determine the prior which solves setting the score function to be a constant. Although in itself this provides motivation for an objective prior, the prior also minimizes a corresponding information criterion.

A Novel Query Strategy-Based Rank Batch-Mode Active Learning Method for High-Resolution Remote Sensing Image Classification

An informative training set is necessary for ensuring the robust performance of the classification of very-high-resolution remote sensing (VHRRS) images, but labeling work is often difficult, expensive, and time-consuming. This makes active learning (AL) an important part of an image analysis framework. AL aims to efficiently build a representative and efficient library of training samples that are most informative for the underlying classification task, thereby minimizing the cost of obtaining labeled data. Based on ranked batch-mode active learning (RBMAL), this paper proposes a novel combined query strategy of spectral information divergence lowest confidence uncertainty sampling (SIDLC), called RBSIDLC. The base classifier of random forest (RF) is initialized by using a small initial training set, and each unlabeled sample is analyzed to obtain the classification uncertainty score. A spectral information divergence (SID) function is then used to calculate the similarity score, and according to the final score, the unlabeled samples are ranked in descending lists. The most “valuable” samples are selected according to ranked lists and then labeled by the analyst/expert (also called the oracle). Finally, these samples are added to the training set, and the RF is retrained for the next iteration. The whole procedure is iteratively implemented until a stopping criterion is met. The results indicate that RBSIDLC achieves high-precision extraction of urban land use information based on VHRRS; the accuracy of extraction for each land-use type is greater than 90%, and the overall accuracy (OA) is greater than 96%. After the SID replaces the Euclidean distance in the RBMAL algorithm, the RBSIDLC method greatly reduces the misclassification rate among different land types. Therefore, the similarity function based on SID performs better than that based on the Euclidean distance. In addition, the OA of RF classification is greater than 90%, suggesting that it is feasible to use RF to estimate the uncertainty score. Compared with the three single query strategies of other AL methods, sample labeling with the SIDLC combined query strategy yields a lower cost and higher quality, thus effectively reducing the misclassification rate of different land use types. For example, compared with the Batch_Based_Entropy (BBE) algorithm, RBSIDLC improves the precision of barren land extraction by 37% and that of vegetation by 14%. The 25 characteristics of different land use types screened by RF cross-validation (RFCV) combined with the permutation method exhibit an excellent separation degree, and the results provide the basis for VHRRS information extraction in urban land use settings based on RBSIDLC.

Trajectory Optimisation for Cooperative Target Tracking with Passive Mobile Sensors

The paper considers the problem of tracking a moving target using a pair of cooperative bearing-only mobile sensors. Sensor trajectory optimisation plays the central role in this problem, with the objective to minimize the estimation error of the target state. Two approximate closed-form statistical reward functions, referred to as the Expected Rényi information divergence (RID) and the Determinant of the Fisher Information Matrix (FIM), are analysed and discussed in the paper. Being available analytically, the two reward functions are fast to compute and therefore potentially useful for longer horizon sensor trajectory planning. The paper demonstrates, both numerically and from the information geometric viewpoint, that the Determinant of the FIM is a superior reward function. The problem with the Expected RID is that the approximation involved in its derivation significantly reduces the correlation between the target state estimates at two sensors, and consequently results in poorer performance.