Datasets:
Amogh1221
/
ML_Dataset

Dataset card Data Studio Files
xet
Community
1
text
stringlengths
0
4.09k
Title: Sampling Spatially Correlated Clutter
Abstract: Correlated $\cal G$ distributions can be used to describe the clutter seen in images obtained with coherent illumination, as is the case of B-scan ultrasound, laser, sonar and synthetic aperture radar (SAR) imagery. These distributions are derived using the square root of the generalized inverse Gaussian distribution for the amplitude backscatter within the multiplicative model. A two-parameters particular case of the amplitude $\mathcal G$ distribution, called $\mathcal G_A^0$, constitutes a modeling improvement with respect to the widespread $\mathcal K_A$ distribution when fitting urban, forested and deforested areas in remote sensing data. This article deals with the modeling and the simulation of correlated $\mathcal G_A^0$-distributed random fields. It is accomplished by means of the Inverse Transform method, applied to Gaussian random fields with spatial correlation. The main feature of this approach is its generality, since it allows the introduction of negative correlation values in the resulting process, necessary for the proper explanation of the shadowing effect in many SAR images.
Title: Local additive estimation
Abstract: Additive models are popular in high--dimensional regression problems because of flexibility in model building and optimality in additive function estimation. Moreover, they do not suffer from the so-called \it curse of dimensionality generally arising in nonparametric regression setting. Less known is the model bias incurring from the restriction to the additive class of models. We introduce a new class of estimators that reduces additive model bias and at the same time preserves some stability of the additive estimator. This estimator is shown to partially relieve the dimensionality problem as well. The new estimator is constructed by localizing the assumption of additivity and thus named \it local additive estimator. Implementation can be easily made with any standard software for additive regression. For detailed analysis we explicitly use the smooth backfitting estimator by Mammen, Linton and Nielsen (1999).
Title: Directional Cross Diamond Search Algorithm for Fast Block Motion Estimation
Abstract: In block-matching motion estimation (BMME), the search patterns have a significant impact on the algorithm's performance, both the search speed and the search quality. The search pattern should be designed to fit the motion vector probability (MVP) distribution characteristics of the real-world sequences. In this paper, we build a directional model of MVP distribution to describe the directional-center-biased characteristic of the MVP distribution and the directional characteristics of the conditional MVP distribution more exactly based on the detailed statistical data of motion vectors of eighteen popular sequences. Three directional search patterns are firstly designed by utilizing the directional characteristics and they are the smallest search patterns among the popular ones. A new algorithm is proposed using the horizontal cross search pattern as the initial step and the horizontal/vertical diamond search pattern as the subsequent step for the fast BMME, which is called the directional cross diamond search (DCDS) algorithm. The DCDS algorithm can obtain the motion vector with fewer search points than CDS, DS or HEXBS while maintaining the similar or even better search quality. The gain on speedup of DCDS over CDS or DS can be up to 54.9%. The simulation results show that DCDS is efficient, effective and robust, and it can always give the faster search speed on different sequences than other fast block-matching algorithm in common use.
Title: High dimensional gaussian classification
Abstract: High dimensional data analysis is known to be as a challenging problem. In this article, we give a theoretical analysis of high dimensional classification of Gaussian data which relies on a geometrical analysis of the error measure. It links a problem of classification with a problem of nonparametric regression. We give an algorithm designed for high dimensional data which appears straightforward in the light of our theoretical work, together with the thresholding estimation theory. We finally attempt to give a general treatment of the problem that can be extended to frameworks other than gaussian.
Title: Modeling And Simulation Of Prolate Dual-Spin Satellite Dynamics In An Inclined Elliptical Orbit: Case Study Of Palapa B2R Satellite
Abstract: In response to the interest to re-use Palapa B2R satellite nearing its End of Life (EOL) time, an idea to incline the satellite orbit in order to cover a new region has emerged in the recent years. As a prolate dual-spin vehicle, Palapa B2R has to be stabilized against its internal energy dissipation effect. This work is focused on analyzing the dynamics of the reusable satellite in its inclined orbit. The study discusses in particular the stability of the prolate dual-spin satellite under the effect of perturbed field of gravitation due to the inclination of its elliptical orbit. Palapa B2R physical data was substituted into the dual-spin's equation of motion. The coefficient of zonal harmonics J2 was induced into the gravity-gradient moment term that affects the satellite attitude. The satellite's motion and attitude were then simulated in the perturbed gravitational field by J2, with the variation of orbit's eccentricity and inclination. The analysis of the satellite dynamics and its stability was conducted for designing a control system for the vehicle in its new inclined orbit.
Title: Onboard Multivariable Controller Design for a Small Scale Helicopter Using Coefficient Diagram Method
Abstract: A mini scale helicopter exhibits not only increased sensitivity to control inputs and disturbances, but also higher bandwidth of its dynamics. These properties make model helicopters, as a flying robot, more difficult to control. The dynamics model accuracy will determine the performance of the designed controller. It is attractive in this regards to have a controller that can accommodate the unmodeled dynamics or parameter changes and perform well in such situations. Coefficient Diagram Method (CDM) is chosen as the candidate to synthesize such a controller due to its simplicity and convenience in demonstrating integrated performance measures including equivalent time constant, stability indices and robustness. In this study, CDM is implemented for a design of multivariable controller for a small scale helicopter during hover and cruise flight. In the synthesis of MIMO CDM, good design common sense based on hands-on experience is necessary. The low level controller algorithm is designed as part of hybrid supervisory control architecture to be implemented on an onboard computer system. Its feasibility and performance are evaluated based on its robustness, desired time domain system responses and compliance to hard-real time requirements.
Title: Collaborative model of interaction and Unmanned Vehicle Systems' interface
Abstract: The interface for the next generation of Unmanned Vehicle Systems should be an interface with multi-modal displays and input controls. Then, the role of the interface will not be restricted to be a support of the interactions between the ground operator and vehicles. Interface must take part in the interaction management too. In this paper, we show that recent works in pragmatics and philosophy provide a suitable theoretical framework for the next generation of UV System's interface. We concentrate on two main aspects of the collaborative model of interaction based on acceptance: multi-strategy approach for communicative act generation and interpretation and communicative alignment.
Title: The Euler-Poincare theory of Metamorphosis
Abstract: In the pattern matching approach to imaging science, the process of ``metamorphosis'' is template matching with dynamical templates. Here, we recast the metamorphosis equations of into the Euler-Poincare variational framework of and show that the metamorphosis equations contain the equations for a perfect complex fluid . This result connects the ideas underlying the process of metamorphosis in image matching to the physical concept of order parameter in the theory of complex fluids. After developing the general theory, we reinterpret various examples, including point set, image and density metamorphosis. We finally discuss the issue of matching measures with metamorphosis, for which we provide existence theorems for the initial and boundary value problems.
Title: A Nonparametric Approach to 3D Shape Analysis from Digital Camera Images - I. in Memory of W.P. Dayawansa
Abstract: In this article, for the first time, one develops a nonparametric methodology for an analysis of shapes of configurations of landmarks on real 3D objects from regular camera photographs, thus making 3D shape analysis very accessible. A fundamental result in computer vision by Faugeras (1992), Hartley, Gupta and Chang (1992) is that generically, a finite 3D configuration of points can be retrieved up to a projective transformation, from corresponding configurations in a pair of camera images. Consequently, the projective shape of a 3D configuration can be retrieved from two of its planar views. Given the inherent registration errors, the 3D projective shape can be estimated from a sample of photos of the scene containing that configuration. Projective shapes are here regarded as points on projective shape manifolds. Using large sample and nonparametric bootstrap methodology for extrinsic means on manifolds, one gives confidence regions and tests for the mean projective shape of a 3D configuration from its 2D camera images.
Title: Utilisation des grammaires probabilistes dans les t\^aches de segmentation et d'annotation prosodique
Abstract: Nous pr\'esentons dans cette contribution une approche \`a la fois symbolique et probabiliste permettant d'extraire l'information sur la segmentation du signal de parole \`a partir d'information prosodique. Nous utilisons pour ce faire des grammaires probabilistes poss\'edant une structure hi\'erarchique minimale. La phase de construction des grammaires ainsi que leur pouvoir de pr\'ediction sont \'evalu\'es qualitativement ainsi que quantitativement. ----- Methodologically oriented, the present work sketches an approach for prosodic information retrieval and speech segmentation, based on both symbolic and probabilistic information. We have recourse to probabilistic grammars, within which we implement a minimal hierarchical structure. Both the stages of probabilistic grammar building and its testing in prediction are explored and quantitatively and qualitatively evaluated.
Title: Belief Propagation and Beyond for Particle Tracking
Abstract: We describe a novel approach to statistical learning from particles tracked while moving in a random environment. The problem consists in inferring properties of the environment from recorded snapshots. We consider here the case of a fluid seeded with identical passive particles that diffuse and are advected by a flow. Our approach rests on efficient algorithms to estimate the weighted number of possible matchings among particles in two consecutive snapshots, the partition function of the underlying graphical model. The partition function is then maximized over the model parameters, namely diffusivity and velocity gradient. A Belief Propagation (BP) scheme is the backbone of our algorithm, providing accurate results for the flow parameters we want to learn. The BP estimate is additionally improved by incorporating Loop Series (LS) contributions. For the weighted matching problem, LS is compactly expressed as a Cauchy integral, accurately estimated by a saddle point approximation. Numerical experiments show that the quality of our improved BP algorithm is comparable to the one of a fully polynomial randomized approximation scheme, based on the Markov Chain Monte Carlo (MCMC) method, while the BP-based scheme is substantially faster than the MCMC scheme.
Title: The Role of Artificial Intelligence Technologies in Crisis Response
Abstract: Crisis response poses many of the most difficult information technology in crisis management. It requires information and communication-intensive efforts, utilized for reducing uncertainty, calculating and comparing costs and benefits, and managing resources in a fashion beyond those regularly available to handle routine problems. In this paper, we explore the benefits of artificial intelligence technologies in crisis response. This paper discusses the role of artificial intelligence technologies; namely, robotics, ontology and semantic web, and multi-agent systems in crisis response.
Title: The end of Sleeping Beauty's nightmare
Abstract: The way a rational agent changes her belief in certain propositions/hypotheses in the light of new evidence lies at the heart of Bayesian inference. The basic natural assumption, as summarized in van Fraassen's Reflection Principle ([1984]), would be that in the absence of new evidence the belief should not change. Yet, there are examples that are claimed to violate this assumption. The apparent paradox presented by such examples, if not settled, would demonstrate the inconsistency and/or incompleteness of the Bayesian approach and without eliminating this inconsistency, the approach cannot be regarded as scientific. The Sleeping Beauty Problem is just such an example. The existing attempts to solve the problem fall into three categories. The first two share the view that new evidence is absent, but differ about the conclusion of whether Sleeping Beauty should change her belief or not, and why. The third category is characterized by the view that, after all, new evidence (although hidden from the initial view) is involved. My solution is radically different and does not fall in either of these categories. I deflate the paradox by arguing that the two different degrees of belief presented in the Sleeping Beauty Problem are in fact beliefs in two different propositions, i.e. there is no need to explain the (un)change of belief.
Title: Temporized Equilibria
Abstract: This paper has been withdrawn by the author due to a crucial error in the submission action.
Title: Fast Wavelet-Based Visual Classification
Abstract: We investigate a biologically motivated approach to fast visual classification, directly inspired by the recent work of Serre et al. Specifically, trading-off biological accuracy for computational efficiency, we explore using wavelet and grouplet-like transforms to parallel the tuning of visual cortex V1 and V2 cells, alternated with max operations to achieve scale and translation invariance. A feature selection procedure is applied during learning to accelerate recognition. We introduce a simple attention-like feedback mechanism, significantly improving recognition and robustness in multiple-object scenes. In experiments, the proposed algorithm achieves or exceeds state-of-the-art success rate on object recognition, texture and satellite image classification, language identification and sound classification.
Title: Analysis of Metric Distances and Volumes of Hippocampi Indicates Different Morphometric Changes over Time in Dementia of Alzheimer Type and Nondemented Subjects
Abstract: In this article, we analyze the morphometry of hippocampus in subjects with very mild dementia of Alzheimer's type (DAT) and nondemented controls and how it changes over a two-year period. Morphometric differences with respect to a template hippocampus were measured by the metric distance obtained from the Large Deformation Diffeomorphic Metric Mapping (LDDMM) algorithm which was previously used to calculate dense one-to-one correspondence vector fields between the shapes. LDDMM assigns metric distances on the space of anatomical images thereby allowing for the direct comparison and quantization of morphometric changes. We use various statistical methods to compare the metric distances in a cross-sectional and longitudinal manner. At baseline, the metric distances for demented subjects are found not to be significantly different from those for nondemented subjects. At follow-up, the metric distances for demented subjects were significantly larger compared to nondemented subjects. The metric distances for demented subjects increased significantly from baseline to follow-up but not for nondemented subjects. We also use the metric distances in logistic regression for diagnostic discrimination of subjects. We compare metric distances with the volumes and obtain similar results. In classification, the model that uses volume, metric distance, and volume loss over time together performs better in detecting DAT. Thus, metric distances with respect to a template computed via LDDMM can be a powerful tool in detecting differences in shape in cross-sectional as well as longitudinal studies.
Title: SiZer for Censored Density and Hazard Estimation
Abstract: The SiZer method is extended to nonparametric hazard estimation and also to censored density and hazard estimation. The new method allows quick, visual statistical inference about the important issue of statistically significant increases and decreases in the smooth curve estimate. This extension has required the opening of a new avenue of research on the interface between statistical inference and scale space.
Title: Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
Abstract: The data-complexity of both satisfiability and finite satisfiability for the two-variable fragment with counting is NP-complete; the data-complexity of both query-answering and finite query-answering for the two-variable guarded fragment with counting is co-NP-complete.
Title: Toward a combination rule to deal with partial conflict and specificity in belief functions theory
Abstract: We present and discuss a mixed conjunctive and disjunctive rule, a generalization of conflict repartition rules, and a combination of these two rules. In the belief functions theory one of the major problem is the conflict repartition enlightened by the famous Zadeh's example. To date, many combination rules have been proposed in order to solve a solution to this problem. Moreover, it can be important to consider the specificity of the responses of the experts. Since few year some unification rules are proposed. We have shown in our previous works the interest of the proportional conflict redistribution rule. We propose here a mixed combination rule following the proportional conflict redistribution rule modified by a discounting procedure. This rule generalizes many combination rules.
Title: Confidence Sets Based on Penalized Maximum Likelihood Estimators in Gaussian Regression
Abstract: Confidence intervals based on penalized maximum likelihood estimators such as the LASSO, adaptive LASSO, and hard-thresholding are analyzed. In the known-variance case, the finite-sample coverage properties of such intervals are determined and it is shown that symmetric intervals are the shortest. The length of the shortest intervals based on the hard-thresholding estimator is larger than the length of the shortest interval based on the adaptive LASSO, which is larger than the length of the shortest interval based on the LASSO, which in turn is larger than the standard interval based on the maximum likelihood estimator. In the case where the penalized estimators are tuned to possess the `sparsity property', the intervals based on these estimators are larger than the standard interval by an order of magnitude. Furthermore, a simple asymptotic confidence interval construction in the `sparse' case, that also applies to the smoothly clipped absolute deviation estimator, is discussed. The results for the known-variance case are shown to carry over to the unknown-variance case in an appropriate asymptotic sense.
Title: Evaluation for Uncertain Image Classification and Segmentation
Abstract: Each year, numerous segmentation and classification algorithms are invented or reused to solve problems where machine vision is needed. Generally, the efficiency of these algorithms is compared against the results given by one or many human experts. However, in many situations, the location of the real boundaries of the objects as well as their classes are not known with certainty by the human experts. Furthermore, only one aspect of the segmentation and classification problem is generally evaluated. In this paper we present a new evaluation method for classification and segmentation of image, where we take into account both the classification and segmentation results as well as the level of certainty given by the experts. As a concrete example of our method, we evaluate an automatic seabed characterization algorithm based on sonar images.
Title: A new generalization of the proportional conflict redistribution rule stable in terms of decision
Abstract: In this chapter, we present and discuss a new generalized proportional conflict redistribution rule. The Dezert-Smarandache extension of the Demster-Shafer theory has relaunched the studies on the combination rules especially for the management of the conflict. Many combination rules have been proposed in the last few years. We study here different combination rules and compare them in terms of decision on didactic example and on generated data. Indeed, in real applications, we need a reliable decision and it is the final results that matter. This chapter shows that a fine proportional conflict redistribution rule must be preferred for the combination in the belief function theory.
Title: Human expert fusion for image classification
Abstract: In image classification, merging the opinion of several human experts is very important for different tasks such as the evaluation or the training. Indeed, the ground truth is rarely known before the scene imaging. We propose here different models in order to fuse the informations given by two or more experts. The considered unit for the classification, a small tile of the image, can contain one or more kind of the considered classes given by the experts. A second problem that we have to take into account, is the amount of certainty of the expert has for each pixel of the tile. In order to solve these problems we define five models in the context of the Dempster-Shafer Theory and in the context of the Dezert-Smarandache Theory and we study the possible decisions with these models.
Title: Une nouvelle r\`egle de combinaison r\'epartissant le conflit - Applications en imagerie Sonar et classification de cibles Radar
Abstract: These last years, there were many studies on the problem of the conflict coming from information combination, especially in evidence theory. We can summarise the solutions for manage the conflict into three different approaches: first, we can try to suppress or reduce the conflict before the combination step, secondly, we can manage the conflict in order to give no influence of the conflict in the combination step, and then take into account the conflict in the decision step, thirdly, we can take into account the conflict in the combination step. The first approach is certainly the better, but not always feasible. It is difficult to say which approach is the best between the second and the third. However, the most important is the produced results in applications. We propose here a new combination rule that distributes the conflict proportionally on the element given this conflict. We compare these different combination rules on real data in Sonar imagery and Radar target classification.
Title: Perfect Derived Propagators
Abstract: When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear equations both with and without coefficients? Constraint variants are ubiquitous: implementing them requires considerable (if not prohibitive) effort and decreases maintainability, but will deliver better performance. This paper shows how to use variable views, previously introduced for an implementation architecture, to derive perfect propagator variants. A model for views and derived propagators is introduced. Derived propagators are proved to be indeed perfect in that they inherit essential properties such as correctness and domain and bounds consistency. Techniques for systematically deriving propagators such as transformation, generalization, specialization, and channeling are developed for several variable domains. We evaluate the massive impact of derived propagators. Without derived propagators, Gecode would require 140000 rather than 40000 lines of code for propagators.
Title: Classification of curves in 2D and 3D via affine integral signatures
Abstract: We propose a robust classification algorithm for curves in 2D and 3D, under the special and full groups of affine transformations. To each plane or spatial curve we assign a plane signature curve. Curves, equivalent under an affine transformation, have the same signature. The signatures introduced in this paper are based on integral invariants, which behave much better on noisy images than classically known differential invariants. The comparison with other types of invariants is given in the introduction. Though the integral invariants for planar curves were known before, the affine integral invariants for spatial curves are proposed here for the first time. Using the inductive variation of the moving frame method we compute affine invariants in terms of Euclidean invariants. We present two types of signatures, the global signature and the local signature. Both signatures are independent of parameterization (curve sampling). The global signature depends on the choice of the initial point and does not allow us to compare fragments of curves, and is therefore sensitive to occlusions. The local signature, although is slightly more sensitive to noise, is independent of the choice of the initial point and is not sensitive to occlusions in an image. It helps establish local equivalence of curves. The robustness of these invariants and signatures in their application to the problem of classification of noisy spatial curves extracted from a 3D object is analyzed.
Title: Fusion de classifieurs pour la classification d'images sonar
Abstract: In this paper, we present some high level information fusion approaches for numeric and symbolic data. We study the interest of such method particularly for classifier fusion. A comparative study is made in a context of sea bed characterization from sonar images. The classi- fication of kind of sediment is a difficult problem because of the data complexity. We compare high level information fusion and give the obtained performance.
Title: Experts Fusion and Multilayer Perceptron Based on Belief Learning for Sonar Image Classification
Abstract: The sonar images provide a rapid view of the seabed in order to characterize it. However, in such as uncertain environment, real seabed is unknown and the only information we can obtain, is the interpretation of different human experts, sometimes in conflict. In this paper, we propose to manage this conflict in order to provide a robust reality for the learning step of classification algorithms. The classification is conducted by a multilayer perceptron, taking into account the uncertainty of the reality in the learning stage. The results of this seabed characterization are presented on real sonar images.
Title: Generalized proportional conflict redistribution rule applied to Sonar imagery and Radar targets classification
Abstract: In this chapter, we present two applications in information fusion in order to evaluate the generalized proportional conflict redistribution rule presented in the chapter . Most of the time the combination rules are evaluated only on simple examples. We study here different combination rules and compare them in terms of decision on real data. Indeed, in real applications, we need a reliable decision and it is the final results that matter. Two applications are presented here: a fusion of human experts opinions on the kind of underwater sediments depict on sonar image and a classifier fusion for radar targets recognition.
Title: Beyond Nash Equilibrium: Solution Concepts for the 21st Century
Abstract: Nash equilibrium is the most commonly-used notion of equilibrium in game theory. However, it suffers from numerous problems. Some are well known in the game theory community; for example, the Nash equilibrium of repeated prisoner's dilemma is neither normatively nor descriptively reasonable. However, new problems arise when considering Nash equilibrium from a computer science perspective: for example, Nash equilibrium is not robust (it does not tolerate ``faulty'' or ``unexpected'' behavior), it does not deal with coalitions, it does not take computation cost into account, and it does not deal with cases where players are not aware of all aspects of the game. Solution concepts that try to address these shortcomings of Nash equilibrium are discussed.
Title: Defaults and Normality in Causal Structures
Abstract: A serious defect with the Halpern-Pearl (HP) definition of causality is repaired by combining a theory of causality with a theory of defaults. In addition, it is shown that (despite a claim to the contrary) a cause according to the HP condition need not be a single conjunct. A definition of causality motivated by Wright's NESS test is shown to always hold for a single conjunct. Moreover, conditions that hold for all the examples considered by HP are given that guarantee that causality according to (this version) of the NESS test is equivalent to the HP definition.
Title: Improved Likelihood Inference in Birnbaum-Saunders Regressions
Abstract: The Birnbaum-Saunders regression model is commonly used in reliability studies. We address the issue of performing inference in this class of models when the number of observations is small. We show that the likelihood ratio test tends to be liberal when the sample size is small, and we obtain a correction factor which reduces the size distortion of the test. The correction makes the error rate of he test vanish faster as the sample size increases. The numerical results show that the modified test is more reliable in finite samples than the usual likelihood ratio test. We also present an empirical application.
Title: An Intelligent Multi-Agent Recommender System for Human Capacity Building
Abstract: This paper presents a Multi-Agent approach to the problem of recommending training courses to engineering professionals. The recommendation system is built as a proof of concept and limited to the electrical and mechanical engineering disciplines. Through user modelling and data collection from a survey, collaborative filtering recommendation is implemented using intelligent agents. The agents work together in recommending meaningful training courses and updating the course information. The system uses a users profile and keywords from courses to rank courses. A ranking accuracy for courses of 90% is achieved while flexibility is achieved using an agent that retrieves information autonomously using data mining techniques from websites. This manner of recommendation is scalable and adaptable. Further improvements can be made using clustering and recording user feedback.