scholarly journals Re-Ranking Image Retrieval on Multi Texton Co-Occurrence Descriptor Using K-Nearest Neighbor

2018 ◽  
Vol 5 (1) ◽  
Author(s):  
Yufis Azhar ◽  
Agus Eko Minarno ◽  
Yuda Munarko
Keyword(s):  
Image Retrieval ◽  
Nearest Neighbor ◽  
K Nearest Neighbor

scholarly journals A novel content based image retrieval system using K-means/KNN with feature extraction

2012 ◽  
Vol 9 (4) ◽  
pp. 1645-1661 ◽  
Author(s):  
Ray-I Chang ◽  
Shu-Yu Lin ◽  
Jan-Ming Ho ◽  
Chi-Wen Fann ◽  
Yu-Chun Wang
Keyword(s):  
Feature Extraction ◽  
Image Retrieval ◽  
Nearest Neighbor ◽  
Clustering Algorithms ◽  
Content Based Image Retrieval ◽  
K Nearest Neighbor ◽  
Color Analysis ◽  
Image Retrieval System ◽  
First Time ◽  
System Designs

Image retrieval has been popular for several years. There are different system designs for content based image retrieval (CBIR) system. This paper propose a novel system architecture for CBIR system which combines techniques include content-based image and color analysis, as well as data mining techniques. To our best knowledge, this is the first time to propose segmentation and grid module, feature extraction module, K-means and k-nearest neighbor clustering algorithms and bring in the neighborhood module to build the CBIR system. Concept of neighborhood color analysis module which also recognizes the side of every grids of image is first contributed in this paper. The results show the CBIR systems performs well in the training and it also indicates there contains many interested issue to be optimized in the query stage of image retrieval.

Optimized Feature Subset Selection and Relevance Feedback for Image Retrieval Based on Multiresolution Enhanced Orthogonal Polynomials Model

2015 ◽  
Vol 6 (2) ◽  
pp. 25-40
Author(s):  
S. Sathiya Devi
Keyword(s):  
Image Retrieval ◽  
Orthogonal Polynomials ◽  
Relevance Feedback ◽  
Nearest Neighbor ◽  
Image Features ◽  
Feature Subset Selection ◽  
Support Vector ◽  
Feature Subset ◽  
K Nearest Neighbor ◽  
Multi Objective Genetic Algorithm

In this paper, a simple image retrieval method incorporating relevance feedback based on the multiresolution enhanced orthogonal polynomials model is proposed. In the proposed method, the low level image features such as texture, shape and color are extracted from the reordered orthogonal polynomials model coefficients and linearly combined to form a multifeature set. Then the dimensionality of the multifeature set is reduced by utilizing multi objective Genetic Algorithm (GA) and multiclass binary Support Vector Machine (SVM). The obtained optimized multifeature set is used for image retrieval. In order to improve the retrieval accuracy and to bridge the semantic gap, a correlation based k-Nearest Neighbor (k-NN) method for relevance feedback is also proposed. In this method, an appropriate relevance score is computed for each image in the database based on relevant and non relevant set chosen by the user with correlation based k-NN method. The experiments are carried out with Corel and Caltech database images and the retrieval rates are computed. The proposed method with correlation based k-NN for relevance feedback gives an average retrieval rate of 94.67%.

A New Image Retrieval Method Based on K-Nearest Neighbor Multistage and Multiple Features

2014 ◽  
Vol 12 (3) ◽  
pp. 479-484 ◽  
Author(s):  
Jun Yue ◽  
Yupeng Wang ◽  
Zhenbo Li ◽  
Zhiwang Zhang ◽  
Jialin Hou
Keyword(s):  
Image Retrieval ◽  
Nearest Neighbor ◽  
K Nearest Neighbor ◽  
Multiple Features ◽  
Retrieval Method

A NOVEL INDEXING AND ACCESS MECHANISM USING AFFINITY HYBRID TREE FOR CONTENT-BASED IMAGE RETRIEVAL IN MULTIMEDIA DATABASES

2007 ◽  
Vol 01 (02) ◽  
pp. 147-170 ◽  
Author(s):  
KASTURI CHATTERJEE ◽  
SHU-CHING CHEN
Keyword(s):  
Image Retrieval ◽  
Metric Spaces ◽  
Nearest Neighbor ◽  
Human Perception ◽  
Multimedia Databases ◽  
Multimedia Retrieval ◽  
Index Structure ◽  
Content Based Image Retrieval ◽  
K Nearest Neighbor ◽  
Computational Overhead

An efficient access and indexing framework, called Affinity Hybrid Tree (AH-Tree), is proposed which combines feature and metric spaces in a novel way. The proposed framework helps to organize large image databases and support popular multimedia retrieval mechanisms like Content-Based Image Retrieval (CBIR). It is efficient in terms of computational overhead and fairly accurate in producing query results close to human perception. AH-Tree, by being able to introduce the high level semantic image relationship as it is in its index structure, solves the problem of translating the content-similarity measurement into feature level equivalence which is both painstaking and error-prone. Algorithms for similarity (range and k-nearest neighbor) queries are implemented and extensive experiments are performed which produces encouraging results with low I/O and distance computations and high precision of query results.

scholarly journals Employing Divergent Machine Learning Classifiers to Upgrade the Preciseness of Image Retrieval Systems

2020 ◽  
Vol 20 (3) ◽  
pp. 75-85
Author(s):  
Shefali Dhingra ◽  
Poonam Bansal
Keyword(s):  
Machine Learning ◽  
Image Retrieval ◽  
Nearest Neighbor ◽  
Machine Learning Algorithms ◽  
Visual Features ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Retrieval Systems ◽  
Retrieval Efficiency ◽  
Benchmark Datasets

AbstractContent Based Image Retrieval (CBIR) system is an efficient search engine which has the potentiality of retrieving the images from huge repositories by extracting the visual features. It includes color, texture and shape. Texture is the most eminent feature among all. This investigation focuses upon the classification complications that crop up in case of big datasets. In this, texture techniques are explored with machine learning algorithms in order to increase the retrieval efficiency. We have tested our system on three texture techniques using various classifiers which are Support vector machine, K-Nearest Neighbor (KNN), Naïve Bayes and Decision Tree (DT). Variant evaluation metrics precision, recall, false alarm rate, accuracy etc. are figured out to measure the competence of the designed CBIR system on two benchmark datasets, i.e. Wang and Brodatz. Result shows that with both these datasets the KNN and DT classifier hand over superior results as compared to others.

A Hybrid GA-LDA Scheme for Feature Selection in Content-Based Image Retrieval

2018 ◽  
Vol 9 (2) ◽  
pp. 48-71 ◽  
Author(s):  
Khadidja Belattar ◽  
Sihem Mostefai ◽  
Amer Draa
Keyword(s):  
Feature Selection ◽  
Image Retrieval ◽  
Nearest Neighbor ◽  
Skin Lesions ◽  
Processing Technique ◽  
Input Image ◽  
Content Based Image Retrieval ◽  
K Nearest Neighbor ◽  
Feature Selection Problem ◽  
Linear Discriminant

Feature selection is an important pre-processing technique in the pattern recognition domain. This article proposes a hybridization between Genetic Algorithm (GA) and the Linear Discriminant Analysis (LDA) for solving the feature selection problem in Content-Based Image Retrieval (CBIR) applied to dermatological images. In the first step, we preprocess and segment the input image, then we derive color and texture features characterizing healthy skin and the segmented skin lesion. At this stage, a binary GA is used to evolve chromosome subsets whose fitness is evaluated by a Logistic Regression classifier. The optimal identified features are then used to feed LDA for a CBIR system, based on a K-Nearest Neighbor classification. To assess the proposed approach, the authors have opted for a K-fold cross validation method on a database of 1097 images of melanomas and other skin lesions. As a result, the authors obtained a reduced number of features and an improved CBDIR system compared to PCA, LDA and ICA methods.

Classification and Retrieval of Images Based on Extensive Context and Content Feature Set

2019 ◽  
Vol 12 (3) ◽  
pp. 162-170 ◽  
Author(s):  
Thiriveedhi Yellamanda Srinivasa Rao ◽  
Pakanati Chenna Reddy
Keyword(s):  
Image Retrieval ◽  
Nearest Neighbor ◽  
Recall Rate ◽  
K Nearest Neighbor ◽  
Query Image ◽  
Visual Words ◽  
Similar Images ◽  
Classification Of Images ◽  
Two Stages ◽  
Scaling Invariant

Background: This paper renders a classification and retrieval of image achievements in the search area of image retrieval, especially content-based image retrieval, an area that has been very active and successful in the past few years. Objective: Primarily the features extracted established on the bag of visual words (BOW) can be arranged by utilizing Scaling Invariant Feature Transform (SIFT) and developed K-Means clustering method. Methods: The texture is extracted for a developed multi-texton method by our study. Our retrieval process consists of two stages such as retrieval and classification. The images will be classified established on the features by applying k- Nearest Neighbor (kNN) algorithm. This will separate the images into various classes in order to develop the precision and recall rate initially. Results: After the classification of images, the similar images are retrieved from the relevant class as per the afforded query image.

Sign in / Sign up

Export Citation Format

Share Document