International Journal of Pure and Applied Mathematics
Volume 118 No. 11 2018, 783-790
ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version)
url: http://www.ijpam.eu
doi: 10.12732/ijpam.v118i11.101
Special Issue
IMAGE RETRIEVAL USING ADDER AND DECODER BASED TEXTURE FEATURES
1
S. Vanitha Sivagami, 2N. Asha
1,2
Department of Computer Science and Engineering,
Mepco Schlenk Engineering College, Sivakasi, India
Abstract: Local binary pattern (LBP) is widely adopted
for efficient image feature description and simplicity.
To describe the color images, it is required to combine
the LBPs from each channel of the image. The
traditional way of binary combination is to simply
concatenate the LBPs from each channel, but it
increases the dimensionality of the pattern. The
proposed method uses multichannel decoded local
binary pattern for image description. Here the adder and
decoder image are used to obtained LBPs form more
than one channel. Image retrieval experiments are
performed to observe the effectiveness of the proposed
approaches and compared with the existing ways of
multichannel techniques. The experiments are
performed over two benchmark natural scene and color
texture image databases such as Corel DB, USP-Tex. It
is observed that the introduced multichannel adder and
decoder based local binary patterns significantly
improves the retrieval performance over each database
and outperforms the other multichannel based
approaches in terms of the average retrieval precision
and average retrieval rate.
IndexTerms: Image retrieval, local binary
pattern, multihannl decoded local binary pattern.
1. Introduction
Image indexing and retrieval is demanding more and
more attention due to its rapid growth in many places.
Image retrieval has several applications such as in
object recognition, biomedical, agriculture, etc. The aim
of Content based Image Retrieval (CBIR) is to extract
the similar images of a given image from huge
databases by matching a given query image with the
images of the database. Matching of two images is
facilitated by the matching of actually its feature
descriptors (i.e. image signatures). It means the
performance of any image retrieval system heavily
depends upon the image feature descriptors being
matched.
783
ijpam.eu
Color, texture, shape, gradient, etc. are the basic type
of features to describe the image .A recent trend of CBIR
has been efficient search and retrieval for large-scale
datasets using hashing and binary coding techniques.
Various methods proposed recently for the large scale
image hashing for efficient image search are Multi view
Alignment Hashing (MAH), Neighborhood Discriminant
Hashing (NDH), Evolutionary Compact Embedding (ECE)
and Unsupervised Bilinear Local Hashing (UBLH). These
methods can be used with the high discriminative
descriptors to improve the efficiency of image search.
Content-based image retrieval (CBIR) is the process
by which one searches for like images according to the
content of the query image, such as color, texture, shape,
and so forth. The field of organizing and searching images
based on their content rather than image annotations.
Retrieval of images based not on keywords or annotations
but based on features extracted directly from the image
data. Image indexing and retrieval techniques which use
image stuffing, that is, low-level (earliest) features of an
image, such as color, shapes, textures, and so on. Queries
are also provided in the form of images. This approach
retrieves otherwise searches digital images from enormous
dataset using the content of the images themselves or
syntactical image features without human intervention.
Other terms used interchangeably for CBIR are query by
image content (QBIC) and content-based visual
information retrieval (CBVIR). "Content-based" means the
investigator will examine the actual contents of the image.
The term 'content' in this perspective may pass on colors,
shapes, textures, or any other information that can be
resultant from the image itself. Images are being generated
at an ever-increasing rate by sources such as defense and
civilian satellites, military reconnaissance and surveillance
flights, fingerprinting and scientific experiments,
biomedical imaging, and home entertainment systems.
2. Related Works
Xianbiao Q, et al (2014), introduced a Pairwise Transform
Invariance (PTI) principle, and then proposes a novel
Pairwise Rotation Invariant Co-occurrence Local Binary
International Journal of Pure and Applied Mathematics Special Issue

Pattern (PRICoLBP) feature, and further extends it to 2.1 System Design

incorporate multi-scale, multi-orientation, and multi-
channel information. Different from other LBP variants,
PRICoLBP can not only capture the spatial context co-
occurrence information effectively, but also possess
rotation invariance. PRICoLBP is comprehensively
evaluated on nine benchmark data sets from five
different perspectives, e.g., encoding strategy, rotation
invariance, the number of templates, speed, and
discriminative power compared to other LBP variants.
Furthermore PRICoLBP applies to six different but
related applications texture, material such as, flower,
leaf, food, and scene classification, The spatial co-
occurrence among features increased the discriminative
power of features. The rationales behind this claim as
that: The spatial co-occurrence of two features captures
a strong correlation between them and hence provides
more information than their individual occurrence. The
spatial co-occurrence feature has larger supporting
regions than a single feature and hence can depict more
subtle and complex structures in an image. Contrarily,
traditional single feature describes a smaller supporting
region individually and ignores the spatial relationship
among features. The spatial co-occurrence of features
can provide higher order statistical information than
their individual occurrence without spatial coherence. It
has been shown in psychological study that higher order Figure 1. System Design
information is important for performing categorization
task in primate visual cortex [4]. The real world vision In this work, find out the relevant image first perform
applications often suffer from geometric and the channel separation (R,G,B channel) for the given input
photometric variations. Unfortunately the current image. For each channel Local Binary Pattern (LBP) was
existing works on co-occurrence features mainly focus computed. From the resultant adder map and decoder map
on improving discriminativeness. was constructed. Then the adder LBP was constructed with
Zhenhua Guo, et al (2010) introduced a completed four outputs, similarly for decoder LBP was constructed
modeling of the local binary pattern (LBP) operator and with eight outputs. Multichannel adder LBP constructed
an associated completed LBP (CLBP) scheme is from the adder LBP, similarly for multichannel decoder
developed for texture classification. LBP is a simple yet LBP constructed from the decoder LBP. From the
efficient operator to describe local image pattern, and it histogram by using the multichannel adder LBP, similarly
has achieved impressive classification results on for decoder histogram was constructed. From resultant
representative texture databases used the absolute gray multichannel decoded LBP Histogram was constructed.
level difference (AGLD) between a pixel and its Features are extracted from each histogram and combine to
neighbors to generate textons, and used the histogram form a feature vector. The process was done both training
of them to represent the image. LBP is also used with and testing images. Finally similarity matching between
sign, instead of magnitude of the difference to represent the training and testing feature vector to return the relevant
the local pattern. A local region is represented by its image
center pixel and a local difference sign-magnitude
transforms (LDSMT). The center pixels representing 3. Proposed Work
the image gray level are converted into a binary code,
namely CLBP-Center (CLBP_C), by global 3.1 Multichannel decoded Local Binary Pattern
thresholding. LDSMT decomposes the image local
differences into two complementary components: the In the study Two multichannel decoded local binary
signs and the magnitudes, and two operators, namely pattern approaches namely multichannel adder based local
CLBP-Sign (CLBP_S) and CLBP-Magnitude binary pattern (maLBP) and multichannel decoder based
(CLBP_M) are proposed. local binary pattern (mdLBP) are used to represent the

784
International Journal of Pure and Applied Mathematics Special Issue

local binary pattern information of multiple channels 3.1.1 Multichannel Adder Based Local Binary Pattern
efficiently.
In this section, two multichannel decoded local Let, the multichannel adder based local binary patterns
binary pattern approaches namely multichannel adder maLBPt1n ( x, y ) are the outputs of the multichannel LBP
based local binary pattern ( ) and multichannel
decoder based local binary pattern ( ) are adder respectively, t1∈ [1, +1]. The values LBPt n ( x, y ) of
extracted. Total +1 and 2c number of output channels are in the binary form (i.e. either 0 or 1). Thus values of
are generated by using multichannel adder and decoder maLBPt1n ( x, y ) are also in the binary form generated from
respectively from number of input channels where ≥
2. the multichannel adder map maM n ( x, y ) respectively
corresponding to the each neighbor of pixel ( ,).
Mathematically, they maM n ( x, y ) are defined as,
n c n
maM (i, j) = ∑ LBPt ( x, y )
t =1 (3)
It is denote for ∀ ∈ [1, ] and ∀ t1 ∈ [1, ] by input
patterns, maLBPt1n ( x, y ) for ∀ ∈ [1, ] and t1 ∈ [1, +1]
by adder patterns. The multichannel adder based local
binary pattern for pixel(x, y) from multichannel adder map
maM n ( x, y ) is defined as,

1 , if n
n maM ( x, y ) = (t1 − 1)
maLBPt1 ( x , y ) = 
0 , otherwise (4)

Figure 2. Center pixel with eight nighborhoo pixel where, t1 ∈ [1, +1] and n ∈ [1, N]. The multichannel
Let It be the tth channel of any image of size adder based local binary patterns ( maLBPt1n ( x, y ) | t1 ∈
× × , where ∈ [1, c] and be the total number of [1, +1]) for the center pixel(x, y) is computed using
channels. If there are neighbors of any pixel (x, y) maLBPt1n ( x, y ) in the following manner.
which are equally-spaced at radius ℛ for ∈ [1,] and
∈ [1, 2c], let it be defined as Itn. Then local binary maLBPt1 ( x, y ) = ∑ maLBPt1n ( x, y ) * f n
(5)
pattern LBPt ( x, y ) for a particular pixel ( , ) in tth
channel is generated by computing a binary value 3.1.2 Multichannel Decoder Based Local Binary Pattern
LBPt n ( x, y ) for n ∈ [1, N] which is given by the
Let, the multichannel decoder based local binary patterns
following equation,
mdLBPt1n ( x, y ) are the outputs of the multichannel LBP
n 1 n
, I t ( x, y ) ≥ I t ( x, y ) (1) [1, 2 c ].
LBPt ( x, y ) =  decoder respectively, t2 ∈ The values
0 , otherwise n
LBPt ( x, y ) of are in the binary form (i.e. either 0 or 1).
where, Itn- Neighborhood pixel, It- Center pixel. Thus values of mdLBPt1n ( x, y ) are also in the binary form
Weight function defined by the following equation,
generated from the multichannel decoder map
n ( n −1) (2)
f =2 , ∀ n ∈[ 1 , N ] mdM n ( x, y ) respectively corresponding to the each
The set of binary values LBPt n ( x, y ) for a neighbor of pixel ( , ). Mathematically, they
n
particular pixel ( , y) corresponding to each neighbor mdM ( x, y ) are defined as,
c
i p ( x, y ) of h channel. Multichannel LBP adder and
mdM n ( x, y ) = ∑ LBPt n ( x, y ) (6)
multichannel LBP decoder are computed by t =1

considering LBP tn ( x, y ) | ∀ t ∈ [1, ] where c is the

number of input channel.

785
International Journal of Pure and Applied Mathematics Special Issue

It is denoting LBPt n ( x, y ) for ∀ ∈ [1, ] and ∀ The final feature vector of multichannel adder based
LBP and multichannel decoder based LBP are given by
t 2 ∈ [1, 2 c ] by input patterns, mdLBPt1n ( x, y ) for ∀ ∈ concatenating the histograms of and
[1, ] and t 2 ∈ [1, 2 c ] by adder patterns. The over each output channel respectively and given as,
multichannel decoder based local binary pattern 1 
mdLBPt1n ( x, y ) for pixel(x, y) from multichannel adder fvaLBP = H , …, H c+1  (12)
c + 1  1 
map mdM n ( x, y ) and then t 2 defined as, 1
2
[
fvdLBP = c H 1 , …, H c
2
] (13)
1 , if mdM n ( x, y ) = (t 2 − 1) where, fvaLBP – Feature vector for adder, fvdLBP –
mdLBPt1n ( x, y ) =  (7)
0 , otherwise Feature vector for decoder. The process of and
feature descriptor of the image is considered as the
Where, t 2 ∈ [1, 2 c ] and n ∈ [1, N].The three input channels. Thus, four and eight output channels
multichannel adder based local binary patterns are produced by the adder and decoder respectively.
( mdLBPt1n ( x, y ) | t 2 ∈ [1, 2 c ]) for the center pixel(x, y)
3.3 Similarity Matching
is computed using mdLBPt1n ( x, y ) in the following
manner, The basic aim of distance measures is to find out the
mdLBPt2 ( x, y ) = ∑ mdLBPt2 ( x, y ) * f
n n
(8) similarity between the features vectors of two images.
Different distance metrics can be used such as, Euclidean
n
where, mdLBPt1 ( x, y ) -multichannel decoder Based distance, Manhattan distance, Canberra distance, Chi-
n square (Chisq), Cosine distance, D1 distance.
LBP, mdM ( x, y ) -Multichannel Adder LBP.
4. Results and Discussion
3.2 Histogram
The experiments were contacted using Corel DB and
The feature vector of t1 ℎ output channel of the adder Texture datasets. Corel DB dataset contains 80 categories,
( maLBPt1 ( x, y ) ) is computed using the following and there are 10,800 images from diverse contents such as
bus, cloud, flag, mask, car, flower, texture, train etc., Each
equation,
of the image size 80×120 or 120×80 in the JPEG format.
1 u −1 v −1 (3.9)
H (c) = ∑ ∑ d(maLBPt (i, j), c) Each category includes minimum 60 to maximum 550
t1 (u − 2R )(v − 2R ) i=2 j=2 1 images. So in each category 50 images are randomly
(9)
selected for training (so total 4000 training images) and the
where, t1 range from 1…c+1, u x v are the remaining images are testing images (so total 6800 testing
dimensions of the input image I, H t1 (c ) Adder images).
Histogram USPtex (texture database) dataset contains 191
categories, and there are 2292 images. Each category
Similarly feature vector (i.e. histogram) of t 2 ℎ
includes 12 images. So in each category 4 images are
output channel of the adder ( mdLBPt 2 ( x, y ) ) is randomly selected for training (so total 764 training
computed using the following equation, images) and the remaining images are testing images (so
u −1 v −1
total 1528 testing images).
1
H (c) = ∑ ∑ d(mdLBPt (i, j), c) The outputs of various modules of the proposed work
t2 (u − 2R )(v − 2R ) i=2 j=2 2 shown in the figure
(10)
where, t 2 range from 1… 2 c ,u x v are the
dimensions of the input image I, H t 2 (c ) Decoder
Histogram
d (x,y) function is define as,
1 , if x = y
d ( x, y ) =  (11)
0 , therwise

786
International Journal of Pure and Applied Mathematics Special Issue

Figure 4. (a) original image, (b) Red Channel, (c) Green

Channel, (d) Blue Channel, (e)Adder Map, (f) Decoder
Map, (g-j) four output channels of the adder, (k-r) eight
output channels of the decoder (s) retrival images for
sample image in UPS-Tex.

Image retrieval result over some sample images in

Corel DB and texture datasets shown in figure

Figure 5. Image retrieval result over various image

databases. An image in the first column is a query image
Figure 3. (a) original image, (b) Red Channel, (c) which a set of subsequent images are retrieved result
Green Channel, (d) Blue Channel, (e)Adder Map, (f) ordered in ascending manner from left to right.
Decoder Map, (g-j) four output channels of the adder,
(k-r) eight output channels of the decoder (s) retrival 5. Performance Analysis
images for sample image in Corel DB.
To evaluate the performance of the proposed system,
measures such as precision, Recall and accuracy are
computed.
number of Query images
Accuracy = * 100
total number of images
(14)
Corel DB dataset contains 10,800 images. Among
this, 4000 images are taken for training phase and 6800
images are taken for testing phase. Similarly, for UPS-Tex
dataset which contains 2292 images. Among this, 1146

787
International Journal of Pure and Applied Mathematics
images are taken for training phase and 1146 images
are taken from testing phase.
Table 1. Accuracy
Accuracy(%)
Dataset
Euclidea Cosine
n distance
distance
UPS-Tex 65.96 66.57
Corel DB 60.33 64.57
The performance can be calculated by using
different distance measurement such as Euclidean,
cosine, Canberra and Manhattan distance. Among these
distances Manhattan results in improved accuracy
compared to others.
6. Conclusion
In this project, two multichannel decoded local binary
patterns are introduced namely multichannel adder local
binary pattern (maLBP) and multichannel decoder local
binary pattern (mdLBP). Basically both maLBP and
mdLBP have utilized the local information of multiple
channels using adder and decoder concepts. The
proposed methods are evaluated using image retrieval
experiments over two databases having images of
natural scene and textures images. The results are
computed in terms of the average precision rate and
average retrieval rate and improved performance is
observed when compared with the results of the
existing multichannel based approaches over each
database. It is also deduced that Manhattan distance
measure is better suited with the proposed image
descriptors. The performance of the proposed
descriptors is much improved for three input channels.
Experiments also suggested that the introduced
approach is generalized and can be applied over any
LBP based descriptor.
References
[1] Z. Guo and D. Zhang (2010), ‘A completed
modeling of local binary pattern operator for texture
classification’, IEEE Trans. Image Process., vol. 19,
no.6, pp. 1657–1663.
788
Special Issue
Canberra Manhattan
distance distance
65.96 72.77
60.96 71.77
[2] S. Liao, M. W. K. Law, and A. C. S. Chung
(2009), ‘Dominant local binary patterns for texture
classification’, IEEE Trans. Image Process., vol. 18,no. 5,
pp. 1107–1118.
[3] M. Heikkila, M. Pietikainen and C. Schmid (2009),
‘Description of interest regions with local binary patterns’,
Pattern Recognition, vol. 42, no. 3, pp. 425-436, 2009.
[4] D. Huang, C. Shan, M. Ardabilian, Y. Wang, and
L. Chen (2011), ‘Local binary patterns and its application
to facial image analysis: A survey’, IEEE Trans. Syst.,
Man, Cybern. C,Appl.Rev.,vol.41,no.6,pp. 665–681.
[5] Xianbiao Qi, Rong Xiao, Chun-Guang Li, Yu
Qiao, Jun Guo, Xiaoou Tang (2014), ‘Pairwise Rotation
Invariant Co-occurrence Local Binary Pattern’, IEEE
Transactions on Pattern Analysis and Machine Intelligence
(TPAMI).
[6] Li Liu, Songyang Lao, Paul W. Fieguth, Yulan
Guo,Xiaogang Wang, and Matti Pietikäinen (2016),
‘Median Robust Extended Local Binary Pattern’,IEEE
Trans. Image Process., vol. 25, no. 3.
[7] Li Liu, Mengyang Yu, and Ling Shao (2016),
‘Learning Short Binary Codes for Large-scale Image
Retrieval’, IEEE transactions on image processing,
vol.76,no.6,pp. 765–781.
[8] S.R. Dubey, S.K. Singh and R.K. Singh (2015),
‘Local Diagonal Extreme Pattern: A new and Efficient
Feature Descriptor for CT Image Retrieval’, IEEE Signal
Processing Letters, vol. 22, no. 9, pp. 1215-1219.
International Journal of Pure and Applied Mathematics Special Issue

[9] S.R. Dubey, S.K. Singh and R.K. Singh (2015),

‘Rotation and scale invariant hybrid image descriptor
and retrieval’, Computers & Electrical Engineering,
vol. 46, pp. 288-302.

[10] B. Zhang, Y. Gao, S. Zhao and J. Liu (2010),

‘Local derivative pattern versus local binary pattern:
face recognition with high-order local pattern
descriptor’, IEEE Transactions on Image Processing,
vol. 19, no. 2, pp. 533-544.

[11] C. Zhu, C.E. Bichot and L. Chen (2010),

“Multi-scale Color Local Binary Patterns for Visual
Object Classes Recognition” In Proceedings of the
IEEE International Conference on Pattern Recognition,
pp. 3065-3068.

[12] C. Zhu, C.E. Bichot and L. Chen(2013), ‘Image

region description using orthogonal combination of
local binary patterns enhanced with color information’,
Pattern Recognition, vol. 46, no. 7, pp. 1949-1963.

789
790