## Efficient Content-Based Retrieval: Experimental Results (1999)

Venue: | in CBA |

Citations: | 7 - 0 self |

### BibTeX

@INPROCEEDINGS{Berman99efficientcontent-based,

author = {Andrew P. Berman and Linda G. Shapiro},

title = {Efficient Content-Based Retrieval: Experimental Results},

booktitle = {in CBA},

year = {1999},

pages = {55--61}

}

### OpenURL

### Abstract

this paper, we briefly summarize those aspects and present a set of experiments that thoroughly evaluates the FIDS techniques and system.

### Citations

882 |
Query by image and video content: The QBIC system
- Flickner, Sawhney, et al.
- 1995
(Show Context)
Citation Context ...; : : : ; dn ); and min: d =Min(d 1 ; d 2 ; : : : ; dn ). These operations are all invariant under inequality. Weighting and addition are already commonly used in both commercial and research systems =-=[11, 10]-=-. Min and Max allow expressions with the boolean operators AND and OR. Fagin[9] has also proposed extending multimedia queries to boolean combinations, using Min and Max to implement them. 3 Indexing ... |

128 |
Some approaches to best match file searchingâ€ť, CACM
- Burkhard, Keller
- 1973
(Show Context)
Citation Context ...ew seconds, and only used 55 direct comparisons to find the results. There are algorithms in the literature based on the triangle inequality that can reduce the number of distance measure calculations=-=[1, 2, 3, 6, 8]-=- in object retrieval. These methods have the advantage of being applicable to any distance measure that satisfies the triangle inequality. FIDS uses algorithms based on the triangle inequality that ar... |

123 | Fuzzy queries in multimedia database systems
- FAGIN
- 1998
(Show Context)
Citation Context ...nvariant under inequality. Weighting and addition are already commonly used in both commercial and research systems [11, 10]. Min and Max allow expressions with the boolean operators AND and OR. Fagin=-=[9]-=- has also proposed extending multimedia queries to boolean combinations, using Min and Max to implement them. 3 Indexing with the triangle inequality Traditional database searches are based upon retri... |

57 | Proximity Matching Using FixedQueries Trees
- Baeza-Yates, Cunto, et al.
(Show Context)
Citation Context ...ew seconds, and only used 55 direct comparisons to find the results. There are algorithms in the literature based on the triangle inequality that can reduce the number of distance measure calculations=-=[1, 2, 3, 6, 8]-=- in object retrieval. These methods have the advantage of being applicable to any distance measure that satisfies the triangle inequality. FIDS uses algorithms based on the triangle inequality that ar... |

35 | A flexible image database system for content-based retrieval
- Berman, Shapiro
- 1999
(Show Context)
Citation Context ...asure retrieval[6], the selection of key images for indexing[4], the additional use of a data structure called the triangle trie to make retrieval time sublinear[7], and the details of the FIDS system=-=[5]-=-. In this paper, we briefly summarize those aspects and present a set of experiments that thoroughly evaluates the FIDS techniques and system. 2 The use of combinations of multiple distance measures A... |

27 | Using the triangle inequality to reduce the number of comparisons required for similarity-based retrieval
- Barros, French, et al.
- 1996
(Show Context)
Citation Context ...ew seconds, and only used 55 direct comparisons to find the results. There are algorithms in the literature based on the triangle inequality that can reduce the number of distance measure calculations=-=[1, 2, 3, 6, 8]-=- in object retrieval. These methods have the advantage of being applicable to any distance measure that satisfies the triangle inequality. FIDS uses algorithms based on the triangle inequality that ar... |

23 | L.G.: Efficient image retrieval with multiple distance measure
- Berman, Shapiro
- 1997
(Show Context)
Citation Context |

21 |
Visual Information Retrieval: A Virage Perspective, tech
- Gupta
- 1995
(Show Context)
Citation Context ...; : : : ; dn ); and min: d =Min(d 1 ; d 2 ; : : : ; dn ). These operations are all invariant under inequality. Weighting and addition are already commonly used in both commercial and research systems =-=[11, 10]-=-. Min and Max allow expressions with the boolean operators AND and OR. Fagin[9] has also proposed extending multimedia queries to boolean combinations, using Min and Max to implement them. 3 Indexing ... |

8 | A new data structure for fast approximate matching
- Berman
- 1994
(Show Context)
Citation Context |

1 |
Selecting good keys for triangle-inequality based pruning algorithms
- Berman, Shapiro
- 1997
(Show Context)
Citation Context ...the methods in the literature. We have published papers that described the use of the triangle inequality for efficient multiple-distance-measure retrieval[6], the selection of key images for indexing=-=[4]-=-, the additional use of a data structure called the triangle trie to make retrieval time sublinear[7], and the details of the FIDS system[5]. In this paper, we briefly summarize those aspects and pres... |

1 |
Triangle-inequalitybased algorithms with triangle tries
- Berman, Shapiro
- 1999
(Show Context)
Citation Context ...lity for efficient multiple-distance-measure retrieval[6], the selection of key images for indexing[4], the additional use of a data structure called the triangle trie to make retrieval time sublinear=-=[7]-=-, and the details of the FIDS system[5]. In this paper, we briefly summarize those aspects and present a set of experiments that thoroughly evaluates the FIDS techniques and system. 2 The use of combi... |