The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Classifier fusion is a well-studied problem in which decisions from multiple classifiers are combined at the score, rank, or decision level to obtain better results than a single classifier. Subsequently, various techniques for combining classifiers at each of these levels have been proposed in the literature. Many popular methods entail scaling and normalizing the scores obtained by each classifier...
Low Light Level Images (LLLIs) are captured with exceptionally low brightness and low contrast, and cannot be enhanced satisfactorily with ordinary methods. In this paper, we propose a LLLI enhancement method using coupled dictionary learning. During the training stage, a pair of dictionaries and a linear mapping function are learned simultaneously. The dictionary pair aims to describe the raw LLLIs...
The particle size distribution (PSD) of a dispersed phase is a fundamental geometrical characteristic that needs to be determined from digital images for many industrial processes involving a multiphase flow. Nevertheless, when dealing with 2-D images, only the projections of the particles are visualized and therefore the particles can overlap each other. In this way, this paper aims to develop and...
The clustering algorithm by fast search and find of density peaks is shown to be a promising clustering approach. However, this algorithm involves manual selection of cluster centers, which is not convenient in practical applications. In this paper we discuss the correlation between density peaks and cluster centers. As a result, we present a new local density estimation method to highlight the uniqueness...
We introduce a new algorithm that maps multiple instance data using both positive and negative target concepts into a data representation suitable for standard classification. Multiple instance data are characterized by bags which are in turn characterized by a variable number of feature vectors or instances. Each bag has a known positive or negative label, but the labels of any given instances within...
This paper is concerned with event clustering for short text streams, which aims to divide constantly arriving short texts into several dynamic event-based clusters. A widely adopted approach is based on the Vector Space Models (VSMs) such as bag of words. However, these models have limitations in that not only the semantic relationships between words are largely ignored, the term weighting may also...
Graph spectral clustering algorithms have been shown to be effective in finding clusters and generally outperform traditional clustering algorithms, such as k-means. However, they have scalibility issues in both memory usage and computational time. To overcome these limitations, the common approaches sparsify the similarity matrix by zeroing out some of its elements. They generally consider local...
Lately, multi-label classification (MLC) problems have drawn a lot of attention in a wide range of fields including medical, web, and entertainment. The scale and the diversity of MLC problems is much larger than single-label classification problems. Especially we have to face all possible combinations of labels. To solve MLC problems more efficiently, we focus on three kinds of locality hidden in...
We present a unified approach for simultaneous clustering and outlier detection in data. We utilize some properties of a family of quadratic optimization problems related to dominant sets, a well-known graph-theoretic notion of a cluster which generalizes the concept of a maximal clique to edge-weighted graphs. Unlike most (all) of the previous techniques, in our framework the number of clusters arises...
We present a regularization technique based on the minimum description length (MDL) principle for the linear manifold clustering. We suggest an inexact minimum description length method based on describing the data structure as linear manifold clusters. We examine the behavior of the proposed method and compare it performance against simulated clustering results of various dimensionality and structure...
In this paper, we present a method for vision-based place recognition in environments with a high content of similar features and that are prone to variations in illumination. The high similarity of features makes difficult the disambiguation between two different places. The novelty of our method relies on using the Bag of Words (BoW) approach to derive an image descriptor from a set of relevant...
In clustering applications, multiple views of the data are often available. Although clustering could be done within each view independently, exploiting information across views is promising to gain clustering accuracy improvement. A common assumption in the field of multi-view learning is that the clustering results from multiple views should be consistent with a latent clustering. However, the potential...
The closest string problem is a core problem in computational biology with applications in other fields like coding theory. Many algorithms exist to solve this problem, but due to its inherent high computational complexity (typically NP-hard), it can only be solved efficiently by restricting the search space to a specific range of parameters. Often, the run-time of these algorithms is exponential...
Scene text detection and recognition have become active research topics in computer vision. In this paper, we focus on the detection of text proposal from wild images. Text proposals attempt to generate a relatively small set of bounding box proposals that are most likely to contain text. Different from previous methods that merge similar region based on property of individual region, we assumed that...
In this paper, we present a geometric algebra approach for detection of geometric entities in images. Our algorithm is grounded on two methodologies: representation of geometric entities and perceptual properties using Conformal Geometric Algebra, and a voting scheme which is implemented using a clustering algorithm. Our method is applied in a hierarchical way, so that, we extract local and global...
Multiple Instance Regression jointly models a set of instances and its corresponding real-valued output. We present a novel multiple instance regression model that infers a subset of instances in each bag that best describes the bag label and uses them to learn a predictive model in a unified framework. We assume that instances in each bag are drawn from a mixture distribution and thus naturally form...
Pattern recognition tasks such as the data classification and clustering usually can be represented by the perspective of multiple views or feature spaces. Obviously, the accuracy of the classification and clustering should be greatly improved if we carefully consider the discriminabilities from multiple views and explore the complementary information among them. However, multiple features also bring...
We introduce a novel bags-of-features framework based on relative position descriptors, modeling both spatial relations and shape information between the pairwise structural subparts of objects. First, we propose a hierarchical approach for the decomposition of complex objects into structural subparts, as well as their description using the concept of Force Histogram Decomposition (FHD). Then, an...
Vision based environmental monitoring using fixed cameras generates large image collections, creating a bottleneck in data analysis. In areas with limited background knowledge of the monitored habitat, this bottleneck can often not be overcome by traditional pattern recognition methods. A new change detection method to identify interesting events such as presence and behavior of different species...
Subspace clustering refers to the task of clustering a collection of points drawn from a high-dimensional space into a union of multiple subspaces that best fits them. State-of-the-art approaches have been proposed for tackling this clustering problem by using the low-rank or sparse optimization techniques. However, most of the traditional subspace clustering methods are developed for single-view...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.