Posts

Showing posts from September 9, 2020

New Post

Hidden Markov Model (HMM)

Image
Hidden Markov Model (HMM)  VIDEO LINK:  https://youtu.be/YIGCWNG8BIA A Hidden Markov Model (HMM) is a statistical model in which the system has hidden states that cannot be directly observed, but produce observable outputs. It is based on the Markov property, meaning the next state depends only on the current state. Video Chapters: HMM in Artificial Intelligence 00:00 Introduction 00:31 Statistical Model 00:54 HMM Examples 02:30 HMM 03:10 HMM Components 05:23 Viterbi Algorithm 06:23 HMM Applications 06:38 HMM Problems 07:28 HMM in Handwriting Recognition 11:20 Conclusion  HMM COMPONENTS A Hidden Markov Model (HMM) is a statistical model in which the system has hidden states that cannot be directly observed, but produce observable outputs. It is based on the Markov property, meaning the next state depends only on the current state. An HMM consists of states, observations, transition probabilities, emission probabilities, and initial probabilities. It is commonly used in a...

Monoalphabetic Substitution Cipher Techniques

  Monoalphabetic Substitution Cipher, also known as a simple substitution cipher, relies (depends) on a fixed replacement structure. That is substitution is fixed for each letter of the alphabet.  A simple example is where each letter is encrypted as the next letter in the alphabet: "a simple message" becomes "B TJNQMF NFTTBHF". Each letter can be encrypted to any symbol [&,%,?,/,*,{},@,~,+,-] not just another letter. 1.) Additive Cipher The Simplest Monoalphabetic cipher is an Additive cipher. This cipher is sometimes called Shift Cipher. When the Cipher is Additive, the Plain Text, Cipher Text and key are integers in Z(26). For Encryption: C = (p + k) mod 26 For Decryption: P = (c - k) mod 26 Where, C = Cipher Text                   P = Plain Text                   k = Key  The secret key between Alice and Bob is also an integer value. The encryption Algorithm adds the key to t...
More posts