Logical Operations on Images Boolean logic is a system of logical operations defined by George Boole in the mid 19th century to apply algebraic operations.

Slides:

Advertisements

Similar presentations

High Boost filtering In image processing, it is often desirable to emphasize high frequency components representing the image details without eliminating.

Advertisements

Lecture 20, Slide 1EECS40, Fall 2004Prof. White Lecture #20 ANNOUNCEMENT Midterm 2 Thursday Nov. 18, 12:40 – 2:00 pm A-L initials in F295 Haas Business.

Week 11b, Slide 1EECS42, Fall 2005Prof. White Week 11b OUTLINE – Synthesis of logic circuits – Minimization of logic circuits Reading: Hambley Ch. 7 through.

EGR 240 Introduction to Electrical and Computer Engineering

CSE 171 Introduction to Digital Logic and Microprocessors Prof. Richard E. Haskell 115 Dodge Hall.

EGR 240 Introduction to Electrical and Computer Engineering Prof. Richard E. Haskell 115 Dodge Hall Prof. Michael P. Polis 102J Science & Engineering Building.

Hamming Code A Hamming code is a linear error-correcting code named after its inventor, Richard Hamming. Hamming codes can detect up to two bit errors,

In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.

SDS-PAGE gel analysis SDS-PAGE analysis is done to study the expression of a protein from the control and the sample, to detect the molecular weight of.

Syndrome Decoding of Linear Block Code

Binary Exponential Backoff Binary exponential backoff refers to a collision resolution mechanism used in random access MAC protocols. This algorithm is.

Document that explains the chosen concept to the animator.

Segmental Mobility – Region of Viscoelasticity  Related LOs: > Prior Viewing – Single Chain Conformation-Ideal Chain > Future Viewing – Unit cells in.

Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:

Logic Gates How Boolean logic is implemented. Transistors used as switches to implement Boolean logic: ANDOR Logic with Transistors.

CSE 171 Introduction to Digital Logic and Microprocessors Prof. Richard E. Haskell 115 Dodge Hall.

Driving force for solidification This Learning object ‏ will introduce the concept of undercooling and driving force for phase transformations Subject:

Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.

Logic Gates Part – III : Combinational Logic Gates Combinational Logic Circuits are made up from basic logic NAND, NOR or NOT gates that are "combined"

ID template 5.0 for creating learning objects Created by OSCAR team October 2011 INSTRUCTIONS SLIDE: DO NO EDIT.

Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.

Electrical Resistivity in Superconductors The electrical resistivity of many metals and alloys drops suddenly to zero when the specimen is cooled to a.

Crystal Structure Author Sachin Patil ‘Basis and Lattice ’ The basic building blocks of Crystalline state ‏ ‏

Line Coding Schemes ‏Line coding is the process of converting binary data, a sequence of bits to a digital signal. Authors Phani Swathi Chitta Mentor Prof.

Convolutional Coding In telecommunication, a convolutional code is a type of error- correcting code in which m-bit information symbol to be encoded is.

Edge Detection using Laplacian of Gaussian Edge detection is a fundamental tool in image processing and computer vision. It identifies points in a digital.

CSMA/CA Simulation  Course Name: Networking Level(UG/PG): UG  Author(s) : Amitendu Panja, Veedhi Desai  Mentor: Aruna Adil *The contents in this ppt.

Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.

Gaussian Smoothing Gaussian Smoothing is the result of blurring an image by a Gaussian function. It is also known as Gaussian blur.  Course Name: Digital.

Crystal Structure Author Sachin Patil ‘Basis and Lattice ’ The basic building blocks of Crystalline state ‏ ‏

CSMA/CD Simulation Carrier Sense Multiple Access (CSMA), although more efficient than ALOHA or slotted ALOHA, still has one glaring inefficiency: When.

Linear Search Linear Search is a fundamental search algorithm. Linear search, also known as sequential search, is a process that checks every element in.

Equilibrium Defects Real crystals are never perfect, they always contain a considerable density of defects and imperfections that affect their physical,

Median Filtering In signal processing, it is often desirable to be able to perform some kind of noise reduction on an image or signal. The median filter.

Electrical Resistivity in Superconductors The electrical resistivity of many metals and alloys drops suddenly to zero when the specimen is cooled to a.

Go-Back-N ARQ (Sliding Window Protocol) Go-Back-N is an instance of the Automatic Repeat-request (ARQ) Protocol, in which the sending process continues.

Document that explains the chosen concept to the animator 1.

Process Scheduling In multiprogramming systems, when there is more than one ready process, the operating system must decide which one to activate. The.

Document that explains the chosen concept to the animator

Boolean Algebra & Logic Gates

Morgan Kaufmann Publishers

Department of Preparatory Year, Umm Al Qura University

Created by OSCAR team October 2011

Created by OSCAR team October 2011

The basic building blocks of Crystalline state‏ ‏

Information of the LO Subject: Information Theory Domain: Algorithms

Document that explains the chosen concept to the animator

Prof. Saravanan Vijayakumaran

Welcome 1 This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.

CSE 171 Introduction to Digital Logic and Microprocessors

Welcome 1 This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.

Simulation of Session Initiation Protocol

Dilation The basic morphological operations applied to either grayscale or binary images are Erosion and Dilation. Erosion shrinks image objects while.

Boolean Logic Boolean Logic is considered to be the basic of digital electronics. We know that a computer’s most basic operation is based on digital electronics.

Closing One of the important morphological operations applied to either grayscale or binary images is Closing. It is derived from the fundamental operations.

Erosion The basic morphological operations applied to either grayscale or binary images are Erosion and Dilation. Erosion shrinks image objects while.

Virtual Memory Virtual memory is a technique which gives an application program the impression that it has contiguous working memory, while in fact it.

Binary Search A binary search algorithm finds the position of a specified value within a sorted array. Binary search is a technique for searching an ordered.

Sorted Linked List A linked list is a data structure that consists of a sequence of data records such that in each record there is a field that contains.

Prof. Saravanan Vijayakumaran

Digital Logic Chapter-2

Discrete Convolution of Two Signals

Continuous Time Convolution

Digital Logic Chapter-2

Welcome 1 This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.

The basic building blocks of Crystalline state‏ ‏

Party Problem The simplest example of Ramsey theory. It is also known as the ‘Maximum Clique Problem’. A clique of a graph is a complete sub graph of the.

Opening One of the important morphological operations applied to either grayscale or binary images is Opening. It is derived from the fundamental operations.

Image Sharpening using Laplacian

Presentation transcript:

Logical Operations on Images Boolean logic is a system of logical operations defined by George Boole in the mid 19th century to apply algebraic operations on binary values.  Course Name: Digital Image Processing Level(UG/PG): UG  Author(s) : Phani Swathi Chitta  Mentor: Prof. Saravanan Vijayakumaran *The contents in this ppt are licensed under Creative Commons Attribution-NonCommercial-ShareAlike 2.5 India license

Learning Objectives After interacting with this Learning Object, the learner will be able to: Explain the performance of logical operations on images

Definitions of the components/Keywords: Logic operations provide a powerful complement to implementation of image processing algorithms based on morphology. These operations consist of 4 basic binary operations: AND, OR, and XOR and a unary operator NOT. Secondary operators can be created by combining the three binary operators with the unary operator, yielding: NAND, NOR, and XNOR. Logic operations are performed on a pixel by pixel basis between corresponding pixels of two or more images(except NOT, which operates on the pixels of a single image).

Definitions of the components/Keywords: Truth Table for basic Logical Operations:

Master Layout Give a dropdown box to select the operation The operations are: NOT, AND, OR, XOR, NOT-AND Give Start, Pause, Reset buttons Image after logical operation is done Original Images

Step 1: NOT I nstruction for the animator T ext to be displayed in the working area (DT) Show the original image first then when the user selects NOT operation and clicks Start show the second image The text in DT should appear in parallel to the figures The original binary image The resulting image after performing a logical NOT operation on the original image

Step 2: AND I nstruction for the animator T ext to be displayed in the working area (DT) Show the image1 and 2 first then when the user selects AND operation and clicks Start show the third image After start is pressed, slowly move the two images(triangle and circle) such that the two outlines of the images come on one another The text in DT should appear in parallel to the figures The original binary images The resulting image after performing a logical AND operation on the binary images

Step 3: OR I nstruction for the animator T ext to be displayed in the working area (DT) Show the image1 and 2 first then when the user selects OR operation and clicks Start show the third image After start is pressed, slowly move the two images(triangle and circle) such that the two outlines of the images come on one another The text in DT should appear in parallel to the figures The original binary images The resulting image after performing a logical OR operation on the binary images

Step 4: v XOR I nstruction for the animator T ext to be displayed in the working area (DT) Show the image1 and 2 first then when the user selects XOR operation and clicks Start show the third image After start is pressed, slowly move the two images(triangle and circle) such that the two outlines of the images come on one another The text in DT should appear in parallel to the figures The original binary images The resulting image after performing a logical XOR operation on the binary images

Step 6: NOT-AND I nstruction for the animator T ext to be displayed in the working area (DT) Show the image1 and 2 first then when the user selects NOT-AND operation and clicks Start show the third image After start is pressed, slowly move the two images(triangle and circle) such that the two outlines of the images come on one another The text in DT should appear in parallel to the figures The original binary images The resulting image after performing a logical NOT-AND operation on the binary images

Introduction Credits 11 Definitions Test your understanding (questionnaire) ‏ Lets Sum up (summary) ‏ Want to know more… (Further Reading) ‏ Try it yourself Interactivity: Analogy Slide 1 Slide 3 Slide 23, 24,25 Slide 26 Electrical Engineering  Select any one of the figures a b c d  Select the Images  Select the operation

Questionnaire 1.Suppose two images have N>0 black pixels and the result of ANDing those images also have N>0 black pixels. Will the images be same? Answers: a) Sometimes b) Always c) Never d) None

Questionnaire 2. In an image, if total # of pixels is M and # of black pixels is N then what is the # of black pixels in NOT image? Answers: a) M-N b) N-M c) M d) N 3. In two images, first image has N 1 black pixels, second image has N 2 black pixels and AND of the two images has N 3 black pixels. What is the # of black pixels in OR of two images? Answers: a) N1+N2-N3 b) N1+N2 c) N1-N2 d) N1+N2+N

Links for further reading Reference websites: Books: Digital Image Processing – Rafael C. Gonzalez, Richard E. Woods, second edition, Prentice Hall