TY - JOUR
T1 - Saliency-weighted graphs for efficient visual content description and their applications in real-time image retrieval systems
AU - Ahmad, Jamil
AU - Sajjad, Muhammad
AU - Mehmood, Irfan
AU - Rho, Seungmin
AU - Baik, Sung Wook
N1 - Publisher Copyright:
© 2015, Springer-Verlag Berlin Heidelberg.
PY - 2017/9/1
Y1 - 2017/9/1
N2 - The exponential growth in the volume of digital image databases is making it increasingly difficult to retrieve relevant information from them. Efficient retrieval systems require distinctive features extracted from visually rich contents, represented semantically in a human perception-oriented manner. This paper presents an efficient framework to model image contents as an undirected attributed relational graph, exploiting color, texture, layout, and saliency information. The proposed method encodes salient features into this rich representative model without requiring any segmentation or clustering procedures, reducing the computational complexity. In addition, an efficient graph-matching procedure implemented on specialized hardware makes it more suitable for real-time retrieval applications. The proposed framework has been tested on three publicly available datasets, and the results prove its superiority in terms of both effectiveness and efficiency in comparison with other state-of-the-art schemes.
AB - The exponential growth in the volume of digital image databases is making it increasingly difficult to retrieve relevant information from them. Efficient retrieval systems require distinctive features extracted from visually rich contents, represented semantically in a human perception-oriented manner. This paper presents an efficient framework to model image contents as an undirected attributed relational graph, exploiting color, texture, layout, and saliency information. The proposed method encodes salient features into this rich representative model without requiring any segmentation or clustering procedures, reducing the computational complexity. In addition, an efficient graph-matching procedure implemented on specialized hardware makes it more suitable for real-time retrieval applications. The proposed framework has been tested on three publicly available datasets, and the results prove its superiority in terms of both effectiveness and efficiency in comparison with other state-of-the-art schemes.
KW - Attributed relational graph
KW - Content-based image retrieval
KW - Image representation
KW - Real-time retrieval
KW - Saliency map
UR - http://www.scopus.com/inward/record.url?scp=84946887886&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84946887886&partnerID=8YFLogxK
U2 - 10.1007/s11554-015-0536-0
DO - 10.1007/s11554-015-0536-0
M3 - Article
AN - SCOPUS:84946887886
SN - 1861-8200
VL - 13
SP - 431
EP - 447
JO - Journal of Real-Time Image Processing
JF - Journal of Real-Time Image Processing
IS - 3
ER -