Regular ArticleDimensionality Reduction for Similarity Searching in Dynamic Databases☆
References (36)
Multi-dimensional binary search trees used for associative searching
Comm. ACM
(1975)- S. Berchtold, D. A. Keim, and, H. P. Kreigel, The X-tree: An index structure for high dimensional data, in, Proceedings...
- N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger, The R* tree: An efficient and robust access method for points and...
- et al.
An eigenspace update algorithm for image analysis
CVGIP: J. Graph. Models Image Process.
(1997) - et al.
Finding images/video in large archives
CNRI Digital Library Mag.
(1997) - et al.
Efficient numerically stabilized rank-one eigenstructure updating
IEEE Trans. Acoust. Signal Process.
(1990) - et al.
An algorithm for finding best matches in logarithmic expected time
ACM Trans. Math. Software
(1977) - et al.
Efficient and effective querying by image content
J. Intell. Inf. Systems
(1994) - et al.
A Fast Algorithm for Indexing, Data-Mining, and Visualization of Traditional and Multimedia Datasets
(1994) - M. W. Freeston, The bang file: A new kind of grid file, in Proc. ACM SIGMOD Intl. Conf. on Management of Data, May...
Visual information retrieval
Comm. ACM
Matrix Computations
Cited by (21)
Random-forest-based real-time contrasts control chart using adaptive breakpoints with symbolic aggregate approximation
2020, Expert Systems with ApplicationsCitation Excerpt :The DWT uses the wavelet function to provide a multi-resolution decomposition basis (Chan & Fu, 1999). The SVD was suggested to find multi-scale patterns in the signal (Kanth, Agrawal, El Abbadi, & Singh, 1999). The PAA uses the average of the sequence to represent the data (Keogh, Chakrabarti, Pazzani, & Mehrotra, 2001a, 2001b), and the SAX adds string-based algorithms to the PAA (Lin et al., 2003, 2007).
Compression of aerodynamic databases using high-order singular value decomposition
2010, Aerospace Science and TechnologyCitation Excerpt :For example, del-Castillo-Negrete et al. [4] considered various SVD based algorithms to compress three-dimensional magneto-hydrodynamic databases; in particular, they used a generalised low rank approximation [17], which requires an iterative process and is suitable for databases in which one of the dimensions is dominant. Also, Kanth et al. [12] have developed a novel SVD technique that allows for image reconstruction with an error caused by the approximate computation smaller than 10%. Another SVD based methodology for face image recognition has been reported by Sakalli et al. [13], who developed a step-wise approach to the problem that involved the Karhunen–Loeve transform of clustered image blocks.
Image Analysis and Computer Vision: 1999
2000, Computer Vision and Image UnderstandingFractal Dimension Calculation for Big Data Using Box Locality Index
2018, Annals of Data ScienceWhen to Invoke a Prediction Service? A Reinforcement Learning-Based Approach
2018, Proceedings - 2018 IEEE International Conference on Web Services, ICWS 2018 - Part of the 2018 IEEE World Congress on Services
- ☆
Work supported in part by a research grant from NSF/ARPA/NASA IRI-9411330. An earlier version of this paper appeared in ACM SIGMOD 1998.
- f1
{kravi, agrawal, amr, ambuj}@cs.ucsb.edu