Transactions on computational science XXIX

Journal Subline LNCS 10220 Transactions on Computational Science XXIX Marina L.Gavrilova · C.J Kenneth Tan Editors-in-Chief 123 Lecture Notes in Computer Science Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Zurich, Switzerland John C Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbrücken, Germany 10220 More information about this series at http://www.springer.com/series/8183 Marina L Gavrilova C.J Kenneth Tan (Eds.) • Transactions on Computational Science XXIX 123 Editors-in-Chief Marina L Gavrilova University of Calgary Calgary, AB Canada C.J Kenneth Tan Sardina Systems Tallinn Estonia ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISSN 1866-4733 ISSN 1866-4741 (electronic) Transactions on Computational Science ISBN 978-3-662-54562-1 ISBN 978-3-662-54563-8 (eBook) DOI 10.1007/978-3-662-54563-8 Library of Congress Control Number: 2017935025 © Springer-Verlag GmbH Germany 2017 This work is subject to copyright All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed The use of general descriptive names, registered names, trademarks, service marks, etc in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations Printed on acid-free paper This Springer imprint is published by Springer Nature The registered company is Springer-Verlag GmbH Germany The registered company address is: Heidelberger Platz 3, 14197 Berlin, Germany LNCS Transactions on Computational Science Computational science, an emerging and increasingly vital field, is now widely recognized as an integral part of scientific and technical investigations, affecting researchers and practitioners in areas ranging from aerospace and automotive research to biochemistry, electronics, geosciences, mathematics, and physics Computer systems research and the exploitation of applied research naturally complement each other The increased complexity of many challenges in computational science demands the use of supercomputing, parallel processing, sophisticated algorithms, and advanced system software and architecture It is therefore invaluable to have input by systems research experts in applied computational science research Transactions on Computational Science focuses on original high-quality research in the realm of computational science in parallel and distributed environments, also encompassing the underlying theoretical foundations and the applications of large-scale computation The journal offers practitioners and researchers the opportunity to share computational techniques and solutions in this area, to identify new issues, and to shape future directions for research, and it enables industrial users to apply leading-edge, large-scale, high-performance computational methods In addition to addressing various research and application issues, the journal aims to present material that is validated – crucial to the application and advancement of the research conducted in academic and industrial settings In this spirit, the journal focuses on publications that present results and computational techniques that are verifiable Scope The scope of the journal includes, but is not limited to, the following computational methods and applications: – – – – – – – – – – – – Aeronautics and Aerospace Astrophysics Big Data Analytics Bioinformatics Biometric Technologies Climate and Weather Modeling Communication and Data Networks Compilers and Operating Systems Computer Graphics Computational Biology Computational Chemistry Computational Finance and Econometrics VI – – – – – – – – – – – – – – – – – – – – – LNCS Transactions on Computational Science Computational Fluid Dynamics Computational Geometry Computational Number Theory Data Representation and Storage Data Mining and Data Warehousing Information and Online Security Grid Computing Hardware/Software Co-design High-Performance Computing Image and Video Processing Information Systems Information Retrieval Modeling and Simulations Mobile Computing Numerical and Scientific Computing Parallel and Distributed Computing Robotics and Navigation Supercomputing System-on-Chip Design and Engineering Virtual Reality and Cyberworlds Visualization Editorial The Transactions on Computational Science journal is part of the Springer series Lecture Notes in Computer Science, and is devoted to a range of computational science issues, from theoretical aspects to application-dependent studies and the validation of emerging technologies The journal focuses on original high-quality research in the realm of computational science in parallel and distributed environments, encompassing the theoretical foundations and the applications of large-scale computations and massive data processing Practitioners and researchers share computational techniques and solutions in the area, identify new issues, and shape future directions for research, as well as enable industrial users to apply the techniques presented The current volume is devoted to the topic of secure and reliable communications, as well as signal and image processing It is comprised of seven full papers, presenting algorithms for secure communication, including recovering weak radio signals, designing efficient circuits, providing multiple antenna sensing techniques, examining the relationship between modes of intercomputer communications and fault types, discovering new ways to efficiently and reliably build geometric meshes, and studying big data processing in distributed environments We would like to extend our sincere appreciation to all the reviewers for their work on this regular issue Our special thanks go to Editorial Assistant Ms Madeena Sultana, for her dedicated work on collecting papers and communicating with authors We would also like to thank all of the authors for submitting their papers to the journal and the associate editors and referees for their valuable work It is our hope that this collection of eight articles presented in this issue will be a valuable resource for Transactions on Computational Science readers and will stimulate further research into the key area of high-performance computing January 2017 Marina L Gavrilova C.J Kenneth Tan LNCS Transactions on Computational Science – Editorial Board Marina L Gavrilova, Editor-in-Chief Chih Jeng Kenneth Tan, Editor-in-Chief Tetsuo Asano Brian A Barsky Alexander V Bogdanov Martin Buecker Rajkumar Buyya Hyungseong Choo Danny Crookes Tamal Dey Ivan Dimov Magdy El-Tawil Osvaldo Gervasi Christopher Gold Rodolfo Haber Andres Iglesias Deok-Soo Kim Stanislav V Klimenko Ivana Kolingerova Vipin Kumar Antonio Lagana D.T Lee Laurence Liew Nikolai Medvedev Graham M Megson Edward D Moreno Youngsong Mun Dimitri Plemenos Viktor K Prasanna Muhammad Sarfraz Dale Shires Masha Sosonkina Alexei Sourin University of Calgary, Canada Sardina Systems, Estonia JAIST, Japan University of California at Berkeley, USA Institute for High Performance Computing and Data Bases, Russia Aachen University, Germany University of Melbourne, Australia Sungkyunkwan University, South Korea Queen’s University Belfast, UK Ohio State University, USA Bulgarian Academy of Sciences, Bulgaria Cairo University, Egypt Università degli Studi di Perugia, Italy University of Glamorgan, UK Council for Scientific Research, Spain University of Cantabria, Spain Hanyang University, South Korea Institute of Computing for Physics and Technology, Russia University of West Bohemia, Czech Republic Army High Performance Computing Research Center, USA Università degli Studi di Perugia, Italy Institute of Information Science, Academia Sinica, Taiwan Platform Computing, Singapore Novosibirsk Russian Academy of Sciences, Russia University of Reading, UK UEA – University of Amazonas State, Brazil Soongsil University, South Korea Université de Limoges, France University of Southern California, USA KFUPM, Saudi Arabia Army Research Lab, USA Ames Laboratory, USA Nanyang Technological University, Singapore X LNCS Transactions on Computational Science – Editorial Board David Taniar Athanasios Vasilakos Chee Yap Igor Zacharov Zahari Zlatev Monash University, Australia University of Western Macedonia, Greece New York University, USA SGI Europe, Switzerland National Environmental Research Institute, Denmark Decision Fusion for Classification of Content Based Image Data Red Component Binarized Red Component Green Component 125 Blue Component Binarized Green Component Binarized Blue Component Fig Binarization with Bernsen’s local threshold selection (Color figure online) 3.2 Feature Extraction with Vector Quantization Feature extraction can be done from the spatial arrangements of color or intensities with the help of texture analysis Same histogram distribution can have different texture representation, which can act as a tool for extraction of distinct features Vector Quantization has been used to generate codebook as feature vectors from the images A k dimensional Euclidian space is mapped by means of Vector Quantization into a finite subset The codebook is represented by the finite set CB as in Eq CB ¼ fCi=i ¼ 1; 2; ; N g ð9Þ where, Ci = (ci1, ci2, …, cik) is a codevector N is the size of codebook The authors have followed Linde - Buzo - Gray (LBG) algorithm for generation of codevectors in which the images are divided into non overlapping blocks which were converted to training vector Xi = (xi1, xi2, ……., xik) [41] The training set is formed with each training vector of dimension 12 comprising of Red (R), Green (G) and Blue (B) components of  neighbouring pixels Further, the first code vector is calculated by computing the centroid of the entire training set The process is followed by generation of two trial code vectors v1 and v2 by adding and subtracting constant error 126 R Das et al Fig Clustering process for codebook generation to the centroid The closeness of each training vector is determined to the trial vectors and two clusters are created based on proximity of the training vectors to v1 and v2 as in Fig Two centroids are calculated from the two newly formed clusters to produce two code vectors for a codebook of size The aforesaid process is repeated with the centroids to generate desired size of codebook which is 16 in this case Matching The image similarity measures have been determined by evaluating distance between set of image features and higher similarity has been characterized by shorter distance [37] The distance between query image Q and database image T is calculated with City block distance and Euclidian distance for binarization and vector quantization techniques of feature extraction respectively as in Eqs 10 and 11 Dcityblock ẳ n X jQi Di j 10ị i1 Deuclidian s n X ẳ Qi Di ị2 11ị i¼1 where, Qi is the query image and Di is the database image The calculated distances for the individual techniques are standardized by Z score normalization based on mean and standard deviation of the computed values as in Eq 12 In general, a feature vector with higher values of attributes tends to have greater effect or “weight.” Hence, to avoid dependence on the choice of feature values of different feature vectors from diverse techniques, the data should be normalized or standardized This has transformed the data to fall within a common range such as [–1, 1] or [0.0, 1.0] Normalizing the data has attempted to provide all the feature vector extraction process with equal weights Decision Fusion for Classification of Content Based Image Data distn ¼ disti À l r 127 12ị where, is the mean and r is the standard deviation Henceforth, the distances are amalgamated as the weighted sum of the distances of the individual techniques Calculation of weights is carried out form the individual Fig Fusion framework for retrieval with classified query 128 R Das et al average precision of each technique Finally, the image is classified based on the class majority of k nearest neighbors [36] where value of k is pffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi k number::of ::training::instances The classified image is forwarded for retrieval purpose The image is a classified query and has searched for similar images only within the class of interest Ranking of the images is done with Canberra Distance measure as in Eq 13 and top 20 images were retrieved Dcanberra = n X jQi Di j Qi j ỵ jDi j j iẳ1 13ị where, Qi is the query image and Di is the database image The process of fusion based classification and then retrieval with classified query has been illustrated in Fig Datasets Used Three different datasets namely Wang dataset (10 different categories of 1000 images of dimension 256  384 or 384  256), Oliva and Torralba (OT-Scene) dataset (2688 images and is divided into eight different categories) and Corel dataset (10,800 images with 80 different categories of images of dimension 80  120 or 120  80) has been used for the classification purpose [38–40] A sample collage of each of the datasets has been given in Figs 4, and Fig Sample collage for Wang dataset Fig Sample collage for OT-Scene dataset Decision Fusion for Classification of Content Based Image Data 129 Fig Sample collage for Corel dataset Results and Discussions The research has been conducted using Matlab version 7.11.0(R2010b) installed in a system having Intel core i5 processor with GB RAM under Microsoft Windows environment At the outset, the precision and recall values for classification are determined on three different public datasets namely, Wang dataset, OT scene dataset and Corel dataset Further, the precision, recall and F1 Score values of the fused architecture for classification are compared against state-of-the art techniques The precision, recall and F1 Score are represented by Eqs 1416 Precision ẳ TP TP ỵ FP TPRate=Recall ẳ F1score ẳ TP TP ỵ FN Precision Recall Precision ỵ Recall 14ị 15ị 16ị True Positive TPị ẳ Number of instances classified correctly True Negative TN ị ẳ Number of negative results created for negative instances False Positive FPị ẳ Number of erroneous results as positive results for negative instances False Negative ðFN Þ ¼Number of erroneous results as negative results for positive instances Subsequent precision and recall values for classification using two different techniques of feature extraction have been given in Figs and The precision and recall values shown in Figs and has indicated higher classification accuracy by feature extraction with Vector Quantization compared to feature extraction with binarization in all the three datasets namely Wang dataset, OT Scene dataset and Corel dataset Henceforth, a statistical technique named Z score normalization has been implemented to fuse the classification decision with two different techniques of feature extraction The fusion technique is carried out with Wang dataset The results of classification with decision fusion has shown 93% precision and 92% recall which has clearly outperformed the precision and recall values obtained with individual feature 130 R Das et al Values Precision and Recall for Classification by feature extraction using binarization 100 80 60 40 20 Precision Recall Wang Dataset 81.6 81.4 OT-Scene Dataset 53.5 48.3 Corel Dataset 40.5 39.2 Fig Precision and recall for classification by feature extraction with binarization Values Comparison of Precision and Recall for Classification by feature extraction Vector Quantization (LBG) 100 80 60 40 20 Precision Recall Wang Dataset 90.2 89.8 OT-Scene Dataset 92.3 91.9 Corel Dataset 70.3 65.8 Fig Precision and recall for classification by feature extraction with vector quantization extraction techniques Further, the precision, recall and F1 Score values obtained by classification decision fusion are compared to state-of-the art techniques The comparison has been accomplished with Wang dataset as in Fig The comparison of average Precision, Recall, F1 Score and MR curves of various techniques has been given in Fig 10 It is observed that the proposed architecture of classification has outperformed all the contemporary techniques discussed in the literature as in Fig A paired t-test (2 tailed) is performed to compute the p-values for the precision for classification with the existing techniques with respect to the proposed technique The actual difference between the two means for variation in precision results of the proposed technique and the existing techniques in Fig was statistically validated by the test The test is carried out to determine whether the differences in precision values are originated from a population with zero mean: Decision Fusion for Classification of Content Based Image Data 131 Comparison of Precision, Recall and F1 Score for Classification 0.9 0.8 0.7 Values 0.6 0.5 0.4 0.3 0.2 0.1 Precision Recall F1 Score Proposed 0.93 0.92 0.92 ( Thepade et al, 2014) [19] 0.69 0.69 0.69 (Kekre et al, 2013) [7] 0.66 0.66 0.66 (Thepade et al , 2013) [9] 0.65 0.65 0.65 (Yanli Y and Zhenxing Z., 2012) [18] 0.64 0.64 0.64 (RamírezOrtegón, M.A And Rojas R., 2010)[17] 0.63 0.63 0.63 (Liu.C, 2013) [16] 0.57 0.57 0.57 (Shaikh, 2013) [12] 0.52 0.52 0.52 Fig Precision recall and F1 score of classification with various techniques H0 : ld = vs H1: ld < The p values in Table have determined the effectiveness of evidence against null hypothesis The p values have indicated significant difference in precision results for the proposed technique with respect to the existing techniques Hence the null hypothesis was rejected and the noteworthy improvement for content based image classification with the proposed technique was established Hereafter, retrieval process was initiated with classified query Precision and Recall were considered as evaluation metric for retrieval and has been given by Eqs 10 and 11 132 R Das et al Comparison of Precision, Recall, F1 Score and MR Curves 0.015 0.92 0.07 0.075 0.078 0.08 0.66 0.65 0.64 0.081 0.096 0.92 0.69 0.107 0.63 0.57 0.69 0.66 0.65 0.64 0.63 0.57 0.52 0.52 0.93 0.69 0.66 Precision 0.65 Recall 0.64 0.63 F1 Score 0.57 0.52 MR Fig 10 Comparison curves for precision, recall, F1 score and MR of various techniques Total::Number::of ::Relevant::Images::Retrieved Total::Number::of ::Retrieved::Images 17ị Total::Number::of ::Relevant::Images::Retrieved Total::Number::of ::Images::in::the::Relevant::Class 18ị Precision ẳ Recall ¼ The process of retrieval was carried out with Wang dataset Random selection of 50 images has been performed which comprised of arbitrary images from each category At the beginning, the classification of the query image is done by fusion based distance measure using Z score normalization Further, the classified query is used to retrieve images by searching only within the class of interest instead of searching the complete dataset as in the case for a generic query without classification In both the cases of classified and generic query for retrieval, the retrieved images are ranked using Canberra Distance measure Ranking process is followed by retrieval of top 20 images Decision Fusion for Classification of Content Based Image Data 133 Table t test for statistical significance in precision value for classification Comparison p-value Feature extraction by binarization using bit plane slicing with Niblack’s local threshold method (Thepade et al 2014) Feature extraction by binarization with multilevel mean threshold (Kekre et al 2013) Feature extraction by binarization of original + even image with mean threshold (Thepade et al 2013) Traditional feature extraction by binarization with Bernsen’s local threshold method (Yanli and Zhenxing 2012) Traditional feature extraction by binarization with Sauvola’s local threshold method (Ramírez-Ortegón and Rojas 2010) Traditional feature extraction by binarization with Niblack’s local threshold method (Liu 2013) Traditional feature extraction by binarization with Otsu’s global threshold method (Shaikh 2013) 0.007 Significance of difference in precision value for classification Significant 0.0074 Significant 0.0079 Significant 0.0043 Significant 0.0016 Significant 0.0029 Significant 0.0029 Significant The comparison of precision and recall for retrieval with generic query and classified query has been illustrated with a sample query image in Fig 11 Firstly, it was applied on Corel K dataset and the retrieval with classified query is observed to be 91% which is much higher than the precision of 63.5% recorded on the same dataset in [42] In Fig 11, the results for retrieval with generic query have yielded 17 images from the desired category named gothic Structure and images from different categories namely Buses, Elephants and Mountains for Wang dataset On the other hand, the results for classified query have retrieved all the 20 images from the category of interest which is Gothic structure It is observed that average precision and recall values for retrieval with classified query have surpassed the results for generic query as in Fig 12 Finally, the proposed technique of retrieval is contrasted to the state-of-the art techniques in Fig 13 Comparison shown in Fig 13 has clearly revealed the superiority of the proposed technique over the existing techniques Hence, it is inferred that the proposed method of retrieval has efficiently boosted up the precision and recall value compared to the state-of-the art techniques 134 R Das et al Results with generic query Results with classified query Fig 11 Comparison of retrieval with generic and classified query Values Comparison of Average Precision and Recall for retrieval with generic query and classified query 100 90 80 70 60 50 40 30 20 10 Generic Query for Retrieval Classified Query for Retrieval Average Precision Average Recall 83.6 16.72 94 18.8 Fig 12 Comparison of average precision and average recall for retrieval with generic and classified query Decision Fusion for Classification of Content Based Image Data 135 Comparison of Precision and Recall for Retrieval with proposed technique with respect to state-of-the art techniques 100 90 80 70 Values 60 50 40 30 20 10 Average Precision Average Recall Rahimi & Moghaddam (2013) [33] 49.6 9.92 Hiremath & Pujari, (2007) [28] 54.9 10.98 Jalab (2011) [30] 58.2 11.64 Subrahmanyam et al (2012) [34] 72.5 14.5 Banerjee et al (2009) [29] 72.7 14.54 Shenn & Wu (2013) [31] 72.8 14.56 Walia et al (2014) [35] 75.8 15.16 94 18.8 Proposed Fig 13 Comparison of average precision and average recall with diverse techniques Conclusions The paper has carried out in depth analysis of different feature extraction techniques for content based image classification and retrieval In this context, the authors have proposed two different techniques of feature extraction based on image binarization and Vector Quantization The identification decisions of the two different techniques are combined for fusion based image classification The precision, recall and F1 Score of classification with the proposed technique have surpassed the existing techniques and the precision value for classification has divulged statistical significance of improved performance Further, the classified image is used as a query for content based retrieval The precision and recall values for retrieval have exceeded the state-of-the art techniques and have significantly contributed to the improvement of the retrieval process Therefore, the research work has fulfilled the following objectives: • It has reduced the dimension of feature vectors • It has successfully implemented fusion based method of content based image identification 136 R Das et al • The research results have shown statistical significance • The research results have outperformed the results of state-of-the art techniques The work may be extended towards content based image recognition in the field of military, media, medical science, journalism, e commerce and many more References Bashir, M.B., et al.: Content-based information retrieval techniques based on grid computing: a review IETE Techn Rev 30(3), 223–232 (2013) Liao, B., Xu, J., Lv, J., Zhou, S.: An image retrieval method for binary images based on DBM and softmax classifier IETE Techn Rev 32(4), 294–303 (2015) Aouat, S., Larabi, S.: Outline shape retrieval using textual descriptors and geometric features Int J Inf Retr Res (IJIRR) 2(4), 60–81 (2012) doi:10.4018/ijirr.2012100105 Keyvanpour, M.R., Charkari, N.M.A.: Content based model for image categorization In: 20th International Workshop on Database and Expert Systems Application, p IEEE (2009) Walia, E., Pal, A.: Fusion framework for effective color image retrieval J Vis Commun Image R 25(6), 1335–1348 (2014) doi:10.1016/j.jvcir.2014.05.005 Yıldız, O.T., Aslan, O., Alpaydın, E.: Multivariate Statistical Tests for Comparing Classification Algorithms In: Coello, C.A.C (ed.) LION 2011 LNCS, vol 6683, pp 1–15 Springer, Heidelberg (2011) Kekre, H.B., Thepade, S., Das, R.K.K., Ghosh, S.: Performance boost of block truncation coding based image classification using bit plane slicing Int J Comput Appl 47(15), 45– 48 (2012) ISSN: 0975-8887 Thepade, S., Das, R., Ghosh, S.: Performance comparison of feature vector extraction techniques in RGB color space using block truncation coding or content based image classification with discrete classifiers In: Annual IEEE India Conference (INDICON), pp 1–6 (2013) doi:10.1109/INDCON.2013.6726053 Thepade, S.D., Das, R.K.K., Ghosh, S.: Image classification using advanced block truncation coding with ternary image maps In: Unnikrishnan, S., Surve, S., Bhoir, D (eds.) Advances in Computing, Communication, and Control Communications in Computer and Information Science Communications in Computer and Information Science, vol 361, pp 500–509 Springer, Heidelberg (2013) 10 Kekre, H.B., Thepade, S., Das, R., Ghosh, S.: Multilevel block truncation coding with diverse colour spaces for image classification In: IEEE-International Conference on Advances in Technology and Engineering (ICATE 2013), pp 1–7 (2013) 11 Otsu, N.: A threshold selection method from gray-level histogram IEEE Trans Syst Man Cybern 9, 62–66 (1979) 12 Shaikh, S.H., Maiti, A.K., Chaki, N.: A new image binarization method using iterative partitioning Mach Vis Appl 24(2), 337–350 (2013) 13 Niblack, W.: An Introduction to Digital Image Processing, pp 115–116 Prentice Hall, Eaglewood Cliffs (1998) 14 Sauvola, J., Pietikainen, M.: Adaptive document image binarization Pattern Recogn 33(2), 225–236 (2000) 15 Bernsen, J.: Dynamic thresholding of gray level images In: Proceedings of the International Conference on Pattern recognition (ICPR 1986), pp 1251–1255 (1986) Decision Fusion for Classification of Content Based Image Data 137 16 Liu, C.: A new finger vein feature extraction algorithm In: IEEE 6th International Congress on Image and Signal Processing (CISP), vol 1, pp 395–399 (2013) 17 Ramírez-Ortegón, M.A., Rojas, R.: Unsupervised evaluation methods based on local gray-intensity variances for binarization of historical documents In: IEEE 20th International Conference on Pattern Recognition (ICPR), pp 2029–2032 (2010) 18 Yanli, Y., Zhenxing, Z.: A novel local threshold binarization method for QR image, In: IET International Conference on Automatic Control and Artificial Intelligence, pp 224–227 (2012) 19 Thepade, S., Das, R., Ghosh, S.: A novel feature extraction technique using binarization of bit planes for content based image classification J Eng 13 (2014) doi:10.1155/2014/ 439218 Article ID 439218 Hindawi Publishing Corporation 20 Kekre, H.B., Sarode, T.K., Raul, B.C.: Color image segmentation using Kekreʼs fast codebook generation algorithm based on energy ordering concept In: Proceedings of the International Conference on Advances in Computing, Communication and Control, pp 357– 362 (2009) 21 Lai, J.Z.C., Liaw, Y.C., Liu, J.: A fast VQ codebook generation algorithm using codeword displacement Pattern Recogn 41(1), 315–319 (2008) 22 Liaw, Y.C., Lo, W., Lai, J.Z.C.: Image restoration of compressed image using classified vector quantization Pattern Recogn 35(2), 329–340 (2002) 23 Nasrabadi, N.M., King, R.A.: Image coding using vector quantization: a review IEEE Trans Commun 36(8), 957–971 (1998) 24 Foster, J., Gray, R.M., Dunham, M.O.: Finite state vector quantization for waveform coding IEEE Trans Inf Theory 31(3), 348–359 (1985) 25 Kim, T.: Side match and overlap match vector quantizers for images IEEE Trans Image Process 1(2), 170–185 (1992) A Publication of the IEEE Signal Processing Society 26 Lai, J.Z.C., Liaw, Y.C., Lo, W.: Artifact reduction of JPEG coded images using mean-removed classified vector quantization Signal Process 82(10), 1375–1388 (2002) 27 ElAlami, M.E.: A novel image retrieval model based on the most relevant features Knowl Based Syst 24, 23–32 (2011) 28 Hiremath, P.S., Pujari, J.: Content based image retrieval using color, texture and shape features In: 15th International Conference on Advanced Computing and Communications ADCOM, vol 9, no 2, pp 780–784 IEEE (2007) 29 Banerjee, M., Kundu, M.K., Maji, P.: Content-based image retrieval using visually significant point features Fuzzy Sets Syst 160(23), 3323–3341 (2009) 30 Jalab, H.A.: Image retrieval system based on color layout descriptor and Gabor filters In: 2011 IEEE Conference on Open Systems, pp 32–36 IEEE (2011) 31 Shen, G.L., Wu, X.J.: Content based image retrieval by combining color texture and CENTRIST In: IEEE International Workshop on Signal Processing, vol 1, pp 1–4 (2013) 32 Irtaza, A Jaffar, M.A Aleisa, E., Choi, T.S.: Embedding neural networks for semantic association in content based image retrieval Multimed Tool Appl 72(2), 1911–1931 (2014) 33 Rahimi, M., Moghaddam, M.E.: A content based image retrieval system based on color ton distributed descriptors Sig Image Video Process 9(3), 691–704 (2015) 34 Subrahmanyam, M., Maheshwari, R.P., Balasubramanian, R.: Expert system design using wavelet and color vocabulary trees for image retrieval Expert Syst Appl 39(5), 5104–5114 (2012) 35 Walia, E., Vesal, S., Pal, A.: An Effective and Fast Hybrid Framework for Color Image Retrieval, Sensing and Imaging Springer, New York (2014) 36 Sridhar, S.: Image Features Representation and Description Digital Image Processing, pp 483–486 India Oxford University Press, New Delhi (2011) 138 R Das et al 37 Dunham, M.H.: Data Mining Introductory and Advanced Topics, p 127 Pearson Education, Upper Saddle River (2009) 38 Wang, J.Z., Li, J., Wiederhold, G.: SIMPLIcity: semantics-sensitive integrated matching for picture libraries IEEE Trans Pattern Anal Mach Intell 23(9), 947–963 (2001) 39 Thepade, S., Das, R., Ghosh, S.: Feature extraction with ordered mean values for content based image classification Adv Comput Eng (2014) doi:10.1155/2014/454876 Article ID 454876 40 Liu, G.-H., Yang, J.-Y.: Content-based Image retrieval using color difference histogram Pattern Recogn 46(1), 188–198 (2013) 41 Linde, Y., Buzo, A., Gray, R.: An algorithm for vector quantizer design IEEE Trans Commun 28(1), 84–95 (1980) 42 Zhang, S., et al.: Query specific rank fusion for image retrieval IEEE Trans Pattern Anal Mach Intell 37(4), 803–815 (2015) 43 Bhattacharya, P., Gavrilova, M.: DT-RANSAC: a delaunay triangulation based scheme for improved RANSAC feature matching In: Gavrilova, M.L., Tan, C.J.K., Kalantari, B (eds.) Transactions on Computational Science XX LNCS, vol 8110, pp 5–21 Springer, Heidelberg (2013) doi:10.1007/978-3-642-41905-8_2 Author Index Agrawal, Vinod Kumar Attene, Marco 86, 97 33 Klimenko, Stanislav Konich, Kira 47 Bagwari, Ashish 64 Malofeev, Valery Cabiddu, Daniela Nikitin, Igor 47 Nikitina, Lialia 47 97 47 47 Das, Rik 121 Ghosh, Saurav 121 Jayashree, H.V 33 Kanti, Jyotshana 64 Klimenko, Andrey 47 Samet, Nermin Samet, Refik Thapliyal, Himanshu 33 Thepade, Sudeep 121 Tomar, Geetam Singh 64 Tyul’bashev, Sergey 47 ... applied computational science research Transactions on Computational Science focuses on original high-quality research in the realm of computational science in parallel and distributed environments,... – – – – – – – – – – – – LNCS Transactions on Computational Science Computational Fluid Dynamics Computational Geometry Computational Number Theory Data Representation and Storage Data Mining and... Systems Tallinn Estonia ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISSN 1866-4733 ISSN 1866-4741 (electronic) Transactions on Computational Science ISBN 978-3-662-54562-1