Abstract
Object detection in images is inherently imbalanced and prone to overfitting on the training set. This work investigates the use of a validation set and sampling methods in Multi-Objective Genetic Programming (MOGP) to improve the effectiveness and robustness of object detection in images. Results show that sampling methods decrease runtimes substantially and increase robustness of detectors at higher detection rates, and that a combination of validation together with sampling improves upon a validation-only approach in effectiveness and efficiency.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asuncion, A., Newman, D.J.: UCI Machine Learning Repository (2007), http://www.ics.uci.edu/~mlearn/MLRepository.html
Bhowan, U., Zhang, M., Johnston, M.: Multi-objective genetic programming for classification with unbalanced data. In: Proceedings of the 22nd Australasian Joint Conference on Artificial Intelligence, pp. 370–380 (2009)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist muliobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 182–197 (2002)
Doucette, J., Heywood, M.I.: GP Classification under Imbalanced Data Sets: Active Sub-sampling and AUC Approximation. In: O’Neill, M., Vanneschi, L., Gustafson, S., Esparcia Alcázar, A.I., De Falco, I., Della Cioppa, A., Tarantino, E. (eds.) EuroGP 2008. LNCS, vol. 4971, pp. 266–277. Springer, Heidelberg (2008)
Gathercole, C., Ross, P.: Dynamic Training Subset Selection for Supervised Learning in Genetic Programming. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 312–321. Springer, Heidelberg (1994)
Hunt, R., Johnston, M., Browne, W., Zhang, M.: Sampling methods in genetic programming for classification with unbalanced data. In: Proceedings of the 23rd Australasian Joint Conference on Artificial Intelligence, pp. 273–282 (2010)
Iba, H.: Bagging, boosting, and bloating in genetic programming. In: GECCO, vol. 2, pp. 1053–1060 (1999)
Knowles, J.: A summary-attainment-surface plotting method for visualizing the performance of stochastic multiobjective optimizers. In: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications, pp. 552–557 (2005)
Krawiec, K., Howard, D., Zhang, M.: Overview of object detection and image analysis by means of genetic programming techniques. In: Proceedings of the International Conference Frontiers in the Convergence of Bioscience and Information Technologies, pp. 779–784 (2007)
Liddle, T., Johnston, M., Zhang, M.: Multi-objective genetic programming for object detection. In: CEC, pp. 3345–3352 (2010)
Sitzler, E., Laumanns, M., Thiele, L., Talbi, E.: SPEA2: Improving the strength pareto evolutionary algorithm. In: USENIX Technical Conference (2001)
Zhang, M.: Improving object detection performance with genetic programming. International Journal on Artificial Intelligence Tools 16(5), 849–873 (2003)
Zhang, M., Ciesielski, V., Andreae, P.: A domain-independent window approach to multiclass object detection using genetic programming. EURASIP Journal on Applied Signal Processing 2003(8), 841–859 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hunt, R., Johnston, M., Zhang, M. (2011). Improving Robustness of Multiple-Objective Genetic Programming for Object Detection. In: Wang, D., Reynolds, M. (eds) AI 2011: Advances in Artificial Intelligence. AI 2011. Lecture Notes in Computer Science(), vol 7106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25832-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-25832-9_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25831-2
Online ISBN: 978-3-642-25832-9
eBook Packages: Computer ScienceComputer Science (R0)