Adaptive Processing of Tree-Structure Image Representation
Much research on image analysis and processing has been carried out for the last few decades. However, it is still challenging to represent the image contents effectively and satisfactorily. In this paper, a segmentation-free tree-structure image representation is presented. In order to learn the structure representation, a back-propagation through structure (BPTS) algorithm is adopted. Experiments on plant image classification and retrieval refining using only six visual features were conducted on a plant image database and a natural scene image database, respectively. Encouraging results have been achieved.
Unable to display preview. Download preview PDF.
- 1.M. Flickner, H. Sawhney, W. Niblack, J. Ashely, Qian Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic, D. Steele, and P. Yanker. Query by image and video content: The qbic system. IEEE Computer, 28(9):23–32, Sept. 1995.Google Scholar
- 3.C. Goller and A. Kuchler. Learning task-dependent distributed representations by backpropagation through structure. In IEEE International Conference on Neural Networks, pages 347–352, 1996.Google Scholar
- 6.A. C. Tsoi. Adaptive processing of data structures:an expository overview and comments. Technique report, Faculty of Informatics, University of Wollongong, Australia, 1998.Google Scholar