Efficient Matching and Indexing of Graph Models in Content-Based Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
| Hi-index | 0.00 |
Content based access to image databases relies on models which permit to abstract images in some space of visual features. A large number of such models addressing features of shape, texture, color, and spatial arrangement have been proposed and experimented. Fusion of multiple features within a single model is now being investigated as a way to increase the effectiveness of retrieval. In particular, integration of color and spatial models is receiving a recent and growing interest.In this paper, we propose a representation which captures the spatial arrangement of the color sets of a picture, without taking into account their distribution in separate non-connected regions. A spatial modeling technique, that we call {\em weighted walkthroughs} is presented, and its suitability to support this representation is motivated and experimented.