Online feature selection for pixel classification

ABSTRACT

Online feature selection (OFS) provides an efficient way to sort through a large space of features, particularly in a scenario where the feature space is large and features take a significant amount of memory to store. Image processing operators, and especially combinations of image processing operators, provide a rich space of potential features for use in machine learning for image processing tasks but they are expensive to generate and store. In this paper we apply OFS to the problem of edge detection in grayscale imagery. We use a standard data set and compare our results to those obtained with traditional edge detectors, as well as with results obtained more recently using "statistical edge detection." We compare several different OFS approaches, including hill climbing, best first search, and grafting.

REFERENCES

• 1: Kevin Bowyer , Christine Kranenburg , Sean Dougherty, Edge detector evaluation using empirical ROC curves, Computer Vision and Image Understanding, v.84 n.1, p.77-103, October 2001 [doi>10.1006/cviu.2001.0931]
• 2: Forbes, L. A., & Draper, B. A. (2000). Inconsistencies in edge detector evaluation. Computer Vision and Pattern Recognition (pp. 398--404). Hilton Head, SC.
• 3: Forrest, S., & Mitchell, M. (1993). Relative building-block fitness and the building-block hypothesis. In L. D. Whitley (Ed.), Foundations of Genetic Algorithms 2, 109--126. San Mateo, CA: Morgan Kaufmann.
• 4: Green, D., & Swets, J. (1966). Signal Detection Theory and Psychophysics. New York: Wiley.
• 5: Greenspan, II., Belongie, S., Perona, P., Goodman, R., Rakshit, S., & Anderson, C. (1994). Overcomplete steerable pyramid filters and rotation invariance. CVPR94 (pp. 222--228).
• 6: Isabelle Guyon , André Elisseeff, An introduction to variable and feature selection, The Journal of Machine Learning Research, 3, 3/1/2003
• 7: Hastie, T., Tibshirani, R., & Friedman, J. (2001). The Elements of Statistical Learning. New York: Springer.
• 8: Ron Kohavi , George H. John, Wrappers for feature subset selection, Artificial Intelligence, v.97 n.1-2, p.273-324, Dec. 1997 [doi>10.1016/S0004-3702(97)00043-X]
• 9: Scott Konishi , Alan L. Yuille , James M. Coughlan , Song Chun Zhu, Statistical Edge Detection: Learning and Evaluating Edge Cues, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.25 n.1, p.57-74, January 2003 [doi>10.1109/TPAMI.2003.1159946]
• 10: John R. Koza, Genetic programming: on the programming of computers by means of natural selection, MIT Press, Cambridge, MA, 1992
• 11: David R. Martin , Charless C. Fowlkes , Jitendra Malik, Learning to Detect Natural Image Boundaries Using Local Brightness, Color, and Texture Cues, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.26 n.5, p.530-549, May 2004 [doi>10.1109/TPAMI.2004.1273918]
• 12: Nestares, O., Navarro, R., Portilla, J., & Tabernero, A. (1998). Efficient spatial-domain implementation of a multiscale image representation based on Gabor functions. Journal of Electronic Imaging, 7, 166--173.
• 13: Simon Perkins , Kevin Lacker , James Theiler, Grafting: fast, incremental feature selection by gradient descent in function space, The Journal of Machine Learning Research, 3, 3/1/2003
• 14: Perkins, S., & Theiler, J. (2003). Online feature selection using grafting. ICML (pp. 592--599).
• 15: Shin, M. C., Goldgof, D. B., & Bowyer, K. W. (1999). Comparison of edge detectors using an object recognition task. Computer Vision and Pattern Recognition (pp. 360--365).
• 16: Jason Weston , André Elisseeff , Bernhard Schölkopf , Mike Tipping, Use of the zero norm with linear models and kernel methods, The Journal of Machine Learning Research, 3, 3/1/2003
• 17: Zhu (1996). Efficient evaluations of edge connectivity and width uniformity. Image and Vision Computing, 14, 21--34.