TY - GEN
T1 - Learning the optimal transformation of salient features for image classification
AU - Zhou, Jun
AU - Fu, Zhouyu
AU - Robles-Kelly, Antonio
PY - 2009
Y1 - 2009
N2 - In this paper, we address the problem of recovering an optimal salient image descriptor transformation for image classification. Our method involves two steps. Firstly, a binary salient map is generated to specify the regions of interest for subsequent image feature extraction. To this end, an optimal cut-off value is recovered by maximising Fisher's linear discriminant separability measure so as to separate the salient regions from the background of the scene. Next, image descriptors are extracted in the foreground region in order to be optimally transformed. The descriptor optimisation problem is cast in a regularised risk minimisation setting, in which the aim of computation is to recover the optimal transformation up to a cost function. The cost function is convex and can be solved using quadratic programming. The results on unsegmented Oxford Flowers database show that the proposed method can achieve classification performance that are comparable to those provided by alternatives elsewhere in the literature which employ pre-segmented images.
AB - In this paper, we address the problem of recovering an optimal salient image descriptor transformation for image classification. Our method involves two steps. Firstly, a binary salient map is generated to specify the regions of interest for subsequent image feature extraction. To this end, an optimal cut-off value is recovered by maximising Fisher's linear discriminant separability measure so as to separate the salient regions from the background of the scene. Next, image descriptors are extracted in the foreground region in order to be optimally transformed. The descriptor optimisation problem is cast in a regularised risk minimisation setting, in which the aim of computation is to recover the optimal transformation up to a cost function. The cost function is convex and can be solved using quadratic programming. The results on unsegmented Oxford Flowers database show that the proposed method can achieve classification performance that are comparable to those provided by alternatives elsewhere in the literature which employ pre-segmented images.
UR - http://www.scopus.com/inward/record.url?scp=77950347006&partnerID=8YFLogxK
U2 - 10.1109/DICTA.2009.28
DO - 10.1109/DICTA.2009.28
M3 - Conference contribution
SN - 9780769538662
T3 - DICTA 2009 - Digital Image Computing: Techniques and Applications
SP - 125
EP - 131
BT - DICTA 2009 - Digital Image Computing
T2 - Digital Image Computing: Techniques and Applications, DICTA 2009
Y2 - 1 December 2009 through 3 December 2009
ER -