| |
Kapitel 1:
Text Retrieval |
Allgemeine Bücher zum Textretrieval
- [SM83] Gerard Salton and Michael J. McGill. Information Retrieval
- Grundlegendes für Informationswissenschaftler, McGraw-Hill Book
Company, 1983, ISBN 3-89028-051-X
- [FB92] W.B. Frakes and R. Baeza-Yates. Information Retrieval, Data
Structures and Algorithms, Prentice Hall, 1992. ISBN 0-13-463837-9.
- [SW97] Karen Sparck Jones and Peter Willet. Readings in Information
Retrieval. Morgan Kaufmann Publishers Inc., 1997. ISBN 1-55860-454-5.
- [GF98] David A. Grossmann and Ophir Frieder. Information Retrieval:
Algorithms and Heuristics, Kluwer Academic Publishers, 1998. ISBN 0-7923-8271-4.
- [BR99] Ricardo Baeza-Yates and Berthier Ribeiro-Neto. Modern Information
Retrieval, Addison-Wesley, 1999, ISBN 0-201-39829-X.
- [Dom01] Sandor Dominich. Mathematical Foundations of Information Retrieval,
Kluwer Academic Publishers, 2001. ISBN 0-7923-6861-4.
Latent Semantic Indexing
- [FDDL+88] George W. Furnas,Scott C. Deerwester,Susan T. Dumais,Thomas
K. Landauer,Richard A. Harshman,Lynn A. Streeter,Karen E. Lochbaum:
Information Retrieval using a Singular Value Decomposition Model of
Latent Semantic Structure.SIGIR 1988: 465-480
- [DDL+90] S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas,
and R. A. Harshman. Indexing by Latent Semantic Analysis. Journal of
the American Society for Information Science, 41(6):391--407, 1990.
- [F96] Christos Faloutsos, Searching Multimedia Databases by Content,
Kuwler Academic Publishers, 1996
- Telcordia: http://lsi.research.telcordia.com/
IR und DBMS
- [GF98] David A. Grossmann, Ophir Friedler, Information Retrieval:
Algorithms and Heuristics, Kuwler Academic Publishers, 1998
- Forschungsprototyp PowerDB (massiv paralleles XML/Text-Retrieval mit
DBMS): http://www-dbs.ethz.ch/~powerdb/
- H.-J. Schek, P. Pistor: Data Structures for an Integrated Data Base
Management and Information Retrieval System. In: Int. Conf. on Very
Large Databases (VLDB) 1982, p. 197-207
- H.-J. Schek, Nested Transactions in a Combined IRS-DBMS Architecture,
in Research and Development in Information Retrieval (ed. C. J. van
Rijsbergen), Cambridge University Press, 1984.
- Grabs, T., Böhm, K., Schek, H.-J., High-level Parallelisation
in a Database Cluster: a Feasibility Study Using Document Services.
To appear in: Proceedings of the 17th International Conference on Data
Engineering (ICDE2001), Heidelberg, Germany, April 2-6 2001.
Anwendungen der Retrievalmodelle
- Boolesches Retrieval
- Vektorraumretrieval
- Retrieval mit LSI
|
| |
Kapitel 3:
Image Retrieval |
Allgemeine Bücher zum Bildtretrieval
- Christos Faloutsos, Searching Multimedia Databases by Content, Kluwer
Academic Publishers, 1996
- Alberto Del Bimbo, Visual Information Retrieval, Morgan Kaufmann Publishers,
1999.
- Michael S. Lew (Ed.), Principles of Visual Information Retrieval,
Springer Verlagr, 2001.
Merkmalsextraktion
- Farbräume
- Primitive Merkmale
- Y. Rui, T. Huang, and S.F. Chang, ContentBased Image Retrieval:
A Survey, Journal of Visual Communication and Image Representation,
Academic Press, March 1999.
- M. Flickner, H. S. Sawhney, J. Ashley, Q. Huang, B. Dom, M. Gorkani,
J. Hafner, D. Lee, D. Petkovic, D. Steele, and P. Yanker, Query by
Image and Video Content: The QBIC System. IEEE Computer, 28(9):23-32,
Sept. 1995.
- M. Stricker and A. Dimai. Color Indexing with Weak Spatial Constraints.
In Storage and Retrieval for Image and Video Databases (SPIE), volume
2670 of SPIE Proceedings, pages 29-40, San Diego/La Jolla, CA, USA,
Feb. 1996.
- A. Dimai, Invariant Scene Representations for Preattentive Similarity
Assessment, PhD. Thesis, ETH Zurich, 1999.
- B.S. Manjunath and W.Y. Ma, Texture Features for Browsing and Retrieval
of Image Data, IEEE Transactions on Pattern Analysis and Machine Intelligence,
Vol. 18:8, p. 837-842, 1996.
- A. Vailaya, Shape-Based Image Retrieval, Master Thesis, Michigan
State University, 1996.
- S. Berchtold, D. A. Keim, and H.-P. Kriegel. Section Coding: Ein
Verfahren zur Ähnlichkeitssuche in CAD-Datenbanken. In Datenbanksysteme
in Büro, Technik und Wissenschaft, pages 152-172, Ulm, Germany,
Mar. 1997. Springer.
- Logische Merkmale
- David Forsyth, http://www.cs.berkeley.edu/~daf/
- The Face Recognition Home Page: http://www.cs.rug.nl/~peterkr/FACE/frhp.html
- Henry A. Rowley, Shumeet Baluja, and TakeoKanade, Neural Network-BasedFace
Detection, IEEE Transactions on Pattern Analysis and MachineIntelligence,
volume 20, number 1, pages 23-38, January 1998, http://www.cs.cmu.edu/~har/faces.html.
- Henry A. Rowley, Shumeet Baluja, and Takeo Kanade, Rotation Invariant
Neural Network-Based Face Detection, accepted for oral presentation
at Computer Vision and Pattern Recognition, 1998,pages 38-44, http://www.cs.cmu.edu/~har/faces.html.
Sinn und Unsinn von NN-Suche in hoch-dimensionalen
Räumen
- S. Berchtold, C. Böhm, D. A. Keim, and H.-P. Kriegel. A Cost
Model For Nearest Neighbour Search. In Proceedings of the ACM Symposium
on Principles of Database Systems (PODS), pages 78-86, Tucson, Arizona,
USA, May 1997. ACM Press.
- R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance
study for similarity-search methods in high-dimensional spaces. In Proceedings
of the International Conference on Very Large Databases (VLDB), New
York, USA, August 1998.
- K. Beyer, J.Goldstein, R. Ramakrishnan, and U. Shaft. When is ``nearest
neighbour'' meaningful? In Proc. 7th Int. Conf. Data Theory, ICDT, number
1540 in Lecture Notes in Computer Science, LNCS, pages 217-235. Springer-Verlag,
10-12 January 1999.
- A. Hinneburg, C. C. Aggarwal, and D. A. Keim. What Is the Nearest
Neighbor in High Dimensional Spaces? In Proceedings of the International
Conference on Very Large Databases (VLDB), pages 506-515, Cairo, Egypt,
Sept. 2000. Morgan Kaufmann.
- C. C. Aggarwal, A. Hinneburg, and D. A. Keim. On the surprising behavior
of distance metrics in high dimensional spaces. In Proceedings of the
International Conference on Database Theory (ICDT), volume 1973 of Lecture
Notes in Computer Science, pages 420-434, London, UK, Jan. 2001. Springer.
Indexstrukturen für NN-Suche
- R.A. Finkel and J.L. Bentley. Quad-trees: A data structure for retrieval
on composite keys. ACTA Informatica, 4(1):1-9, 1974
- J.T. Robinson. The k-d-b-tree: A search structure for large multidimensional
dynamic indexes. In Proceedings of the ACM SIGMOD International Conference
on Management of Data, pages 10-18, 1981.
- J. Nievergelt, H. Hinterberger, and K.C. Sevcik. The grid file: An
adaptable symmetric multikey file structure. ACM Transactions on Database
Systems, 9(1):38-71, March 1984.
- J. A. Orenstein and T. H. Merrett. A Class of Data Structures for
Associative Searching. In Proceedings of the ACM Symposium on Principles
of Database Systems (PODS), pages 181--190, Waterloo, Ontario, Canada,
Apr. 1984. ACM.
- A.Guttman. R-Trees: A dynamic index structure for spatial searching.
In Proceedings of the ACM SIGMOD International Conference on Management
of Data, pages 47-57, Boston, MA, June 1984.
- T. Sellis, N. Roussopoulos, and C. Faloustos. The R+-tree: A dynamic
index for multi-dimensional objects. In Proceedings of the International
Conference on Very Large Databases (VLDB), pages 507-518, Brighton,
England, 1987.
- N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree:
An efficient and robust access method for points and rectangles. In
Proceedings of the 1990 ACM SIGMOD International Conference on Management
of Data, pages 322-331, Atlantic City, NJ, 23-25 May 1990.
- H. V. Jagadish. Spatial Search with Polyhedra. In Proceedings of the
International Conference on Data Engineering (ICDE), pages 311--319,
Los Angeles, California, USA, Feb. 1990. IEEE Computer Society.
- K.-I. Lin, H.V. Jagadish, and C. Faloutsos. The TV-tree: An index
structure for high-dimensional data. The VLDB Journal: The International
Journal on Very Large Data Bases, 3(4):517-549, October 1994.
- Tzi-cker Chiueh. Content-Based Image Indexing (vp-Tree). In Proceedings
of the Twentieth International Conference on Very Large Databases, pages
582--593, Santiago, Chile, 1994.
- S. Berchtold, D.A. Keim, and H.-P. Kriegel. The X-tree: An index structure
for high-dimensional data. In Proceedings of the International Conference
on Very Large Databases (VLDB), pages 28-39, 1996.
- David A. White, Ramesh Jain: Similarity Indexing with the SS-tree.
ICDE 1996: 516-523
- R. Kurniawati, J. S. Jin, and J. Shepherd. SS+-Tree: An Improved Index
Structure for Similarity Searches in a High-Dimensional Feature Space.
In Storage and Retrieval for Image and Video Databases (SPIE), volume
3022 of SPIE Proceedings, pages 110--120, San Jose, CA, USA, Feb. 1997.
- N. Katayama and S. Satoh. The SR-tree: An index structure for high-dimensional
nearest neighbor queries. In Proceedings of the ACM SIGMOD International
Conference on Management of Data, pages 369-380, Tucson, Arizon USA,
1997.
- P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access
method for similarity search in metric spaces. In Proceedings of the
International Conference on Very Large Databases (VLDB), Greece, 1997.
- C. Böhm and H.-P. Kriegel. Dynamically Optimizing High-Dimensional
Index Structures. In Proceedings of the International Conference on
Extending Database Technology, volume 1777 of Lecture Notes in Computer
Science, pages 36--50, Konstanz, Germany, Mar. 2000. Springer-Verlag.
- J. M. Hellerstein, J. F. Naughton, and A. Pfeffer. Generalized Search
Trees for Database Systems (GiST). In Proceedings of the International
Conference on Very Large Databases (VLDB), pages 562-573, Zurich, Switzerland,
Sept. 1995. Morgan Kaufmann.
- Stefan Berchtold, Christian Böhm, and Hans-Peter Kriegel. The
pyramid-technique: Towards breaking the curse of dimensionality. In
Proceedings of the ACM SIGMOD International Conference on Management
of Data, pages 142-153, Seattle, WA, USA, 1998
- J. Goldstein and R. Ramakrishnan. Contrast Plots and P-Sphere Trees:
Space vs. Time in NN Searches. In Proceedings of the International Conference
on Very Large Databases (VLDB), pages 429--440, Cairo, Egypt, Sept.
2000. Morgan Kaufmann.
VA-File
- Roger Weber, Hans-J. Schek and Stephen Blott. A Quantitative Analysis
and Performance Study for Similarity-Search Methods in High-Dimensional
Spaces. In Proceedings of the International Conference on Very Large
Databases (VLDB), New York, USA, August 1998.
- Roger Weber, Klemens Böhm. Trading Quality for Time with Nearest-Neighbor
Search. In VII. Conference on Extending Database Technology (EDBT'2000),
Konstanz, Germany, March 27-31 2000.
- Roger Weber, Klemens Böhm, and Hans-J. Schek. Interactive-Time
Similarity Search for Large Image Collections Using Parallel VA-Files.
In 16th International Conference on Data Engineering (ICDE'2000), San
Diego, CA, USA, February 29 - March 3, 2000.
- Roger Weber, Similarity Search in High-Dimensional Vector Spaces,
PhD. Thesis, ETH Zurich, 1999.
Komplexe Anfragen
- P. Ciaccia, M. Patella, and P. Zezula. Processing Complex Similarity
Queries with Distance-Based Access Methods. In Proceedings of the International
Conference on Extending Database Technology, volume 1377 of Lecture
Notes in Computer Science, pages 9-23, Valencia, Spain, Mar. 1998. Springer.
- R. Fagin. Combining Fuzzy Information from Multiple Systems. In Proceedings
of the ACM Symposium on Principles of Database Systems (PODS), pages
216-226, Montreal, Canada, June 1996. ACM Press.
- Surajit Chaudhuri, Luis Gravano. Optimizing Queries over Multimedia
Repositories, SIGMOD Conf. 1996, pages 91-102.
- Surajit Chaudhuri,Kyuseok Shim. Optimization of Queries with User-defined
Predicates, VLDB 1996, pages 87-98.
- M. Mlivoncic, K. Böhm, H.-J. Schek, R. Weber: Fast Evaluation
Techniques for Complex Similarity Queries. 27th Int. Conf. on Very Large
Databases (VLDB), Roma, Italy, September 2001.
Bildsuchsysteme (ausgewählte)
|