Soft Computing For Problem Solving Proceedings of Socpros 2020 Volume 2 Advances in Intelligent Systems and Computing 1393 Aruna Tiwari (Editor)

Soft Computing for Problem Solving
Proceedings of SocProS 2020 Volume 2

Advances in Intelligent Systems and
Computing 1393 Aruna Tiwari (Editor)
Visit to download the full and correct content document:
https://ebookmeta.com/product/soft-computing-for-problem-solving-proceedings-of-so
cpros-2020-volume-2-advances-in-intelligent-systems-and-computing-1393-aruna-tiw
ari-editor/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
Soft Computing for Problem Solving Proceedings of

SocProS 2020 Volume 1 Advances in Intelligent Systems
and Computing 1392 Aruna Tiwari (Editor)
https://ebookmeta.com/product/soft-computing-for-problem-solving-
proceedings-of-socpros-2020-volume-1-advances-in-intelligent-
systems-and-computing-1392-aruna-tiwari-editor/
Soft Computing and Signal Processing Proceedings of 3rd

ICSCSP 2020 Volume 2 1340 Advances in Intelligent
Systems and Computing 1340 V. Sivakumar Reddy (Editor)
https://ebookmeta.com/product/soft-computing-and-signal-
processing-proceedings-of-3rd-icscsp-2020-volume-2-1340-advances-
in-intelligent-systems-and-computing-1340-v-sivakumar-reddy-
editor/
Soft Computing for Security Applications Proceedings of

ICSCS 2021 Advances in Intelligent Systems and
Computing 1397 G. Ranganathan (Editor)
https://ebookmeta.com/product/soft-computing-for-security-
applications-proceedings-of-icscs-2021-advances-in-intelligent-
systems-and-computing-1397-g-ranganathan-editor/
Proceedings of 6th International Conference on Harmony

Search Soft Computing and Applications ICHSA 2020
Istanbul 1275 Advances in Intelligent Systems and
Computing 1275 Sinan Melih Nigdeli (Editor)
https://ebookmeta.com/product/proceedings-of-6th-international-
conference-on-harmony-search-soft-computing-and-applications-
ichsa-2020-istanbul-1275-advances-in-intelligent-systems-and-
Recent Advances in Artificial Intelligence and Data
Engineering: Select Proceedings of AIDE 2020 (Advances
in Intelligent Systems and Computing, 1386)
https://ebookmeta.com/product/recent-advances-in-artificial-
intelligence-and-data-engineering-select-proceedings-of-
aide-2020-advances-in-intelligent-systems-and-computing-1386/
Intelligent Computing Proceedings of the 2021 Computing

Conference Volume 2 Lecture Notes in Networks and
Systems 284 Kohei Arai (Editor)
https://ebookmeta.com/product/intelligent-computing-proceedings-
of-the-2021-computing-conference-volume-2-lecture-notes-in-
networks-and-systems-284-kohei-arai-editor/
International Conference on Innovative Computing and

Communications Proceedings of ICICC 2021 Volume 1
Advances in Intelligent Systems and Computing 1387
Ashish Khanna (Editor)
https://ebookmeta.com/product/international-conference-on-
innovative-computing-and-communications-proceedings-of-
icicc-2021-volume-1-advances-in-intelligent-systems-and-
computing-1387-ashish-khanna-editor/
Computational Vision and Bio Inspired Computing

Proceedings of ICCVBIC 2021 Advances in Intelligent
Systems and Computing 1420 S. Smys (Editor)
https://ebookmeta.com/product/computational-vision-and-bio-
inspired-computing-proceedings-of-iccvbic-2021-advances-in-
intelligent-systems-and-computing-1420-s-smys-editor/
Artificial Intelligence and Sustainable Computing

Proceedings of ICSISCET 2020 Algorithms for Intelligent
Systems Hari Mohan Dubey (Editor)
https://ebookmeta.com/product/artificial-intelligence-and-
sustainable-computing-proceedings-of-icsiscet-2020-algorithms-
for-intelligent-systems-hari-mohan-dubey-editor/
Advances in Intelligent Systems and Computing 1393
Aruna Tiwari · Kapil Ahuja ·

Anupam Yadav ·
Jagdish Chand Bansal · Kusum Deep ·
Atulya K. Nagar Editors
Soft Computing
for Problem
Solving
Proceedings of SocProS 2020,
Volume 2
Advances in Intelligent Systems and Computing
Volume 1393
Series Editor
Janusz Kacprzyk, Systems Research Institute, Polish Academy of Sciences,
Warsaw, Poland
Advisory Editors
Nikhil R. Pal, Indian Statistical Institute, Kolkata, India
Rafael Bello Perez, Faculty of Mathematics, Physics and Computing,
Universidad Central de Las Villas, Santa Clara, Cuba
Emilio S. Corchado, University of Salamanca, Salamanca, Spain
Hani Hagras, School of Computer Science and Electronic Engineering,
University of Essex, Colchester, UK
László T. Kóczy, Department of Automation, Széchenyi István University,
Gyor, Hungary
Vladik Kreinovich, Department of Computer Science, University of Texas
at El Paso, El Paso, TX, USA
Chin-Teng Lin, Department of Electrical Engineering, National Chiao
Tung University, Hsinchu, Taiwan
Jie Lu, Faculty of Engineering and Information Technology,
University of Technology Sydney, Sydney, NSW, Australia
Patricia Melin, Graduate Program of Computer Science, Tijuana Institute
of Technology, Tijuana, Mexico
Nadia Nedjah, Department of Electronics Engineering, University of Rio de Janeiro,
Rio de Janeiro, Brazil
Ngoc Thanh Nguyen , Faculty of Computer Science and Management,
Wrocław University of Technology, Wrocław, Poland
Jun Wang, Department of Mechanical and Automation Engineering,
The Chinese University of Hong Kong, Shatin, Hong Kong
The series “Advances in Intelligent Systems and Computing” contains publications
on theory, applications, and design methods of Intelligent Systems and Intelligent
Computing. Virtually all disciplines such as engineering, natural sciences, computer
and information science, ICT, economics, business, e-commerce, environment,
healthcare, life science are covered. The list of topics spans all the areas of modern
intelligent systems and computing such as: computational intelligence, soft comput-
ing including neural networks, fuzzy systems, evolutionary computing and the fusion
of these paradigms, social intelligence, ambient intelligence, computational neuro-
science, artificial life, virtual worlds and society, cognitive science and systems,
Perception and Vision, DNA and immune based systems, self-organizing and
adaptive systems, e-Learning and teaching, human-centered and human-centric
computing, recommender systems, intelligent control, robotics and mechatronics
including human-machine teaming, knowledge-based paradigms, learning para-
digms, machine ethics, intelligent data analysis, knowledge management, intelligent
agents, intelligent decision making and support, intelligent network security, trust
management, interactive entertainment, Web intelligence and multimedia.
The publications within “Advances in Intelligent Systems and Computing” are
primarily proceedings of important conferences, symposia and congresses. They
cover significant recent developments in the field, both of a foundational and
applicable character. An important characteristic feature of the series is the short
publication time and world-wide distribution. This permits a rapid and broad
dissemination of research results.
Indexed by DBLP, INSPEC, WTI Frankfurt eG, zbMATH, Japanese Science and
Technology Agency (JST).
All books published in the series are submitted for consideration in Web of Science.
More information about this series at http://www.springer.com/series/11156

Aruna Tiwari · Kapil Ahuja · Anupam Yadav ·
Jagdish Chand Bansal · Kusum Deep ·
Atulya K. Nagar
Editors
Soft Computing for Problem

Solving
Proceedings of SocProS 2020, Volume 2
Editors
Aruna Tiwari Kapil Ahuja
Computer Science and Engineering Computer Science and Engineering
Indian Institute of Technology Indore Indian Institute of Technology Indore
Indore, Madhya Pradesh, India Indore, Madhya Pradesh, India
Anupam Yadav Jagdish Chand Bansal

Dr. B. R. Ambedkar National Institute Department of Mathematics
of Technology South Asian University
Jalandhar, India New Delhi, India
Kusum Deep Atulya K. Nagar

Department of Mathematics School of Mathematics, Computer Science
Indian Institute of Technology Roorkee and Engineering
Roorkee, India Liverpool Hope University
Liverpool, UK
ISSN 2194-5357 ISSN 2194-5365 (electronic)

Advances in Intelligent Systems and Computing
ISBN 978-981-16-2711-8 ISBN 978-981-16-2712-5 (eBook)
https://doi.org/10.1007/978-981-16-2712-5
© The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature
Singapore Pte Ltd. 2021
This work is subject to copyright. All rights are solely and exclusively licensed 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, expressed 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.
This Springer imprint is published by the registered company Springer Nature Singapore Pte Ltd.
The registered company address is: 152 Beach Road, #21-01/04 Gateway East, Singapore 189721,
Singapore
Preface
IIT Indore and the Soft Computing Research Society (SCRS), New Delhi, co-hosted
the “10th International Conference on Soft Computing for Problem Solving (SocPros
2020)” from 18 December to 20 December 2020 in a Virtual Mode. The seeds for
this conference were laid more than a year ago at the 9th conference in this series at
the Liverpool Hope University, UK (in September 2019).
The conference opening was done by Prof. Deepak B. Phatak (BoG Chairman,
IIT Indore), Prof. Neelesh K. Jain (Director, IIT Indore), and Prof. Ajit K. Chaturvedi
(Director, IIT Roorkee and IIT Mandi). These esteemed guests appreciated the efforts
and highlighted the need of taking the technology to the common people.
This mega event, which happens to be the first international conference of
Computer Science and Engineering at IIT Indore, covered recent developments in
the interdisciplinary areas of Artificial Intelligence, Machine Learning, Optimiza-
tion, and Soft Computing. The conference received 334 papers from participants
belonging to 13 different countries, which went through a very stringent blind review
process. This was done by the international expert committee and had a very good
acceptance rate of 37%. These papers would be published as two books by Springer.
This year the conference had many innovative features. Prof. Chandra Mohan
Gold Medal for excellence in Soft Computing was instituted, which was given to
Prof. Sankar Pal of ISI Kolkatta. Twelve eminent academicians gave keynote talks.
There was a big industry participation with four keynote talks by distinguished indus-
trialists. Fourteen outstanding paper awards and 5 best paper awards (sponsored
by Springer) were given. The conference had two special sessions on “Cognitive
Science” and “Remote Sensing” as well as a panel discussion on the future of soft
computing with ten renowned panelists from academia and industry.
Indore, India Aruna Tiwari

Indore, India Kapil Ahuja
Jalandhar, India Anupam Yadav
New Delhi, India Jagdish Chand Bansal
Roorkee, India Kusum Deep
Liverpool, UK Atulya K. Nagar
v
Contents
A Deep Semi-supervised Approach for Multi-label Land-Cover

Classification Under Scarcity of Labelled Images . . . . . . . . . . . . . . . . . . . . . 1
Shounak Chakraborty, Nilesh Agarwal, and Moumita Roy
Role of Individual Samples in Modified Possibilistic c-Means
Classifier for Handling Heterogeneity Within Mustard Crop . . . . . . . . . . 13
Mragank Singhal, Ashish Payal, and Anil Kumar
Specially Structured Flow Shop Scheduling Models with Processing
Times as Trapezoidal Fuzzy Numbers to Optimize Waiting Time
of Jobs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
Bharat Goyal and Sandeep Kaur
Potential Fishing Zone Characterization in the Indian Ocean
by Machine Learning Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43
Swarnali Majumder, Sourav Maity, T. M. Balakrishnan Nair,
Rose P. Bright, M. Nagaraja Kumar, Naga Shwetha, and Nimit Kumar
A Novel Method to Optimize Interval Length for Intuitionistic
Fuzzy Time Series . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55
Manish Pant, A. K. Shukla, and Sanjay Kumar
Low-Altitude Unmanned Aerial Vehicle for Real-Time Greenhouse
Plant Disease Monitoring Using Convolutional Neural Network . . . . . . . . 63
C. S. Arvind, K. Prajwal, Amrut C. Patil, A. Ashwin Kumar,
A. Sreedevi, and R. Jyothi
Design and Development of an IoT-Based Smart Medication Device . . . . 77
D. Ramesh Reddy, K. Bikash, K. P. Vivek, U. Z. Sadek, and P. Kodali
Effects of SARS-COV-2 on Blood . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89
Indu Malik, Nipun R. Navadia, Aatif Jamshed, Lalita Verma,
Taranjeet Singh, and Harshit Bhardwaj
vii
viii Contents
Covid-19: Machine Learning Algorithms to Predict Mortality

Rate for Advance Testing and Treatment . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
Nipun R. Navadia, Gurleen Kaur, Indu Malik, Lalita Verma,
Taranjeet Singh, and Harshit Bhardwaj
Personality Prediction Using EEG Signals and Machine Learning
Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109
Harshit Bhardwaj, Pradeep Tomar, Aditi Sakalle, Divya Acharya,
and Arpit Bhardwaj
A Comparative Study of Various Apriori and FP-Growth
Tree-Based Incremental Mining Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115
Shelly Gupta and Lopamudra Mohanty
Emotion Analysis on Hindi Audio . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127
Aniket Anand, Harsh Choudhary, and R. Jayashree
Temporal Analysis of Human Serum Albumin with Recurrent
Neural Networks for Changepoint Detection and Prediction . . . . . . . . . . . 141
R. D. Harshitha, Jayanth Jeevanandam, Natarajan Sudha,
and N. T. Saraswathi
Modeling of Discrete Jaya Optimized Frequency Controller
for Renewable-Based Interconnected Power System . . . . . . . . . . . . . . . . . . 153
Subhranshu Sekhar Pati and Saroj Kumar Mishra
Grey Wolf Optimizer for Data Envelopment Analysis . . . . . . . . . . . . . . . . . 163
Awadh Pratap Singh and Ashish Kumar Dixit
A Model Based on Fuzzy C-Means with Density Peak Clustering
for Seismicity Analysis of Earthquake Prone Regions . . . . . . . . . . . . . . . . . 173
Ashish Sharma, Satyasai Jagannath Nanda, and Rahul Kumar Vijay
Memetic Flower Pollination Algorithm-Based Radiation Pattern
in Time-Modulated Linear Antenna Arrays . . . . . . . . . . . . . . . . . . . . . . . . . . 187
Gopi Ram, D. Suneel Varma, and G. Arun Kumar
Multi-objective Adaptive Antenna Synthesis Using Teaching
Learning Based Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 197
D. Suneel Varma, Gopi Ram, G. Arun Kumar, and Pranthik Dutta
A Secure Data Transfer in Cloud Environment Using Double-Layer
Security for Internet of Medical Things . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 211
C. Vanmathi, R. Mangayarkarasi, V. Hari Haran, and S. Karthikeyan
Reversible Data Hiding Technique Using Multi-layer Perceptron
Based Prediction and Adaptive Histogram Bin Shifting . . . . . . . . . . . . . . . 231
Sabhapathy Myakal, Rajarshi Pal, and Nekuri Naveen
Contents ix
Epileptic Seizure Detection Using LSTM: A Deep Learning

Technique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 245
Divya Acharya, Richa Bhatia, Anushna Gowreddygari, Varsha Shaju,
S. Aparna, and Arpit Bhardwaj
A Manta Ray Foraging Algorithm Solution for Practical Reactive
Power Optimization Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 259
Hong-Jiang Wang, Thi-Kien Dao, Van-Dinh Vu, Truong-Giang Ngo,
Thi-Xuan-Huong Nguyen, and Trong The Nguyen
Indexing on Healthcare Big Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 271
Aneri Mehta, Vahishta Vandriwala, Jigna Patel, and Jitali Patel
A Stochastic Approach for Automatic Collection of Precise
Training Data for a Soft Machine Learning Algorithm Using
Remote Sensing Images . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
Parth Naik and Anil Kumar
Optimized Convolutional Neural Network-Based Classification
of Arrhythmia Disease Using ECG Signals . . . . . . . . . . . . . . . . . . . . . . . . . . . 299
Pooja Sharma, Shail Kumar Dinkar, and Kusum Deep
β-Hill Climbing Grey Wolf Optimizer . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 311
Saniya Bahuguna and Ashok Pal
A Power System Economic Load Dispatch Using Jellyfish Search
Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 321
Shi-Jie Jiang, Trong-The Nguyen, Thi-Kien Dao, Van-Dinh Vu,
and Truong-Giang Ngo
ANN Based Security Analysis of Block Ciphers with Focus
on Non-linear Component . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 333
Nehal Varshney, Geetansh Saxena, and Girish Mishra
Employing LRCN Model for Application Classification in SDN . . . . . . . . 347
Adarsh Rai, Abdul Aleem, and Manoj Madhava Gore
Advanced Rainfall Prediction Model for India Using Various
Regression Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 361
Parin Jigishu Shah, Devansh Hiren Timbadia, Sughosh Sudhanvan,
and Supriya Agrawal
An Optimal Dispatch of Microgrid Based on Improved Particle
Swarm Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 375
Chun-Yuan Ning, Jun-Jie Shang, Duc-Tinh Pham, Trong-The Nguyen,
and Thi-Xuan-Huong Nguyen
ACO-Based Optimal Route Scheduling for EV Fleet Operation . . . . . . . . 387
Polly Thomas and Prabhakar Karthikeyan Shanmugam
x Contents
An Analysis of Machine Learning Algorithm for the Classification

of Emotion Recognition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 399
Aditi Sakalle, Pradeep Tomar, Harshit Bhardwaj, Divya Acharya,
and Arpit Bhardwaj
Adaptive Neuro-Fuzzy Inference System-Based Information
Fusion Model for Smart Monitoring of Public Amenities . . . . . . . . . . . . . . 409
Rajasi Gore, Shashwati Banerjea, and Neeraj Tyagi
Deep Neural Networks to Predict Sub-surface Ocean Temperatures
from Satellite-Derived Surface Ocean Parameters . . . . . . . . . . . . . . . . . . . . 423
Kalpesh R. Patil and Masaaki Iiyama
Density Estimation of Heterogeneous Crowd in Mass Religious
Gatherings Using Image Processing and Denoising Filter . . . . . . . . . . . . . . 435
Nipun Choubey, Abhishek Kumar Prajapati, Ashish Verma,
and Anirban Chakraborty
Workload Prediction for Cloud Resource Provisioning using Time
Series Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 447
Mahendra Pratap Yadav and Dharmendra Kumar Yadav
A Trust-Based Framework to Reduce Message Dissemination
Latency Using CFC Model for Internet of Vehicle . . . . . . . . . . . . . . . . . . . . 461
Deepak Kumar Mishra and Kapil Sharma
Generative Adversarial Network for Cloud Removal from Optical
Temporal Satellite Imagery . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 481
Chintan Maniyar and Anil Kumar
Streamed Covid-19 Data Analysis Using LSTM—A Deep Learning
Technique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 493
Sanjay Patidar, Rajni Jindal, and Neetesh Kumar
Canonical Correlation Analysis with Bhattacharya Similarity
Distance for Multiview Data Representation . . . . . . . . . . . . . . . . . . . . . . . . . 505
Surendra Gupta, Urjita Thakar, and Sanjiv Tokekar
An Optimization Nodes Layout in Deployment WSN Based
on Improved Artificial Bee Colony . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 517
Trong-The Nguyen, Thi-Kien Dao, Thi-Thanh-Tan Nguyen,
Truong-Giang Ngo, and Duc-Tinh Pham
A Home Energy Management System with Peak Demand
Reduction Using Ant Colony Optimization and Time of Use
Pricing Scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 531
Senthil Prabu Ramalingam and Prabhakar Karthikeyan Shanmugam
Contents xi
An Apache Giraph Implementation of Distributed ADMM

for Solving LASSO Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 547
Rohit Agrawal, Aditya A. Shastri, Kapil Ahuja, Antoine Perreard,
and Juniper Gujral
Integrated Optimization Model for Sustainable Supplier Selection
and Order Allocation in Food Supply Chain . . . . . . . . . . . . . . . . . . . . . . . . . 557
Rashi Sharma and Jyoti Dhingra Darbari
Performance-Based Supplier Selection and Order Allocation
Model Incorporating Sustainable Development Strategies . . . . . . . . . . . . . 573
Aditi and Sugandha Aggarwal
A Multi Objective Reverse Logistics Network Design Model Under
Carbon Pricing: An Emerging Economy Perspective . . . . . . . . . . . . . . . . . . 589
Rahul Solanki and Jyoti Dhingra Darbari
Centralised Resource Allocation Model for Improving
the Environmental Sustainability of Retailers with Imprecise Data
Envelopment Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 603
Nomita Pachar and Anshu Gupta
Evaluation of Adoption of Blockchain Technology for Supply
Chain Management: A Case of Indian MSME . . . . . . . . . . . . . . . . . . . . . . . . 621
Rubina Mittal, Pankaj Pankaj, Sugandha Aggarwal, and Arshia Kaul
Analysis of Critical Success Factors for Adopting Omni-Channel
Retailing in India . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 635
Akansha Jain and Arshia Kaul
Fuzzy MCDM Model for Analysis of Critical Success Factors
for Sustainable Collaboration with Third Party Reverse Logistics
Providers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 651
Shiwani Sharma and Jyoti Dhingra Darbari
An integrated Fuzzy MCDM Approach for Evaluation of Barriers
in Implementing LARS Paradigms in Supply Chain . . . . . . . . . . . . . . . . . . 663
Dixita Barua, Akansha Jain, and Veena Jain
Quality Improvement Using Fuzzy MCDM for Flexographic
Printing Industry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677
Rubina Mittal, Huda Shameem, and Pallavi Sharma
Using Attractive–Repulsive Binary Local Gradient Contours
for Sample-Consensus Background Modeling . . . . . . . . . . . . . . . . . . . . . . . . 687
Rimjhim Padam Singh and Poonam Sharma
Lexical, Pragmatic and Linguistic Feature Based Two-Level
Sarcasm Detection Using Machine Learning Techniques . . . . . . . . . . . . . . 699
Paluck Deep, Archita Mittal, Easha Pandey, and Sakshi Agarwal
xii Contents
Real-Time Statistics and Visualization of the Impact of COVID-19

in India with Future Prediction Using Deep Learning . . . . . . . . . . . . . . . . . 717
S. Raj Kiran and Priyanka Kumar
A Brief Survey on Concept Drifted Data Stream Regression . . . . . . . . . . . 733
Ajay Choudhary, Preeti Jha, Aruna Tiwari, and Neha Bharill
Differential Evolution Algorithm for Multimodal Optimization:
A Short Survey . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 745
Shatendra Singh, Aruna Tiwari, and Suchitra Agrawal
Implementation of Brain Tumor Segmentation Using CNN Deep
Learning Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 757
Tarang Kumar Barsiya, Lakshita Bhargava, Suchitra Agrawal,
Aruna Tiwari, and Amit Saxena
Improved Self-adaptive Differential Evolution Based Throughput
Maximization of Energy Harvesting Cognitive Radio Network . . . . . . . . . 767
Sanjoy Debnath, Wasim Arif, Srimanta Baishya, and Debarati Sen
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 779

About the Editors
Dr. Aruna Tiwari is Associate Professor in Computer Science & Engineering at

IIT Indore, India. Her all degrees B.Tech., M.Tech., Ph.D. are in Computer Science
& Engineering from SGSITS Indore. She has more than 20 years of research experi-
ence in the areas such as artificial intelligence, machine learning, and soft-computing.
Her work is around artificial neural networks, fuzzy clustering, evolutionary compu-
tation and their applications to bioinformatics, and medical diagnosis. Her research
directions are toward the design of intelligent computing algorithms for classifica-
tion, clustering, and feature selection which can handle big data. She has more than
30 journal publications of international repute including more than 5 IEEE transac-
tions and Elsevier journals of high impact factor and has published more than fifty
research articles in the ranked conferences. She has established a big data handling
lab in IIT Indore which is funded by Council of Science & Industrial Research (CSIR)
Government of India in 2017. She has enabled two MOUs, collaborating with Indian
Institute of Soybean Research, Indore, and CSIR-Central Electronics Engineering
Research Institute, Pilani. She has recently initiated a consortium project on Arti-
ficial Intelligence which is approved from Ministry of Electronics & Information
Technology (MeitY) Government of India. There are seven PhDs and more than 25
masters awarded under her guidance.
Dr. Kapil Ahuja holds master’s and Ph.D. degrees in Mathematics and Computer
Science (from Virginia Tech, USA) and has a strong interdisciplinary focus. After
graduating earlier this decade from VT, he received his postdoctoral training from
the Max Planck Institute in Magdeburg (Germany). Since then, he has established his
independent research program in Mathematics of Data Science and Computational
Science at IIT Indore, where he is currently working as Associate Professor. Dr. Ahuja
is solving challenging problems that are at both the ends of the research spectrum,
i.e., theoretical as well as applicable. His core research interests are in artificial
intelligence, machine learning, numerical methods, and optimization. He believes
that it is necessary to collaborate globally to solve challenging research problems.
Hence, he has multiple active international research collaborations (USA, Germany,
India, France, and UK). In the recent past, he has also held visiting professor positions
at TU Braunschweig (Germany), TU Dresden (Germany), and Sandia National Labs
xiii
xiv About the Editors
(USA). Dr. Ahuja’s overall research output includes thirty publications (including
eighteen in reputed journals) as well as external funding worth more than half-a-
million USD from twelve projects. While achieving this, he has graduated two Ph.D.
students with three more to graduate soon. Since teaching and service are essential
for a fruitful and satisfying research career, he is very committed to these aspects
as well. Dr. Ahuja has received the Best Teacher Award four times at IIT Indore. In
the past, he has held many administrative positions. Since the past three years, he is
heading International Affairs at IIT Indore as Founding Dean for the same.
Dr. Anupam Yadav is Assistant Professor in the Department of Mathematics at

Dr. BR Ambedkar National Institute of Technology Jalandhar, India. His research
area includes numerical optimization, soft computing, and artificial intelligence, he
has more than ten years of research experience in the areas of soft computing and
optimization. Dr. Yadav has done Ph.D. in soft computing from Indian Institute of
Technology Roorkee, and he worked as Research Professor at Korea University. He
has published more than twenty-five research articles in journals of international
repute and has published more than fifteen research articles in conference proceed-
ings. Dr. Yadav has authored a text book entitled “An introduction to neural network
methods for differential equations”. He has edited three books which are published
by AISC, Springer Series. Dr. Yadav was General Chair, Convener, and Member of
steering committee of several international conferences. He is Associate Editor in
the journal of the experimental and theoretical artificial intelligence. Dr. Yadav is
Member of various research societies.
Dr. Jagdish Chand Bansal is Associate Professor at South Asian University, New
Delhi, and Visiting Faculty at Maths and Computer Science, Liverpool Hope Univer-
sity, UK. Dr. Bansal has obtained his Ph.D. in Mathematics from IIT Roorkee. Before
joining SAU, New Delhi, he has worked as Assistant Professor at ABV Indian Insti-
tute of Information Technology and Management Gwalior and BITS Pilani. His
primary area of interest is swarm intelligence and nature-inspired optimization tech-
niques. Recently, he proposed a fission–fusion social structure-based optimization
algorithm, spider monkey optimization (SMO), which is being applied to various
problems from engineering domain. He has published more than 60 research papers in
various international journals/conferences. He is Series Editor of the book series such
as Algorithms for Intelligent Systems (AIS) and Studies in Autonomic, Data-driven
and Industrial Computing (SADIC) published by Springer. He is Editor-in-Chief of
International Journal of Swarm Intelligence (IJSI) published by Inderscience. He is
also Associate Editor of IEEE ACESSS published by IEEE and ARRAY published
by Elsevier. He is Steering Committee Member and General Chair of the annual
conference series SocProS. He is General Secretary of Soft Computing Research
Society (SCRS). He has also received Gold Medal at UG and PG level.
Prof. Kusum Deep is Full Professor in the Department of Mathematics, Indian

Institute of Technology Roorkee, India, and Visiting Professor, Liverpool Hope
University, UK, and University of Technology Sydney, Australia. She has completed
About the Editors xv
her B.Sc. (Hons) and M.Sc. (Hons) from Centre for Advanced Studies, Panjab Univer-
sity, Chandigarh. She is an M.Phil. Gold Medalist. She earned her Ph.D. from UoR
(now IIT Roorkee) in 1988. She has been a national scholarship holder and a postdoc-
toral from Loughborough University, UK assisted by International Bursary funded
by Commission of European Communities, Brussels. She has won numerous awards
like Khosla Research Award, UGC Career Award Starred Performer of IITR Faculty,
many best paper awards by Railway Bulletin of Indian Railways, special facilita-
tion in memory of late Professor M. C. Puri, and AIAP Excellence Award. She has
authored two books, supervised 20 Ph.Ds, and published 125 research papers. She
is Senior Member of IEEE, ORSI, CSI, IMS, and ISIM. She is Executive Editor of
International Journal of Swarm Intelligence, Inderscience. She is Associate Editor of
Swarm and Evolutionary Algorithms, Elsevier. She is on the editorial board of many
journals. She is Founder President of Soft Computing Research Society, India. She
is General Chair of series of International Conference on Soft Computing for Prob-
lems Solving (SocProS). Her research interests are evolutionary algorithms, swarm
Iitelligence, and nature-inspired optimization techniques and their applications.
Prof. Atulya K. Nagar holds Foundation Chair as Professor of Mathematical

Sciences and is Pro-Vice-Chancellor for Research at Liverpool Hope University,
United Kingdom. He has been Dean of the Faculty of Science and Head of the
School of Mathematics, Computer Science and Engineering which he established at
the University. He received a prestigious Commonwealth Fellowship for pursuing
his doctorate (D.Phil.) in Applied Nonlinear Mathematics, which he earned from
the University of York (UK) in 1996. He holds B.Sc. (Hons), M.Sc. (Mathematics),
and M.Phil. (with distinction) in Mathematical Physics from the MDS University of
Ajmer, India. Prior to joining Liverpool Hope, he was at the Department of Mathemat-
ical Sciences and later at the Department of Systems Engineering, at Brunel Univer-
sity, London. He is internationally respected Scholar working at the cutting edge
of theoretical computer science, applied mathematical analysis, and systems engi-
neering with his research expertise spanning both applied mathematics and compu-
tational methods for nonlinear, complex, and intractable problems arising in science,
engineering, and industry. He has edited volumes on Intelligent System, and Applied
Mathematics. He is Editor-in-Chief of the International Journal of Artificial Intelli-
gence and Soft Computing (IJAISC) and serves on editorial boards for a number of
prestigious journals. He is well published with over 450 publications in prestigious
publishing outlets. Professor Nagar sits on a number of strategic UK wide research
bodies including the JISC Research Strategy group, and he is Fellow of the Institute
of Mathematics and its Applications (FIMA) and Fellow of the Higher Education
Academy (FHEA).
A Deep Semi-supervised Approach for
Multi-label Land-Cover Classification
Under Scarcity of Labelled Images
Shounak Chakraborty, Nilesh Agarwal, and Moumita Roy
Abstract In this manuscript, a land-cover classification (LCC) mechanism has been

investigated for the practical situations where a remotely sensed aerial image can be
annotated by more than one land-cover class. A striking factor for the development
of the proposed technique is its ability to operate under situations when there is
scarcity of labelled images in the training set, thereby alleviating extensive manual
collection of multi-label ground truth information for LCC. The solution using very
few labelled training images has been envisioned through a semi-supervised deep
learning-based methodology where templates have been generated corresponding to
each of the classes present in the training images. Thereafter, each of the test images is
assigned to multiple classes based on their similarity with each of the class templates.
Experimentation conducted on UCM and AID benchmark multi-label aerial image
datasets suggests promising results for the proposed approach.
1 Introduction
In the past few decades, the advancement in remote sensing machinery has resulted
in the generation of a massive number of digital images captured periodically over
the planet’s surface, rendering extensive scope for Earth observation. The images
captured by satellites as well as by manned or unmanned aerial vehicles have provided
scope for the development of software products capable of automatic surveillance
of land-covers (i.e. bare soil, forest, agriculture land, water body, etc.) with precise
accuracies. These automatic land-cover classification (LCC) techniques are useful
in diverse domains like forest and crop monitoring, thermal mapping, land-cover
map generation, biogeochemical cycling, biodiversity to name a few [1]. In the
current trends, the conventional single-label classification techniques have been in
the limelight (where a pixel or an image is annotated with only a single class) since
the spatial resolutions of the satellite images have been limited. Accordingly, these
S. Chakraborty (B) · N. Agarwal · M. Roy

Indian Institute of Information Technology, Design and Manufacturing Kurnool, Kurnool, Andhra
Pradesh, India
e-mail: shounak@iiitk.ac.in
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2021 1
A. Tiwari et al. (eds.), Soft Computing for Problem Solving, Advances in Intelligent
Systems and Computing 1393, https://doi.org/10.1007/978-981-16-2712-5_1
2 S. Chakraborty et al.
techniques can be broadly categorised [2] as pixel-level classification of satellite

images where every pixel is assigned with a class label [3], scene-level classification
[4] where each image obtained from an aerial vehicle flying at lower altitude is
associated with a label, and object-level classification where each land-objects like
cars, buildings, etc., are detected from an image scene [5]. Nevertheless, annotating a
pixel or an image with a single class label is far from practical as there should be more
than one land-cover class always present in the pixel or the image. For example, each
pixel in the Landsat-8 satellite image has a spatial resolution of 15–30 m where more
than one land class (like soil and water, vegetation and buildings) can easily co-exist.
Regardless, obtaining ground truth information about multiple classes corresponding
to each of the pixels of low (spatial) resolution satellite images is extremely daunting
due to spectral mixing of signals [6].
A recent expedition in the use of (un)manned aerial vehicles for remote sensing
has made a large-scale collection of high-resolution images over the Earth surface
possible [7–9]. Though expensive in terms of human effort, these images have multi-
ple land-cover classes clearly distinguishable which makes the collection of ground
truth possible. Conventionally, the task of multi-label classification has been han-
dled in a supervised fashion and the contributions therein can be categorised either as
problem transformation (i.e. decomposing the multi-label problem as a set of single-
label problems) [10, 11] and algorithm adaptation (i.e. adaptation of classification
algorithms to work on multi-label data directly) [12–14]. More specifically, the for-
mer reduces the multi-label problem into a set of binary classification problem to
tackle the problem, which however ignores the dependencies that may be present
among the class labels occurring together in the input image [15]. As a solution to
this, algorithm adaptation techniques, extend the traditional classification approaches
like k-nearest neighbour [12], boosting [13] and neural networks [14] for solving the
multi-label classification problem.
In specific context to remote sensing, one of the pioneering works has introduced
multi-label LCC as a single-label classification problem where each combination of
the co-existing classes have been treated as a separate class [11]. However, this had
an obvious drawback in the unavailability of sufficient training examples for each
newly defined composite class. To solve this, Moranduzzo et al. [16] have parti-
tioned the images into multiple tiles and assigned coarse classes corresponding to
each of them. Similarly, a radial basis function neural network [17] has been used
with customised thresholds to identify the possible land classes in an image [18].
Furthermore, the multi-class problem has been solved deliberately by exploring the
spatial characteristics and output label structure through a structured SVM [19]. Nev-
ertheless, a semi-supervised graph-theoretic approach has been explored in [20] for
extraction of multiple class labels from the aerial images. Recently, deep convolu-
tion neural network (CNN) [21] has been investigated for this task using augmented
images to supplement the training set [8]. Moreover, recent investigations have sug-
gested exploitation of the strong co-relation among the co-existing labels in case
of the remotely sensed images. For example, the occurrence of ship class strongly
indicates the presence of water body in the same image; same can be said about
A Deep Semi-supervised Approach for Multi-label Land-Cover Classification … 3
the co-occurrence of building-pavements or car–road label pairs [9] within the same
image. In this direction, recurrent neural networks [21] have been coupled with CNN
to explore spatial dependencies among the image segments using bi-directional long
short-term memory neural networks (LSTM) [7, 21].
Most of the multi-label LCC techniques developed so far indicate considerably
high prediction accuracies while operating with sufficient availability of labelled
training images (assuming standard training–testing image ratio of 80:20). However,
the accuracies drop significantly when the amount of training images to be used
are reduced. Since the manual generation of such training set containing multiple
annotations for every image is expensive, infeasible and time-consuming (even many
times more daunting than obtaining single-labelled training set), the development
of an approach requiring less training images is of utmost importance. As per the
knowledge of the authors, the investigation of a multi-label LCC approach operating
with a reduced training set is yet to be explored. In this regard, a deep learning-based
solution to the problem of multi-label LCC has been proposed in this manuscript
to work under a situation when there is a severe scarcity of labelled images. At
the onset, a multi-channel CNN has been investigated for extraction of the ‘most
confident’ training images from each class in the training set. These confident training
images from each class have been used to generate a corresponding class template
through U-NET CNN network [22]. Here, the training images having the highest of
confidences to contain a major class is segmented to extract the major object (class).
Thereafter, the collection of the segmented objects is saved as the templates for each
class. These class templates are then input to multi-channel CNN for one-versus-
all classification training. However, the class-correlation probability matrix is also
considered during training to capture the inter-label dependencies. During testing,
each of the test images is passed through each of the class-specific U-NET to obtain
its map corresponding to each class. These are then placed as input to the series of
one-versus-all multi-channel CNN for the identification of multiple objects present
in the image.
2 Proposed Methodology
As already mentioned, a multi-labelled LCC technique has been introduced in this

manuscript through a deep semi-supervised class template matching to operate in sit-
uations where there is a severe scarcity of labelled images. Here, class templates have
been generated through the ‘most confident’ training images in each of the classes;
whereas, the label dependencies have been captured using the class-correlation prob-
ability matrix. A detailed training and testing methodologies have been presented in
Fig. 1.
Fig. 1 Diagrammatic representation of the proposed scheme. Step-1: selection of the most confident
training images, template generation and training. Step-2: Obtaining feature map of the test images
and class label assignment
2.1 Selection of the Most-Confident Images from the

Training Set
As already mentioned, a multi-channel CNN has been used to select the ‘most confi-
dent’ training images. For this purpose, the multi-labelled training images are used to
train a multi-channel CNN, as shown in Fig. 2. In the proposed multi-channel CNN
architecture, a global average pooling operation is performed after each block to
covert the feature matrix into a one-dimensional vector. These one-dimensional vec-
tors are concatenated and then fed into fully connected layers for classification where
available multi-labels have been supplied for the purpose of training. The training
images are then applied as input to the trained CNN to obtain the probability scores
indicating their belongingness to each of the classes. Thereafter, a semi-supervised
threshold selection algorithm [23], as shown in Algorithm 1, has been applied to
find out the images having maximum belongingness to each of the classes. More
Fig. 2 Architecture of multi-channel CNN
specifically, jth image, denoted as X j is selected amongst the ‘most confident’ ones
in the mth class if its probability score is greater than the threshold (th m ) for the mth
class. Here, the total number of class labels is denoted by C.
1: for all m = 1, 2, ..., C do

2: for all X j in m th class do
3: min m = min member shi p j
j=1,2,...,βm
4: maxm = max member shi p j
j=1,2,...,βm
βm
5: mean m = β1 member shi p j
m
j=1
6: di f f min m =| mean m − min m |
7: di f f maxm =| maxm − mean m |
8: if di f f min m > di f f maxm then
9: th m = mean m
10: else
11: th m = 21 (mean m + maxm )
12: end if
13: end for
14: end for
In this phase of the proposed methodology, the most confident images from each
of the classes have been obtained for further processing in the consequent steps. The
set of the ‘most confident’ images for the mth class is denoted by Con f m = {X jm }.
2.2 Segmentation and Generation of Class Templates
In this stage of the investigation, the ‘most confident’ images obtained from the pre-
vious stage are segmented using a U-NET CNN, as shown in Fig. 3, to get segmented
major object present in the image. A U-net is an unsupervised neural network con-
Fig. 3 U-net for image segmentation
sisting of two paths: an encoder and a decoder [22]. The encoder path, similar to a
traditional stack of convolution operations, is a contraction path which means that
every layer downsample the original image to capture the contents of the major object
in the image. On the other hand, the decoder path symmetrically expands the image
to store the localisation information from the image. As shown in the figure, the final
segmented image is extracted from the final layer of this end-to-end deep network.
The image is compressed in the encoder layer to get its symmetric down-scaled
activation maps; the same kernel filters and activation maps of the same sizes are
used during decompression (expansion) of the image. Each of the confident images
from Con f m is segmented using a U-net (U-NETm ) specific to the mth class and
hence there are C U-nets corresponding to each class for segmentation and template
generation. Finally, the segmented one-class and mono-chromatic maps have been
obtained for each of the confident images with respect to their corresponding class,
which can now be used for training. Here, a specific U-net has been used to generate
templates corresponding to each of the classes. The details of the training process
have been presented in the consequent section.
2.3 One-Versus-All Training
At this stage, the segmented images have been used to train the proposed multi-
channel CNN (MC-CNN) already described in Sect. 2.1. A one-versus-all training has
been adopted for the present investigation, which means that there is a multi-channel
CNN assigned to identify images from each of the classes, as shown in Fig. 1. More
elaborately, mth MC-CNN (i.e. MCCNNm ) is trained with the segmented confident
images (or class templates) from all the classes; it is assigned a label “1” during
training if the image is a template of the mth class and “0” otherwise. During testing,
a trained CNN responds to the test images with a higher probability if they contain
the object (class) corresponding to the one it is trained with. However, the catch is
that the class-wise probability scores obtained from the CNN have been multiplied
with the class-correlation matrix obtained from the labels of the training image. As
already mentioned, this is done to capture the inter-dependencies among the class
labels for multi-label LCC. It is to be noted that the class-correlation matrix generated
from the labels available in the training set only is used for both training and testing
processes.
2.4 Assignment of Multiple Class Labels to the Test Image
During testing, an activation map corresponding to each of the classes is generated

using the trained U-net. The activation map is the segmented image from the test
image which is then fed to the correspondingly trained multi-channel CNN for pre-
diction. The probability score corresponding to the positive class index is recorded
and multiplied with the class correlation matrix available from the training labels.
Thereafter, a semi-automatic threshold selection technique, as already described in
Algorithm 1, has been applied to this modified probability score to predict the classes
which are present in the test images. In other words, a label is assigned to a test image
only if the modified probability score is greater than a customised automatic threshold
from Algorithm 1.
3 Experimental Results
3.1 Description of the Datasets
The effectiveness of the proposed methodology has been validated through exper-
imentation conducted on two very high resolution (VHR) remotely sensed image
benchmark datasets. A detailed description of the datasets is given as follows:
3.1.1 UCM Merced Multi-label Dataset
In this dataset, images are available from 21 land-cover classes, with each class con-
taining 100 remotely sensed aerial images [24]. Each of the images has a size of 256
× 256 × 3 with a spatial resolution of 0.3 m. Further, the images of this benchmark
remote sensing dataset are captured over various regions of the United States. The
multi-label ground truth information have been collected manually through photo
interpretation [20]. Here, one or more labels have been assigned to each image with
a maximum of seven classes. In this regard, the dataset has 17 distinct classes. For
experimental purposes, the entire dataset has been divided into an 80–20 training–
test ratio. For evaluation of the proposed scheme under a severe scarcity of labelled
images, the evaluation of the proposed approach has been carried out by selecting
80, 40 and 20 percent of the labelled samples for training. The samples not used for
training have been used as test samples.
3.1.2 AID Dataset
AID remotely sensed benchmark dataset [25] is a combination of 10,000 images from
Google EarthTM with size of each image as 600 × 600 × 3. The spatial resolutions
vary from 0.5 to 8 m. The image scenes have been captured over China, United
States, England, France, Italy, Japan, and Germany. Out of the 10,000 images, multi-
labelled ground truth information has been made available for 3,000 images through
photo-interpretation [7]. Similar to the UCM dataset, here also, 80, 40 and 20
3.2 Details of the Implementation
For the implementation of multi-channel CNN, five blocks have been used. Each
of the blocks further has two convolution layers followed by a batch normalisation
layer to achieve faster convergence. The convolution blocks have a kernel size of 3
× 3 and a stride of 2 × 2. The number of activation maps increases across each of
the convolution blocks as 64, 128, 256 and 512, respectively. Further, each block is
followed by a max-pooling layer of kernel 2 × 2 and stride of 2 × 2. Here, skip
connections have been introduced in the CNN architecture where there is a max-
pooling layer of stride 2 × 2 and kernel size of 2 × 2. Afterwards, we fine-tune the
entire network in the training phase with the Nestro Adam optimizer, and the initial
learning rate is set as 0.0001. The loss is calculated with the binary cross-entropy
with an input batch size of 32 for training up to 400 epochs. Moreover, early stopping
[17] has been enabled to avoid over-fitting. For U-net, five convolution blocks (i.e.
first two for down-sampling and the rest for up-sampling) have been used. Each of the
u-net consists of five convolution blocks. Here also, the images are down-sampled
using max-pooling layer of kernel size 3 × 3 with a stride 2 × 2 and the size of
activation maps are 64, 128 and 256, respectively. The fine-tuning of the network has
been carried out using the Nestro Adam optimizer [21] keeping the initial learning
rate is set as 0.0001. Here also, the linear decay function and early stopping [17] has
been utilised to avoid over-fitting of the model.
3.3 Analysis of the Results
As already mentioned, the evaluation of the proposed scheme has been carried out
on two benchmark multi-label datasets of aerial (VHR) images. To validate the
effectiveness of the proposed scheme in situations when there is severe scarcity

of (multi)labelled images for training, the performance analysis has been carried
out by varying the training–testing ratio of the datasets, as 80:20, 40:60 and 20:80.
Moreover, the performance of the prposed scheme has been compared with that
of data augmentation [8]-based and LSTM-based [7] approaches for multi-labelled
land-cover classification. In this regard, the comparative analysis has been carried out
on performance evaluation metrics [8] like precision, recall, F-score and accuracy as
follows:

nt
|Ti ∩Pi | 1 |Ti ∩Pi |
nt
Precision= n1t |Pi |
Recall = nt |Ti |
i=1 i=1
nt
|Ti ∩Pi |
Accuracy = 1
nt |Ti ∪Pi |
F-score = 2 × Precision×Recall
Precision+Recall
i=1
Here, n t denotes the number of unlabelled images in the test set. Ti and Pi denotes
the true and predicted label set of the ith image in the test set. Moreover, union (∪) and
intersection (∩) operators denote the bit-wise OR and AND operations, respectively,
on the one-hot-encoded labels.
3.3.1 Performance Evaluation on UCM Multi-labelled Dataset
As shown in Table 1, the performance of the proposed scheme has been compared
with that of others in scenarios when there is a scarcity of multi-labelled images in
the training set. It can be noted that all the compared schemes show sufficiently high
accuracies in captioning the test images when 80% of the labelled images have been
used for training. In this regard, the proposed scheme has obtained an improvement
of ≈10–12%, ≈7–11%, ≈9–12% and ≈12–13% in precision, recall, F1-score and
accuracy, respectively. However, by reducing the number of training images to 40%
of the total images, the improvement enhances using the proposed scheme. The same
improvement in terms of the four metrics then stand at ≈13–15%, ≈7–9%, ≈ 10–
13% and ≈12–15% for the proposed scheme. The proposed scheme is shown to be
effective when the training percent is further reduced to 20%. In such a scenario, the
proposed scheme outperforms the other compared techniques by ≈14%, ≈ 10–17%,
≈12–15% and ≈15–17% in terms of precision, recall, F1-score and accuracy.
3.3.2 Performance Evaluation on AID Multi-labelled Dataset
To further validate the effectiveness of the proposed scheme, experimentation has

been carried out on another benchmark multi-label remotely sensed dataset of AID,
as shown in Table 2. On a standard training–test ratio of 80:20, the improvement in
case of the proposed scheme stands at ≈11–13%, ≈8–16%, ≈9–15% and ≈10–17%
in terms of precision, recall, F1-score and accuracy. However, the same improve-
ment is shown to be ≈12–16%, ≈11–16%, ≈8–13% and ≈11–15% on decreasing
the number of training images to 40%. On further reducing the training images to
Table 1 Comparison of results on UCM multi-labelled dataset

Percentage of Scheme Precision (%) Recall (%) F1-score (%) Accuracy (%)
images used
for training
(%)
80 Augmentation 80.78 82.39 81.58 71.57
based [8]
LSTM based 78.52 78.68 78.59 70.68
[7]
Proposed 91.11 89.45 90.27 83.12
scheme
40 Augmentation 75.95 77.14 76.54 65.18
based [8]
LSTM based 73.89 73.45 73.66 62.88
[7]
Proposed 88.04 84.42 86.19 77.30
scheme
20 Augmentation 68.00 71.04 69.49 56.68
based [8]
LSTM based 68.62 64.78 66.64 54.57
[7]
Proposed 82.50 81.33 81.91 71.82
scheme
around 20%, the proposed scheme still manages an improvement of ≈9–16%, ≈11–
20%, ≈10–18% and ≈6–10% in terms of precision, recall, F1-score and accuracy,
respectively, over the other compared schemes.
4 Conclusion
The manuscript deals with a deep learning-based technique for multi-label land-
cover classification when a few multi-labelled images available for training. This
technique has been developed for the identification of multiple land-classes that
may be present in an aerial (VHR) image without the necessity of extensively col-
lected manually labelled images for training. Experiments carried out on two bench-
mark multi-labelled remotely sensed datasets show the effectiveness of the proposed
scheme when the number of labelled images in the training set is sufficiently less.
A comparative analysis of the proposed approach carried out against the other state-
of-the-art techniques suggests a better performance of the former when there is a
scarcity of manually labelled training images.
Table 2 Comparison of results on AID multi-labelled dataset

Percentage of Scheme Precision (%) Recall (%) F1-score (%) Accuracy (%)
images used
for training
(%)
80 Augmentation 81.48 84.90 83.16 78.43
based [8]
LSTM based 78.32 76.80 77.70 71.32
[7]
Proposed 92.73 92.60 92.90 88.90
scheme
40 Augmentation 75.95 77.81 76.81 71.77
based [8]
LSTM based 71.11 72.41 71.70 66.48
[7]
Proposed 87.95 88.22 88.09 80.12
scheme
20 Augmentation 73.09 71.48 72.27 66.39
based [8]
LSTM based 66.47 62.31 64.55 62.44
[7]
Proposed 82.70 82.79 82.74 72.82
scheme
References
1. Meher SK, Kumar DA (2015) Ensemble of adaptive rule-based granular neural network clas-
sifiers for multispectral remote sensing images. IEEE J Sel Topics App Earth Obser Remote
Sens 8(5):2222–2231
2. Ma L, Liu Y, Zhang X, Ye Y, Yin G, Johnson BA (2019) Deep learning in remote sensing
applications: a meta-analysis and review. ISPRS J Photogramm Remote Sens 152:166–177
3. Kim M, Lee J, Han D, Shin M, Im J, Lee J, Quackenbush LJ, Gu Z (2018) Convolutional neural
network-based land cover classification using 2-D spectral reflectance curve graphs with multi-
temporal satellite imagery. IEEE J Sel Topics Appl Earth Obser Remote Sens 11(12):4604–4617
4. Ammour N, Bashmal L, Bazi Y, Al Rahhal MM, Zuair M (2018) Asymmetric adaptation of
deep features for cross-domain classification in remote sensing imagery. IEEE Geosci Remote
Sens Lett 15(4):597–601
5. Zhang L, Shi Z, Wu J (2015) A hierarchical oil tank detector with deep surrounding features
for high-resolution optical satellite imagery. IEEE J Sel Topics Appl Earth Obser Remote Sens
8(10):4895–4909 Oct
6. Karalas K, Tsagkatakis G, Zervakis M, Tsakalides P (2016) Land classification using remotely
sensed data: going multilabel. IEEE Trans Geosci nd Remote Sens 54(6):3548–3563
7. Hua Y, Mou L, Zhu XX (2019) Recurrently exploring class-wise attention in a hybrid con-
volutional and bidirectional lstm network for multi-label aerial image classification. ISPRS J
Photogramm Remote Sens 149:188–199
8. Stivaktakis R, Tsagkatakis G, Tsakalides P (2019) Deep learning for multilabel land cover scene
categorization using data augmentation. IEEE Geosci Remote Sens Lett 16(7):1031–1035
9. Hua Y, Mou L, Zhu XX (2020) Relation network for multilabel aerial image classification.
IEEE Trans Geosci Remote Sens
10. Brinker K, Hüllermeier E (2007) Case-based multilabel ranking, pp 702–707
11. Learning multi-label scene classification. Pattern Recogn, 37
12. Zhang M-L, Zhou Z-H (2007) Ml-knn: a lazy learning approach to multi-label learning. Pattern
Recogn 40(7):2038–2048
13. Schapire RE, Singer Y (2000) Boostexter: a boosting-based system for text categorization.
Mach Learn 39(2–3):135–168
14. Zhang M-L, Zhou Z-H (2006) Multilabel neural networks with applications to functional
genomics and text categorization. IEEE Trans Knowl Data Eng 18(10):1338–1351
15. Nasierding G, Kouzani AZ (2010) Empirical study of multi-label classification methods for
image annotation and retrieval. In: 2010 international conference on digital image computing:
techniques and applications, pp 617–622
16. Moranduzzo T, Melgani F, Mekhalfi ML, Bazi Y, Alajlan N (2015) Multiclass coarse analysis
for UAV imagery. IEEE Trans Geosci Remote Sens 53(12):6394–6406
17. Haykin S (2007) Neural networks: a comprehensive foundation. Prentice-Hall of India, New
Delhi
18. Zeggada A, Melgani F, Bazi Y (2017) A deep learning approach to UAV image multilabeling.
IEEE Geosci Remote Sens Lett 14(5):694–698
19. Koda S, Zeggada A, Melgani F, Nishii R (2018) Spatial and structured SVM for multilabel
image classification. IEEE Trans Geosci Remote Sen 56(10):5948–5960
20. Chaudhuri B, Demir B, Chaudhuri S, Bruzzone L (2018) Multilabel remote sensing image
retrieval using a semisupervised graph-theoretic method. IEEE Trans Geosci Remote Sens
56(2):1144–1158
21. Goodfellow I, Bengio Y, Courville A (2016) Deep Learning. MIT Press
22. Ronneberger O, Fischer P, Brox T, U-net: Convolutional networks for biomedical image seg-
mentation. In: Medical image computing and computer-assisted intervention, pp 234–241,
Cham, Springer International Publishing
23. Chakraborty S, Roy M, Melgani F (2019) Semisupervised two-level fusion-based autoencoded
approach for low-cost domain adaptation of remotely sensed images. IEEE Geosci Remote
Sens Lett 16(7):1041–1045 July
24. Yang Y, Newsam S (2010) Bag-of-visual-words and spatial extensions for land-use classi-
fication. In: Proceedings of the 18th SIGSPATIAL international conference on advances in
geographic information systems, pp 270–279
25. Xia G, Hu J, Hu F, Shi B, Bai X, Zhong Y, Zhang L, Lu X (2017) Aid: a benchmark data
set for performance evaluation of aerial scene classification. IEEE Trans Geosci Remote Sens
55(7):3965–3981
Role of Individual Samples in Modified
Possibilistic c-Means Classifier
for Handling Heterogeneity Within
Mustard Crop
Mragank Singhal, Ashish Payal, and Anil Kumar
Abstract In raster remote sensing images within class have variations represented as
heterogeneity. Pixel-based classifiers use means/variance-covariance (DVC) statis-
tical parameters, generated from training sample datasets. These parameters do not
represent in totality about variations within class. This research paper explains the
role of each sample in handling heterogeneity without using statistical parameters
from the training samples. Modified possibilistic c-means fuzzy algorithm capable of
mapping single class to handle heterogeneity has been experimented. Multi-spectral
temporal images of Sentinel-2A/B of Banasthali, Rajasthan region acquired from 1
November 2019 to 24 February 2020 have been used for mustard class mapping. It
has been observed that while using individual samples in place of statistical parame-
ters in fuzzy-based classifiers, individual class identified has been least affected due
to heterogeneity within class.
Keywords Heterogeneity · Soft classification · Modified possibilistic c-means ·

Maximum sample
1 Introduction
Earth’s observation by remote sensing methods can be used for a wide range of
quantitative measurements. These measurements can be related to vegetation canopy
structure or for different LULC applications. The incorporation of human interpreta-
tions with various sensors to examine digital images has resulted in lower quantitative
accuracy. Digital image classification is one of the prominent application domains
to map and extort data about remote areas from satellite imagery. Higher accuracy
M. Singhal (B) · A. Payal

Guru Gobind Singh Indraprastha University, Delhi, India
A. Payal
e-mail: ashish@ipu.ac.in
A. Kumar
IIRS, ISRO, Dehradun, India
e-mail: anil@iirs.gov.in
14 M. Singhal et al.
can be achieved with the intervention of computers to process a digital image [16].
Lillesand and Kiefer [14] have mentioned digital image classification as a quanti-
tative technique to classify image data into various categories [14]. Supervised and
unsupervised image classifications are two broad categories of classification proce-
dure [6]. When training data are available, supervised classification is widely used
and when training data are unavailable, unsupervised classification is incorporated
in remotely sensed imagery.
A digital image is a combination of pixels. In the case of hard classification,
every pixel is assumed to be pure and is classified into one class. In reality, mixed
pixel problems exist and each pixel, through fuzzy classification, can be assigned to
multiple class memberships. A fuzzy-based classifier was observed to be generally
effective in handling mixed pixels, to produce precise and reasonable outcomes from
image classification [7]. Land cover varieties are not consistent, instead are dissimilar
because of which the classes have no crisp boundaries. This becomes a prime reason
behind the evolution of fuzzy-based classifiers. Another reason is that a pixel may
comprise two or more classes because of the coarse or medium spatial resolution
of sensors. Bezdek presented a fuzzy c-means (FCM) algorithm with the thought
of fuzzy sets to solve mixed pixel problem [3]. Later, to overcome the drawbacks
of FCM, Krishnapuram proposed an algorithm based on possibilistic concept and
improvement in objective function which was labeled as PCM [11]. Hybridization of
different methodologies like entropy-based, contextual-based and many more with
these classifiers has been eminent in fields of study. The applicability of artificial
intelligence in SAR imagery processing has been evaluated using automated SAR
image processing (ASIP) system [9].
To classify nonlinear data, a kernel-based fuzzy c-means (KFCM) was developed
in the year 2007. For KFCM, sample data that appear to be nonlinear in the input
space are mapped to a higher dimensional feature space where the sample points are
considered to be linearly separable [20]. Because of the ability of KFCM methods
to cluster more shapes in the input dataset, their classification accuracies are much
higher as compared to FCM [20]. Ben-hur discussed different types of kernels, such
as stationary kernels and definite kernels [1]. There is an improvement in the accuracy
with the incorporation of eight kernels with fuzzy c-mean classification, in order to
handle nonlinearity among the classes [5].
Similarly, possibilistic c-means (PCM) has been modified with KPCM by
replacing the Euclidean norm with the Gaussian kernel, resulting in an increase
in robustness to noise [10]. Supervised noise clustering has been chosen as the base
classifier, and adding nine different kernel functions as the distance functions with
it leads to derive a kernel-based classifier, termed as, KNC [18].
The objective function of PCM was revised by Li et al. [12], and an efficient
clustering algorithm named modified possibilistic c-means (MPCM) was presented
by them [12]. This algorithm saves the amount of running time by eliminating the
computation of membership parameters in every iteration. MPCM not only has the
properties of PCM, i.e., resisting noisy and avoiding trivial solutions, but also is one
of the fast clustering methods.
Role of Individual Samples in Modified Possibilistic … 15
PCM and MPCM algorithms are capable of mapping specific classes of interest
from temporal datasets [15, 19]. Mapping of various stages of a specific class
requires temporal data to incorporate changes happening within the class. Also,
single date images may have spectral overlap while mapping the second/third level
of classification.
This research paper experimented to use individual samples as statistical param-
eters of fuzzy MPCM classifier, in place of mean. The objective of this experiment
was to handle heterogeneity within class. The proposed approach has been compared
while using only mean or mean with variance–covariance (DVC) parameters in the
MPCM classifier. Secondly, the spectral overlap between classes like wheat, mustard
and grass has been handled while using the temporal indices database. This temporal
indices database for the mustard class has been generated during the class-based
sensor-independent (CBSI)-NDVI approach and compared with NDVI temporal
database.
2 Vegetation Indices and Heterogeneity
Many scientists have extracted and modeled various vegetation biophysical variables
using remotely sensed data since 1960. A lot of efforts have been put toward the
development of vegetation indices and are defined as dimensionless, radiometric
measures that function as indicators of relative abundance and activity of green
vegetation. Although there are more than 20 different vegetation indices in use,
in this research work NDVI was considered. Cohen [8] suggests that the first true
vegetation index was the simple ratio (SR), which is the near-infrared (NIR) to red
reflectance ratio described in Birth and Mc-Vey as mentioned in Eq. (2.1) [4]:
NIR
SR = (2.1)
Red
Rouse developed the generic normalized difference vegetation index (NDVI) [17]
as mentioned in Eq. (2.2):
NIR − red
NDVI = (2.2)
NIR + red
The NDVI was widely used and applied to the original Landsat MSS digital remote
sensor data. A novel class-based sensor-independent indices (CBSI) image has been
generated to reduce spectral dimensionality of the dataset. The CBSI-NDVI formula
is mentioned in Eq. (2.3):
ρmax − ρmin
CBSI-NDVI = (2.3)
ρmax + ρmin
where ρ max and ρ min represent band of maximum and minimum reflectance,
respectively.
Heterogeneity is an intrinsic property of the land surface which means the
complexity of discontinuous category and the spatial variability in continuous land
surface properties [13]. Spatial heterogeneity is related to the spatial resolution of
remote sensing pixels, spatial variations of the surface variables and the size of the
spatial domain. The traditional supervised classification is predicted on pure single-
class observations to train a classifier [2]. Using this approach, the end-users create a
single-class area of interest (AOI), nudging the area of interest away from field-based
points which may produce AOIs unrepresentative of the landscape and may insert
an error into the classification.
3 Mathematical Concepts of Algorithm
To resolve the limitations of FCM and PCM, MPCM has been introduced. MPCM
has fast clustering ability, the ability to resist noise and trivial solutions [12]. Since
PCM causes coincident clusters, MPCM was proposed to overcome this problem
and fit the clusters, which are close to one another. Li introduced the limitation of
PCM that it takes more time in implementation and a large number of parameters
need to be determined [12]. This section gives the mathematical concepts of MPCM
algorithm and its objective function formulation. Li revised the objective function of
PCM and presented an efficient clustering algorithm and discussed how to choose
parameters.
3.1 Pseudo Code of MPCM Algorithm
1. Assign mean values of each class from training data.

2. Assign the value of degree of fuzziness ∞ > m > 1.
3. Compute the regularization parameter ‘ηi ’ as mentioned in Eq. (3.6).
4. Compute the membership matrix, as given in Eq. (3.1):

−di2j
ηi
ui j = e (3.1)
5. Assign the final class to each pixel.
To minimize the impact of noise and outliers, parameter λi was introduced with
respect to each training sample and the modification has been done in the objective
function of PCM. The objective function of MPCM is given in Eq. (3.2):

N
C
m 2 N
C
m
Jm = μ ji xi − v j + ηi μ ji log μ ji − μ ji (3.2)
i=1 j=1 i=1 j=1
The objective function in Eq. (3.2) and the membership value in Eq. (3.1) satisfy
the criterion given below:
μ ji ∈ [0, 1], ∀i, j (3.3)

N
0 < μ ji ≤ 1, ∀ j (3.4)
i=1
max μ ji > 0, ∀i (3.5)

j
In Eq. (3.2), vj represents the prototype associated with class c and ηi is the
“bandwidth” or “resolution” or “scale” parameter which controls the shape and size
of the class as given in Eq. (3.6):
N 2
(μ ji )m xi − v j
i=1
ηi = N (3.6)
i=1 (μ ji )
m
4 Study Area and Dataset Used
This section elaborates the details of the study area and the dataset used in this
research work.
4.1 Study Area
The surroundings of Banasthali Vidyapith area, Rajasthan state, India, have been
selected as a study area for this research work to identify mustard, wheat and grass
fields while testing the proposed approaches. Banasthali is located in the district Tonk
and is surrounded by agricultural land where mustard covers around 299,000 hectares
of area, whereas wheat is cultivated in approximately 66,000 hectares. Several other
crops such as barley, gram, jowar, bajra, moong and urad can also be found in
comparatively less area.
The area is located in the north-eastern part of Rajasthan. The study area lies
between 26°23 and 26°24 north latitude, 75°51 and 75°54 east longitude. It is
surrounded by Jaipur toward the north, Sawai Madhopur toward the east, Kota district
Mustard
Fig. 1 Mustard fields identified on 11 Dec 2019 in the surroundings of Banasthali Vidyapith region
on the southeast, Bundi toward the south, Bhilwara district on the southwest and
Ajmer toward the west. The reasons for selecting this study area were:
• The area is surrounded by small villages where mustard, wheat and grass fields
can be found easily.
• During the month of November (2019) and December (2019) large fields of
mustard can be seen here, which later becomes fallow land by the end of March
(2020).
The mustard samples collected from fields have been shown in Fig. 1. The location
map and different land cover classes identified in the study area has been shown in
Fig. 2.
4.2 Study Area
In this research work, the multi-spectral and temporal images from twin satel-
lites Sentinel-2A and Sentinel-2B have been used to identify mustard fields. Seven
temporal images were acquired from 1 Nov 2019 to 24 Feb 2020 of the same area. In
this research work, multi-spectral temporal images from Sentinel-2A and Sentinel-2B
have been used to study the performance of classification algorithms while studying
the effect of individual samples in terms of statistical parameters from training data.
The multi-spectral temporal Sentinel 2A/2B dataset and its sensor specification have
been given in Table 1.
5 Methodology
Initially, multi-spectral images have been pre-processed to generate a temporal

indices database using Sentinel-2 A/B satellite images. The CBSI-NDVI approach
has been applied to generate temporal indices database parallel to it, NDVI temporal
Mustard
Fig. 2 Location of study, Banasthali Vidyapith area, Rajasthan state, India
Table 1 Sentinel 2A/2B dataset and sensor specification

Specifications Sentinel-2A Sentinel-2B
Spatial resolution 10–60 m 10–60 m
Spectral resolution 13 bands 13 bands
Scene size 290 km × 290 km 290 km × 290 km
Image acquired on 1 Nov 2019, 16 Nov 2019, 11 Dec 1 Nov 2019, 16 Nov 2019, 11 Dec
2019, 26 Dec 2019, 10 Jan 2020, 30 2019, 26 Dec 2019, 10 Jan 2020, 30
Jan 2020, 24 Feb 2020 Jan 2020, 24 Feb 2020
indices database was also generated, to have a comparison with the CBSI-NDVI
output. The objective of generating temporal indices database was to reduce the
spectral dimension of temporal images and maintain the temporal dimension to
incorporate the phonological profile of crop, and represented in the form of vector
elements to be used in the MPCM classifier. Spectral dimension has been reduced and
Table 2 Selected NIR and

Dates Mustard
red bands for mustard using
CBSI-NDVI CBSI-NDVI value NIR Red
1 Nov 2019 0.57 SWIR Blue
16 Nov 2019 0.4 VNIR Blue
11 Dec 2019 0.62 VNIR SWIR
30 Jan 2020 0.86 VNIR Blue
24 Feb 2020 0.52 VNIR SWIR
only temporal dimension has been used in fuzzy-based classifiers, to have input data
representing indices as vector elements. The temporal indices database has been
used in inseparability analysis to find out the best temporal date combination for
mustard fields, as shown in Table 2. Once suitable dates for each class are identified,
using these best dates temporal indices database has been generated. This temporal
indices database has been used in supervised modified possibilistic c-means (MPCM)
algorithm. MPCM classifier has been experimented while using mean, mean with
variance-covariance (DVC) as well as each sample as statistical mean, respectively,
to study how nicely within class heterogeneity can be handled with considered norms.
A detailed description of the methodology has been given in Fig. 3.
Following steps were applied to identify mustard fields’ class using the temporal
dataset of 1 Nov 2019, 16 Nov 2019, 11 Dec 2019, 26 Dec 2019, 10 Jan 2020, 30
Jan 2020 and 24 Feb 2020 images:
(1) All temporal images were used to generate CBSI-NDVI outputs using seed
training data for mustard fields separately, with the help of the CBSI-NDVI
formula mentioned in Eq. (2.3).
(2) Outputs from step (1) were used in separability analysis to identify temporal
images suitable to be used for mustard class. The identified optimized temporal
images were 1 Nov 2019, 16 Nov 2019, 11 Dec 2019, 30 Jan 2020 and 24 Feb
2020 as mentioned in Table 3.
(3) Temporal images identified in step (2) were then used to generate CBSI-NDVI
outputs using seed training data for mustard fields separately in the similar way
as done in step (1).
(4) The outputs generated in step (3) have been used to create an optimized
temporal indices database.
(5) Training data was created from optimized temporal indices database generated
from step (4) using the ground truth samples locations.
(6) The optimized temporal indices database (generated from step 4) was then clas-
sified using training data created in step (5), by applying the modified possi-
bilistic c-means algorithm with three different norms, i.e., Euclidean distance,
Diagonal variance-covariance (DVC) and each sample as mean.
(7) The classified outputs generated from step (6) were then compared, and the
accuracy assessment was conducted.
Input Multispectral Temporal Data: Sentinel-2 Satellite Images
Apply CBSI- NDVI, NDVI formula to generate CBSI-NDVI, NDVI out-

puts for all temporal images using training data of specific class
Apply separability analysis to identify temporal images to be used for the

specific class
Optimized temporal indices database
Create training data from optimized temporal indices database using known
ground truth samples locations
Apply Modified Pos- Apply Modified Pos- Apply Modified Pos-

sibilistic c-Means to sibilistic c-Means to sibilistic c-Means to
classify temporal indi- classify temporal indi- classify temporal indi-
ces database with ces database with Eu- ces database with each
DVC distance clidean distance sample as mean
Output comparison
and accuracy assess-
ment
Fig. 3 Methodology adopted
Table 3 NDVI values of

Dates Mustard NDVI values
mustard using suitable
temporal images 16 Nov 2019 0.38
11 Dec 2019 0.60
30 Jan 2020 0.85
24 Feb 2020 0.44
As discussed in the methodology, Table 2 presents the NIR band and red band
selected from the optimized temporal indices database for mustard class using the
suitable temporal images as identified from step (2).
Table 3 represents the NDVI values of mustard class from the optimized temporal
indices database using the suitable temporal images as identified from step (2)
discussed in the methodology.
6 Results and Discussion
In order to identify the mustard fields in the Banasthali area of Rajasthan state,
temporal remote sensing data for seven different dates were available. The seed
training samples of temporal datasets were collected which were applied on 1 Nov
2019, 16 Nov 2019, 11 Dec 2019, 26 Dec 2019, 10 Jan 2020, 30 Jan 2020 and 24
Feb 2020 temporal images.
The separability analysis conducted for mustard class in order to identify the
suitable temporal images to be used for classification is shown in Table 4. After five
temporal images of dates 1 Nov 2019, 16 Nov 2019, 11 Dec 2019, 30 Jan 2020 and
24 Feb 2020, the separability parameter was getting constant. So, these dates have
been selected to generate the outputs of mustard class using mean only, mean with
variance-covariance (DVC) and each sample as a mean approach.
Figure 4 shows the output of mustard fields by adopting the methodology
discussed in Sect. 5 using the selected temporal images as represented in Table 4
with training individual samples as a mean approach.
The outputs generated by classifying the selected temporal images, for mustard
class, using five different approaches have been compared and given in Table 5. It
can be clearly seen from the outputs that NDVI temporal indices database classi-
fied with MPCM using DVC is not giving very clear patches, specifically unable to
handle heterogeneity. The NDVI temporal indices database classified with MPCM
using Euclidean gives better outputs in comparison to DVC results. The NDVI
temporal indices database classified with MPCM using an individual sample as
a mean approach generated more favorable outputs as compared with DVC and
Euclidean parameters.
Table 4 Signature separability analysis for mustard class

S. no. No. of layers Class pair Min Dates
1 1 1:3 11 1 Nov 2019
2 2 1:2 39 16 Nov 2019, 11 Dec 2019
3 3 1:2 42 16 Nov 2019, 11 Dec 2019, 30
Jan 2020
4 4 1:2 46 1 Nov 2019, 16 Nov 2019, 11
Dec 2019, 24 Feb 2020
5 5 1:2 49 1 Nov 2019, 16 Nov 2019, 11
Dec 2019, 30 Jan 2020, 24 Feb
2020
6 6 1:2 50 1 Nov 2019, 16 Nov 2019, 11
Dec 2019, 26 Dec 2019, 30 Jan
2020, 24 Feb 2020
7 7 1:2 50 1 Nov 2019, 16 Nov 2019, 11
Dec 2019, 26 Dec 2019, 10 Jan
2020, 30 Jan 2020, 24 Feb 2020
1-Nov-19 16-Nov-19 11-Dec-19 30-Jan-20 24-Feb-20
Applied CBSI-NDVI to create temporal indices database and then classifying

with Modified Possibilistic c-Means Algorithm using each individual sample as
mean approach
Mustard Fields
Fig. 4 Mustard class output using MPCM with individual samples as mean approach
Table 5 Comparison of mustard output

Methodology used Mustard Methodology used Mustard
NDVI temporal indices database CBSI-NDVI temporal indices
classified with MPCM using DVC database classified with MPCM
using DVC

classified with MPCM using database classified with MPCM
Euclidean using Euclidean

classified with MPCM using database classified with MPCM
individual sample as mean using individual sample as mean
In the same way, CBSI-NDVI outputs show better results as compared to NDVI
temporal indices databases classified with MPCM algorithm using DVC, Euclidean
and individual samples as a mean approach. If we compare all the results generated,
then the CBSI-NDVI temporal indices database classified with MPCM using an
individual sample as a mean approach gives the best results.
7 Conclusion
This study has integrated a new innovation in each sample from the training data, to
handle heterogeneity using the modified possibilistic c-means algorithm in order to
identify mustard fields using temporal datasets. Identification of these classes was
carried out using temporal datasets obtained from Sentinel 2A/2B between the dates
1 Nov 2019 and 24 Feb 2020. Since commercial software classifies images using
statistical algorithms, it uses parameters such as mean or variance-covariance, etc.
from the training samples which cannot handle heterogeneity within class. There-
fore, in this research work, it has been experimented to apply an approach where
every training sample has been considered as a mean. Using this approach, only
the membership value which is found to be maximum for a given sample has been
considered. Through this approach, heterogeneity within the class has been handled
and homogeneity with class was maintained.
The classification results of optimized temporal indices database with MPCM
using Euclidean distance, MPCM using DVC and MPCM using individual samples
as a mean approach were studied. Individual training sample as mean approach
outperformed other two parameters considered in MPCM classifier. Also while using
each training sample as a mean approach, the MPCM algorithm behaves like learning
algorithms (ANN and deep learning based-CNN/RNN). This is because in learning
algorithms (ANN and deep learning-based CNN/RNN) each training sample is used
independently, which gives its impression during training of algorithms and these
learning algorithms handle homogeneity within class very nicely.
References
1. Ben-hur A, Horn D, Siegelmann HT, Vapinik V (2001) Support vector clustering. J Mach Learn
Res 2:125–137
2. Berhane TM, Costa H, Lane CR, Anenkhonov OA, Chepinoga VV, Autrey BC (2019) The
influence of region of interest heterogeneity on classification accuracy in wetland systems.
Remote Sens 11(5):551. https://doi.org/10.3390/rs11050551
3. Bezdek JC, Ehrlich R, Full W (1984) FCM: the fuzzy c-means clustering algorithm. Comput
Geosci 10(2):191–203. https://doi.org/10.1016/0098-3004(84)90020-7
4. Birth GS, McVey GR (1968) Measuring the color of growing turf with a reflectance
spectrophotometer. Am Soc Agronomy 60:640–643
5. Byju A (2015) Non-linear separation of classes using a kernel based fuzzy c-means (KFCM)
approach. University of Twente Faculty of Geo-Information and Earth Observation (ITC),
Enschede
6. Campbell JB (1996) Introduction to remote sensing, pp 337–349
7. Chawla S (2010) Possibilistic c-means-spatial contextual information based sub-pixel classifi-
cation approach for multi-spectral data. University of Twente Faculty of Geo-Information and
Earth Observation (ITC), Enschede
8. Cohen WB (1991) Temporal versus spatial variation in leaf reflectance under changing water
stress conditions. Int J Remote Sens 12(9):1865–1876
9. Fisher F, Chien S, Lo E, Greeley R (1999) SAR image processing using artificial intelligence
planning. Solid State Sci 3:856–861. https://doi.org/10.1109/ICIAP.1999.797702
10. Kandpal N (2016) Non-linear separation of classes using kernel based possibilistic c-means.
University of Twente Faculty of Geo-Information and Earth Observation (ITC), Enschede
11. Krishnapuram R, Keller JM (1993) A possibilistic approach to clustering. IEEE Trans Fuzzy
Syst 1(2):98–110. https://doi.org/10.1109/91.227387
12. Li KAI, Huang H, Li K (2003) A modified PCM clustering algorithm. In: 2nd international
conference on machine learning and cybernetics
13. Li H, Reynolds JF (1995) On definition and quantification of heterogeneity. Oikos 73(2):280.
https://doi.org/10.2307/3545921
14. Lillesand TM, Kiefer RW (1979) Remote sensing and image interpretation, pp 465–670
15. Misra G, Kumar A, Patel NR, Zurita-Milla R, Singh A (2012) Mapping specific crop-A
multi sensor temporal approach. In: 2012 IEEE international geoscience and remote sensing
symposium (IGARSS), pp 3034–3037
16. Richards JA, Jia X (2013) Remote sensing digital image analysis. J. Chem. Inform. Model. 4th
ed., vol 53. Springer, Berlin, Heidelberg
17. Rouse JW, Haas RH, Schell JA, Deering DW (1974) Monitoring vegetation systems in the Great
Plains with ERTS. In: Freden SC, Mercanti EP, Becker M (eds) Third earth resources technology
satellite–1 syposium, vol I. Technical presentations, NASA SP-351. NASA, Washington, DC,
pp 309–317
18. Sengupta I, Kumar A, Dwivedi R (2019). Performance evaluation of kernel-based supervised
noise clustering approach. J Indian Soc Remote Sens 47. https://doi.org/10.1007/s12524-019-
00938-2
19. Singh A, Kumar A (2019) Fuzzy based approach to incorporate spatial constraints in possi-
bilistic c-means algorithm for remotely sensed imagery. In: International conference on sustain-
able computing in science, technology & management, 20 February 2019, p 5, Jaipur. https://
doi.org/10.2139/ssrn.3354465
20. Yang A, Jiang L, Zhou Y (2007) A KFCM-based fuzzy classifier. In: Fourth international
conference on fuzzy systems and knowledge discovery
Specially Structured Flow Shop
Scheduling Models with Processing
Times as Trapezoidal Fuzzy Numbers
to Optimize Waiting Time of Jobs
Bharat Goyal and Sandeep Kaur
Abstract This paper presents a two-stage flow shop fuzzy scheduling approach
under uncertain situations. The processing times are demonstrated by the trape-
zoidal membership function. An exact algorithm is proposed with an objective to
achieve a schedule that minimizes the total waiting time of jobs in a specially struc-
tured model where the AHR of processing times is not on the whole arbitrary but
must satisfy a definite condition. Most of the literature in scheduling focuses on
minimizing the make-span. The significance of the desired objective and the effec-
tiveness of the proposed algorithm are exhibited in comparison to Johnson (Naval
Res Logist Quar 1(1):61–68, [1]), Palmer (Oper Res 16:101–107, [2]), NEH (Int
J Manag Sci11(1):91–95, [3]), Nailwal et al. (Int J Indus Eng Comput 7:671–680,
[4]) and Goyal and Kaur (Mater Today: Proc, [5]) heuristic approaches. The results
obtained show the best out of the five as well whenever the objective of minimizing
waiting times is concerned.
Keywords Flow shop scheduling · Trapezoidal fuzzy numbers · Heuristic · Total

waiting time · Job sequencing
1 Introduction
Scheduling is a deliberate study of decision-making problems. Flow shop scheduling

is a selection-making ideology used in the present time engineering and industrial
manufacturing services. The job shop scheduling model comprises various jobs along
with some operations which are to be performed on different machines. The machines
can be railway tracks, ophthalmologists, machines in the car manufacturing industry
and many others. Jobs can be arrival and departure of trains, diagnosis of patients,
B. Goyal
Department of Mathematics, G.S.S.D.G.S. Khalsa College, Patiala, Punjab, India
e-mail: bhartu89@gmail.com
S. Kaur (B)
Department of Mathematics, Punjabi University Patiala, Punjab, India
e-mail: sandeep_mathrs19@pbi.ac.in
28 B. Goyal and S. Kaur
assembling of car parts in sequence, etc. Every job has been processed on machines
for a certain time period. The processing times of different operations of a job do
not intersect with each other. One machine can implement only one job at a time.
Flow shop scheduling problem is one of the most prominent problems in the field
of scheduling. m-Operations of each job must be performed in the same order on m
different machines. For the permutable theories and heuristic approaches, scheduling
becomes an integral part as it provides various techniques to achieve the objective.
Scheduling aims to meet one or more objectives by performing various jobs over
available machines.
Most of the literature deals with deterministic processing times, but in the real
world, there are a lot of problems that have uncertain situations. Approaches that
deal with exact processing times fail to tackle uncertainty-based issues. To over-
come such indeterminist problems, scheduling approaches take advantage of a fuzzy
environment as it provides solutions for uncertainty-based problems. Trapezoidal
fuzzy membership functions can be used to demonstrate this vague information. The
objective of obtaining an optimal or near-optimal solution to minimize make-span
has been the key interest of almost every researcher in scheduling theory. In this
paper, we propose an exact method to obtain an optimal sequence to minimize the
total waiting time of jobs. McCahon and Lee [6] proposed an algorithm with gener-
alized mean values (GMVs) in order to defuzzify the fuzzy numbers with triangular
membership. Later on, improved results were obtained by Sanja and Xueyan [7] who
made use of α-cut approach to minimize the make-span in two-machine flow shop
scheduling problem. Leekwijck and Kerre [8] studied various defuzzification tech-
niques and found that the maxima methods give satisfactory results referring to the
primary defuzzification methods. To get the optimal results, Yager’s ranking method
[9] is used in this paper.
First, optimal two- and three-stage scheduling approaches were originated by
Johnson [1] around the 1950s to optimize the make-span. Palmer [2] applied the
heuristic approach for minimizing make-span in n-job m-machine problem. Nawaz
et al. [3] introduced the Nawaz, Enscore and Ham (NEH) algorithm based on
a heuristic approach for reducing total processing time on all machines. Also,
Chakraborty and Laha [10] attempted to obtain a good solution in polynomial time by
modifying the NEH algorithm. Szwarc [11] surveyed all significant acquainted cases
of the m × n flow shop problem and provides optimal results for three new cases.
Further, Gupta [12] considers the specially structured models in flow shop scheduling
to reduce the make-span. Apart from this, numerous heuristic approaches were made
alike of Bhatnagar et al. [13] and Gupta and Goyal [14] to optimize the waiting time
of jobs with deterministic processing times. Maggu and Das [15] studied scheduling
models with various objectives and parameters incorporating the concept of job block
and transportation time. Gupta and Goyal [16] obtained optimum total waiting time
of jobs in two-stage flow shop scheduling problem. Nailwal et al. [4] developed a
heuristic approach to obtain a sequence of jobs to minimize the total elapsed time
when there is a lack of intermediate storage between the processing of jobs. Goyal
and Kaur [5] proposed a heuristic approach to minimize the waiting time of jobs
Specially Structured Flow Shop Scheduling Models … 29
when the processing times are random. This paper aims to propose a specially struc-
tured problem, with two machines n-jobs flow shop scheduling, to minimize the total
waiting time of jobs in a fuzzy environment.
2 Preliminaries
2.1 Fuzzy Number
A fuzzy number Ñ is a convex fuzzy set of real line R along with its membership
function μ Ñ : R → [0, 1] which satisfies the following axioms:
(i) Ñ is normal, i.e., there exists exactly one x ∈ R for which μ Ñ (x) = 1.
(ii) μ Ñ (x) is piecewise continuous.
2.2 Trapezoidal Fuzzy Number
A fuzzy number A = (a1 , a2 , a3 , a4 ) is said to be a trapezoidal fuzzy number if its

membership function (Fig. 1)
⎧ ⎫
⎪
⎪ 0, x < a1 ⎪ ⎪
⎪
⎪ ⎪
⎪
⎪
⎨ a2 −a1 , a1 < x < a2 ⎪
x−a1
⎬
μ A (x) = 1, a2 ≤ x ≤ a3 (1)
⎪
⎪ ⎪
⎪
−x
⎪ aa4−a , a3 < x < a4 ⎪
⎪
⎪
⎪
⎩ 4 3 ⎪
⎭
0, x > a4
Fig. 1 Trapezoidal
membership fuzzy number
A = (a1 , a2 , a3 , a4 )
30 B. Goyal and S. Kaur
2.3 Yager’s Ranking Method
For a trapezoidal fuzzy number F̃, Yager’s ranking index [9] is given by
1
1
R F̃ = Fαl + Fαu dα (2)
2
0
where Fαl , Fαu is the α-level cut for the fuzzy number F̃, R F̃ is the Yager’s
ranking index for fuzzy number F̃.
2.4 Waiting Time of Jobs
The waiting time Uβ of a job β in a flow shop scheduling problem is defined as the
time which is consumed on waiting in queue for processing on the second machine.
2.5 Total Waiting Time of Jobs
The total waiting time Wt can be stated as the sum of all waiting times, i.e.

n
Wt = Uβi (3)
i=1
3 Format of Framework
3.1 Notation
Different notations used in the paper are as follows:
Notations Explanation
I Index for jobs βi i = 1,2,3,…,n
f iM Fuzzy processing time of job i on machine M
piM AHR value of fuzzy processing time of job i on machine M
CβM Completion time of job β on machine M
(continued)
Specially Structured Flow Shop Scheduling Models … 31
(continued)
Notations Explanation
Uβ Time consumed on waiting by job β
YiM Starting time of job i on machine M
Wt Total waiting time of jobs
3.2 Postulates
1. At the initial time t = 0, all machines are ready to perform their tasks (jobs).
2. Whichever job is to be processed on the first machine, it is always available.
3. Every machine is available without any halt and failure during the scheduling
process.
4. Machine’s setup time is assumed to be included in the processing times.
3.3 Problem Description
Let n-jobs are carried out on two machines (Machine 1 and Machine 2) in the
flow shop process with the processing time of ith job on machine M, (M = 1, 2)
taken as trapezoidal fuzzy numbers are denoted as f iM . Mathematically, the problem
description can be framed as represented in Table 1.
The Yager’s ranking index of processing times piM (M = 1, 2) are satisfying the
condition
max pi1 ≤ min p 2j (4)
The objective is to obtain the best schedule in order to minimize the total waiting
time.
Table 1 Problem description

Jobs Machine 1 Machine 2
in matrix form
i f i1 f i2
1 α111 , α1 , α1 , α1
21 31 41
2 , α2 , α2 , α2
α11 21 31 41
2 α121 , α1 , α1 , α1
22 32 42 α12
2 , α2 , α2 , α2
22 32 42
3 α131 , α1 , α1 , α1
23 33 43 α13
2 , α2 , α2 , α2
23 33 43
. . .
. . .
. . .
n α1n
1 , α1 , α1 , α1
2n 3n 4n α1n
2 , α2 , α2 , α2
2n 3n 4n
Another random document with
no related content on Scribd:
presence in the Synagogue is of comparatively modern date. The
ner tamid of the Sanctuary, however, is explained to be a lamp
burning “from evening to morning” (Exod. xxvii. 21). A golden
candlestick standing in the Sanctuary against the south side, with its
seven branches arranged from east to west, served this purpose.
According to Tradition it was the second branch, counting from east
to west, which really burnt continually; but this was not considered as
implied in the term ner tamid, which only meant “a continual lamp” in
the sense of a lamp that burns regularly every night.
The ner tamid in the Synagogue, which burns continually day and
night, is not mentioned by any of the earlier Rabbinical authors. It
has been introduced as a symbol representing our conviction that
from the Synagogue shall continually come forth the light of
instruction, the light of comfort and blessing, and the light of love and
peace.
In the Synagogue women are separated from men. There was also
in the Temple an ‫‏עזרת נשים‬‎“court of the women,” distinguished from
the ‫‏עזרת אנשים‬‎“court of the men,” to which women had no access.
During the Feast of Tabernacles, when the great rejoicings in the
Temple attracted a large assembly, special care was taken (‫‏תקון גדול‬
‫היה שם‬‎) that the separation of the sexes should be maintained
(Mishnah, Succah v. 2; and [427]Talm. B., Succah 51b). This
precedent has been followed in the Synagogue, and has been
accepted as law up to this day.
Reservedness and modesty (‫‏צניעות‬‎) have always been the pride and
ornament of Jewish women, both in their homes and in the
Synagogue; hence also their taking a silent part in the public
devotion is an honour to them, and by no means derogatory.
In addition to the above-mentioned points, a Synagogue ought to be

distinguished by the greatest possible simplicity, by the absence of
all kinds of images, portraits, or statues representing living beings,
whether real or imaginary. The Jewish religion is void of every visible
symbol; and the so-called magen-david (the double triangle) is
probably not of Jewish origin, and has no connection with our holy
religion. It is not a symbol of this kind, but some inscription of a
passage from the Scriptures that in most houses of worship reminds
us of the sacredness of the place. We enter it with due reverence,
manifesting it outwardly, in our peculiar traditional manner, by
keeping the head covered. It is our ancient custom to cover the head
when engaged in prayers, in reading the Bible or Talmud and their
commentaries. This outward sign serves to remind us that not only
our Service but even our literature is something holy, and its study a
religious act (‫‏מצוה‬‎). 119
Before we proceed to describe the details of our [428]ritual, we

mention one important point in which the present Synagogal Service
differs from the ancient Service in the Temple. From what we are told
in the Scriptures and in the Talmud, we learn that instrumental music
was an essential element in the Service, and that King David and his
successors paid great attention to it, whilst, with a few exceptions, it
is almost entirely absent from our Synagogues. The principal reason
why instrumental music is excluded from the Synagogue is its
prohibition on Sabbaths and Holy-days by Rabbinical law (Babyl. T.,
Erubin 104a). This prohibition, like many other enactments, did not
apply to the Temple Service; for the sacrificial laws had to be
obeyed, irrespective of the fact that they involved acts which, if
performed apart from the Temple Service, would constitute a breach
of the Sabbath laws. Apart from the Temple Service the Sabbath
laws remained in full force for the priests as well as for the general
public.
There were also other considerations that helped to keep

instrumental music out of the Synagogue Service. Its absence,
though not directly a sign of mourning, served to preserve the
memory of the destruction of the Temple, and to strengthen our
longing for its restoration. It is also urged that the introduction of
instrumental music into the Service would not satisfy any real want of
Jewish worshippers, but would merely be a concession to the desire
to assimilate our Divine Service to that of our non-Jewish
neighbours, contrary to the prohibition of chukkoth haggoyim
contained in the words, “Ye shall not walk in their statutes” (Lev. xviii.
3), i.e., in the statutes of the Gentiles. But, on [429]the other hand, it
has been argued that the feeling once expressed by the nation in the
words “This is my God, and I will worship him in a beautiful manner”
(Exod. xv. 2), still animates us. It is said that it is our duty to make
our Service as beautiful and as attractive as possible. This argument
deserves consideration, and might even outweigh some of the
above-mentioned arguments against the introduction of music into
our Service, if we were sure of the result of such introduction. But
this is by no means the case, for the experiment, where tried, has
not been successful if judged by the most practical test. The number
of worshippers has not been increased, and discontent has not been
removed. Whether the devotion of the worshippers has been
improved, refined, or intensified by music is a question that cannot
be answered with certainty. Even if the answer were satisfactory, it
could only apply to the introduction of instrumental music into our
Service on week-days, on Friday evening before the commencement
of Sabbath, but not on Sabbaths and Holy-days.
The Ritual.
In the Bible there is no indication of a fixed ritual; there are, however,

a few instances of forms of prayer prescribed for certain occasions.
There is the priests’ blessing (Num. vi. 24–26); the thanksgiving on
bringing the first-fruit offering to the Temple (Deut. xxvi. 3–10); prayer
on distributing the tithes which accumulated in three years (ibid. 13–
15). David (Ps. lv. 18) says, “Evening, and morning, and at
[430]noonday do I pray;” Daniel “kneeled upon his knees three times
a day and prayed, and gave thanks before his God, as he did
aforetime” (Dan. vi. 11); but nothing is said about the form and the
contents of these prayers. The Mishnah first speaks of certain fixed
forms of prayer: the “Eighteen” (‫‏שמונה עשרה‬‎), the reading of Shema
(‫‏קריאת שמע‬‎), and Benedictions (‫‏ברכות‬‎). The composition of the
tefillah, “Prayer” par excellence, is attributed to the Men of the Great
Synagogue (‫‏אנשי כנסת הגדולה‬‎), but only in its outlines. The number of
the paragraphs, the theme of each paragraph, and the formula by
which it is concluded may then have been fixed, the rest being left to
be filled up by each supplicant according to his capacity. It was but
natural that prayers uttered repeatedly by men eminent for their piety
should be eagerly copied by others, and gradually become, to some
extent at least, fixed forms of prayer. The tefillah, however, in the
time of the Mishnah was by no means identical with the tefillah of the
Men of the Great Synagogue. The destruction of the Temple
necessitated several changes; e.g., the prayers for the welfare of
Jerusalem, for the prosperity of Israel and of the Holy Land, and for
the acceptance of the Service in the Temple were altered in
accordance with the new state of affairs.
The Mishnah speaks of the tefillah as a well-known existing

institution; it seems that it was the regular prayer in the Synagogue
Service, and the discussion whether the tefillah should be repeated
every day in extenso or in an abbreviated form (Mishnah, Berachoth
iv. 3) refers probably to the prayer recited privatim (‫‏תפלת יחיד‬‎), and
not to the Service in the Synagogue. [431]The prescribed “Eighteen
Blessings” were the framework, into which each man was expected
to fit in his peculiar, individual supplications; whilst in the public
Service the tefillah remained uniform. In the days of Rabban Gamliel
of Jamnia, and with his sanction, an important addition was made by
Samuel: a prayer for the discomfiture of those who by slander,
denunciation, or other wicked means attempt to undermine the
existence of the Jewish religion and community (‫‏ברכת הצדוקים‬‎or
‫‏ברכת המינים‬‎). 120 In some congregations two other paragraphs (‫‏את‬
‫צמח‬‎and ‫‏ולירושלם‬‎) were at the same time combined into one, in order
to keep to the traditional “Eighteen Blessings.” 121
The reading of shema in the evening and in the morning, the three
sections constituting the shema, and the order of these sections, are
assumed in the Mishnah as fully established by law and usage. Only
a few regulations are discussed concerning the time and the mode of
the reading. There was this difference between the custom of the
Babylonian Jews and that of their brethren in Palestine, that the
latter omitted in the evening the passage referring to tsitsith. Later
on, however, the Palestine Jews conformed to the Babylonian
custom. Suggestions have been made [432]to substitute other Biblical
passages for shema, but they have been rejected. Several attempts
have been made to introduce, as an addition to the three sections of
shema, the reading of the Decalogue; the addition was disallowed,
lest people should be misled to think that the Ten Commandments
alone were to be observed, and that the other laws were not binding
(Babyl. T., Berachoth 12a). 122
The Benedictions which precede and follow the reading of shema

were fixed in the time of the Mishnah as regards number, order, and
form; but the contents were left unsettled for some time (Mishnah,
Berachoth i. 4); in the Gemara their wording is still a subject for
discussion. The same can be said with regard to the relative order of
shema and tefillah. For the Evening Service the tefillah seems to
have generally been considered as optional. As to Benedictions in
general, their obligatory character is assumed in the Mishnah as
admitted by all, and only their form seems to have been fixed by the
regulations mentioned in Berachoth vi.–ix.
The Mishnah (Megillah iii. 4–iv. 10) includes a number of regulations
concerning the reading of the Law, the Prophets, and the Book of
Esther. Detailed rules were laid down for the reader and the
translator (methurgeman), pointing out which passages should be
omitted in the translation, and which should be omitted [433]even in
the original. It seems that there was a regular, consecutive reading,
which was interrupted on extraordinary days by the reading of
passages referring to these days.
The ritual which was adopted for the priests in the Temple was an
abridged form of the ritual then in general use. It was as follows:
They commenced with a benediction—the first of those which
precede the shema (‫‏יוצר אור‬‎); then they read the Decalogue, shema
(the three paragraphs), and three further benedictions, ‫‏אמת ויציב‬‎,
‫‏עבודה‬‎(corresponding to ‫‏רצה‬‎in our prayer), and the blessing of the
priests (Mishnah, Tamid v. 1).
A special ritual is also mentioned in the Talmud (Mishnah, Taanith iv.

2) for the Maamadoth and the Fast-days. 123 There were four
Services daily, as on the Day of Atonement. The principal feature in
the Service of the Maamadoth was the reading of the first chapter of
Genesis.
At the conclusion of the Talmud (about 500 c.e.) the essential parts
of our present ritual were already in a settled state; the shema with
the benedictions preceding and following, the tefillah with its
variations for New-moon, Sabbath, and Holy-days, the reading from
the Law and the prophets, and Hallel. The Seder evening Service
was complete in its main parts. [434]Of the Benedictions (Berachoth)
on various occasions both form and contents were fixed, and the rule
was laid down by Rabbi Meir (Berachoth 40a) that he who uttered a
berachah in a form different from that fixed by our Sages has not
fulfilled his duty (or, according to Maimonides, Hilchoth Berachoth i.
5, is in error). Notwithstanding this rule, however, changes were
made; new benedictions were introduced and old ones
discontinued. 124—Kaddish and Kedushah seem to have formed part
of the Service; of the latter the Talmud mentions the name, of the
former the response: “May his great Name be praised” ‫‏יהא שמו הגדול‬
‫מבורך‬‎or ‫‏יהא שמיה רבא מ׳‬‎(Comp. Babyl. Talm., Berachoth 3a).
In the next period, that of the Geonim, we meet with the complete
Siddur, “Arrangement” or “Order” of Service for ordinary days, for
Sabbaths and Festivals, Benedictions for all occasions, and Piyyutim
as optional additions. Such a Siddur was arranged by the Gaon
Rabbenu Saadiah (892–942), and another by the Gaon Rabbenu
Amram (about 880). Henceforth the principal prayers underwent only
insignificant alterations. Of the next period the most important
Siddurim are those included in the Mishneh-torah, at the end of the
second book, and that contained in the Machzor Vitry. 125
The additional prayers and piyyutim, being optional, varied according

to the taste of each congregation and [435]its leaders; in course of
time these variations became permanent; the same was the case
with minor changes, especially in the less essential elements of the
Service, and thus the various Minhagim (Rites) of the various
congregations came into existence. The principal Minhagim of
importance for us are: the Polish, the Sephardic, the German, and
the Italian Rites. 126 In the following description of the Ritual only the
two rites adopted in the principal Synagogues of the Anglo-Jewish
congregations in England will be noted.
Prayers at Fixed Times.
Although we constantly enjoy the blessings of God, the very breath

we breathe being the gift of our Heavenly Father, yet certain seasons
of the day, of the week, of the month, and of the year have been
selected as especially fit for reminding us of God’s kindness, and
predisposing our heart to devotion. Thus in the day, morning, noon
and evening have been fixed for prayer; in the week, Sabbath; in the
month, New-moon; in the year, the Festivals.
We have three daily Services: Maaribh, “Evening prayer;”

Shacharith, “Morning prayer,” 127 and Minchah, “Afternoon prayer.”
On Sabbath, New-moon, and Festivals an “Additional prayer,” Musaf,
is inserted [436]between the Morning and the Afternoon Services, and
on the Day of Atonement, Neïlah, “Concluding Service,” is added
after Minchah.
The two most essential elements in these Services are: (1) the
Reading of Shema (‫‏קריאת שמע‬‎), in the Maaribh and the Shacharith;
(2) the Tefillah or Amidah, common to all the Services.
1. The Reading of Shema.
In obedience to the precept, “Thou shalt speak of them,” i.e., of “the

words which I command thee this day—when thou liest down and
when thou risest up,” three sections of the Law are read daily in the
morning and in the evening, viz., (1) Deut. vi. 4–9, beginning ‫‏שמע‬‎
“Hear;” (2) Ibid. xi. 13–21, beginning ‫‏והיה אם שמע תשמעו‬‎“And it shall
be if ye will diligently hearken;” (3) Num. xv. 37–41, beginning ‫‏ויאמר יי‬‎
“And the Lord said.” The first section teaches the Unity of God, and
our duty to love this One God with all our heart, to make His Word
the subject of our constant meditation, and to instil it into the heart of
the young.—The second section contains the lesson of reward and
punishment: that our success depends on our obedience to the Will
of God. This important truth must constantly be kept before our eyes
and before the eyes of our children.—The third section contains the
commandment of tsitsith, the object of which is to remind us of God’s
precepts: “Ye shall see it and remember all the commandments of
the Lord and do them, and that ye seek not after your own heart and
your own eyes, after which ye use to go astray, that [437]you
remember and do all my commandments, and be holy unto your
God.”
The reading of the shema is preceded by two berachoth: (1) ‫‏יוצר אור‬‎
Praise of the Creator for the regular sequence of day and night, light
and darkness; (2) ‫‏אהבה רבה‬‎or ‫‏אהבת עולם‬‎Praise of His goodness in
giving us the Torah, and prayer for His assistance in the study of the
Torah. The shema is followed by a berachah on the Redemption of
Israel; it contains a reflection on the last words of shema, “I am the
Lord your God,” an expression of our faith in the truth of these
words, which strengthen our belief in the future Redemption of
Israel. 128 In the Evening Service a second berachah follows,
beginning ‫‏השכיבנו‬‎, and containing a prayer for protection during the
night. 129
2. The Tefillah or Amidah.
The Tefillah, “Prayer” par excellence, is called Amidah (lit.,

“standing”), because the worshipper stands during the time he offers
it up. It is also called Shemoneh-esreh, “Eighteen,” because it
contains on most occasions eighteen (or nineteen, comp. p. 431)
paragraphs, each concluding with a benediction. [438]
The first three paragraphs contain praise of God’s goodness to us,

the descendants of the pious patriarchs (1), His omnipotence (2),
and His holiness (3).
The next thirteen paragraphs are petitions for our individual and
national well-being. For our individual well-being (4–9), namely, for
reason and wisdom (4), assistance in our endeavour to return to God
(5), forgiveness of our sins (6), deliverance from trouble (7), from
illness (8), and from want (9).—For our national well-being (10–15),
namely, for the gathering of those who are scattered (10), under
good leaders (11), protected from the evil designs of our foes (12),
for the support of the faithful (13), the rebuilding of Jerusalem (14),
and the advent of Messiah (15). The sixteenth paragraph is a prayer
that our petition may be accepted.—The last three paragraphs
include a petition for the re-establishment of Divine Service in the
Temple of Jerusalem (17), thanksgiving (18), and prayer for peace
and prosperity (19). When the prayer is finished we express the wish
that our lips, from which prayer to God has come forth, may not be
defiled by unworthy language.
On Sabbaths, Holy-days, and in every Musaph the thirteen middle

paragraphs are replaced by one in which reference is made to the
characteristic feature of the day; in the Musaph of New-year three
berachoth (p. 404) are substituted for the thirteen middle berachoth
of the ordinary tefillah. The thirteen paragraphs have been
eliminated in order that we should not be reminded on Sabbath and
Holy-days of our failings, wants, and troubles; that those seasons
should be [439]marked by a happier and more cheerful mood than
ordinary days (supra, p. 354).
There are two shorter forms of the tefillah for urgent occasions: the
one is a substitute for the “Eighteen,” in which the middle thirteen
paragraphs are contracted into one; it is called ‫‏הביננו‬‎(the first word
of this middle section), or ‫‏מעין שמונה עשרה‬‎“abstract of the
‘Eighteen.’ ” The other is a contraction of the Friday evening tefillah,
and is called ‫‏מעין שבע‬‎“abstract of the ‘Seven’ ” (scil., paragraphs
forming the tefillah), originally intended for those who were too late
for the full Service. 130
Each of the above Services ends with a prayer called after its initial
word alenu, “It is our duty.” In this prayer we thank God that we have
the privilege of proclaiming His Unity, and express our hope to see
the worship of the One God adopted by all mankind. It is omitted
between two Services following closely the one upon the other.
In addition to the above, the Service contains the following parts:—
(1.) ‫‏ברכות השחר‬‎“Blessings of the Morning,” forming the first part of

the Morning Service. It contains benedictions, reflections, and
prayers suggested by the change from night to day, from sleep to
wakefulness, from rest to activity.
(2.) Psalms.—Our Service contains various groups of psalms: chief

among them the mizmorim or pesuke dezimrah (“songs” or “verses
of song”), and shir shel yom (“song of the day”), in the Morning
Service. The former include Ps. cxlv. to cl., some other psalms, and
[440]the song of Moses (Exod. xv.). The latter correspond to the
songs of the Levites in the Temple, and consist of Ps. xxiv. (for
Sunday), xlviii. (for Monday), lxxxii. (for Tuesday), xciv. (for
Wednesday), lxxxi. (for Thursday), xciii. (for Friday), and xcii. (for
Saturday).—The repetition of Ps. cxlv. three times a day, twice during
Shacharith and once during Minchah, is an old minhag (Babyl. Talm.,
Berachoth, p. 4b).
(3.) Supplications (‫‏תחנונים‬‎) added in the Morning and the Afternoon

Services after the tefillah.
(4.) Readings from the Bible and Post-Biblical Sacred Literature,

such as Num. vi. 22 sqq. (priests’ blessing); Gen. xxii. (binding of
Isaac); Exod. xvi. (manna); Mishnah, Peah i. 1, and Babyl. T.,
Shabbath 127a, in the earlier part of the Morning Service; and words
of comfort (beginning ‫‏ובא לציון‬‎) from the Prophets after the
“Supplications.” Originally an exposition of the Written and the Oral
Law followed the “Supplications,” and concluded with Messianic
prophecies, recited in Hebrew and in the Chaldee Version.
(5.) Biblical and Post-Biblical passages referring to the Sacrificial
Service, in the Morning and the Afternoon Services.
In addition to the above Services, read either in the Synagogue or

privately at home, there is a special prayer read by us before retiring
to rest. The chief element in it is the first section of shema; hence the
name ‫‏קריאת שמע שעל המטה‬‎“Reading of shema before going to bed.”
Some psalms and supplications are generally added. [441]
Public Service, ‫‏תפלה בצבור‬‎. 131
The following points mark off the Public Service from the various
forms of private prayer:—
(1.) Kaddish, “Sanctification,” a prayer for the universal sanctification

of God’s name, which will distinguish the age of Messiah. In the
second part of the Kaddish we pray for the Messianic peace, and in
the last sentence express our hope that it may soon be granted.
Formerly the Kaddish concluded the Service; at present it is recited

at the end of the Service in its full form (‫‏קדיש שלם‬‎“the whole
Kaddish”); the first half (‫‏חצי קדיש‬‎“half-Kaddish”) has its place at the
end of a section of the Service—e.g., after the ‫‏פסוקי דזמרה‬‎in the
Morning Service; a third form is recited by mourners after ‫‏עלינו‬‎and
after special hymns or psalms; it is the whole Kaddish with the
omission of the sentence beginning ‫‏תתקבל‬‎. It is called ‫‏קדיש יתום‬‎
“Kaddish of the orphan,” and is intended to express the mourner’s
faith in God and his resignation to His Will.—Sometimes a special
Kaddish, called Kaddish dirabbanan, is recited after the reading of
some Talmudic or Midrashic passages. It is the same as Kaddish
shalem, except that the sentence beginning ‫‏תתקבל‬‎is replaced by a
prayer for the welfare of the scholars, the Rabbis, and their pupils.
[442]
(2.) Repetition of the tefillah by the Reader, with the addition of

Kedushah before the third paragraph, and the Priests’ Blessing
before the last paragraph, of the tefillah. The Kedushah,
“Proclamation of the Holiness of God,” is based on the visions of Isa.
vi. and of Ezek. iii., with citation of three verses, Isa. vi. 3, Ezek. iii.
12, and Ps. cxlvi. 10, in which the Holiness, Glory, and Kingdom of
God are proclaimed.
The Priests’ Blessing, originally spoken by priests, descendants of

Aaron, is now in most Synagogues included by the Reader in the
tefillah by way of quotation; only on Holy-days it is pronounced by
the priests.
(3.) ‫‏קריאת התורה‬‎“the Reading of the Law,” and the “Lessons from the
Prophets” (‫‏הפטרה‬‎), with the benedictions preceding and following
(supra, p. 348).
Occasional Prayers—Benedictions, ‫‏ברכות‬‎.
The feeling of our dependence on the goodness of God must

constantly be present to our mind. Whatever we enjoy, be it in the
form of eating or drinking, or some pleasing or remarkable sight, an
agreeable smell, a festivity on a joyful event, or the performance of a
Divine commandment (‫‏מצוה‬‎); whatever befall us, whether it be
pleasant or unpleasant—all this we consider as sent to us by the Will
of the Almighty, and we express our conviction by a suitable
berachah. The general rule is thus laid down by our Sages: It is
unlawful for man to enjoy anything on earth without previously
acknowledging by a berachah that God is the source whence the
enjoyment is derived. For [443]different cases different forms of
“blessings” have been fixed by our Sages. In some cases the
enjoyment is also followed by a prayer of thanksgiving, the most
important being the prayer after meals, called ‫‏ברכת המזון‬‎
“Benediction for food or Grace.” 132 In the Mishnah it is called “Three
Blessings” (‫‏שלש ברכות‬‎), because it consisted originally of three
paragraphs, each ending with a benediction. The three paragraphs
are the following: (1) ‫‏ברכת הזן‬‎(“Benediction commencing ‫‏הזן‬‎”), in
which we praise God’s providential care of all creatures. (2) ‫‏הודאה‬‎
“Thanksgiving,” or ‫‏ברכת הארץ‬‎(Benediction referring to Palestine). In
this paragraph we offer thanks for our individual sustenance, as well
as for our national gifts: Palestine, the Covenant, and the Law. (3)
Prayer for the restoration of Zion and the rebuilding of the Temple
(‫‏בנין ירושלם‬‎).—Subsequently a fourth paragraph was added (‫‏הטוב‬
‫והמטיב‬‎“who is good and causes His creatures to be good”) in
commemoration of the relief given to the Jews after the close of the
war with Hadrian. 133—On certain occasions, e.g., at a wedding
repast, suitable additions are made. Besides these, various
supplications have been added in later times.
There are various short forms of this ‫‏ברכת המזון‬‎; the shortest is that
for children, “Blessed be the Merciful, the Giver of this bread.” 134—
When three grown-up male persons or more have their meal
together, [444]a special introductory form is used, called ‫‏זמון‬‎
“summons to prayer,” one of the company acting as Reader, and the
rest forming the congregation.
Another form of thanksgiving is the “Abstract of the Three Blessings”

(‫‏מעין שלש‬‎), consisting of one paragraph which contains the whole of
the Grace in a contracted form, and is used after cake, wine, and the
like.
No restriction is enforced upon us if we desire on our part to give
expression to our feeling of gratitude and reverence toward the
Almighty in our own words on occasions not provided for in the
ancient forms of benedictions and prayers. In order, however, to
make a distinction between the forms of obligatory berachoth fixed
by our Sages and the optional ones introduced by ourselves, we do
not employ the words, “O Lord, our God, King of the Universe,”
which are essential in the former.
[Contents]
Notes.
1. On Page 424 sqq.
Among the different minhagim observed in the Synagogue the

following are noteworthy:—The head is kept covered, the hands
uncovered; gloves are generally taken off before the beginning of the
Service. It was customary to spread forth the hands during prayer,
and the phrase “spreading forth the hands” is used in the Bible in the
sense of “praying.” The priests still raise their hands when
pronouncing the blessing. Isaiah, rebuking those who prayed to God
without seeking purification from evil deeds, says, “And when you
spread forth your hands I will hide mine eyes from you; yea, when ye
make many prayers I will not hear; your hands are full of blood” (Isa.
i. 15). Following the example of the Psalmist, “I will wash my hands
in innocency, so will I compass thine altar” (Ps. xxvi. 6), we wash our
hands [445]before prayer, as a symbol of the duty of purifying our
conscience from guilt before approaching the Almighty with our
petitions. We thus uncover our hands as if to say, “The reproach of
Isaiah does not apply to us; we have tried to free our heart and our
hands from guilt.”
A custom frequently animadverted upon is the habit which many

Jews have adopted of swinging their bodies forward and backward
during prayer. We consider it a more decent way to stand or sit still
when communing with the Supreme Being. Both ways find support in
the Talmud (Babyl. T., Berachoth 31a, and Shabbath 10a); whilst the
one stands like “a servant in the presence of his master,” the other
gives way to his emotions and excitement. The Magen Abraham, on
chap. xlviii. 4, says: “He who follows the one example is right, and he
who follows the other is likewise right: all depends on the devotion of
the heart.” Rabbi Jehudah ha-Levi in his Cuzari (Book II. chap. xli.)
mentions and explains the custom of shaking during prayer. The
habit of accompanying the emotions of our heart by corresponding
motions of our body has produced the custom of raising the whole
body upwards when uttering the word “holy” in the kedushah.
During tefillah we remain standing in the same place; at the end,

when we have finished our petition, we retire slowly a few steps
backward; the same is done by the Reader during the last paragraph
of the kaddish. It is as if, our petition ended, we reverently withdrew
from the heavenly King who has given us audience during the
prayer.
We bend the knee, incline our head, and bow down on certain
occasions during the Service, but we do not kneel during prayer.—It
has perhaps been avoided as an idolatrous practice, with reference
to Judges vii. 5.
When the Ark is opened and the Sefer is taken out or put back, we
stand and show our respect for the Word of God in various ways.
Some bow the head; others, considering this as worship, kiss the
Sefer, or otherwise express their reverence.
The traditional way in which the kohanim proceed to bless the

people is this: they remove their shoes, as the priests did who
ministered in the Temple; water is then poured over their hands by
the Levites, the ablutions of the ancient priests being thus imitated to
some extent (see Exod. xxx. 20). It is a holy act, and is done in the
Synagogue generally in front of the Ark. [446]The priests ascend the
steps of the hechal and wait till called upon by the Reader to
pronounce the blessing. They turn toward the congregation, spread
forth their hands in the traditional manner, and cover head and face
with the talith, in order not to be disturbed in their devotion by the
sight of the congregation before them; the Reader dictates the words
of the benediction to them to guard against any mistakes being
made by them. The congregation, giving special importance to each
word, add Biblical quotations and special supplications during the
interval between one word and the other. Of greater importance,
however, is respectful listening to the words uttered by the priests,
and chanted by them in a peculiar traditional tune. The priests turn to
all directions while pronouncing the blessing, expressing thereby that
they would have no one excluded from the blessing.
Some kohanim refuse to perform this duty, pretending or believing

that they are unworthy to bless the congregation. This is a mistake.
Those who feel that they are unworthy must try by improved conduct
to render themselves worthy, but disobedience to the direct
commandment of the Divine Law is certainly not the beginning of
improvement. Others object to the singing, in which they are unable
to join; others to taking off their boots. The excuses are certainly
insufficient. But as these two elements are less essential, they might,
if necessary, be dispensed with if the fulfilment of the commandment
is secured thereby.
2. On Page 439.
There are various parts in our Service which originally seem to have
formed a substitute, under certain circumstances, for a section of the
Service or for the whole of it, but were subsequently, when the
circumstances altered, embodied as an integral part of the Service in
addition to the sections which they had replaced.
In the Morning Service there is in the section called ‫‏ברכות השחר‬‎a

prayer beginning ‫‏לעולם יהא אדם‬‎and concluding ‫‏לעיניכם אמר יי‬. This
prayer, preceded by an exhortation to be God-fearing in secret—
when persecution prevented public worship of God—contains an
expression of pride in our history, and of gratitude to God that we
have the privilege to proclaim the [447]Unity of God in the words,
“Hear, O Israel,” &c., and a petition for the fulfilment of the Messianic
prophecies.
In the Maaribh the part beginning ‫‏ברוך יי לעולם‬‎and ending ‫‏על כל מעשיו‬‎
was originally a substitute for the Amidah, and the conclusion of the
Evening Service for those who considered the tefillah in the evening
optional. Similarly, on Friday evening the contracted tefillah was
originally a substitute for the tefillah for those who came late. In both
these and similar cases the substitute and its original have been
retained as integral parts of the Service.
3. On Page 442 (2).
In the public Service the tefillah is repeated by the Reader after the
silent prayer (‫‏בלתש‬‎) of the congregation. This minhag must have
been introduced very early. In the Talmud (end of Rosh ha-shanah) it
is spoken of as a regular institution, its purpose is discussed, and the
reason stated why we should not dispense with the Reader’s
repetition or with the silent tefillah. It seems that there was, on the
one hand, a desire on the part of the congregants to have an
uninterrupted silent tefillah in which they could give suitable
expression each one to his personal and peculiar wants and wishes.
On the other hand, there was also a desire felt by many to be guided
in their devotions by the Reader. Our minhag satisfies both
requirements. But it is a grave error to think, as unfortunately many
do, that, while the Reader repeats the tefillah, the congregants may
turn their heart and mind to other things, however holy these be. The
congregation and the Reader must be united in devotion during ‫‏תפלה‬
‫בצבור‬‎, and where the continued concentration of thought during the
tefillah and its repetition seems unattainable, it would be better to
sacrifice the minhag of repeating the tefillah rather than to have the
repetition of the prayer without the participation of the congregants,
or even without decorum.
In the repetition of the tefillah the kedushah forms an important

addition. The essential idea of the kedushah is repeated thrice
during the Morning Service, viz., in the first of the benedictions
preceding the shema, in the tefillah or Amidah, and in the concluding
section commencing ‫‏ובא לציון‬‎.
In the first kedushah (called ‫‏קדושה דיוצר‬‎), while praising God [448]as
the Creator of light and of the heavenly luminaries, we introduce
these, as proclaiming, as it were, the holiness and glory of God in
the words of the Prophets. In the last kedushah (called ‫‏קדושה דסידרא‬‎
or ‫‏סידרא דקדושה‬‎) we merely read, among other passages from the
Prophets, those verses of Isaiah and Ezekiel which contain the chief
sentences of the kedushah. In the kedushah of the tefillah the
Reader summons the congregation to proclaim the sanctification of
God in the manner of the angels above; it has therefore its place
only in Public Worship, whilst as to the other two kedushoth there is
no difference whether a person prays by himself or in a congregation
of worshippers.
As regards ‫‏קדיש וברכו‬‎, two prayers generally united, it must be

remarked that in their meaning they are disunited: the half-kaddish is
the conclusion of the mizmorim or pesuke dezimrah, and ‫‏ברכו‬‎is the
commencement of the next section: shema, with its benedictions.
The half-kaddish, wherever it occurs, concludes some section of the
Service. In shacharith, after Amidah, or after “Supplications,” or after
the Reading of the Law; at Musaf, Minchah, Neïlah, and Maaribh
after the introductory psalms. The half-kaddish before the Amidah in
the Maaribh is probably a remnant of the whole kaddish that used to

Soft Computing For Problem Solving Proceedings of Socpros 2020 Volume 2 Advances in Intelligent Systems and Computing 1393 Aruna Tiwari (Editor)

Uploaded by

Copyright:

Available Formats

You might also like

Soft Computing For Problem Solving Proceedings of Socpros 2020 Volume 2 Advances in Intelligent Systems and Computing 1393 Aruna Tiwari (Editor)

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Soft Computing For Problem Solving Proceedings of Socpros 2020 Volume 2 Advances in Intelligent Systems and Computing 1393 Aruna Tiwari (Editor)

Uploaded by

Copyright:

Available Formats

Soft Computing for Problem Solving

Proceedings of SocProS 2020 Volume 2

Soft Computing for Problem Solving Proceedings of

Soft Computing and Signal Processing Proceedings of 3rd

Soft Computing for Security Applications Proceedings of

Proceedings of 6th International Conference on Harmony

Intelligent Computing Proceedings of the 2021 Computing

International Conference on Innovative Computing and

Computational Vision and Bio Inspired Computing

Artificial Intelligence and Sustainable Computing

Aruna Tiwari · Kapil Ahuja ·

More information about this series at http://www.springer.com/series/11156

Soft Computing for Problem

Anupam Yadav Jagdish Chand Bansal

Kusum Deep Atulya K. Nagar

ISSN 2194-5357 ISSN 2194-5365 (electronic)

Indore, India Aruna Tiwari

A Deep Semi-supervised Approach for Multi-label Land-Cover

Covid-19: Machine Learning Algorithms to Predict Mortality

Epileptic Seizure Detection Using LSTM: A Deep Learning

An Analysis of Machine Learning Algorithm for the Classification

An Apache Giraph Implementation of Distributed ADMM

Real-Time Statistics and Visualization of the Impact of COVID-19

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 779

Dr. Aruna Tiwari is Associate Professor in Computer Science & Engineering at

Dr. Anupam Yadav is Assistant Professor in the Department of Mathematics at

Prof. Kusum Deep is Full Professor in the Department of Mathematics, Indian

Prof. Atulya K. Nagar holds Foundation Chair as Professor of Mathematical

Shounak Chakraborty, Nilesh Agarwal, and Moumita Roy

Abstract In this manuscript, a land-cover classification (LCC) mechanism has been

S. Chakraborty (B) · N. Agarwal · M. Roy

techniques can be broadly categorised [2] as pixel-level classification of satellite

As already mentioned, a multi-labelled LCC technique has been introduced in this

2.1 Selection of the Most-Confident Images from the

Fig. 2 Architecture of multi-channel CNN

1: for all m = 1, 2, ..., C do

2.2 Segmentation and Generation of Class Templates

Fig. 3 U-net for image segmentation

2.3 One-Versus-All Training

2.4 Assignment of Multiple Class Labels to the Test Image

During testing, an activation map corresponding to each of the classes is generated

3.1 Description of the Datasets

3.1.1 UCM Merced Multi-label Dataset

3.1.2 AID Dataset

3.2 Details of the Implementation

3.3 Analysis of the Results

effectiveness of the proposed scheme in situations when there is severe scarcity

3.3.1 Performance Evaluation on UCM Multi-labelled Dataset

3.3.2 Performance Evaluation on AID Multi-labelled Dataset

To further validate the effectiveness of the proposed scheme, experimentation has

Table 1 Comparison of results on UCM multi-labelled dataset

Table 2 Comparison of results on AID multi-labelled dataset

Mragank Singhal, Ashish Payal, and Anil Kumar

Keywords Heterogeneity · Soft classification · Modified possibilistic c-means ·

M. Singhal (B) · A. Payal

2 Vegetation Indices and Heterogeneity

3 Mathematical Concepts of Algorithm

3.1 Pseudo Code of MPCM Algorithm