DOCSLIB.ORG

Efficient K-Nearest Neighbor Searches for Multiple-Face Recognition in the Classroom Based on Three Levels DWT-PCA

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Efficient K-Nearest Neighbor Searches for Multiple-Face Recognition in the Classroom Based on Three Levels DWT-PCA (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 8, No. 11, 2017 Efficient K-Nearest Neighbor Searches for Multiple-Face Recognition in the Classroom based on Three Levels DWT-PCA Hadi Santoso Agus Harjoko, Agfianto Eko Putra Department of Computer Science and Electronics, Department of Computer Science and Electronics, Faculty of Mathematics and Natural Science Faculty of Mathematics and Natural Science Universitas Gadjah Mada Universitas Gadjah Mada Yogyakarta, Indonesia Yogyakarta, Information System Study Program Indonesia STMIK Atma Luhur Pangkalpinang, Indonesia Abstract—The main weakness of the k-Nearest Neighbor determine whether each student is present or absent and will be algorithm in face recognition is calculating the distance and sort recognized in the group of courses followed. all training data on each prediction which can be slow if there are a large number of training instances. This problem can be solved The contibutions of this paper include: 1) combining three by utilizing the priority k-d tree search to speed up the process of levels of 2D DWT-PCA for feature extraction; 2) we adapted k-NN classification. This paper proposes a method for student approximate nearest neighbors search algorithm using the attendance systems in the classroom using facial recognition priority of k-d tree to find some (k) nearest neighbors from a techniques by combining three levels of Discrete Wavelet certain query point (q) efficiently [2] Transforms (DWT) and Principal Component Analysis (PCA) to extract facial features followed by applying the priority of k-d The paper is structured as follows: Section 2 consists of tree search to speed up the process of facial classification using k- related research discussions, Section 3 consists of the proposed Nearest Neighbor. The proposed algorithm is tested on two research method, Section 4 presents the results of research and datasets that are Honda/UCSD video dataset and our dataset analysis, and Section 5 offers some conclusions. (AtmafaceDB dataset). This research looks for the best value of k to get the right facial recognition using k-fold cross-validation. II. RELATED WORKS 10-fold cross-validation at level 3 DWT-PCA shows that face Human facial recognition plays an important role in recognition using k-Nearest Neighbor on our dataset is 95.56% biometrics. The eigenvector-based method of facial recognition with k = 5, whereas in the Honda / UCSD dataset it is only 82% was first introduced by [3], and then expanded upon by [4] and with k = 3. The proposed method gives computational recognition [5]. The eigenvector-based method extracts the low- time on our dataset 40 milliseconds. dimensional subspace, which tends to simplify the Keywords—Multiple-face recognition; DWT; PCA; priority k-d classification process. Chitaliya and Trivedi [6] developed a tree; k-Nearest Neighbor facial recognition model that used wavelet-PCA for feature extraction, then used Euclidean distance and neural networks I. INTRODUCTION for classification. In this study, Level 1 discrete wavelet transform (DWT) was used. They were able to attain up to Facial recognition performance is influenced by several 93.3% accuracy. variables, including pose, expression, lighting, and occlusion (namely, glasses, mustaches, beards, headgear, etc.) [1]. In 2012, Rao [7] proposed a facial recognition system using discrete wavelet transform (DWT) and eigenvectors, showing Many educational institutions in Indonesia continue to use an average of 3.25% improvement in recognition performance. attendance sheets, allowing students to cheat by asking friends to sign their names. The use of attendance sheets has proven to Research on attendance management in the classroom be time-consuming, unreliable, inaccurate, and inefficient. proposed by [8], using the haar cascade method for face Based on this issue, we propose a combination of face detection. While the face recognition using eigenface method. recognition methods using three levels of Discrete Wavelet This face recognition approach achieves an accuracy of 85%. Transforms (DWT) and Principal Component Analysis (PCA) to extract facial features followed by applying k-d tree to Research on improving facial recognition was proposed by accelerate the process of facial classification using k-NN. The [9], who used a wavelet-PCA decomposition method with k-NN process with Euclidean distance is used to identify mahalanobis classification. The results of this study improved students’ presence through pictures or video of a student’s face. recognition by 95.7%. Recognition results using Euclidean By using this approach, it is possible that automatically classification reached 93.8% accuracy, with a computing speed integrated systems between IP camera and pc or notebooks will of 8.501 milliseconds. 112 | P a g e www.ijacsa.thesai.org (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 8, No. 11, 2017 In 2014, Mao [10] conducted research into multiple face efficiently and search for the location of the nearest neighbors. detection, tracking, and recognition in the classroom using a K-d tree data structure has been used as a data structure for Honda/UCSD dataset of videos. In the experiment, the student overcoming increased processing times caused by the addition dataset consisted of 16 and 39 people in the classroom. Fifty- of features into the database. An alternative approach is nine videos were used: 20 for training and 39 for testing. The establishing a balanced k-d tree, as proposed by [22]. The study used the Haar cascade facial detection method. For facial nearest neighbor search algorithm using the k-d tree data recognition, this study used eigenfaces, LBP+K-mean. The structure can be found in [23]. In their research, they only average precision and recall values in this study were more found one nearest neighbor. We integrate the priority k–d tree than 90%. search and best bin first method (BBF) to find the nearest neighbors, and the Euclidean distance is utilized as similarity The combination of methods for student attendance measure. systems in the classroom was proposed by [11] using facial recognition techniques by incorporating Discrete Wavelet In our study, the nearest proposed neighbor search Transforms (DWT) and Discrete Cosine Transform (DCT) to algorithm uses a data structure called a priority queue that extract the facial features of students followed by applying stores the list of closest neighbors k with some distance to the Radial Basis Function (RBF) to classify face objects. The query point q. The priority queue has a fixed upper limit on the success rate of the proposed system in recognizing facial number of elements (or points) that can be stored, which is the images of students who sit in the classroom is about 82%. number of nearest neighbors k. Each time a new element is added to the queue, if the queue is at a predetermined capacity, In 2017, Sayeed [12] presented an automated attendance the element with the highest priority value (the longest monitoring system with face recognition in a real-time distance) is removed from the queue. background world for with a database of student’s information by using Principal Component Analysis (PCA) algorithm. The III. PROPOSED METHOD testing results have been tested and taken from few different environment backgrounds. Basically is during the day and In order to make the framework, the proposed method in night time with lights either on or off. Average successful rate this study used was the method from related research and then of the proposed system are about 2.43 to 2.81. we developed them to be tested on our dataset. The research method used in this article consisted of several stages, as K-nearest neighbor (k-NN) is a simple and effective shown in Fig. 1. classification method. Samet [13] proposed a k-nearest neighbor algorithm using MaxNearestDist, while the k-NN A. Face Database Training Stage repair method had been proposed by [14]-[16]. The weakness 1) Single Face Image of k-NN algorithm, namely the process of calculating the In this stage, facial images of students were captured using similarity to be done on all existing training data [17]. If a digital camera. Facial data from 1,014 individuals was training data increases in number, the time for classification collected; each individual had nine images taken from different will also increase proportionately. The problem can be solved angles. A set of student facial images as training data is if using k-d tree data structure [18]-[21]. It can be used with a presented in Fig. 2. k-nearest neighbor (k-NN) approach to match facial features Face Database Training Stage 2D Discrete Single Face Face database Preprocessing Wavelet PCA Image with kd-tree Transform index Face Recognition Stage K-Nearest 2D Discrete Multiple Face Neighbor with Multiple Face Preprocessing Wavelet PCA Images / Video Euclidean Recognition Transform distance Fig. 1. The proposed method. Fig. 2. A set of student facial images as training data. 113 | P a g e www.ijacsa.thesai.org (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 8, No. 11, 2017 2) Preprocessing Discrete Wavelet Transform (DWT) is a discrete form of In the preprocessing stage, the following steps were the wavelet transform, consisting of a signal sampling process conducted: based on the scaling and shifting of parameters [25]. It is systematically defined by the following equation [26]: a) Facial cropping, the detection and localization of the face in a square area using the Viola-Jones method [24] j d j,k x(n)h(n 2 k) b) Changing the facial image from RGB to grayscale DWTx(n) (1) a x(n)g(n 2 j k) mode. j,k c) Resizing the facial image to 128x128 pixels. The coefficient refers to the detailed component of the d) Normalizing color brightness using a histogram signal ( ) and it is suited to the function of the wavelet, while equalization process.
Load more

Recommended publications
  • Two Algorithms for Nearest-Neighbor Search in High Dimensions
    Two Algorithms for Nearest-Neighbor Search in High Dimensions Jon M. Kleinberg∗ February 7, 1997 Abstract Representing data as points in a high-dimensional space, so as to use geometric methods for indexing, is an algorithmic technique with a wide array of uses. It is central to a number of areas such as information retrieval, pattern recognition, and statistical data analysis; many of the problems arising in these applications can involve several hundred or several thousand dimensions. We consider the nearest-neighbor problem for d-dimensional Euclidean space: we wish to pre-process a database of n points so that given a query point, one can ef- ficiently determine its nearest neighbors in the database. There is a large literature on algorithms for this problem, in both the exact and approximate cases. The more sophisticated algorithms typically achieve a query time that is logarithmic in n at the expense of an exponential dependence on the dimension d; indeed, even the average- case analysis of heuristics such as k-d trees reveals an exponential dependence on d in the query time. In this work, we develop a new approach to the nearest-neighbor problem, based on a method for combining randomly chosen one-dimensional projections of the underlying point set. From this, we obtain the following two results. (i) An algorithm for finding ε-approximate nearest neighbors with a query time of O((d log2 d)(d + log n)). (ii) An ε-approximate nearest-neighbor algorithm with near-linear storage and a query time that improves asymptotically on linear search in all dimensions.
    [Show full text]
  • Rank-Approximate Nearest Neighbor Search: Retaining Meaning and Speed in High Dimensions
    Rank-Approximate Nearest Neighbor Search: Retaining Meaning and Speed in High Dimensions Parikshit Ram, Dongryeol Lee, Hua Ouyang and Alexander G. Gray Computational Science and Engineering, Georgia Institute of Technology Atlanta, GA 30332 p.ram@,dongryel@cc.,houyang@,agray@cc. gatech.edu { } Abstract The long-standing problem of efficient nearest-neighbor (NN) search has ubiqui- tous applications ranging from astrophysics to MP3 fingerprinting to bioinformat- ics to movie recommendations. As the dimensionality of the dataset increases, ex- act NN search becomes computationally prohibitive; (1+) distance-approximate NN search can provide large speedups but risks losing the meaning of NN search present in the ranks (ordering) of the distances. This paper presents a simple, practical algorithm allowing the user to, for the first time, directly control the true accuracy of NN search (in terms of ranks) while still achieving the large speedups over exact NN. Experiments on high-dimensional datasets show that our algorithm often achieves faster and more accurate results than the best-known distance-approximate method, with much more stable behavior. 1 Introduction In this paper, we address the problem of nearest-neighbor (NN) search in large datasets of high dimensionality. It is used for classification (k-NN classifier [1]), categorizing a test point on the ba- sis of the classes in its close neighborhood. Non-parametric density estimation uses NN algorithms when the bandwidth at any point depends on the ktℎ NN distance (NN kernel density estimation [2]). NN algorithms are present in and often the main cost of most non-linear dimensionality reduction techniques (manifold learning [3, 4]) to obtain the neighborhood of every point which is then pre- served during the dimension reduction.
    [Show full text]
  • Nearest Neighbor Search in Google Correlate
    Nearest Neighbor Search in Google Correlate Dan Vanderkam Robert Schonberger Henry Rowley Google Inc Google Inc Google Inc 76 9th Avenue 76 9th Avenue 1600 Amphitheatre Parkway New York, New York 10011 New York, New York 10011 Mountain View, California USA USA 94043 USA [email protected] [email protected] [email protected] Sanjiv Kumar Google Inc 76 9th Avenue New York, New York 10011 USA [email protected] ABSTRACT queries are then noted, and a model that estimates influenza This paper presents the algorithms which power Google Cor- incidence based on present query data is created. relate[8], a tool which finds web search terms whose popu- This estimate is valuable because the most recent tradi- larity over time best matches a user-provided time series. tional estimate of the ILI rate is only available after a two Correlate was developed to generalize the query-based mod- week delay. Indeed, there are many fields where estimating eling techniques pioneered by Google Flu Trends and make the present[1] is important. Other health issues and indica- them available to end users. tors in economics, such as unemployment, can also benefit Correlate searches across millions of candidate query time from estimates produced using the techniques developed for series to find the best matches, returning results in less than Google Flu Trends. 200 milliseconds. Its feature set and requirements present Google Flu Trends relies on a multi-hour batch process unique challenges for Approximate Nearest Neighbor (ANN) to find queries that correlate to the ILI time series. Google search techniques. In this paper, we present Asymmetric Correlate allows users to create their own versions of Flu Hashing (AH), the technique used by Correlate, and show Trends in real time.
    [Show full text]
  • R-Trees with Voronoi Diagrams for Efficient Processing of Spatial
    VoR-Tree: R-trees with Voronoi Diagrams for Efficient Processing of Spatial Nearest Neighbor Queries∗ y Mehdi Sharifzadeh Cyrus Shahabi Google University of Southern California [email protected] [email protected] ABSTRACT A very important class of spatial queries consists of nearest- An important class of queries, especially in the geospatial neighbor (NN) query and its variations. Many studies in domain, is the class of nearest neighbor (NN) queries. These the past decade utilize R-trees as their underlying index queries search for data objects that minimize a distance- structures to address NN queries efficiently. The general ap- based function with reference to one or more query objects. proach is to use R-tree in two phases. First, R-tree's hierar- Examples are k Nearest Neighbor (kNN) [13, 5, 7], Reverse chical structure is used to quickly arrive to the neighborhood k Nearest Neighbor (RkNN) [8, 15, 16], k Aggregate Nearest of the result set. Second, the R-tree nodes intersecting with Neighbor (kANN) [12] and skyline queries [1, 11, 14]. The the local neighborhood (Search Region) of an initial answer applications of NN queries are numerous in geospatial deci- are investigated to find all the members of the result set. sion making, location-based services, and sensor networks. While R-trees are very efficient for the first phase, they usu- The introduction of R-trees [3] (and their extensions) for ally result in the unnecessary investigation of many nodes indexing multi-dimensional data marked a new era in de- that none or only a small subset of their including points veloping novel R-tree-based algorithms for various forms belongs to the actual result set.
    [Show full text]
  • Dimensional Testing for Reverse K-Nearest Neighbor Search
    University of Southern Denmark Dimensional testing for reverse k-nearest neighbor search Casanova, Guillaume; Englmeier, Elias; Houle, Michael E.; Kröger, Peer; Nett, Michael; Schubert, Erich; Zimek, Arthur Published in: Proceedings of the VLDB Endowment DOI: 10.14778/3067421.3067426 Publication date: 2017 Document version: Final published version Document license: CC BY-NC-ND Citation for pulished version (APA): Casanova, G., Englmeier, E., Houle, M. E., Kröger, P., Nett, M., Schubert, E., & Zimek, A. (2017). Dimensional testing for reverse k-nearest neighbor search. Proceedings of the VLDB Endowment, 10(7), 769-780. https://doi.org/10.14778/3067421.3067426 Go to publication entry in University of Southern Denmark's Research Portal Terms of use This work is brought to you by the University of Southern Denmark. Unless otherwise specified it has been shared according to the terms for self-archiving. If no other license is stated, these terms apply: • You may download this work for personal use only. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying this open access version If you believe that this document breaches copyright please contact us providing details and we will investigate your claim. Please direct all enquiries to [email protected] Download date: 05. Oct. 2021 Dimensional Testing for Reverse k-Nearest Neighbor Search Guillaume Casanova Elias Englmeier Michael E. Houle ONERA-DCSD, France LMU Munich, Germany NII, Tokyo,
    [Show full text]
  • Efficient Nearest Neighbor Searching for Motion Planning
    E±cient Nearest Neighbor Searching for Motion Planning Anna Atramentov Steven M. LaValle Dept. of Computer Science Dept. of Computer Science Iowa State University University of Illinois Ames, IA 50011 USA Urbana, IL 61801 USA [email protected] [email protected] Abstract gies of con¯guration spaces. The topologies that usu- ally arise are Cartesian products of R, S1, and projective We present and implement an e±cient algorithm for per- spaces. In these cases, metric information must be ap- forming nearest-neighbor queries in topological spaces propriately processed by any data structure designed to that usually arise in the context of motion planning. perform nearest neighbor computations. The problem is Our approach extends the Kd tree-based ANN algo- further complicated by the high dimensionality of con¯g- rithm, which was developed by Arya and Mount for Eu- uration spaces. clidean spaces. We argue the correctness of the algo- rithm and illustrate its e±ciency through computed ex- In this paper, we extend the nearest neighbor algorithm amples. We have applied the algorithm to both prob- and part of the ANN package of Arya and Mount [16] to abilistic roadmaps (PRMs) and Rapidly-exploring Ran- handle general topologies with very little computational dom Trees (RRTs). Substantial performance improve- overhead. Related literature is discussed in Section 3. ments are shown for motion planning examples. Our approach is based on hierarchically searching nodes in a Kd tree while handling the appropriate constraints induced by the metric and topology. We have proven the 1 Introduction correctness of our approach, and we have demonstrated the e±ciency of the algorithm experimentally.
    [Show full text]
  • A Fast All Nearest Neighbor Algorithm for Applications Involving Large Point-Clouds à Jagan Sankaranarayanan , Hanan Samet, Amitabh Varshney
    Best Journal Paper of 2007 Award ARTICLE IN PRESS Computers & Graphics 31 (2007) 157–174 www.elsevier.com/locate/cag A fast all nearest neighbor algorithm for applications involving large point-clouds à Jagan Sankaranarayanan , Hanan Samet, Amitabh Varshney Department of Computer Science, Center for Automation Research, Institute for Advanced Computer Studies, University of Maryland, College Park, MD - 20742, USA Abstract Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollification, and noise removal. All of these primitive operations require the seemingly repetitive process of finding the k nearest neighbors (kNNs) of each point. These algorithms are primarily designed to run in main memory. However, rapid advances in scanning technologies have made available point-cloud models that are too large to fit in the main memory of a computer. This calls for more efficient methods of computing the kNNs of a large collection of points many of which are already in close proximity. A fast kNN algorithm is presented that makes use of the locality of successive points whose k nearest neighbors are sought to reduce significantly the time needed to compute the neighborhood needed for the primitive operation as well as enable it to operate in an environment where the data is on disk. Results of experiments demonstrate an order of magnitude improvement in the time to perform the algorithm and several orders of magnitude improvement in work efficiency when compared with several prominent existing methods. r 2006 Elsevier Ltd. All rights reserved.
    [Show full text]
  • Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree
    in Proceedings of the 8th International Conference on Computer Vision, Vancouver, Canada, Jul. 2001, Volume 1, pages 446–453 Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree Yong-Sheng Chen†‡ Yi-Ping Hung†‡ Chiou-Shann Fuh‡ †Institute of Information Science, Academia Sinica, Taipei, Taiwan ‡Dept. of Computer Science and Information Engineering, National Taiwan University, Taiwan Email: [email protected] Abstract In the past, Bentley [2] proposed the k-dimensional bi- nary search tree to speed up the the nearest neighbor search. This paper presents a novel algorithm for fast nearest This method is very efficient when the dimension of the data neighbor search. At the preprocessing stage, the proposed space is small. However, as reported in [13] and [3], its algorithm constructs a lower bound tree by agglomeratively performance degrades exponentially with increasing dimen- clustering the sample points in the database. Calculation of sion. Fukunaga and Narendra [8] constructed a tree struc- the distance between the query and the sample points can be ture by repeating the process of dividing the set of sam- avoided if the lower bound of the distance is already larger ple points into subsets. Given a query point, they used than the minimum distance. The search process can thus a branch-and-bound search strategy to efficiently find the be accelerated because the computational cost of the lower closest point by using the tree structure. Djouadi and Bouk- bound, which can be calculated by using the internal node tache [5] partitioned the underlying space of the sample of the lower bound tree, is less than that of the distance.
    [Show full text]
  • Efficient Similarity Search in High-Dimensional Data Spaces
    New Jersey Institute of Technology Digital Commons @ NJIT Dissertations Electronic Theses and Dissertations Spring 5-31-2004 Efficient similarity search in high-dimensional data spaces Yue Li New Jersey Institute of Technology Follow this and additional works at: https://digitalcommons.njit.edu/dissertations Part of the Computer Sciences Commons Recommended Citation Li, Yue, "Efficient similarity search in high-dimensional data spaces" (2004). Dissertations. 633. https://digitalcommons.njit.edu/dissertations/633 This Dissertation is brought to you for free and open access by the Electronic Theses and Dissertations at Digital Commons @ NJIT. It has been accepted for inclusion in Dissertations by an authorized administrator of Digital Commons @ NJIT. For more information, please contact [email protected]. Copyright Warning & Restrictions The copyright law of the United States (Title 17, United States Code) governs the making of photocopies or other reproductions of copyrighted material. Under certain conditions specified in the law, libraries and archives are authorized to furnish a photocopy or other reproduction. One of these specified conditions is that the photocopy or reproduction is not to be “used for any purpose other than private study, scholarship, or research.” If a, user makes a request for, or later uses, a photocopy or reproduction for purposes in excess of “fair use” that user may be liable for copyright infringement, This institution reserves the right to refuse to accept a copying order if, in its judgment, fulfillment
    [Show full text]
  • A Cost Model for Nearest Neighbor Search in High-Dimensional Data Space
    A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space Stefan Berchtold Christian Böhm University of Munich University of Munich Germany Germany [email protected] [email protected] Daniel A. Keim Hans-Peter Kriegel University of Munich University of Munich Germany Germany [email protected] [email protected] Abstract multimedia indexing [9], CAD [17], molecular biology (for In this paper, we present a new cost model for nearest neigh- the docking of molecules) [24], string matching [1], etc. Most bor search in high-dimensional data space. We first analyze applications use some kind of feature vector for an efficient different nearest neighbor algorithms, present a generaliza- access to the complex original data. Examples of feature vec- tion of an algorithm which has been originally proposed for tors are color histograms [23], shape descriptors [16, 18], Quadtrees [13], and show that this algorithm is optimal. Fourier vectors [26], text descriptors [15], etc. Nearest neigh- Then, we develop a cost model which - in contrast to previous bor search on the high-dimensional feature vectors may be models - takes boundary effects into account and therefore defined as follows: also works in high dimensions. The advantages of our model Given a data set DS of d-dimensional points, find the data are in particular: Our model works for data sets with an arbi- point NN from the data set which is closer to the given query trary number of dimensions and an arbitrary number of data point Q than any other point in the data set.
    [Show full text]
  • Improving K-Nearest Neighbor Approaches for Density-Based Pixel Clustering in Hyperspectral Remote Sensing Images
    remote sensing Article Improving K-Nearest Neighbor Approaches for Density-Based Pixel Clustering in Hyperspectral Remote Sensing Images Claude Cariou 1,*, , Steven Le Moan 2 and Kacem Chehdi 1 1 Institut d’Électronique et des Technologies du numéRique, CNRS, Univ Rennes, UMR 6164, Enssat, 6 rue de Kerampont, F22300 Lannion, France; [email protected] 2 Centre for Research in Image and Signal Processing, Massey University, Palmerston North 4410, New Zealand; [email protected] * Correspondence: [email protected] Received: 30 September 2020; Accepted: 12 November 2020; Published: 14 November 2020 Abstract: We investigated nearest-neighbor density-based clustering for hyperspectral image analysis. Four existing techniques were considered that rely on a K-nearest neighbor (KNN) graph to estimate local density and to propagate labels through algorithm-specific labeling decisions. We first improved two of these techniques, a KNN variant of the density peaks clustering method DPC, and a weighted-mode variant of KNNCLUST, so the four methods use the same input KNN graph and only differ by their labeling rules. We propose two regularization schemes for hyperspectral image analysis: (i) a graph regularization based on mutual nearest neighbors (MNN) prior to clustering to improve cluster discovery in high dimensions; (ii) a spatial regularization to account for correlation between neighboring pixels. We demonstrate the relevance of the proposed methods on synthetic data and hyperspectral images, and show they achieve superior overall performances in most cases, outperforming the state-of-the-art methods by up to 20% in kappa index on real hyperspectral images. Keywords: clustering methods; density estimation; nearest neighbor search; deterministic algorithm; unsupervised learning 1.
    [Show full text]
  • Very Large Scale Nearest Neighbor Search: Ideas, Strategies and Challenges
    Int. Jnl. Multimedia Information Retrieval, IJMIR, vol. 2, no. 4, 2013. The final publication is available at Springer via http://dx.doi.org/10.1007/s13735-013-0046-4 Very Large Scale Nearest Neighbor Search: Ideas, Strategies and Challenges Erik Gast, Ard Oerlemans, Michael S. Lew Leiden University Niels Bohrweg 1 2333CA Leiden The Netherlands {gast, aoerlema, mlew} @liacs.nl Abstract Web-scale databases and Big Data collections are computationally challenging to analyze and search. Similarity or more precisely nearest neighbor searches are thus crucial in the analysis, indexing and utilization of these massive multimedia databases. In this work, we begin by reviewing the top approaches from the research literature in the past decade. Furthermore, we evaluate the scalability and computational complexity as the feature complexity and database size vary. For the experiments we used two different data sets with different dimensionalities. The results reveal interesting insights regarding the index structures and their behavior when the data set size is increased. We also summarized the ideas, strategies and challenges for the future. 1. Introduction Very large scale multimedia databases are becoming common and thus searching within them has become more important. Clearly, one of the most frequently used searching paradigms is k-nearest neighbor(k- NN), where the k objects that are most similar to the query are retrieved. Unfortunately, this k-NN search is also a very expensive operation. In order to do a k-NN search efficiently, it is important to have an index structure that can efficiently handle k-NN searches on large databases. From a theoretical and technical point of view, finding the k nearest neighbors is less than linear time is challenging and largely 1 unsolved.
    [Show full text]