New Post

Intelligent Traffic Management Using || AI & Metaheuristics || ~xRay Pixy

-
Image
Hybrid Artificial Intelligence and Metaheuristics for Smart City TRafci Management Problem Video Chapters: 00:00 Introduction 00:40 Smart Cities 01:14 Traditional Methods for Traffic Management 02:12 Hybrid Approach AI and Metaheuristics 02:47 STEPS for Hybrid  Traffic Management System 08:40 Advantages of Smart Traffic Management System 09:33 Conclusion
Post a Comment

Local Directional Pattern (LDP)

-

 Local Directional Pattern


How to Calculate Local Directional Pattern (LDP) Code? With Example |Kirsch Compass Mask| ~xRay Pixy

Click here - > WATCH NOW

What are Local Directional Patterns?

LDP = Local Directional Pattern. Local Directional Pattern is a descriptor i.e., used for Face Recognition. 

What is Descriptor? 

Descriptors rely on Gradient-based or intensity variation approaches detect Local Features (e.g.,  Edges, Blobs and Regions).  BLOB = Binary Large Object (i.e., the region of the image). Descriptors such as HOG, SIFT, SURF (rely on local gradient computation).  Binary Descriptors such as BRISK, ORB or FREAK (rely on local intensity differences). Local Directional Pattern (LDP) Assign code for each pixel in the image. Local Directional Pattern (LDP) encoded image is divided into regions.

How LDP Calculate? 

For Each pixel in the image LDP computes an 8-bit binary code. 8-bit binary pattern is calculated by involving the local regions of the image of size 3x3 with Krisch Mask in 8 Directions. Local Directional Pattern (LDP) Local Region’s Values: 


What is Kirsch Compass Mask? 

Local Directional Pattern (LDP) is Based on the known KIRSCH MASK. Kirsch Mask is non-linear Edge Detector. Using Kirsch mask we can find Edges in the following 8 direction: North, North West, West, South West, South, South East, East, North East.

How to Calculate Local Directional Pattern Value?


Calculation of Eight Directional Responses.

Calculate East Direction Mask i.e., 𝑚_0

 E (East)

E = [ (5 * 30) + (5 * 25) + (5 * 10) + (-3 * 50) + (-3 * 40) + (-3 * 45) + (-3 * 55) + (-3 * 15) + (0 * 60) ]

E = [ 150 + 125 + 50 – 150 – 120 – 135 – 165  – 45 – 0 ] 

E = [– 290 ]

Calculate North Direction Mask i.e., 𝑚_2

 N (North)

N = [ (5 * 55) + (5 * 15) + (5 * 30) + (-3 * 25) + (-3 * 10) + (-3 * 50) + (-3 * 40) + (-3 * 45) + (0 * 60) ]

N = [275 + 75 + 150 – 75 – 30 – 150 – 120 – 135 – 0  ] 

N = [– 10]

 Calculate South Direction Mask i.e., 𝑚_6

 S (South)

S = [ (5 * 10) + (5 * 50) + (5 * 40) + (-3 * 45) + (-3 * 55) + (-3 * 15) + (-3 * 30) + (-3 * 25) + (0 * 60) ]

S = [50 + 250 + 200 – 135 – 165 – 45 – 90 – 75 – 0  ] 

S = [– 10]

 Calculate West Direction Mask i.e., 𝑚_4

 W (West)

W = [ (5 * 55) + (5 * 45) + (5 * 40) + (-3 * 50) + (-3 * 10) + (-3 * 25) + (-3 * 30) + (-3 * 15) + (0 * 60) ]

W = [275 + 225 + 200 – 150 – 30 – 75 – 90 – 45 – 0  ] 

W = [ 310]


Rank Calculated Values in Ascending Order [Ranking of Directional Response]

(MSB, also called the high-order bit). the high-order bit or left-most bit


LDP is formed Considering only first 3 values of sorted Edge Response in descending order (i.e., largest to smallest).

LDP code for K = 3 is computed as:

𝑚_5 = 270   (3rd most significant directional response).

Calculate LDP Code of the pixel (x , y) : 

〖 𝑳𝑫𝑷〗_(𝒙,𝒚)  (𝒎_𝟎…𝒎_𝟕 )= ∑_𝟎^𝟕▒〖𝒔 (𝒎_𝒊−𝒎_𝟓 )∗𝟐^𝒊 〗

 Calculate LDP Binary Code of the pixel (x , y) 

〖 𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 )= ∑_0^7▒〖𝑠 (𝑚_𝑖−𝑚_5 )∗2^𝑖 〗

For i =  0, 

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (𝑚_0−𝑚_5 )∗2^0 〗

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (−290−270)∗1〗

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (−560) 〗 *  1

− 560 < 0

 0 * 1

 0

For i = 1, 

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (𝑚_1−𝑚_5 )∗2^1 〗

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (−250−270)∗2〗

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (−520) 〗 * 2

− 520 < 0

 0 * 2

 0

For i = 2, 

〖 𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (𝑚_2−𝑚_5 )∗2^2 〗

〖 𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (−10−270)∗4〗

〖 𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (−280) 〗 * 4

− 280 < 0

 0 * 4

0

For i = 3, 

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (𝑚_3−𝑚_5 )∗2^3 〗

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (110−270)∗8〗

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (−160) 〗 * 8

  - 160 < 0 

  0 * 8

0

For i = 4, 

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (𝑚_4−𝑚_5 )∗2^4 〗

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (310−270)∗16〗

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (40) 〗 * 16

 40 ≥0 

 1 * 16

16

For i = 5, 

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (𝑚_5−𝑚_5 )∗2^5 〗

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (270−270)∗32〗

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (0) 〗 * 32

 0 ≥0 

 1 * 32

32

For i = 6, 

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (𝑚_6−𝑚_5 )∗2^6 〗

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (−10−270)∗64〗

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (−280) 〗 * 64

 -280 <0 

 0 * 64

 0

For i = 7, 

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (𝑚_7−𝑚_5 )∗2^7 〗

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (−130−270)∗128〗

〖𝐿𝐷𝑃〗_(𝑥,𝑦)  (𝑚_0…𝑚_7 ) = ∑_0^7▒〖𝑠 (−400) 〗

 -400<0 

  0 * 128

 0

Calculated LDP Code = 0 * 𝟐^𝟎+"0 ∗ " 𝟐^𝟏+"0 ∗ " 𝟐^𝟐+"0 ∗ " 𝟐^𝟑+"1 ∗ " 𝟐^𝟒+"1 ∗ " 𝟐^𝟓 " +0 ∗ " 𝟐^𝟔+"0 ∗ " 𝟐^𝟕

〖 𝑳𝑫𝑷〗_(𝒙,𝒚)  (𝒎_𝟎…𝒎_𝟕 ) = (0 * 1) + (0 * 2) +  (0 * 4) + (0 * 8) + (1 * 16) + (1 * 32) + (0 * 64) + (0 * 128)

〖 𝑳𝑫𝑷〗_(𝒙,𝒚)  (𝒎_𝟎…𝒎_𝟕 ) =  16 + 32 = 48

LDP CODE = 48

Local Directional Pattern Video for more Details 

How to Calculate Local Directional Pattern (LDP) Code? With Example |Kirsch Compass Mask| ~xRay Pixy

Click here - > WATCH NOW


Comments

Post a Comment

Popular Post

PARTICLE SWARM OPTIMIZATION ALGORITHM NUMERICAL EXAMPLE

-
Image
 PARTICLE SWARM OPTIMIZATION ALGORITHM NUMERICAL EXAMPLE PSO is a computational method that Optimizes a problem. It is a Population-based stochastic search algorithm. PSO is inspired by the Social Behavior of Birds flocking. n Particle Swarm Optimization the solution of the problem is represented using Particles. [Flocking birds are replaced with particles for algorithm simplicity]. Objective Function is used for the performance evaluation for each particle / agent in the current population. PSO solved problems by having a Population (called Swarms) of Candidate Solutions (Particles). Local and global optimal solutions are used to update particle position in each iteration. Particle Swarm Optimization (PSO) Algorithm step-by-step explanation with Numerical Example and source code implementation. - PART 2 [Example 2] 1.) Initialize Population [Current Iteration (t) = 0] Population Size = 4; 𝑥𝑖 : (i = 1,2,3,4) and (t = 0) 𝑥1 =1.3; 𝑥2=4.3; 𝑥3=0.4; 𝑥4=−1.2 2.) Fitness Function used:
Read more

Cuckoo Search Algorithm for Optimization Problems

-
Image
 Cuckoo Search Algorithm - Metaheuristic Optimization Algorithm What is Cuckoo Search Algorithm? Cuckoo Search Algorithm is a Meta-Heuristic Algorithm. Cuckoo Search Algorithm is inspired by some Cuckoo species laying their eggs in the nest of other species of birds. In this algorithm, we have 2 bird Species.  1.) Cuckoo birds   2.) Host Birds (Other Species) What if Host Bird discovered cuckoo eggs? Cuckoo eggs can be found by Host Bird.  Host bird discovers cuckoos egg with Probability of discovery of alien eggs.  If Host Bird Discovered Cuckoo Bird Eggs. The host bird can throw the egg away. Abandon the nest and build a completely new nest. Mathematically, Each egg represent a solution and it is stored in the host bird nest. In this algorithm Artificial Cuckoo Birds are used. Artificial Cuckoo can lay one egg at a time. We will replace New and better solutions with less fit solutions. It means eggs that are more similar to host bird has opportunity to develop in the new generation a
Read more

Particle Swarm Optimization (PSO)

-
Image
Particle Swarm Optimization (PSO) is a p opulation-based stochastic search algorithm. PSO is inspired by the Social Behavior of Birds flocking. PSO is a computational method that Optimizes a problem. PSO searches for Optima by updating generations. It is popular is an intelligent metaheuristic algorithm.  In Particle Swarm Optimization the solution of the problem is represented using Particles. [Flocking birds are replaced with particles for algorithm simplicity]. Objective Function is used for the performance evaluation for each particle / agent in the current population. After a number of iterations agents / particles will find out optimal solution in the search space. Q. What is PSO? A. PSO is a computational method that Optimizes a problem. Q. How PSO will optimize? A. By Improving a Candidate Solution. Q. How PSO Solve Problems? A. PSO solved problems by having a Population (called Swarms) of Candidate Solutions (Particles). Local and global optimal solutions are used to upda
Read more

PSO (Particle Swarm Optimization) Example Step-by-Step

-
Image
 Particle swarm optimization (PSO) What is meant by PSO? PSO is a computational method that Optimizes a problem. It is a Population-based stochastic search algorithm. PSO is inspired by the Social Behavior of Birds flocking. n Particle Swarm Optimization the solution of the problem is represented using Particles. [Flocking birds are replaced with particles for algorithm simplicity]. Objective Function is used for the performance evaluation for each particle / agent in the current population. PSO solved problems by having a Population (called Swarms) of Candidate Solutions (Particles). Local and global optimal solutions are used to update particle position in each iteration. How PSO will optimize? By Improving a Candidate Solution. How PSO Solve Problems? PSO solved problems by having a Population (called Swarms) of Candidate Solutions (Particles). The population of Candidate Solutions (i.e., Particles). What is Search Space in PSO? It is the range in which the algorithm computes the op
Read more

PSO Python Code || Particle Swarm Optimization in Python || ~xRay Pixy

-
Image
Particle Swarm Optimization Implementation in Python Video Chapters: 00:00 Introduction 02:01 Code 05:55 Position Initialization 08:06 PSO Main Loop 08:42 Velocity Calculation 10:02 Position Update 10:36 Fitness Evaluation 13:21 Objective Function 17:44 Result 19:00 Conclusion .....................................................SOURCE CODE......................................................................... import random import numpy as np from tkinter import messagebox #Define Class Particles class Particle: def __init__ (self,position): self.position=position self.velocity=np.zeros_like(position) self.best_position=position self.best_fitness=float('inf') def PSO(ObjF,Pop_Size,D,MaxT): swarm_best_position=None swarm_best_fitness=float('inf') particles=[] #Posotion Initialization position=np.random.uniform(-0.5,0.5,D) particle=Particle(position) particles.append(particle) #Fit
Read more

Bat algorithm Explanation Step by Step with example

-
Image
There are about 1000 species of Bats. Bat Algorithm is based on the echolocation behavior of Micro Bats with varying pulse rates of emission and loudness. All bats use echolocation to sense distance and background barriers.  Microbats are small to medium-sized flying mammals. Micro Bats used a Sonar that is known as Echolocation to detect their prey. Bats fly randomly with the velocity at the position with a fixed frequency and loudness for prey.  Q. Whats is Frequency? A. Frequency is the number of waves that pass a fixed point in unit time. Wavelength is the minimum distance between two nearest particles which are in the same phase. Here, Sound waves are used by microbats to detect prey.  Q. What is Position? A. A place where something or someone is located.  Q. What is Velocity? A. Speed of something in a given direction.  Q. What is loudness. A. Loudness refers to how soft or loud sound seems to listeners.  Q. What is pulse rate? A. Wave or vibration.  In th
Read more

Grey Wolf Optimization Algorithm

-
Image
 Grey Wolf Optimization Algorithm  (GWO) Grey Wolf Optimization Grey Wolf Optimization Algorithm is a metaheuristic proposed by Mirjaliali Mohammad and Lewis, 2014. Grey Wolf Optimizer is inspired by the social hierarchy and the hunting technique of Grey Wolves. What is Metaheuristic? Metaheuristic means a High-level problem-independent algorithmic framework (develop optimization algorithms). Metaheuristic algorithms find the best solution out of all possible solutions of optimization. Who are the Grey Wolves? Wolf (Animal): Wolf Lived in a highly organized pack. Also known as Gray wolf or Grey Wolf, is a large canine. Wolf Speed is 50-60 km/h. Their Lifespan is 6-8 years (in the wild). Scientific Name: Canis Lupus. Family: Canidae (Biological family of dog-like carnivorans). Grey Wolves lived in a highly organized pack. The average pack size ranges from 5-12.  4 different ranks of wolves in a pack: Alpha Wolf, Beta Wolf, Delta Wolf, and Omega Wolf. How Grey Wolf Optimization Algorithm
Read more

how is the LBP |Local Binary Pattern| values calculated? Step-by-Step with Example

-
Image
 Local Binary Pattern Introduction to Local Binary Pattern (LBP) Q. What is Digital Image? A. Digital images are collections of pixels or numbers ( range from 0 to 255).  Q. What is Pixel? A. Pixel is the smallest element of any digital image. Pixel can be categorized as Dark Pixel and Bright Pixel. Dark pixels contain low pixel values and bright pixels contain high pixel values. Q. Explain Local Binary Pattern (LBP)? A. Local binary pattern is a popular technique used for image processing. We can use the local binary pattern for face detection and face recognition. Q. What is LBP Operator? A. LBP operator is an image operator. We can transform images into arrays using the LBP operator. Q. How LBP values are computed? A. LBP works in 3x3 (it contain a 9-pixel value ). Local binary pattern looks at nine pixels at a time. Using each 3x3 window in the digital image, we can extract an LBP code. Q. How to Obtain LBP operator value?  A. LBP operator values can be obtained by using the simp
Read more

Grey Wolf Optimization Algorithm Numerical Example

-
Image
 Grey Wolf Optimization Algorithm Numerical Example Grey Wolf Optimization Algorithm Steps 1.) Initialize Grey Wolf Population. 2.) Initialize a, A, and C. 3.) Calculate the fitness of each search agent. 4.) 𝑿_𝜶 = best search agent 5.) 𝑿_𝜷 = second-best search agent 6.) 𝑿_𝜹 = third best search agent. 7.) while (t<Max number of iteration) 8.) For each search agent       update the position of the current search agent by the above equations end for 9.) update a, A, and C 10.) Calculate the fitness of all search agents. 11.) update 𝑿_𝜶, 𝑿_𝜷, 𝑿_𝜹 12.) t = t+1 end while 13.) return 𝑿_𝜶 Grey Wolf Optimization Algorithm Numerical Example STEP 1.  Initialize the Grey wolf Population [Initial Position for each Search Agent] 𝒙_(𝒊  )  (i = 1,2,3,…n)     n = 6 // Number of Search Agents  [ -100, 100] // Range Initial Wolf Position      3.2228     4.1553    -3.8197     4.2330     1.3554    -4.1212 STEP 2. Calculate Fitness for Each Search Agent.    Objective Function: F6(x)  = su
Read more

Whale Optimization Algorithm Code Implementation || WOA CODE || ~xRay Pixy

-
Image
Whale Optimization Algorithm Code Implementation Whale Optimization Algorithm Code Files function obj_fun(test_fun) switch test_fun     case 'F1'         x = -100:2:100; y=x;     case 'F2'         x = -10:2:10; y=x; end end function [LB,UB,D,FitFun]=test_fun_info(C) switch C     case 'F1'         FitFun = @F1;         LB = -100;          UB = 100;         D = 30;     case 'F2'         FitFun = @F2;         LB = -10;         UB = 10;         D = 30; end % F1 Test Function     function r = F1(x)         r = sum(x.^2);     end % F2 Test Function     function r = F2(x)         r = sum(abs(x))+prod(abs(x));     end end function Position = initialize(Pop_Size,D,UB,LB) SS_Bounds = size(UB,2); if SS_Bounds == 1     Position = rand(Pop_Size,D).*(UB-LB)+LB; end if SS_Bounds>1     for i = 1:D         UB_i = UB(i);         LB_i = LB(i);         Position(:,i) = rand(Pop_Size,1).*(UB_i-LB_i)+LB_i;      end end end function [Best_Val,Best_Pos,Convergence_Curve]=WOA(
Read more