Does anyone know how this "connected component algorithm" works?

This is interesting. I hope your talk goes deeper into the workings of Adaboost. Also, the authors make the claim that adaboost is the best training algorithm for detecting objects in image scenes. Where has this been investigated. It seems like depending on what features you choose, or how carefully you choose them, different training methods may have unpredictable results in terms of their comparative success.

During the training of the strong classifier of the AdaBoost algorithm, the choice of weigths, alpha_t, and weak classifiers, h_t, are obtained by updating the weights, D_t(i). Why is the optimum choice that which minimizes Z_t ( where Z_t is the normalization factor)?

This is a good application for AdaBoost. However, the paper does not discuss the sensitivity of the algorithm to the input data and parameters. It would be interesting to see some tolerance bounds and the dependence of accuracy on the original signal.

Their feature analysis process is interesting. I gather that the decisions about what category of feature to offer the classifiers at each level was largely done by hand. I wonder whether some of that process can be generalized and automated. For example, maybe good combination features can be discovered by examining the shape of their joint histograms to see how bimodal they are.

I didn't understand their modulus of derivative feature, though. What is that?

Edited by author 10-19-2004 03:32 AM
They seem to have slower speed of detection compared to Viola Jones (that was able to detect faces at 30fps) even though they use less features and the same integral image trick. Why is that??

The features they used still seem similar to Viola Jones features, what is the difference? I did not understand their initial feature set production phase?

your discussion is very good! I will wait for updates. Give a look at allegra d side effects webpage devoted to allegra d side effects. lexapro medicine webpage devoted to lexapro medicine.

Hello moder!