TY - GEN
T1 - Building a navigation structure from a fuzzy relationship for image retrieval
AU - Loisant, Erwan
AU - Ishikawa, Hiroshi
AU - Martinez, José
AU - Ohta, Manabu
AU - Katayama, Kaoru
PY - 2005
Y1 - 2005
N2 - Going one step further feedback querying in integrating user into retrieval process, navigation is the more recent approach to find images in a large image collection using content-based information. However, while properties extracted from images are usually fuzzy data, most of the time a navigation structure will deal with binary links from an image (or a group of images) to another. A trivial solution to get a binary relationship from fuzzy data is to apply a threshold, but this solution not only leads to a loss of information but fails to distinguish noise from interesting elements. In this paper, we propose two techniques to eliminate isolated elements and lead to a structure made of more compact subparts. The first one is based on a variable threshold depending on the number of neighbours. The second one, specific to Galois' lattice, is based on taking into account the existing navigation structure for binarisation of descriptions. Experiments showed that it improves the resulting structure by reducing the number of nodes without loosing information on image description, thus improving user experience.
AB - Going one step further feedback querying in integrating user into retrieval process, navigation is the more recent approach to find images in a large image collection using content-based information. However, while properties extracted from images are usually fuzzy data, most of the time a navigation structure will deal with binary links from an image (or a group of images) to another. A trivial solution to get a binary relationship from fuzzy data is to apply a threshold, but this solution not only leads to a loss of information but fails to distinguish noise from interesting elements. In this paper, we propose two techniques to eliminate isolated elements and lead to a structure made of more compact subparts. The first one is based on a variable threshold depending on the number of neighbours. The second one, specific to Galois' lattice, is based on taking into account the existing navigation structure for binarisation of descriptions. Experiments showed that it improves the resulting structure by reducing the number of nodes without loosing information on image description, thus improving user experience.
UR - http://www.scopus.com/inward/record.url?scp=33947158150&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33947158150&partnerID=8YFLogxK
U2 - 10.1109/ICDE.2005.201
DO - 10.1109/ICDE.2005.201
M3 - Conference contribution
AN - SCOPUS:33947158150
SN - 0769526578
SN - 9780769526577
T3 - Proceedings - International Workshop on Biomedical Data Engineering, BMDE2005
SP - 1179
BT - Proceedings - International Workshop on Biomedical Data Engineering, BMDE2005
PB - IEEE Computer Society
T2 - 21st International Conference on Data Engineering Workshops 2005
Y2 - 3 April 2005 through 4 April 2005
ER -