Two Tantalizing Concepts Randomness –“Any one who considers arithmetical methods of producing random digits is, of course, in a state of sin” – Von Neumann.

Slides:



Advertisements
Similar presentations
Using random numbers Simulation: accounts for uncertainty: biology (large number of individuals), physics (large number of particles, quantum mechanics),
Advertisements

Compressive Sensing IT530, Lecture Notes.
Signal processing’s free lunch The accurate recovery of undersampled signals.
Lecture 17 Introduction to Eigenvalue Problems
COS 323: Computing for the Physical and Social Sciences Szymon Rusinkiewicz.
Communication Systems Simulation - I Harri Saarnisaari Part of Simulations and Tools for Telecommunication Course.
Compressed Sensing for Networked Information Processing Reza Malek-Madani, 311/ Computational Analysis Don Wagner, 311/ Resource Optimization Tristan Nguyen,
Using random numbers Simulation: accounts for uncertainty: biology (large number of individuals), physics (large number of particles, quantum mechanics),
Using random numbers Simulation: accounts for uncertainty: biology (large number of individuals), physics (large number of particles, quantum mechanics),
Genetic Algorithms Can Be Used To Obtain Good Linear Congruential Generators Presented by Ben Sproat.
Class 07 - Information What is Information?. Class 07 - Information What is Information? Information arts Information design Information society Information.
Snick  snack A Working Computer Slides based on work by Bob Woodham and others.
Outline Chapter 1 Hardware, Software, Programming, Web surfing, … Chapter Goals –Describe the layers of a computer system –Describe the concept.
Noise, Information Theory, and Entropy
15-853Page :Algorithms in the Real World Generating Random and Pseudorandom Numbers.
Of 35 05/16/2012CTW: Communication and Computation1 Communication amid Uncertainty Madhu Sudan Microsoft, Cambridge, USA Based on: Universal Semantic Communication.
Noise, Information Theory, and Entropy
1 Ethics of Computing MONT 113G, Spring 2012 Session 11 Graphics on the Web Limits of Computer Science.
1 TOPIC 1 INTRODUCTION TO COMPUTER SCIENCE AND PROGRAMMING Topic 1 Introduction to Computer Science and Programming Notes adapted from Introduction to.
Overview of Computing. Computer Science What is computer science? The systematic study of computing systems and computation. Contains theories for understanding.
Media Computing Instructor Byung Kim Olsen 231 Office hours – MWF 9:00-10:00 AM or by appointment.
10/6/2015 1Intelligent Systems and Soft Computing Lecture 0 What is Soft Computing.
Computer Systems Organization CS 1428 Foundations of Computer Science.
(Important to algorithm analysis )
Random Number Generators 1. Random number generation is a method of producing a sequence of numbers that lack any discernible pattern. Random Number Generators.
Computer Vision – Compression(1) Hanyang University Jong-Il Park.
Information & Communication INST 4200 David J Stucki Spring 2015.
Overview.  Explores the theoretical foundations of computing  What can and cannot be done by an algorithm  Most of the material predates computers!
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
1 CS 4700: Foundations of Artificial Intelligence Prof. Bart Selman Machine Learning: The Theory of Learning R&N 18.5.
Course Overview  What is AI?  What are the Major Challenges?  What are the Main Techniques?  Where are we failing, and why?  Step back and look at.
Combinatorics (Important to algorithm analysis ) Problem I: How many N-bit strings contain at least 1 zero? Problem II: How many N-bit strings contain.
Encoding How is information represented?. Way of looking at techniques Data Medium Digital Analog Digital Analog NRZ Manchester Differential Manchester.
The man who knew 28% of mathematics. John Von Neumann ( ) Hans Bethe: Academic seminars (10.
EMIS 7300 SYSTEMS ANALYSIS METHODS FALL 2005 Dr. John Lipp Copyright © 2005 Dr. John Lipp.
RATE SCALABLE VIDEO COMPRESSION Bhushan D Patil PhD Research Scholar Department of Electrical Engineering Indian Institute of Technology, Bombay Powai,
1.  How does the computer generate observations from various distributions specified after input analysis?  There are two main components to the generation.
EE5393, Circuits, Computation, and Biology Computing with Probabilities 1,1,0,0,0,0,1,0 1,1,0,1,0,1,1,1 1,1,0,0,1,0,1,0 a = 6/8 c = 3/8 b = 4/8.
Introduction to Artificial Intelligence Heshaam Faili University of Tehran.
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 1: INTRODUCTION.
Computer Vision COURSE OBJECTIVES: To introduce the student to computer vision algorithms, methods and concepts. EXPECTED OUTCOME: Get introduced to computer.
Sub-fields of computer science. Sub-fields of computer science.
Electrical Engineering
Introduction to formal languages and automata
Dr. Clincy Professor of CS
Combinational circuits
Universality of Computation
Edexcel GCSE Computer Science Topic 15 - The Processor (CPU)
FIRST REVIEW.
High Performance Computing and Monte Carlo Methods
Introduction to Information Theory- Entropy
Done Done Course Overview What is AI? What are the Major Challenges?
EKT 221 : Digital 2 Serial Transfers & Microoperations
Computational Statistics with Application to Bioinformatics
경희대학교 MediaLab 서 덕 영 Information theory 경희대학교 MediaLab 서 덕 영
A Level Computing Component 2
Advanced Artificial Intelligence Evolutionary Search Algorithm
Foundations of Computer Science
CS 475/575 Slide set 4 M. Overstreet Old Dominion University
K-wise vs almost K-wise permutations, and general group actions
Intelligent Systems and
EEL 3705 / 3705L Digital Logic Design
Error Detection Neil Tang 9/26/2008
Random number generators
MACHINE LEARNING TECHNIQUES IN IMAGE PROCESSING
MACHINE LEARNING TECHNIQUES IN IMAGE PROCESSING
More NP-Complete Problems
Generating Random and Pseudorandom Numbers
Generating Random and Pseudorandom Numbers
CS 462: Introduction to Artificial Intelligence
Presentation transcript:

Two Tantalizing Concepts Randomness –“Any one who considers arithmetical methods of producing random digits is, of course, in a state of sin” – Von Neumann –There is no such thing as a random number; there are only methods (e.g., arithmetic vs. quantum) to produce random numbers Redundancy –Narrow sense, in information theory –Broad sense, in science and engineering

Pseudorandom Number Generator Complexity-based pseudorandomness is a deep concept in theoretical CS (with wide applications in scientific computing such as Monte Carlo methods) Engineers generate pseudorandom numbers by arithmetic algorithms such as linear congruential generators and linear feedback shift registers (LFSR) A maximal LFSR produces an m-sequence (i.e. cycles through all possible 2n − 1 states within the shift register except the state where all bits are zero), unless it contains all zeros, in which case it will never change.

AWGN How is AWGN generated under MATLAB? Yes, by “randn” function but how does it work? RANDN('seed') in MATLAB4 vs. RANDN('state',J) in MATLAB5 Subtle implication into denoising experiments

Randomness in Nature Waitomo Glow-worm Caves on Lake Roturura Star Constellation

Homogeneous PoissonRandom pin-dropping

Redundancy What is redundancy in Shannon’s mind? –In source coding, redundancy refers to the gap between the source entropy and the actual bit rate (so we want to eliminate redundancy). –In channel coding, redundancy refers to the “extra bits” used for error correction (so we add redundancy in a controlled fashion). Divide-and-conquer: an engineering solution

Redundancy in Nature Redundancy in language –Why are human languages redundant? How is it possible for young kids to learn speaking a language? Redundancy in natural world –Why are natural images compressible? How does human vision systems work? Redundancy in genetics –Why are Chromosomes in pairs?

Redundancy in SP Sampling – an artificial tool which we have not yet understood well No signal from the natural world is band- limited –Shannon/Nyquist’s sampling theorem never holds in practice –“Truth is much too complicated to allow anything but approximations.” Uniform sampling- a “sin” operator?

Two Contrasting Views Redundancy is bad –Since most natural signals are still so compressible, we should acquire much fewer samples (joint design of sampling and coding) –The emerging “compressive sensing” paradigm Redundancy is good –Redundancy is essential to human intelligence especially the redundancy exploitation hypothesis advocated by H. Barlow –To solve high-level computer vision problems, get low-level (image sampling, feature extraction) done right first.