This paper presents a new and fast binary descriptor for image matching learned from Haar features. The training uses AdaBoost; the weak learner is built on response function for Haar features, instead of histogram-type features. The weak classifier is selected from a large weak feature pool. The selected features have different feature type, scale and position within the patch, having correspo...

Recent works on ensemble methods like Adaptive Boosting have been applied successfully in many problems. Ada-Boost algorithm running on a given weak learner several times on slightly altered data and combining the hypotheses in order to achieve higher accuracy than the weak learner. This paper presents an expert system that boosts the performance of an ensemble of classifiers. In, Boosting, a s...

Mobile Mapping is a standard technique for compiling cartographic information from a mobile vehicle. This paper proposes a novel method for modelling the recognition in a Mobile Mapping process that consists in fitting a model to recover the sign distortion and applying recognition techniques on weak classifiers cascade results. The images received from Adaboost learning algorithm with weak cla...

We present a theory of boosting probabilistic classifiers. We place ourselves in the situation of a user who only provides a stopping parameter and a probabilistic weak learner/classifier and compare three types of boosting algorithms: probabilistic Adaboost, decision tree, and tree of trees of ... of trees, which we call matryoshka. “Nested tree,” “embedded tree” and “recursive tree” are also ...

Recently, many classes of objects can be efficiently detected by the way of machine learning techniques. In practice, boosting techniques are among the most widely used machine learning for various reasons. This is mainly due to low false positive rate of the cascade structure offering the possibility to be trained by different classes of object. However, it is especially used for face detectio...

We propose a boosting method, DirectBoost, a greedy coordinate descent algorithm that builds an ensemble classifier of weak classifiers through directly minimizing empirical classification error over labeled training examples; once the training classification error is reduced to a local coordinatewise minimum, DirectBoost runs a greedy coordinate ascent algorithm that continuously adds weak cla...

Classifier combining techniques have become popular for improving weak classifiers in recent years. The random subspace method (RSM) is an efficient classifier combining technique that can improve classification performance of weak classifiers for the small sample size (SSS) problems. In RSM, the feature subsets are randomly selected and the resulting datasets are used to train classifiers. How...

This paper proposes a universal method, Boost Picking, to train supervised classification models mainly by un-labeled data. Boost Picking only adopts two weak classifiers to estimate and correct the error. It is theoretically proved that Boost Picking could train a supervised model mainly by un-labeled data as effectively as the same model trained by 100% labeled data, only if recalls of the tw...

This paper proposes a crack recognition method based on high-resolution line array 12 cameras and adaptive lifting algorithm. By defining the crack rate, this algorithm calculates the 13 ratio of the crack area to the area of the entire collected image to characterize the damage extent of 14 the current section. The algorithm first uses image preprocessing to reduce the image noise, then 15 use...

In many problems of machine learning and computer vision, there exists side information, i.e., information contained in the training data and not available in the testing phase. This motivates the recent development of a new learning approach known as learning with side information that aims to incorporate side information for improved learning algorithms. In this work, we describe a new traini...