Scene classification plays an important role in understanding high-resolution satellite (HRS) remotely sensed imagery. For remotely sensed scenes, both color information and texture information provide the discriminative ability in classification tasks. In recent years, substantial performance gains in HRS image classification have been reported in the literature. One branch of research combine...

We propose an algorithm for forming a hierarchical clustering when multiple views of the data are available. Different views of the data may have different underlying distance measures which suggest different clusterings. In such cases, combining the views to get a good clustering of the data becomes a challenging task. We allow these different underlying distance measures to be arbitrary Bregm...

When analysing binary data, the ease at which one can interpret results is very important. Many existing methods, however, discover either models that are difficult to read, or return so many results interpretation becomes impossible. Here, we study a fully automated approach for mining easily interpretable models for binary data. We model data hierarchically with noisy tiles—rectangles with si...

This paper presents TreeGNG, a top-down unsupervised learning method that produces hierarchical classification schemes. TreeGNG extends the Growing Neural Gas algorithm by maintaining a time history of the learned topological mapping. TreeGNG is able to recover from poor decisions made during the construction of the tree, and provides the novel ability to influence the general shape of the hier...

The method to deal with the tag collision in RFID system can be directly called “Multiple Access”. According to the ideas of these different anti-collision algorithms, they can be divided into two categories. One is the binary tree algorithm based on deterministic; the other is the statistical-based ALOHA algorithm. Overall, however, there is still room for improvement on anti-collision algorit...

2 Binary search trees 2 2.1 Definition of a binary search tree . . . . . . . . . . . . . . . . . . 2 2.2 Profile. Discrete martingale . . . . . . . . . . . . . . . . . . . . . 3 2.3 Embedding in continuous time. Yule tree . . . . . . . . . . . . . . 4 2.4 Martingale connection Yule tree binary search tree . . . . . . . . 5 2.5 Asymptotics . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierarchical clustering, it is required that the individual trees are drawn crossing-free. A natural optimization problem, denoted tanglegram layout problem, is thus to minimize the number of crossings between inter-tree edg...

Phylogenetic trees in genetics and biology in general are all binary. We make an attempt to answer one fundamental question: Is such binary branching from the coarsest to the finest scales sustained by data? We convert this question into an equivalent one: where is the structural information of tree in a data matrix? Results from this conceptual as well as computing issue afford us to conclude ...

During production of emotional speech there are deviations in the components of speech production mechanism when compared to normal speech. The objective of this study is to capture the deviations in features related to the excitation source component of speech, and to develop a system for automatic recognition of emotions based on these deviations. The emotions considered for this study are: a...

This paper presents GraphBPT, a tool for hierarchical representation of images based on binary partition trees. It relies on a new BPT construction algorithm that have interesting tuning properties. Besides, access to image pixels from the tree is achieved efficiently with data compression techniques, and a textual representation of BPT is also provided for interoperability. Finally, we illustr...