scholarly journals CONTENT-BASED IMAGE RETRIEVAL UNTUK PENCARIAN PRODUK PONSEL

2019 ◽  
Vol 3 (1) ◽  
pp. 31
Author(s):  
Nickolas Cornelius Siantar ◽  
Jaqnson Hendryli ◽  
Dyah Erny Herwindiati
Keyword(s):  
Image Retrieval ◽  
Vector Quantization ◽  
Euclidean Distance ◽  
Local Binary Pattern ◽  
Feature Vector ◽  
Content Based Image Retrieval ◽  
Color Quantization ◽  
Histogram Of Oriented Gradient ◽  
Feature Extractor ◽  
Online Stores

Phone or smartphone and online shop, there is something that cannot be separated with human. There are so many type of smartphones show up in the market that people are confused on which one to get on the online stores. Smartphones recognition is done by using the Histogram of Oriented Gradient to recognize shapes of phones, Color Quantization to recognize the color, and Local Binary Pattern to recognize texture of the phones. The output of the Feature Extractor is a feature vector which is used on the LVQ to process recognize through finding the smallest Euclidean Distance between the trained vectors. The result of this paper is an application that can recognize 16 phone types using the image with the accuracy of 9.6%. Pada saat ini, ponsel dan toko online merupakan sesuatu yang tidak dapat dipisahkan dari manusia. Begitu banyak jenis ponsel bermunculan setiap tahunnya sehingga menyebabkan manusia bingung dalam mengenali ponsel tersebut. Pada program pengenalan ponsel ini digunakan Histogram of Oriented Gradient untuk mengambil fitur berupa bentuk ponsel, Color Quantization untuk mengambil fitur warna, dan Local Binary Pattern untuk mengambil fitur tekstur ponsel. Hasil dari pengambilan fitur berupa fitur vektor yang digunakan pada Learning Vector Quantization untuk proses pengenalan dengan mencari nilai terkecil Euclidean Distance antara vektor fitur dengan vektor bobot terlatih. Hasil dari program pengenalan ini yaitu program dapat melakukan pengenalan terhadap 16 jenis ponsel dengan akurasi sebesar 9.6%.

Content-based image retrieval using local texture features in distributed environment

2019 ◽  
Vol 18 (01) ◽  
pp. 1941001
Author(s):  
U. S. N. Raju ◽  
K. Suresh Kumar ◽  
Pulkesh Haran ◽  
Ramya Sree Boppana ◽  
Niraj Kumar
Keyword(s):  
Image Retrieval ◽  
Local Binary Pattern ◽  
Feature Vector ◽  
Texture Features ◽  
Content Based Image Retrieval ◽  
Distributed Environment ◽  
Average Precision ◽  
Neighboring Pixel ◽  
Hadoop Cluster ◽  
The Relationship

In this paper, we propose novel content-based image retrieval (CBIR) algorithms using Local Octa Patterns (LOtP), Local Hexadeca Patterns (LHdP) and Direction Encoded Local Binary Pattern (DELBP). LOtP and LHdP encode the relationship between center pixel and its neighbors based on the pixels’ direction obtained by considering the horizontal, vertical and diagonal pixels for derivative calculations. In DELBP, direction of a referenced pixel is determined by considering every neighboring pixel for derivative calculations which results in 256 directions. For this resultant direction encoded image, we have obtained LBP which is considered as feature vector. The proposed method’s performance is compared to that of Local Tetra Patterns (LTrP) using benchmark image databases viz., Corel 1000 (DB1) and Brodatz textures (DB2). Performance analysis shows that LOtP improves the average precision from 59.31% to 64.36% on DB1, and from 83.24% to 85.95% on DB2, LHdP improves it to 65.82% on DB1 and to 87.49% on DB2 and DELBP improves it to 60.35% on DB1 and to 86.12% on DB2 as compared to that of LTrP. Also, DELBP reduces the feature vector length by 66.62% as compared to that of LTrP. To reduce the retrieval time, the proposed algorithms are implemented on a Hadoop cluster consisting of 116 nodes and tested using Corel 10K (DB3), Mirflickr 100,000 (DB4) and ImageNet 511,380 (DB5) databases.

Image Retrieval of Self-Adapt Distance Measure Based on SLLE

2014 ◽  
Vol 989-994 ◽  
pp. 3675-3678
Author(s):  
Xiao Fen Wang ◽  
Hai Na Zhang ◽  
Xiu Rong Qiu ◽  
Jiang Ping Song ◽  
Ke Xin Zhang
Keyword(s):  
Image Retrieval ◽  
High Dimension ◽  
Topological Structure ◽  
Euclidean Distance ◽  
Distance Measure ◽  
Content Based Image Retrieval ◽  
Locally Linear Embedding ◽  
Euclidean Distance Measure ◽  
Linear Embedding ◽  
Dimension Space

Self-adapt distance measure supervised locally linear embedding solves the problem that Euclidean distance measure can not apart from samples in content-based image retrieval. This method uses discriminative distance measure to construct k-NN and effectively keeps its topological structure in high dimension space, meanwhile it broadens interval of samples and strengthens the ability of classifying. Experiment results show the ADM-SLLE date-reducing-dimension method speeds up the image retrieval and acquires high accurate rate in retrieval.

scholarly journals Content-Based Image Retrieval using Color Quantization and Angle Representation

2014 ◽  
Vol 13 (10) ◽  
pp. 5094-5104
Author(s):  
Ihab Zaqout
Keyword(s):  
Image Retrieval ◽  
Color Space ◽  
Measurement Methods ◽  
Content Based Image Retrieval ◽  
Similarity Measurement ◽  
Color Quantization ◽  
Human Visual Perception ◽  
Hsv Color Space ◽  
Perception System ◽  
Similar Images

An efficient non-uniform color quantization and similarity measurement methods are proposed to enhance the content-based image retrieval (CBIR) applications. The HSV color space is selected because it is close to human visual perception system, and a non-uniform color method is proposed to quantize an image into 37 colors. The marker histogram (MH) vector of size 296 values is generated by segmenting the quantized image into 8 regions (multiplication of 45°) and count the occurrences of the quantized colors in their particular angles. To cope with rotated images, an incremental displacement to the MH is applied 7 times. To find similar images, we proposed a new similarity measurement and other 4 existing metrics. A uniform color quantization of related work is implemented too and compared to our quantization method. One-hundred test images are selected from the Corel-1000 images database. Our experimental results conclude high retrieving precision ratios compared to other techniques.

scholarly journals An Novel Framework For Content Based Image Retrieval With Quality Assessment System using Optimal Deep Convolution Neural Network

2019 ◽  
Vol 8 (12) ◽  
pp. 3916-3926
Keyword(s):  
Feature Extraction ◽  
Image Retrieval ◽  
Feature Vector ◽  
Structural Similarity ◽  
Extraction Process ◽  
Input Image ◽  
Assessment System ◽  
Content Based Image Retrieval ◽  
Query Image ◽  
Occurrence Matrix

Content based image retrieval (CBIR) models become popular for retrieving images connected to the query image (QI) from massive dataset. Feature extraction process in CBIR plays a vital role as it affects the system’s performance. This paper is focused on the design of deep learning (DL) model for feature extraction based CBIR model. The presented model utilizes a ResNet50 with co-occurrence matrix (RCM) model for CBIR. Here, the ResNet50 model is applied for feature extraction of the QI. Then, the extracted features are placed in the feature repository as a feature vector. The RCM model computes the feature vector for every input image and compares it with the features present in the repository. Then, the images with maximum resemblance will be retrieved from the dataset. In addition, the resemblance between the feature vectors is determined by the use of co-occurrence matrix subtraction process. Besides, structural similarity (SSIM) measure is applied for the validation of the similarity among the images. A comprehensive results analysis takes place by the use of Corel 10K dataset. The experimental outcome indicated the superiority of the RCM model with respect to precision, recall and SSIM.

Content-based Image Retrieval by Information Theoretic Measure

2011 ◽  
Vol 61 (5) ◽  
pp. 415 ◽  
Author(s):  
Madasu Hanmandlu ◽  
Anirban Das
Keyword(s):  
Image Retrieval ◽  
Feature Vector ◽  
Texture Features ◽  
Entropy Function ◽  
Content Based Image Retrieval ◽  
Query Image ◽  
Information Theoretic ◽  
Dominant Colour ◽  
Image Retrieval System ◽  
Information Theoretic Measures

<p>Content-based image retrieval focuses on intuitive and efficient methods for retrieving images from databases based on the content of the images. A new entropy function that serves as a measure of information content in an image termed as 'an information theoretic measure' is devised in this paper. Among the various query paradigms, 'query by example' (QBE) is adopted to set a query image for retrieval from a large image database. In this paper, colour and texture features are extracted using the new entropy function and the dominant colour is considered as a visual feature for a particular set of images. Thus colour and texture features constitute the two-dimensional feature vector for indexing the images. The low dimensionality of the feature vector speeds up the atomic query. Indices in a large database system help retrieve the images relevant to the query image without looking at every image in the database. The entropy values of colour and texture and the dominant colour are considered for measuring the similarity. The utility of the proposed image retrieval system based on the information theoretic measures is demonstrated on a benchmark dataset.</p><p><strong>Defence Science Journal, 2011, 61(5), pp.415-430</strong><strong><strong>, DOI:http://dx.doi.org/10.14429/dsj.61.1177</strong></strong></p>

Sign in / Sign up

Export Citation Format

Share Document