Applications of Computational

Intelligence in Multi-Disciplinary
Research Ahmed A. Elngar
Visit to download the full and correct content document:
https://ebookmass.com/product/applications-of-computational-intelligence-in-multi-dis
ciplinary-research-ahmed-a-elngar/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...

Applications of Computational Intelligence in Multi-

Disciplinary Research Ahmed A. Elngar

https://ebookmass.com/product/applications-of-computational-
intelligence-in-multi-disciplinary-research-ahmed-a-elngar-2/

Multi-Chaos, Fractal and Multi-Fractional Artificial

Intelligence of Different Complex Systems Yeliz Karaca

https://ebookmass.com/product/multi-chaos-fractal-and-multi-
fractional-artificial-intelligence-of-different-complex-systems-
yeliz-karaca/

Bionanotechnology: Emerging Applications of

Bionanomaterials Ahmed Barhoum

https://ebookmass.com/product/bionanotechnology-emerging-
applications-of-bionanomaterials-ahmed-barhoum/

Science and Applications of Nanoparticles Wagar Ahmed

https://ebookmass.com/product/science-and-applications-of-
nanoparticles-wagar-ahmed/
Computational and Data-Driven Chemistry Using
Artificial Intelligence: Fundamentals, Methods and
Applications Takashiro Akitsu

https://ebookmass.com/product/computational-and-data-driven-
chemistry-using-artificial-intelligence-fundamentals-methods-and-
applications-takashiro-akitsu/

Proceedings of the Third Annual National Multi-

Disciplinary Conference, V-CMT 2016 Dr. Rohini Kelkar

https://ebookmass.com/product/proceedings-of-the-third-annual-
national-multi-disciplinary-conference-v-cmt-2016-dr-rohini-
kelkar/

Digitalisation and Human Security: A Multi-Disciplinary

Approach to Cybersecurity in the European High North
1st ed. Edition Mirva Salminen

https://ebookmass.com/product/digitalisation-and-human-security-
a-multi-disciplinary-approach-to-cybersecurity-in-the-european-
high-north-1st-ed-edition-mirva-salminen/

Applications of Artificial Intelligence in Process

Systems Engineering Jingzheng Ren

https://ebookmass.com/product/applications-of-artificial-
intelligence-in-process-systems-engineering-jingzheng-ren/

Applications of genetic and genomic research in cereals

Korzun

https://ebookmass.com/product/applications-of-genetic-and-
genomic-research-in-cereals-korzun/
Applications of Computational Intelligence in
Multi-Disciplinary Research
Advances in Biomedical Informatics

Applications of
Computational Intelligence
in Multi-Disciplinary
Research

Edited by
Ahmed A. Elngar
Faculty of Computers and Artificial Intelligence, Beni-Suef University, Beni-Suef City, Egypt
College of Computer Information Technology, American University in the Emirates,
United Arab Emirates

Rajdeep Chowdhury
Department of Computer Application, JIS College of Engineering, Kalyani, West Bengal, India

Mohamed Elhoseny
College of Computing and Informatics, University of Sharjah, United Arab Emirates
Faculty of Computers and Information, Mansoura University, Egypt

Valentina Emilia Balas

Department of Automatics and Applied Software, Faculty of Engineering,
“Aurel Vlaicu” University of Arad, Arad, Romania

Series Editor
Valentina Emilia Balas
Department of Automatics and Applied Software, Faculty of Engineering,
“Aurel Vlaicu” University of Arad, Arad, Romania
Academic Press is an imprint of Elsevier
125 London Wall, London EC2Y 5AS, United Kingdom
525 B Street, Suite 1650, San Diego, CA 92101, United States
50 Hampshire Street, 5th Floor, Cambridge, MA 02139, United States
The Boulevard, Langford Lane, Kidlington, Oxford OX5 1GB, United Kingdom
Copyright © 2022 Elsevier Inc. All rights reserved.
No part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including
photocopying, recording, or any information storage and retrieval system, without permission in writing from the publisher.
Details on how to seek permission, further information about the Publisher’s permissions policies and our arrangements with
organizations such as the Copyright Clearance Center and the Copyright Licensing Agency, can be found at our website:
www.elsevier.com/permissions.
This book and the individual contributions contained in it are protected under copyright by the Publisher (other than as may be
noted herein).
Notices
Knowledge and best practice in this field are constantly changing. As new research and experience broaden our understanding,
changes in research methods, professional practices, or medical treatment may become necessary.
Practitioners and researchers must always rely on their own experience and knowledge in evaluating and using any information,
methods, compounds, or experiments described herein. In using such information or methods they should be mindful of their
own safety and the safety of others, including parties for whom they have a professional responsibility.
To the fullest extent of the law, neither the Publisher nor the authors, contributors, or editors, assume any liability for any injury
and/or damage to persons or property as a matter of products liability, negligence or otherwise, or from any use or operation of
any methods, products, instructions, or ideas contained in the material herein.
British Library Cataloguing-in-Publication Data
A catalogue record for this book is available from the British Library
Library of Congress Cataloging-in-Publication Data
A catalog record for this book is available from the Library of Congress
ISBN: 978-0-12-823978-0

For Information on all Academic Press publications

visit our website at https://www.elsevier.com/books-and-journals

Publisher: Mara Conner

Acquisitions Editor: Chris Katsaropoulos
Editorial Project Manager: Isabella C. Silva
Production Project Manager: Selvaraj Raviraj
Cover Designer: Greg Harris
Typeset by MPS Limited, Chennai, India
Contents

List of contributors ix 3. Behavioral malware detection and

classification using deep learning
1. Iris feature extraction using approaches 29
three-level Haar wavelet transform
T. Poongodi, T. Lucia Agnes Beena,
and modified local binary D. Sumathi and P. Suresh
pattern 1
3.1 Introduction 29
Prajoy Podder, M. Rubaiyat Hossain Mondal and 3.1.1 Digital forensics—malware
Joarder Kamruzzaman detection 30
Abbreviations 1 3.1.2 Malware evolution and its
1.1 Introduction 1 taxonomy 32
1.2 Related works 3 3.1.3 Machine learning techniques for
1.3 Iris localization 4 malware analysis 32
1.4 Iris normalization 6 3.1.4 Behavioral analysis of malware
1.5 The proposed feature extraction detection 33
scheme 7 3.2 Deep learning strategies for malware
1.6 Matching results 11 detection 35
1.7 Performance evaluation 11 3.2.1 Feature extraction and data
1.8 Conclusion 13 representation 35
References 14 3.2.2 Static Analysis 36
3.2.3 Dynamic analysis 38
3.2.4 Hybrid analysis 38
3.2.5 Image processing techniques 38
2. A novel crypt-intelligent 3.3 Architecture of CNNs for malware
cryptosystem 17 detection 41
3.3.1 Preprocessing 41
Pratyusa Mukherjee and
3.3.2 Classification using CNNs 41
Chittaranjan Pradhan
3.3.3 Evaluation 42
2.1 Introduction 17 3.4 Comparative analysis of CNN
2.2 Related work 18 approaches 42
2.2.1 Machine learning contributions in 3.5 Challenges and future research
cryptology 18 directions 43
2.2.2 Genetic algorithm contributions in 3.6 Conclusion 43
cryptology 20 References 43
2.2.3 Neural network contributions in
cryptology 21 4. Optimization techniques and
2.2.4 Background of DNA cryptography 23 computational intelligence with
2.3 Proposed methodology 23 emerging trends in cloud
2.3.1 Proposed encryption scheme 24 computing and Internet of Things 47
2.3.2 Proposed decryption scheme 25
2.4 Discussion 25 Jayesh S Vasudeva, Sakshi Bhargava and
Deepak Kumar Sharma
2.5 Conclusion and future work 26
References 26 4.1 Introduction 47

v
vi Contents

4.1.1 Introduction to optimization 48 6.2 Supervisory control and data acquisition

4.1.2 Introduction to cloud computing with systems 84
emphasis on fog/edge computing 48 6.3 The very small aperture terminal
4.2 Optimization techniques 49 networks 87
4.2.1 An optimization problem 49 6.3.1 The satellite communication
4.2.2 Solution to the optimization problem 52 systems 87
4.3 Understanding fog/edge computing 54 6.3.2 Architecture very small aperture
4.3.1 What is fog? 54 terminal networks 89
4.3.2 Prelude to our framework 54 6.3.3 Connectivity 92
4.3.3 Our goal 55 6.3.4 Multiple access 93
4.3.4 Framework for fog computing 55 6.4 Algorithm for estimating the satellite
4.4 Optimizing fog resources 57 bandwidth 95
4.4.1 Defining optimization problem for 6.4.1 Determining the bandwidth
fog layer resources 57 required for data transmission 95
4.4.2 Optimization techniques used 58 6.4.2 Case study 98
4.5 Case studies 60 6.4.3 Overview of some recent
4.5.1 Case study I: floorplan optimization 60 algorithms in detail 99
4.5.2 Case study II: Gondwana— 6.4.4 Validation of bandwidth
optimization of drinking water calculations 104
distribution system 63 6.5 Challenges and future work 106
4.6 Scope of advancements and future 6.6 Conclusions 107
research 63 References 107
4.7 Conclusion 64
References 65
7. Using artificial intelligence search
5. Bluetooth security architecture in solving the camera placement
cryptography based on genetic problem 109
codons 67 Altahir A. Altahir, Vijanth S. Asirvadam,
Nor Hisham B. Hamid and Patrick Sebastian
Asif Ikbal Mondal, Bijoy Kumar Mandal,
Debnath Bhattacharyya and Tai-Hoon Kim Nomenclature 109
7.1 Introduction 109
5.1 Introduction 67
7.1.1 The roles of visual surveillance
5.1.1 Bluetooth 67
systems 110
5.1.2 Bluetooth security architecture 67
7.1.2 The camera placement problem
5.2 Survey of literature 69
from an artificial intelligence
5.3 Plaintext-to-ciphertext conversion
perspective 111
process 71
7.1.3 Chapter description 112
5.3.1 Basic workflow 71
7.2 Background 112
5.3.2 Algorithm 72
7.3 Modeling the visual sensors 113
5.3.3 Analysis and discussion 78
7.3.1 The sensor space modeling 114
5.4 Conclusion 79
7.3.2 The camera coverage modeling 114
5.5 Future work 79
7.3.3 The analysis of camera visibility 115
References 80
7.4 Solving the camera placement problem
using artificial intelligence search 116
6. Estimation of the satellite bandwidth 7.4.1 Generate and test algorithm 117
required for the transmission of 7.4.2 Uninformed search 118
information in supervisory control 7.4.3 Hill climbing strategy 119
and data acquisition systems 83 7.5 Further discussion 121
7.5.1 The efficiency of the algorithms 122
Marius Popescu and Antoanela Naaji
7.5.2 The performance of the algorithms 123
Abbreviations 83 7.6 Conclusion 123
6.1 Introduction 84 References 124
 Contents vii

8. Nanotechnology and applications 129 9.10 Nanotechnology in pesticides and

fertilizers 151
Kanika Dulta, Amanpreet Kaur Virk, 9.11 Control of plant pests 152
Parveen Chauhan, Paras Bohara and 9.12 Concluding remarks 152
Pankaj Kumar Chauhan Consent for publication 152
8.1 Introduction 129 Conflict of interest 153
8.2 Nanoscience and nanotechnology 130 References 153
8.3 Computational nanotechnology 130
8.3.1 Molecular modeling 131 10. A methodology for designing
8.3.2 Nanodevice simulation 133
knowledge-based systems and
8.3.3 Nanoinformatics 133
8.3.4 High-performance computing 135
applications 159
8.3.5 Computational intelligence 135 Hien D. Nguyen, Nhon V. Do and
8.4 Applications of computational Vuong T. Pham
nanotechnology 137
10.1 Introduction 159
8.4.1 Nanotube-based sensors and
10.2 Related work 160
actuators 138
10.3 Design the knowledge-based system 160
8.4.2 Nanoinformatics for drugs 138
10.3.1 The architecture of a
8.4.3 Molecular docking 138
knowledge-based system 160
8.4.4 Nanotoxicology 138
10.3.2 The process for designing the
8.4.5 Other applications 139
knowledge-based system 162
8.5 Conclusion 139
10.4 Knowledge base and inference engine
References 139
of a knowledge-based system 163
9. Advances of nanotechnology in 10.4.1 Design the knowledge base 163
plant development and crop 10.4.2 Design the Inference engine 164
10.5 Applications 168
protection 143
10.5.1 Design an intelligent problem
Rokeya Akter, Md. Habibur Rahman, solver for solving solid geometry
Md. Arifur Rahman Chowdhury, at high school 168
Manirujjaman Manirujjaman and 10.6 Conclusion and Future work 183
Shimaa E. Elshenawy References 184
9.1 Introduction 143
9.2 Agriculture’s nanofarming: a modern 11. IoT in healthcare ecosystem 187
frontier 143 Poonam Gupta and Indhra Om Prabha M
9.3 Synthesis of green nanoparticles and its
sources 144 11.1 Introduction 187
9.4 Good distribution possibilities allowed 11.2 Applications of Internet of Things in
by nanoparticles: a modern sustainable healthcare 188
agriculture portal 145 11.2.1 Patient-centric IoT 188
9.5 Nanofertilizers: a good food supply for 11.2.2 Hospital-centric IoT applications 189
crops 146 11.2.3 IoT benefitting health insurance
9.6 Germination, field production, and companies 190
efficiency enhancement of seed 11.2.4 Pharmaceutical governance 190
nanomaterials 148 11.3 Implementation methodologies 190
9.7 Plant sensory systems and responses to 11.3.1 Fog computing 191
radical climate change influences 11.3.2 Edge computing 192
nanomaterials 149 11.4 Implementation models 193
9.8 Nanosensors and nanomaterials: 11.4.1 Heart disease prediction 193
perturbation detection and control 150 11.4.2 Healthcare IoT-based affective
9.9 Pesticide-based plant safety state mining using deep
nanomaterials 150 convolutional neural networks 194
viii Contents

11.5 Challenges in healthcare IoT 195 11.7.3 Quarantined patient care 199
11.5.1 Technology-oriented challenges 195 11.7.4 Public surveillance 200
11.5.2 Adapting to remote healthcare 11.7.5 Safeguarding hygiene 200
and telehealth 195 11.7.6 IoT and robotics 200
11.5.3 Data security 195 11.7.7 Smart disinfection and sanitation
11.6 Security issues and defense tunnel 201
mechanisms and IoT 196 11.7.8 Smart masks and smart medical
11.6.1 Security requirements in equipment 201
healthcare IoT 196 11.8 Future of IoT in healthcare 202
11.6.2 Attacks on IoT devices 196 11.8.1 IoT and 5G 202
11.6.3 Defensive mechanism 197 11.8.2 IoT and artificial intelligence 202
11.7 Covid 19—how IoT rose to the global 11.9 Conclusion 203
pandemic 198 References 203
11.7.1 About Covid 19 199
11.7.2 Decoding the outbreak and Index 205
identifying patient zero 199
List of contributors
T. Lucia Agnes Beena Department of Information
Technology, St. Josephs College, Tiruchirappalli,
India
Rokeya Akter Department of Pharmacy, Jagannath
University, Dhaka, Bangladesh
Altahir A. Altahir Department of Electrical and
Electronics Engineering, Universiti Technologi
PETRONAS, Perak, Malaysia
Vijanth S. Asirvadam Department of Electrical and
Electronics Engineering, Universiti Technologi
PETRONAS, Perak, Malaysia
Sakshi Bhargava Department of Physical Sciences and
Engineering, Banasthali Vidyapith, Tonk, India
Debnath Bhattacharyya Computer Science and
Engineering Department, Koneru Lakshmaiah
Education Foundation, Guntur, India
Paras Bohara Faculty of Applied Sciences and
Biotechnology, Shoolini University of Biotechnology
and Management Sciences, Solan, India
Pankaj Kumar Chauhan Faculty of Applied Sciences
and Biotechnology, Shoolini University of
Biotechnology and Management Sciences, Solan, India
Parveen Chauhan Faculty of Applied Sciences and
Biotechnology, Shoolini University of Biotechnology
and Management Sciences, Solan, India
Md. Arifur Rahman Chowdhury Department of
Pharmacy, Jagannath University, Dhaka, Bangladesh;
Department of Bioactive Materials Science, Jeonbuk
National University, Jeoju, South Korea
Nhon V. Do Hong Bang International University, Ho Chi
Minh City, Vietnam
Kanika Dulta Faculty of Applied Sciences and
Biotechnology, Shoolini University of Biotechnology
and Management Sciences, Solan, India
Shimaa E. Elshenawy Center of Stem Cell and
Regenerative Medicine, Zewail City for Science,
Zewail, Egypt
Poonam Gupta G H Raisoni College of Engineering and
Management, Pune, India
Nor Hisham B. Hamid Department of Electrical and
Electronics Engineering, Universiti Technologi
PETRONAS, Perak, Malaysia
Joarder Kamruzzaman School of Engineering and
Information Technology, Federation University
Australia, Churchill, VIC, Australia
Tai-Hoon Kim Computer Science and Engineering
Department, Global Campus of Konkuk University,
Chungcheongbuk-do, Korea
Deepak Kumar Sharma Department of Information
Technology, Netaji Subhas University of Technology
(formerly known as Netaji Subhas Institute of
Technology), New Delhi, India
Indhra Om Prabha M G H Raisoni College of
Engineering and Management, Pune, India
Bijoy Kumar Mandal Computer Science and
Engineering Department, NSHM Knowledge Campus,
Durgapur, India
Manirujjaman Manirujjaman Institute of Health and
Biomedical Innovation (IHBI), School of Clinical
Sciences, Faculty of Health, Queensland University of
Technology, Brisbane, QLD, Australia
Asif Ikbal Mondal Computer Science and Engineering
Department, Dumkal Institute of Engineering &
Technology, Murshidabad, India
Pratyusa Mukherjee School of Computer Engineering,
KIIT Deemed to be University, Bhubaneshwar,
India
Antoanela Naaji Faculty of Economics, Computer
Science and Engineering, “Vasile Goldis” Western
University of Arad, Arad, Romania
Hien D. Nguyen University of Information Technology,
Ho Chi Minh City, Vietnam; Vietnam National
University, Ho Chi Minh City, Vietnam
Vuong T. Pham Sai Gon University, Ho Chi Minh City,
Vietnam
Prajoy Podder Bangladesh University of Engineering
and Technology, Institute of Information and
Communication Technology, Dhaka, Bangladesh
ix
x List of contributors
T. Poongodi School of Computing Science and
Engineering, Galgotias University, Greater Noida,
India
Marius Popescu Faculty of Economics, Computer
Science and Engineering, “Vasile Goldis” Western
University of Arad, Arad, Romania
Chittaranjan Pradhan School of Computer
Engineering, KIIT Deemed to be University,
Bhubaneshwar, India
Md. Habibur Rahman Department of Pharmacy,
Southeast University, Dhaka, Bangladesh
M. Rubaiyat Hossain Mondal Bangladesh University of
Engineering and Technology, Institute of Information
and Communication Technology, Dhaka, Bangladesh
Patrick Sebastian Department of Electrical and
Electronics Engineering, Universiti Technologi
PETRONAS, Perak, Malaysia
D. Sumathi SCOPE, VIT-AP University, Amaravati,
India
P. Suresh School of Mechanical Engineering, Galgotias
University, Greater Noida, India
Jayesh S Vasudeva Department of Instrumentation and
Control Engineering, Netaji Subash University of
Technology (formerly known as Netaji Subhas
Institute of Technology), New Delhi, India
Amanpreet Kaur Virk Faculty of Applied Sciences and
Biotechnology, Shoolini University of Biotechnology
and Management Sciences, Solan, India
Chapter 1

Iris feature extraction using three-level

Haar wavelet transform and modified
local binary pattern
Prajoy Podder1, M. Rubaiyat Hossain Mondal1 and Joarder Kamruzzaman2
1
Bangladesh University of Engineering and Technology, Institute of Information and Communication Technology, Dhaka, Bangladesh, 2School of
Engineering and Information Technology, Federation University Australia, Churchill, VIC, Australia

Abbreviations
^ yÞ
iðx; 2D cepstrum with ðx; yÞ representing quefrency coordinates
Iðu; vÞ 2D discrete-time Fourier Transform
Gðx; yÞ 2D Gabor function
FðU; VÞ 2D discrete cosine transform (DCT) coefficient matrix
W Angular frequency
σx andσy Standard deviations of x and y
xc The x-axis coordinate of the iris circle
yc The y-axis coordinate of the iris circle
r Radius of the iris circle
gc Gray level of the center pixel, c
gp Gray level of the neighboring pixel, p


ψ" sp Binary iris code obtained as XOR output
LBPp MLBP operator

1.1 Introduction
The concern of high security and surveillance in the present world has made the identification of people an increasingly
important issue. Among various identification modes, biometric has been considered over the last few decades for its
reliable and accurate identification [15]. Commonly used biometric features include the face, fingerprint, iris, retina,
hand geometry, and DNA identifications. Among them, nowadays, iris recognition has attracted significant interest in
research and commercialization [615]. Iris recognition has several applications in the security systems of banks, bor-
der control, restricted areas, etc. [13]. One key part of such a system is the extraction of prominent texture information
or features in the iris. This feature extraction method generates feature vectors or feature codes. The feature vectors of
the unknown images are used to match those of the stored known ones. In an iris recognition system, the matching pro-
cess matches the extracted feature code of a given image with the feature codes previously stored in the database. In
this way, the identity of the given iris image can be known.
A generalized iris recognition scheme is presented in Fig. 1.1. There are two major parts of Fig. 1.1, one showing
the feature extraction and the other describing the identification portion of an iris. The system starts with image acquisi-
tion and ends with matching, that is, the decision of acceptance or rejection of the identity. In between, there are two
main stages: iris image preprocessing and feature extraction [3,4]. Furthermore, iris image preprocessing includes the
stages of iris segmentation, normalization, and enhancement [5,11]. In the acquisition stage, cameras are used to capture
images of the iris. The acquired images are then segmented. In iris segmentation, the inner and the outer boundaries are

Applications of Computational Intelligence in Multi-Disciplinary Research. DOI: https://doi.org/10.1016/B978-0-12-823978-0.00005-8

© 2022 Elsevier Inc. All rights reserved. 1
2 Applications of Computational Intelligence in Multi-Disciplinary Research

FIGURE 1.1 Example of a typical iris recognition

system: (A) process of feature extraction from an iris
image; (B) identification of an iris.

detected to separate the iris from the pupil and sclera. A circular edge detection method is used to segment the iris
region by finding the pixels of the image that have sharp intensity differences with neighboring pixels [3]. Estimating
the center and the radius of each of the inner and outer circles refers to iris localization. After iris segmentation, any
image artifacts are suppressed. Next is the normalization step in which the images are transformed from Cartesian to
pseudo polar scheme. This is shown in Fig. 1.1, where boundary points are aligned at an angle. Image enhancement is
then performed. As a part of feature extraction, the important features are extracted and then used to generate an iris
code or template. Finally, iris recognition is performed by calculating the difference between codes with the use of a
matching algorithm. For this purpose, Hamming and Euclidian are well known and also considered in this chapter [15].
The matching score is compared with a threshold to determine whether the given iris is authentic or not.
Despite significant research results so far [39,11,12,14], there are several challenges in iris recognition
[13,1526]. One problem is the occlusion, that is, the hiding of the iris caused by eyelashes, eyelids, specular reflec-
tion, and shadows [21]. Occlusion can introduce irrelevant parts and hide useful iris texture [21]. The movement of the
eye can also cause problems in iris region segmentation and thus accurate recognition. Another issue is the computation
time of iris identification. For large population sizes, the matching time of the iris can sometimes become exceedingly
high for real-time applications, and the identification delay increases with the increase in the population size and the
length of feature codes. It has been reported in the recent literature [13,18,22] that the existing iris recognition methods
still suffer from long run times apart from other factors. This is particularly true when the sample size is very large, and
the iris images are nonideal and captured from different types of cameras. Hence, devising a method that reduces the
run time of iris recognition without compromising accuracy is still an important research problem. The identification
delay can be reduced by reducing the feature vector of iris images. Thus this chapter focuses on the issue of reducing
the feature vector which will lead to a reduction in identification delay without lowering the identification accuracy.
For lowering the feature vector, the concept of Haar wavelet along with modified local binary pattern (MLBP) is used
in this work. Note that in the context of face recognition [2730] and fingerprint identification [31], the Haar wavelet
transform demonstrates an excellent recognition rate at a low computation time. In Ref. [32], the Haar wavelet is also
proposed without the use of MLBP.
The main contributions of this chapter can be summarized as follows.
1. A new iris feature extraction method is proposed. This new method is based on repeated Haar wavelet transforma-
tion (HWT) and MLBP. Note that MLBP is the local binary pattern (LBP) operation followed by Exclusive OR
(XOR). This proposed method is different from the technique described in Ref. [30], which uses single-level HWT
and LBP (without XOR) in the context of face recognition.
 Iris feature extraction using three-level Haar wavelet transform and modified local binary pattern Chapter | 1 3

2. The efficacy of the HWTMLBP method is evaluated using three well-known benchmark datasets: CASIA-Iris-V4
[33], CASIA-Iris-V1 [34], and MMU iris database [35].
3. A comparison is made of this new technique with the existing methods of feature extraction in terms of feature vec-
tor length, false acceptance rate (FAR), and false rejection rate (FRR). It is shown here that the proposed method
outperforms the existing ones in terms of feature vector length.
The remainder of this chapter is organized as follows. Section 1.2 provides a literature survey of the relevant
research. Section 1.3 shows the iris localization part where the inner boundary and outer boundary can be detected.
Section 1.4 describes iris normalization. Section 1.5 illustrates our proposed approach for the purpose of encoding the
iris features. Section 1.6 describes the iris recognition process by matching score. The effectiveness of the new method
is evaluated in Section 1.7. Finally, Section 1.8 provides a summary of the research work followed by the challenges
and future work.

1.2 Related works

A number of research papers describe iris feature extraction techniques, which are discussed in the following.
Ma et al. [3] applied a bank of spatial filters to acquire local details of the iris. These spatial filters generate discrim-
inating texture features for an iris image based on the characteristics of the iris. Ma et al. [4] considered a bank of circu-
lar symmetric filters for iris feature extraction. These filters [4] are modulated by a circular symmetric sinusoidal
function, which is different from the Gabor filter modulated by an orientated sinusoidal function. Monro et al. [5] used
discrete cosine transform (DCT) for iris recognition. Daugman [6] introduced the idea of using a 2D Gabor wavelet fil-
ter for extracting features of an iris image. Furthermore, Masek et al. [9] used 1D and 2D Log-Gabor filters for feature
extraction. Li et al. [8] used a convolutional neural network (CNN) algorithm, which is a form of deep learning, to
extract iris features. Umer et al. [12] used a novel texture code defined over a small region at each pixel. This texture
code was developed with vector ordering based on the principal component of the texture vector space. Soliman et al.
[11] considered feature extraction using the Gabor filter, where the original Gabor features were masked via a random
projection scheme. The masking was performed to increase the level of security. In this scheme, the effects of eyelids
and eyelashes were removed. An iris feature extraction method using wavelet-based 2D mel-cepstrum was proposed in
Ref. [14], where the cepstrum of a signal is the inverse Fourier transform of the logarithm of the estimated signal spec-
trum. The 2D cepstrum of an image can be defined by the following expression:
 
^ yÞ 5 IDFTðlogðI ðu; vÞ2 ÞÞ;
iðx;
^ yÞ is the 2D cepstrum with ðx; yÞ representing quefrency coordinates, IDFT represents the inverse discrete
where iðx;
Fourier transform, and Iðu; vÞ is the 2D discrete-time Fourier Transform of the image. This scheme applied the
CohenDaubechiesFeauveau 9/7 filter bank for extracting features. In wavelet cepstrum, nonuniform weights are
assigned to the frequency bins. In this way, the high-frequency components of the iris image are emphasized, resulting
in greater recognition reliability. Furthermore, this wavelet cepstrum method helps to reduce the feature set.
Barpanda et al. [15] used a tunable filter bank to extract region-based iris features. These filters were used for recog-
nizing noncooperative images instead of high-quality images collected in cooperative scenarios. The filters in this filter
bank were based on the halfband polynomial of 14th order where the filter coefficients were extracted from the polyno-
mial domain. To apply the filter bank, the iris template was divided into six equispaced parts and the features were
extracted from all the parts except the second one, which mainly contains artifacts. Betancourt et al. [13] proposed a
robust key pointsbased feature extraction method. To identify distinctive key points, three detectors, namely
HarrisLaplace, HessianLaplace, and Fast-Hessian detectors, were used. This method is suitable for iris recognition
under variable image quality conditions.
For iris feature extraction, Sahua et al. in [22] used phase intensive local pattern (PILP), which consists of density-
based spatial clustering and key-point reduction. This technique groups some closely placed key points into a single
key point, leading to high-speed matching. Jamaludin et al. [18] used a 1D Log-Gabor filter and considered the subiris
region for feature extraction. This filter has a symmetrical frequency response on the log axis. In this case, only the
lower iris regions that are free from noise, as well as occlusions, are considered.
In Ref. [17], combined discrete wavelet transform (DWT) and DCT were used for the extraction of iris features.
Firstly, DWT was performed where the output of this stage was in the spatial domain. Next, DCT was performed to
transform the spatial domain signal to the frequency domain and to obtain better discriminatory features. Another fea-
ture extraction method is the discrete dyadic wavelet transform reported in Ref. [16]. In dyadic wavelet transform, the
4 Applications of Computational Intelligence in Multi-Disciplinary Research

decomposition at each level is done in a way that the bandwidth of the output signal is half of that of the input. In Ref.
[26], a PILP technique is used for feature extraction and to obtain a feature vector of size 1 3 128. In this PILP method,
there are four stages: key-point detection via phase-intensive patterns, removal of edge features, computation of ori-
ented histogram, and formation of the feature vector. Iris features were extracted using 1D DCT and relational measure
(RM), where RM encodes the difference in intensity levels of local regions of iris images [21]. The matching scores of
these two approaches were fused using a weighted average. The score-level fusion technique compensates for some
images that are rejected by one method but accepted by the other [21]. Another way of extracting feature vectors from
iris images is by the use of linear predictive coding coefficients (LPCC) and linear discriminant analysis (LDA) [24].
Llano et al. in [19] used a 2D Gabor filter for feature extraction. Before applying this filter, the fusion of three different
algorithms was performed at the segmentation level (FSL) of the iris images to improve the textual information of the
images. Oktiana et al. [36] proposed an iris feature extraction system using an integration of Gradientface-based nor-
malization (GRF), where GRF uses an image gradient to remove the variation in the illumination level. Furthermore,
the work in Ref. [19] concatenated the GRF with a Gabor filter, a difference of Gaussian (DoG) filter, binary statistical
image feature (BSIF), and LBP for iris feature extraction in a cross-spectral system. Shuai et al. proposed [37] an iris
feature extraction method based on multiple-source feature fusion performed by a Gaussian smoothing filter and texture
histogram equalization. Besides, there have been some recent studies in the field of iris recognition [3849], with some
focusing on iris feature extraction methods [38,4042,45,49] and some on iris recognition tasks [39,44,46,48].
The 2D Gabor function can be described mathematically by using the following expression:
     
1 1 x2 y2
Gðx; yÞ 5 exp 2 1 1 2 3 π 3 j 3 Wx
2 3 π 3 σx 3 σy 2 σx 2 σy 2
and 2D DCT can be defined as:
pffiffiffi M21 N21    
2XX ð2Y 1 1ÞUπ ð2X 1 1ÞVπ
F ðU; V Þ 5 f ð X; Y Þcos cos
M X50 Y50 2M 2M

where f(X,Y) is the image space matrix; (X, Y) is the position of the current image pixel and
FðU; V ÞðU; V 5 1; 2; . . . ::; M 2 1Þ is the transform coefficient matrix; W is the angular frequency; and σx and σy are the
standard deviations of x and y, respectively.
The concepts of machine learning (ML)-driven methods for example, neural networks and genetic algorithms have
been reported [46], while the idea of deep CNNs has also been applied [40]. Moreover, researchers are now investigat-
ing the effectiveness of multimodal biometric recognition systems [43,47].
A comparative summary of some of the most relevant works on iris feature extraction is shown in Table 1.1. It can
be seen that there are several algorithms and these are applied to different datasets, achieving varying performance
results.

1.3 Iris localization

This section discusses the iris localization step that employs circular Hough transformation, which is capable of prop-
erly detecting circles in the images. Hough transform searches for a triplet of parameters (xc ; yc ; r) determining (xi ; yi ),
where xc ; yc , and r represent the x-axis coordinate, y-axis coordinate, and the radius of the iris circle, respectively. In
this case, (xi ; yi ) represents the coordinates of any of the i points on the circle. With this consideration, the Hough trans-
form can be defined as follows.
X
n
H ðxc ; yc ; r Þ 5 hðxi ; yi ; xc ; yc ; rÞ (1.3)
i51

In this regard, edge points are detected first. For each of the edge points, a circle is drawn having the center in the
middle of the edge. In this way, each of the edge points constitutes circles with the desired radius. Next, an accumulator
matrix is formed to track the intersection points of the circles in the Hough space, where the accumulator has the num-
ber of circles. The largest number in the Hough space points to the center of the image circles. Several circular filters
with different radius values are considered and the best one is selected.
 Iris feature extraction using three-level Haar wavelet transform and modified local binary pattern Chapter | 1 5

TABLE 1.1 Summary of literature review.

References Adopted technique in reference Remarks Database

[3] Spatial filters constructed based on Extraction of features is performed only in CASIA-Iris-V1
observations the upper portion of the normalized iris
region as it provides useful texture
information. The feature vector length is
large, being of size 1 3 1536.
[4] Circular symmetric filters About 75% of the top-most of the
unwrapped iris images are used for texture
information. The variation of the texture of
the iris in the local region is not focused on
in this paper.
[5] Patch-coding technique for extracting The method has low complexity with a high CASIA-Iris-V1
features from normalized iris. The amount of accuracy. Additionally, the
features are derived by using fast Fourier dimensionality of the feature vector is
transformation. 1 3 2343. However, nonideal images are not
considered.
[6] 2D Gabor filter The dimensionality of the feature vector is
1 3 2048.
[9] 1D and 2D Log-Gabor filters This method cannot produce features of CASIA-Iris-V1
different frequencies, and the size of the iris
template is 1 3 4800.
[8] Deep learning CNN as deep learning is used to extract iris CASIA-Iris-V4
features, and the features are then used for
image encryption.
[12] Texture code cooccurrence matrix Feature vector size of 1 3 400. The method UPOL, CASIA-Iris-V3-
uses only an effective portion of the iris Interval, MMU1, and
images to avoid the occlusion part caused by IITD
not only eyelashes but also eyelids.
[11] 1D Gabor filter where Gabor features Masks the original Gabor features for CASIA-Iris-V3-Interval
are masked improving security while excluding the
effects of eyelids and eyelashes. Moreover,
only the upper half of the normalized iris
portion is considered.
[7] 2D kernel and hybrid MLPNNPSO Feature extraction is performed on a small CASIA-Iris-V3
algorithm sample of 140 images at an accuracy rate of
95.36%. In this case, 1000 iterations are
performed, which leads to high
computational time.
[14] 2D wavelet cepstrum technique for False acceptance rate is 10.45%; recognition CASIA-Iris-V3,
feature extraction accuracy is 89.93%. UBIRISv1, IITD
[15] Tunable filter bank based on halfband False acceptance rate is 8.45%; recognition CASIA-Iris-V3,
polynomial of 14th order accuracy is 91.65%. UBIRISv1, IITD
[13] Key pointsbased feature extraction Considers only salient key points in the CASIA-Iris-V4-Interval,
method whole region. The feature extraction stage is MMU 2, UBIRIS 1
time consuming.
[23] Low-density parity check and SHA-512 Comparatively high false rejection rate.
[22] Density-based spatial clustering and key- For feature extraction and feature vector BATH and CASIA-Iris-
point reduction to be applied on PILP reduction, postprocessing is required, V3
leading to additional time consumption.
[18] Subiris technique Does not extract features of the unoccluded CASIA-Iris-V4
upper part of the iris region.

(Continued )
6 Applications of Computational Intelligence in Multi-Disciplinary Research

TABLE 1.1 (Continued)

References Adopted technique in reference Remarks Database

[17] DWT and DCT combination for feature Provides good performance only for low- Phoenix and IITD iris
extraction contrast images. A recognition rate of 88.5% database
was achieved on the Phoenix database.
[16] Discrete dyadic wavelet transform Iris images of only 10 people are used and a
feature vector with a size of 1 3 256 is
achieved. Results need to be validated with a
higher number of subjects.
[26] Local feature based on phase-intensive Feature extraction is based on key point BATH, CASIA-Iris-V3,
patterns detection via phase-intensive patterns. UBIRISv2, and
Obtains a feature vector of size 1 3 128. FERETv4
[21] DCT and RM Based on the dissimilarity score of DCT and CASIA-Iris-V4 Interval,
RM and using the Hamming distance metric, Lamp, and self-
the matching of images is performed. This is collected IITK
used to compensate for images rejected by
either DCT or RM but accepted by the other.
[24] LPCC and LDA The method has high complexity, and in the CASIA-Iris-V1
case of LPCC, results in a feature vector with
a size of 1 3 546.
[19] Textural information development and This method has three stages: quality MBGC-V2, CASIA-Iris-
exploration evaluation, automatic segmentation, and V3, CASIA-Iris-V4,
fusion at the segmentation level. This and UBIRIS v1 (for iris
method rejects images that have low quality. image)
The obtained feature vector is of size
1 3 2048.
[36] Gabor filter, a DoG filter, BSIF, and LBP The feature extraction is done using the Hong Kong
fusion of GRF with a Gabor filter, a DoG Polytechnic University
filter, a BSIF, and LBP. Hamming distance is Cross-Spectral Iris
used for matching purposes. Images Database
[37] Convolutional neural network Feature extraction is done using the concept JLU iris library
of feature fusion, which is achieved by using
a Gaussian filter and a texture histogram
equalizer.

1.4 Iris normalization

This section describes the iris normalization step. The size of different acquired iris images will vary because of the var-
iation in the distance from the camera, angle of image capturing, illumination level, etc. For the purpose of extracting
image features, the iris image is to be segmented and the resultant segments must not be sensitive to the orientation,
size, and position of the patterns. For this, after segmentation, the resultant element is transformed to Cartesian. In other
words, the circular iris image is transformed into a fixed dimension.
Fig. 1.2 illustrates the normalization of iris images from three datasets. For each of the datasets, the one original
input image is shown, followed by its inner and outer boundary detection, and then its segmented version, and finally
its normalized version. Fig. 1.2A describes Daugman’s rubber sheet model for iris recognition. Three original images
from three datasets are shown in Fig. 1.2B, F, and J. First of all, Fig. 1.2B is one original image from the CASIA-Iris-
V4 dataset [33]. For the iris image in Fig. 1.2BE represent the corresponding inner and outer boundaries, the
segmented version, and the normalized version, respectively. Secondly, Fig. 1.2F is one original image from the
CASIA-Iris-V1 dataset [34]. For the iris image in Fig. 1.2FI represent the corresponding inner and outer boundaries,
the segmented version, and the normalized version, respectively. Thirdly, Fig. 1.2J is one original image from the
MMU iris database [35], and Fig. 1.2KM represent the corresponding inner and outer boundaries, the segmented ver-
sion, and the normalized version, respectively.
 Iris feature extraction using three-level Haar wavelet transform and modified local binary pattern Chapter | 1 7

FIGURE 1.2 Illustrations of (A) Daugman’s rubber sheet model; (B, F, J) original input images; (C, G, K) images with inner and outer boundary
detection; (D, H, L) segmented iris regions, and (E, I, M) iris images after normalization.

1.5 The proposed feature extraction scheme

This section describes the proposed iris feature extraction method. Fig. 1.3 represents the block diagram of the proposed
three-level HWT and MLBP. The decomposition of the image three times by HWT results in the reduction in feature
size without significant loss in the image quality or important attributes. The use of MLBP further reduces the feature
vector size without loss in image attributes. Fig. 1.4 shows the three-level HWT. It can be seen from the figure that at
each level of HWT, the input image is divided into four output images. These output images are denoted as horizontal
detail (HL), vertical detail (VL), diagonal detail (HH), and approximation (LL) images. The LL subimage, also known
as the LL subband, contains significant information about the original image. In other words, the LL subband is a
coarse approximation of an image and it does not contain high-frequency information. Next, the three-level HWT algo-
rithm is discussed.
Algorithm 1: HWT
Input: Normalized iris image
8 Applications of Computational Intelligence in Multi-Disciplinary Research

FIGURE 1.3 Block diagram of the proposed approach for iris feature extraction.

FIGURE 1.4 Three-level HWT.

Output: Approximation part of level three

Main Process:
Step 1: Apply first-level HWT to the normalized iris image to generate its wavelet coefficients.
Step 2: Apply second-level HWT on the approximation part obtained from Step 1 to generate its wavelet
coefficients.
Step 3: Apply third-level HWT on the approximation part obtained from Step 2 to generate its wavelet coefficients.
Step 4: Get the level three approximation part obtained from Step 3.
The main idea of using HWT is that wavelet decomposition can transform a detailed image into approximation
images. The approximation parts contain a major portion of the energy of the images. The HWT is repeatedly executed
to shrink the information size. The results of the three-level decomposition produce a reduced characteristics region
having little loss. This is shown in Fig. 1.5. It can be noted that most of the information of the iris image is contained
in the extracted LL (low-frequency) region on the multidivided iris image as indicated by Fig. 1.5. The other regions
have less information as indicated by their low intensity (dark) levels. Fig. 1.6 illustrates the size of each level for the
three-level HWT. The application of level 1 HWT to the normalized image of size 64 3 512 results in wavelet
 Iris feature extraction using three-level Haar wavelet transform and modified local binary pattern Chapter | 1 9

FIGURE 1.5 Three-level wavelet

decomposition of normalized iris.

FIGURE 1.6 Three-level HWT

with the size of each level.

coefficients of LL1, LH1, HL1, and HH1. In this case, the approximation part of level 1, denoted as LL1, becomes of
size 32 3 256. Next, level 2 HWT is applied to LL1, which generates wavelet coefficients of LL2, LH2, HL2, and HH2.
In this case, the approximation part of level 2 (LL2) becomes of size 16 3 128. After that, level 3 HWT is applied to
LL2 to generate its wavelet coefficients LL3, LH3, HL3, and HH3. In this case, the approximation part of level 3 (LL3)
becomes of size 8 3 64. Hence a major distinctive region LL3 is obtained by performing the wavelet transformation
three times. Next, the LL3 region is used for the MLBP tasks.
Now consider the MLBP operation [25], which generates robust binary features. Furthermore, MLBP has low
computational complexity. MLBP labels each pixel based on the neighboring pixels and considering a given threshold.
MLBP then produces outputs in the binary format. This binary code can describe the local texture pattern. Note that
MLBP is an LBP followed by an XOR operation. Next, MLBP operation is described in the following.
For a center pixel c, and neighboring pixels p within a neighborhood of P pixels, the MLBP operation can be
expressed as follows.
X
P21

LBPp 5 S gp 2 g c 3 2p (1.4)
p50

where LBPp is the MLBP operator, gc is the gray level of c, and gp is the gray level of p pixels. Moreover, SðxÞ in (4)
refers to the sign function defined as,
1 ifx $ 0
Sð x Þ 5 (1.5)
0 otherwise
10 Applications of Computational Intelligence in Multi-Disciplinary Research

FIGURE 1.7 Center element of a 3 3 3 pixel

image.

FIGURE 1.8 MLBP operation of

a 3 3 3 subregion: (A) the neigh-
borhood of a pixel within the
image, (B) the threshold version of
the neighborhood, and (C) the
MLBP pattern where the middle
pixel has been computed.

Next, the center pixel value is generated by applying XOR operation on the values of LBPp . This results in the fol-
lowing expression.
ψ" ðsp Þ 5 so ". . ."sP-1 (1.6)


where " denotes the XOR operator and ψ" sp is the binary iris code obtained as the XOR output. Since it is a com-
mutative operation of XOR, this can be performed by circularly shifting on sp in the clockwise or anticlockwise direc-
tion. Now XOR is performed to reduce the size from 8 3 64 to 1 3 64. XOR is computed in the column vector. In other
words, the eight-row iris signature is reduced to only a single row. Figs. 1.7 and 1.8 describe the MLBP operation.
Fig. 1.7 shows the center pixel in a 3 3 3 neighborhood, while Fig. 1.8 illustrates the computation of LBP8;1 with XOR
for a single pixel.
Algorithm 2: Feature encoding using the proposed MLBP
Input: Level three approximation part of the normalized image
Output: Binary sequence of the normalized iris image.
Main Process:
Step 1: Read the intensity values of the level three approximation part of the normalized image.
Step 2: Convert the RGB image to grayscale form.
Step 3: Resize the image if required and then store the size ½M; N of the image.
Step 4: Divide the image into eight segments.
Step 5: For each of the image segments, apply a 3 3 3 kernel.
Step 6: For i 5 1: P // P 5 8 for a 3 3 3 kernel.
Step 7: Compute DðiÞ 5 gp ðiÞ 2 gc ðiÞ // gp is the gray level for neighboring pixels and gc is the center pixel.
Step 8: If DðiÞ , 0
setUSðiÞ 5 0
else
SðiÞ 5 1
end.
Step 9: Compute LBP_p 5 XOR(SðiÞ); // Apply XOR operation to get the binary mask.
Step 10: Place the binary output of the XOR operation in the center pixel.
Step 11: Move the kernel in order to obtain a binary template.
Step 12: Apply XOR operation across the columns.
So, for the case of MLBP, the first LBP operation extracts the distinctive features to generate a unique iris code.
This code is reduced from 8 3 64 features to 1 3 64 by applying the XOR operation.
Another random document with
no related content on Scribd:
VERTICAL

Likeness
1 producers Total46
Rudimentary
2 Bow47
Postponement
3 Belonging
48 to him
Educate
4 Anger
49
There5 Contraction
50 of “it is”
Yields6 Conjurors
54
Afraid7 Corrode
55
Tendency
8 to revert to Bombastic
56
type Charm
57
One who
9 issues Salutes
59
permits Guided
60
Again10 Homage
61
Therefore
11 Wilful
63damage to ship
Ills 12 by mariners
Returning
13 (rare.) Separation
64 of parts
Wooden
14 pegs previously joined
Beginner
15 Characteristic
66
Accomplish
18 Refuge
67
Exclamation
19 Resting
68 place
Separater
22 Pen 69
Matured
23 Made71like ivory
Shade29 tree Exercised
72
Turf 30 Atlantic
77 right whale
Utensil
36 Brown
79 pigment
Err 38 Tastes
81
Couch40 Deliver
83
Parts41of shoes This86way
Medicinal
43 plant Toward
87
Grieve
44 3rd person
90 plural
Distant
45 Nor 92
[97]

[Contents]
Puzzle No. 37
 DECORATION
By Anna J. Munro

A good deal of black, but very ornamental. The

center, with its outreaching arms, is well built.
1 2 3 4 5 6 7 8 9 10 11
12 13 14 15 16 17
18 19 20 21 22
23 24 25 26
27 28 29 30 31 32 33
34 35 36 37 38 39
40 41 42 43
44 45 46
47 48
49 50 51 52 53
54 55 56 57 58 59 60 61
62 63 64 65
66 67 68 69 70 71
72 73 74
75 76 77 78
79 80 81 82 83 84
85 86

[96]

HORIZONTAL
 River 1boundary, Forwards
48 by post
ancient Italy Numeral
50
Ladies 6 small umbrella Recent
52
To weaken
12 Bits 54
of materials
A sailor
13 Statesman
57
An alcoholic
15 drink City 60
in Italy
Cotton16 fabric Interior
62
Part 18
of verb “to be” Alarm64
To demand
20 the return Malicious
65 crime
of Near66
Act 22 By way
67 of
Disorder
23 Before
69
Portions
25 of medicine Not bright
70
Part 27
of verb “to be” Parent
71
Equip 29with weapons Cuttlefish
72
A quick
30 blow Fathers
74
Eggs32of fish Behold
75
Indefinite
33 article Move 77
Separately
34 Exist78
Last36 Organ79 of head
A feature
38 A foundation
81
Corn40 weed Devoured
82
Pertaining
41 to a poet of Strike
84
Greece Retreated
85
Faction
43 Do without;
86 refrain
Girl’s44woolen hat from
A fish45
An artist
47 of colors

VERTICAL

To butt
1 Loathes
41
Above2
 Pronoun3 A member
42 of solar
Billiard
4 shot system
Raw metals
5 Powerful
44 explosive
Dry 7 A bird
46of crow family
Hearsay8 Easily
49crumbled
Part of9 verb “to be” Gazers
51
Either10 Oriental
53 tower
Guided11 Insect
55
Glut 12 Separate
56
Purer 14 Playing
58 card
Terse 17 Rage 59
Part 19 Equipped
60
Noblemen
21 Vortex
61
Skill 24 Tear63
Drunkard
26 Tune65
Mineral
28 spring Directed
68
Edge30 Systematic
70 rules for
State31of equality eating
Help33 Military
73 assistant
Accuse35 To pierce
74
Abets 36 Used76in small boats
Liberty
37 A box78or place
Purposeless
39 In regard
80 to
Part 81
of verb “to be”
Latin83for “and”
Exclamation
84

[99]
[Contents]
Puzzle No. 38
 BLACK BEETLE
By Fred L. Kleinschmidt

This constructor blocked out a pretty fair beetle form.

The center is a little loose.
1 2 3 4 5 6 7 8 9 10 11 12
13 14 15
16 17 18 19 20
21 22 23 24
25 26 27 28 29 30
31 32 33 34 35
36 37 38 39 40
41 42 43 44 45 46
47 48 49
50 51 52 53
54 55 56 57 58 59 60 61
62 63 64 65 66 67 68
69 70 71 72 73 74
75 76 77
78 79 80 81
82 83 84 85 86 87
88 89 90

[98]

HORIZONTAL
 Intellectual
1 dullness A soft
49white metal
A resting
6 place To take
50 out
The hair
8 of the Angora Aid 52
goat Regarding
55
Bracing
13 Madness
57
Hairy15appendages Conjunction
60
Come 16together Near62
Pertaining
18 to Mars Primp64
A female
19 bird Exposes
66
Drinking
21 vessel Towards
68
Threads
23 that guide Consumed
69
through a maze To dignify
71
A vase
25 with feet Be indebted
73 to
Barren
26 Carries
75
Single
30 Scented
76
Note31of scale Sick78
To vanquish
32 Wearisome
79
Concise
33 Hebrew
81 prophet
As 34 Anxious
82
Us 36 An indestructible
85 unit
An obstinate
37 person Instruction
88
As 39 A lair89
A game
41 of chance A drink
90 of hot milk
General
45 term for curdled with liquor
followers of theory
To corrode
47
Lessened
48

VERTICAL

Problems
1 in arithmetic To freeze
43
To speak
2 Utilize
44
River 3in Italy Historic
45 mountain
 Forward
4 To rest
46
Edge 5 Diseased
51 person
One who
7 consumes Chest53
Male 8 A parent
54
Preposition
9 A golf
56term
A personal
10 pronoun An hotel
57
Pale11 To recede
58
Flees12 Metalliferous
59 earth
The 14
air To act
61
A tree
15 An Oriental
63 weight
Handbag
17 To go65into
Female
20 sheep A book
67 for pictures
To deduce
22 To inform
68
A pale
24 yellowish clay Stories
70
A male
26 child To think
72
Period
27 of time Useless
74 plants
Possessive
28 pronoun A bank-note
75
To make
29 a mistake Shade77
Personal
31 pronoun A number
79
Over35and above To soak
80 in
A common
36 liquid So 83
Jeer38 To depart
84
Fur-bearing
40 animal Negative
86
Hobby41 To wit
87
A lyric
42poem

[101]

[Contents]
Puzzle No. 39
 FACILE EST DECENSUS AVERNI
By Cerberus

Cerberus was a three-faced dog, and that is what

you may think of the progenitors of this bark after
you’ve tried it. Averni (which does not mean Arverne)
is the unkeyed centre-piece.
1 2 3 4 5 6 7 8 9 10 11 12 13 14
15 16 17 18
19 20 21 22 23 24 25
26 27 28 29 30
31 32 33 34
35 36 37 38 39 40 41 42 43
44 45 46 47 48 49 50
51 52 53 54 55
56 57 58 59 60 61 62 63
64 65 66 67 68
69 70 71
72 73 74 75 76 77 78 79 80
81 82 83 84 85 86 87
88 89 90 91 92
93 94 95 96 97 98 99 100
101 102 103 104 105 106
107 108 109 110 111
112 113 114 115 116
117 118 119 120 121 122
123 124 125
[100]

HORIZONTAL

Extremities
1 Companion
69
Unchangeable
4 Organs
70 of hearing
A metal
12 Legendary
71 Queen of
Concerning
15 Carthage
Digits
16 Toward
72
Variety
17 of wood To eulogize
74
Therefore
18 Myself
77
Shores
19 Orange-brown
78
Thus21 Disordered
80 type
Catkins
23 Mammal
81 milk bag
Fruit26
of common tree Toss83gently
And 27
so forth Rational
85 animal
Obliterate
30 Mournful
86 sound
Things
31 of secondary Collected
88 mass of
importance eggs (pl.)
Sportmen’s
33 lodges Kind89of fish
(Scot.) Engrave
90
A blow
34 Vocal92music
Grassy
35 field Before,
93 prefix
Part 37
of “to be” Head 94covering
Ecclesiastical
39 Requirement
95
contribution box Secreted
98
Strike
40 Possessive
100 pronoun
Bleak41 Equal
101
Unoccupied
44 Golf
103
term
Container
46 for liquids Fermented
105 drink
Rip 48 Severe
107
Hindu50mendicant Fossil
108lizards
Designation
51 African
110 antelope
Annoy53 Vend112again
 Common
54 breakfast Latin
114 for “and”
food Compound
115 of nitrogen
Lacquer
55 Inside
117
Latin,
56and Earth
119
Roman57 magistrate Open
121hall
Behold
59 Elevated
122
Pert.61
to An 123
injury
Road 63(abbr.) Association
124
Eager64 Melt
125
Indian
65Cult
Black67

VERTICAL

Roman 1 garment Kind59of soil

Allowing
2 that Giant60
Tale 3 Man62 of ancient Asiatic
Belonging
4 to it race
Missive5 Form64of “to be”
Article6 of apparel (pl.) You 65
Like 7 Intransitive
66 verb
By 8 Word68of negation
Wild animal
9 (pl.) Smell73
A priest
10 Common
75 woman
Piece11out Measure
76 of weight
Prefix,
12 within Perched
78
Bone13 Measure
79 of length
A feature
14 To palpitate
80
A metallic
19 element More82profound
Again20 African
84 native race
Prophet
21 Plural
85of medium
Pert.22to the ear Egg-shaped
87 (obs.)
Lizard
24 Pitch89
 Persian
25 ruler Pronoun
91
Form28of limestone Domestic
94 birds
Stimulate
29 Judicial
96 circuit
Juice32of a tree Send97forth
Form34of male address Wild99animal
Written
35 or printed Upright
102
productions A dinner
103 course
Revise36 Boredom
104
To be 38impelled by Apart
106from
wind Utensil
107 for roasting
Old women
40 Fruit
108of a shrub
Substance
42 derived Storehouse
109 for grain
from seaweed Thick
111liquid
Meanderings
43 Sprite
113
Lifts 45 To prepare
116 leather
Anger 47 Denial
118
Self 49 Pronoun
120
Captain
50 of Arab Near
121
vessel (pl.) Plural
122pronoun
Literary
52 compiler
Shifting
55 sail
Conception
58

[103]

[Contents]
Puzzle No. 40
 99​9⁄10 PER CENT PURE
By Kross Korner Knut

They don’t come much better than this one. K.K.K. is

an expert of the first water and knows how to put
words together in a fascinating pattern.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
16 17 18 19 20
21 22 23 24 25 26 27
28 29 30 31 32 33
34 35 36 37 38 39
40 41 42 43 44 45 46 47
48 49 50 51 52 53
54 55 56 57 58
59 60 61 62 63 64 65
66 67 68 69 70 71 72
73 74
75 76 77 78 79 80 81 82 83 84 85
86 87 88 89 90 91
92 93 94 95 96 97 98
99 100 101 102 103 104
105 106 107 108 109 110 111 112
113 114 115 116 117 118 119
120 121 122 123 124 125
126 127 128 129 130 131
132 133 134 135 136
137 138 139
[102]

HORIZONTAL

Self contradiction
1 Eludes
74
Competitor
6 Table-land
75
Restrict
10 Fondle
79
Holly16 Shallow
80 vessel
Couch17 Place82
Dance18 step Medley
83
Froth20 Episode
86
Crow-like
21 bird Decade
88
Solitary
23 Bog 90
Smooth
24 Endured
91
Condition
26 Diners
92
Prayer
28 The 94
end
Hard29blows German
97
Infirm
31 Baked
100 clay
Caoutchouc
33 Humming
101
Acquires
34 Wagon
103 travel
Again36 Printing
105 measure
Underanged
38 Climate
107
Completed
39 Insect
109
Either
40 Different
110 one
Flavor
41 Exclamation
112
Cloud43 Bribes
113
Annoy45 Cabal
115
Any 47 Ancestor
117
Slant48 Proof-reading
118
Divide
49 proportionately direction
An auction
52 Wrath
120
Dormant
54 Inner
121part of bottom of
Obliterate
56 a shoe
Austere
57 Penetrates
123
 Trite59 Metallic
125 rock
Guided
60 Restrain
126
Consume
62 Remain
128
Retorts
64 Learning
129
Possessive
66 pronoun Tall,130
slim structure
Comrade
67 Opposite
132 of aloft
Precious
68 stone Before
134
Small70cake Behold
135
Weird72 Uncouth
136
Fruit73 Metallic
137 salts
Ether
138derived from
oxygenated acid
A young
139 seal

VERTICAL

Model1of excellence Ecclesiastic

65 council
Short 2bolt Baby67food
Beverage
3 Chasm
68
Lairs 4 Humans
69
Bovine5 quadruped Lace71
Regenerate
6 Close
76of day
Important
7 Roman Locate
77
dates Capers
78
Mimics8 Broad
81thoroughfare
Bathes9 Weasel-like
83 fur-
Concerning
11 bearing animals
Snout
12 Behold
84
Corpulent
13 Compound
85 of atoms
Adult,
14mature insect and electrons
Rudiment
15 Relate
87
Nursery
17 rhyme Neither
89
character Baseball
90 enthusiast