To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Diffraction is a phenomenon in which a light beam bends around the corner of an obstacle and spreads into the geometric shadow of that obstacle.
FRESNEL AND FRAUNHOFER DIFFRACTION
Diffraction can be classified into two categories:
1. Fresnel diffraction
2. Fraunhofer diffraction
The distinction between these two categories is as follows:
a. In Fresnel diffraction, the screen and source are at a finite distance from an obstacle. The distances are important in this class. In Fraunhofer diffraction, the source and screen are at an infinite distance from an obstacle. Therefore, inclination is important.
b. The incident wavefront in Fresnel diffraction is either spherical or cylindrical, whereas the incident wavefront in Fraunhofer diffraction is planar.
c. In Fresnel diffraction, the central point of the screen is either bright or dark depending on the number of zones, whereas in Fraunhofer diffraction, the central point of the screen is always bright.
FRAUNHOFER DIFFRACTION DUE TO SINGLE SLIT
Let us consider a monochromatic light source of wavelength ƛ placed at the focus of convex lens L1. The collimated rays of plane wavefront are incident on a single-slit AB of width “e.” The un-deviated rays from the slit reaches at point O, and the rays diffracted by an angle θ reach at P on the screen, as shown in Figure 12.1.
In graph theory, planar graphs introduce a fascinating area of study that intersects geometry, topology and network analysis. A graph is called planar if it can be drawn on a plane without any edges crossing each other. This property of planarity has significant implications in fields like circuit design, geographic mapping and urban planning where minimizing crossings leads to more efficient and visually accessible structures. In this chapter we will be covering important topics like the Eulerâs formula which provides a basis for understanding the structural constraints of a planar graph. We will also be discussing Kuratowskiâs and Wagnerâs theorems that provide a criteria for non-planarity. As we will see later in Chapter 9, one of the intriguing mathematical characteristics of planar graphs is that their vertices can be colored by at most four colors.
The subject, Computer Vision, deals with the science ofimparting to a machine or a computer the capabilityof seeing and understanding the environment as wehumans are able to do, and seeks to apply itstheories and models in various applications of ourlife and society. From the late sixties of the lastcentury, there have been efforts in analyzingdigital images captured by a scanner or a camera.Initially, it was the 2-D digital geometry in adiscrete grid of integral coordinate space whichdrew primary attention of the researchers. Inparticular, Prof. Azriel Rosenfeld (1931–2004) ofthe University of Maryland, USA, took a leading andpioneering role in developing theories of digitalpicture processing. Subsequently, the area wasstrengthened by the development and application oftheories of mathematical morphology, textureprocessing, pattern recognition techniques, etc.However, the major development in the theory ofcomputer vision, following the psycho-physiologicalmodels of human vision, happened in the seventies ofthe last century, when Prof. David Marr (1945–1980)of the Massachusetts Institute of Technology (MIT),Cambridge, USA, hypothesized three stages ofprocessing and representation of images by primalsketches consisting of edges, regions, 2.5-Dsketches of the scene, and finally 3-D models.
Over the years, theories of computer vision have beendeveloped from different areas of mathematical andphysical sciences, such as digital geometry,projective geometry, differential geometry, linearand nonlinear systems, human cognition andpsycho-visual perception, color representation andprocessing, computational learning, patternrecognition, etc. As we see, the theoreticalfoundation of the subject has been built fromdifferent domains, and it requires to learn thefundamentals across these disciplines in asystematic and organized manner in the context ofcore agenda of computer vision, which is to solveproblems related to the understanding of a 3-Dscene, static or dynamic, given visual inputs fromimaging systems.
In graph theory, independent sets represent collections of vertices that are pairwise nonadjacent, meaning no two vertices within an independent set share an edge. The study of independent sets is often linked to cliques (sets of mutually adjacent vertices) and covering numbers (the smallest set of vertices and edges that cover the entire graph) as they provide contrasting perspectives on how elements within a graph relate to each other.
The world of graph theory is expanding at a pace at which it is hard to keep track of the various disciplines of study that have somehow been irrevocably affected by the techniques owned and created by this versatile subject. However, the beauty of graph theory and its grandeur can also be intimidating for a beginner who wishes to explore its realms. The primary aim of the book is therefore to help a student understand and master the tools and techniques that are inherent to the subject and to serve as a handbook for anyone who wishes to explore the amazing world of graph theory.
We started writing this book with the goal of creating an undergraduate graph theory textbook that would be used by a broad audience, including students and teachers of Mathematics, Computer Science, Economics and perhaps Business Administration. However, mathematical training in proofs and logic is a prerequisite for understanding and following this book.
STATISICAL EXPERIMENTS ENABLE us to make inferences from data about parameters that characterize a population. Generally speaking, inferences may be of two types, namely, deductive inference and inductive inference. Deductive inference pertains to conclusions based on a set of premises (propositions) and their synthesis. Deductive reasoning has a definitive character. For example, all men are mortal (first proposition); Socrates is a man (second proposition); hence, Socrates is mortal (deductive conclusion). On the other hand, inductive inference has a probabilistic character. One conducts an experiment and collects data. Based on this data, certain conclusions are drawn that may have a broader applicability beyond the contours of the particular experiment performed by the researcher. This generalization of the conclusions drawn from the particular experiment constitutes the framework of inductive reasoning. For example, measurement of heights of a small group of people belonging to a certain population is conducted. Based on the calculations of this small sample set, and upon finding that for this small group the average height of men is greater than the average height of women, it is inferred that the men of this population are generally taller than the women.
The formal practice of inductive reasoning dates back to the thesis of Gottfried Wilhelm Leibniz (see Figure 5.1). He was the first to propose that probability is a relation between hypothesis and evidence (data). His thesis was founded on three conceptual pillars: chance (probability), possibilities (realizable random events), and ideas (generalization of inferences by induction). We have encountered the first two concepts in earlier chapters of this textbook. In this chapter, we will delve into the third theme whereby we will discuss methods to draw conclusions from data derived from statistical experiments based on the principles of inductive reasoning.
Biometrics is the scienceand technology of uniquely identifying a person bythe physical, physiological, genomic, or behavioralcharacteristics. For example, the biometric traitsor signatures for unique characterization of aperson may be obtained from fingerprint, palm print,face, iris, retina, shape of ear, voice, signature,gait, vein in the hand, odor, handwriting, DNAsequences, etc. Some of these traits are evidentlyvisible and are often used in our socialinteractions to identify a person. But many of themmay need use of technology and computationalprocessing for extraction of biometriccharacteristic signatures from them and verifyingthem subsequently. For a unique identification of aperson, the biometric data, also referred to as thebiometric signature, should have the properties ofuniqueness and permanence. The uniqueness is thecharacteristics that uniquely identifies anindividual person and permanence implies that itshould remain unchanged throughout the life of theindividual. However, permanence in absolute sense isseldom true in practice. In view of that, it ispragmatic to use those biometric traits, which areexpected to remain mostly unaltered for asignificant period of time. During this period,there may be some marginal deviations that can belargely tolerated for a practical solution.
17.1 | Biometric system
A biometric system isprimarily designed for managing the identity of aperson. Identity management is required in almostevery sphere of social interaction and activitieslike, border control, access control to certainresources, to avail conditional facilities (food,LPG connection, etc.), financial transactions,admission to examinations, certifying thequalification and competence, etc. There may also bevarious related tasks other than identifying aperson like, determining age and gender of anindividual, establishing kinship between twopersons, etc. There are three main generic tasksthat are involved in such a system of identitymanagement.
Classification is a taskof assigning a known category or class to an object.A class is a wellstudied group of objects that is identified by theircommon properties or characteristics. For example,consider the image in Fig. 7.1, where an instance ofa region in the image is denoted by a rectangularbounding box. Here, the task is to classifydifferent regions in the image by consideringvarious patches, as illustrated by a few boundingboxes, to two classes, “human” or “nonhuman”.Likewise a few other examples of imageclassification problem are, detection of pedestriansin an image patch, recognition of a letter given atwo-dimensional (2-D) image pattern, assigning apixel of an image to its foreground or background,finding whether an image captured indoor or outdoor,etc. We may observe here the diversified nature ofclassification problems and by solving them,different types of tasks are performed. Mostly, theclassification problem falls under the supervisedlearning framework, where training samples withappropriate features and class labels are used tolearn a model that is suitable for predictingclasses of the given data. There are variousapproaches for addressing the classification problemlike probabilistic approach, distance basedapproach, discriminant analysis based approach,artificial neural network (ANN) based approach, etc.This chapter introduces four specific techniquesfrom these approaches, namely, Bayesianclassification technique (particularly, naiveBayesian classifier), 𝐾-nearest neighbor (𝐾-NN)classifier, use of linear discriminant functions,and artificial neutral network, respectively.
Computer vision is the science of facilitating amachine or a computer with the human-like capabilityof seeing and understanding the environment. It is afield of artificial intelligence (AI), which dealswith the theory, algorithmic basis, and computationfor automatic understanding of visual data acquiredfrom an environment. With the rapid advancement ofdigital and computing technology, it is possible tocapture images and videos of a scene and store thedata in the memory of a computer. Computer vision isprimarily concerned with the automatic extraction,analysis and understanding of useful informationfrom a single image, a set of images, or a videowhich is a sequence of images. It has a wide rangeof applications across the society and variousindustries, such as in autonomous vehicles, healthcare, surveillance, augmented reality, robotics,remote sensing, document processing, biometrics, andmore. Some of the key tasks of computer vision areacquisition and processing of images and videos,extracting information, and finally, derivingknowledge and description about the scene. In thisintroductory chapter, we briefly review some of thefundamental aspects of image and video processingwhich may be sufficient to follow the content of therest of the book. However, the readers may beadvised to go through first level image and videoprocessing textbooks to know more details aboutit.
1.1 Image representation
To understand how images are represented in a computer,consider an image shown in Fig 1.1. A small portionof this image, shown by a white rectangle, is zoomedto reveal enlarging details of that portion of theimage. We observe that, within this zoomed portion,although the details are better visible, the edgesappear jagged.
The amplifiers studied so far are small signal amplifiers, where the magnitude of the input signal is small, and the main aim is to amplify either voltage or current with minimum distortion. However, in many applications like control, communication, and power conversion, a large amount of power, sometimes exceeding tens of kW, is to be handled by transistors and other semiconductor devices. In that case, the employed amplifiers are called power amplifiers or large signal amplifiers, where output signals, voltage and current, are large in magnitude.
Based on the type of circuit configuration like CE, CB, and CC, and the location of the quiescent point on the output characteristics, power amplifiers are classified as class A, class B, class AB, class C, and D, E, and F. Each class has its advantages and limitations, which will be discussed along with their circuits and operation. Class D is used very little, and classes E and F are rarely used, so only A, B, and C types of amplifiers will form part of this study, and their classification criterion is mentioned next.
Class A Amplifier: In class A operation, an amplifier is so biased that its operating point is almost in the middle of the output characteristics. The magnitude of the input signal is such that the amplifier operates over its full linear region of the characteristics, but without any clipping of the input signal. So, the output is the amplified replica of the input signal with minimal distortion. However, class A operation works with poor power conversion efficiency; the theoretical maximum power conversion efficiency from DC input to AC output is from 25–50%.
• Decarbonization pyramid and the importance of energy conservation in sustainable development
• Concept of energy management for optimal utilization of electricity
• Demand-side management
• Role of energy-efficient appliances in decarbonization
• Energy Conservation Act of India
• Major schemes on energy conservation by the BEE in India
• Concept and types of energy audit, energy managers, and energy auditors
• Power factor and energy conservation
• Importance of awareness campaigns, and participation of stakeholders in energy conservation
Introduction
Decarbonizing the electricity infrastructure is of prime importance for achieving climate protection and SDGs. Switching over to carbon-free generation of electricity, like solar and wind, is a mandatory requirement for it. But this energy shifting is not the sufficient requirement for decarbonization. Conservation of energy, in addition to energy shifting, needs to be pursued and implemented simultaneously. Energy conservation is using less energy by avoiding unnecessary uses of energy. The idea of energy conservation, in fact, is in the true spirit of sustainable development also. As defined earlier, development that meets the needs of the present without compromising the ability of future generations to meet their own needs is sustainable development.
‘One unit saved is equal to two units generated’ has been a famous saying of electrical engineering for a long time.
The objective behind this principle, however, was more on financial savings. But in the changed scenario, this principle needs aggressive reiteration as it involves financial as well as environmental savings. In addition, energy conservation leads to reduction in peak demand and the requirement of new infrastructure.