ECE-1021 Instructor’s Project SIRDS Single Image Random Dot Stereograms STATUS UPDATE #4 29 NOV 03.

Slides:



Advertisements
Similar presentations
WORKCENTER 7755 – Walk-Up Training COPY Cheat Sheets.
Advertisements

Data Dependencies Describes the normal situation that the data that instructions use depend upon the data created by other instructions, or data is stored.
Composition CMSC 202. Code Reuse Effective software development relies on reusing existing code. Code reuse must be more than just copying code and changing.
FEATURES – Displays the job features on the screen. Additional features are available by touching the tabs. TOUCH SCREEN – displays all the available features.
December 5, 2013Computer Vision Lecture 20: Hidden Markov Models/Depth 1 Stereo Vision Due to the limited resolution of images, increasing the baseline.
St Testing, Simulation and Monitoring (actually mostly simulation) Stephen Hillier Joint Meeting, Mainz, June 2001.
© The McGraw-Hill Companies, 2006 Chapter 9 Software quality.
Cornell University Library Instruction Statistics Reporting System Members: Patrick Chen (pyc7) Soo-Yung Cho (sc444) Gregg Herlacher (gah24) Wilson Muyenzi.
Stego-SIRDS William L. Bahn CS-591 Project 07 December 2005.
Lec 5 Feb 10 Goals: analysis of algorithms (continued) O notation summation formulas maximum subsequence sum problem (Chapter 2) three algorithms image.
First Bytes - LabVIEW. Today’s Session Introduction to LabVIEW Colors and computers Lab to create a color picker Lab to manipulate an image Visual ProgrammingImage.
CSE473/573 – Stereo Correspondence
Computer Vision Lecture 3: Digital Images
Tracking with Linear Dynamic Models. Introduction Tracking is the problem of generating an inference about the motion of an object given a sequence of.
Copyright 2008 Koren ECE666/Koren Part.6a.1 Israel Koren Spring 2008 UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Digital Computer.
Object Tracking for Retrieval Application in MPEG-2 Lorenzo Favalli, Alessandro Mecocci, Fulvio Moschetti IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR.
CS 206 Introduction to Computer Science II 10 / 28 / 2009 Instructor: Michael Eckmann.
3x3x3 Rubik’s Cube Solver Kevin Van Kammen Kyle Rupnow Jason Lavrenz.
Image processing Lecture 4.
PREPARED BY: NOR HELYA IMAN KAMALUDIN
Image Processing1 Image Filtering Filtering can be use to enhance some features and de- enhance others. Usually used as a pre-processing step.
Lab Assignment 7 | Web Forms and Manipulating Strings Interactive Features Added In this assignment you will continue the design and implementation of.
CC0002NI – Computer Programming Computer Programming Er. Saroj Sharan Regmi Week 7.
Concussion Detection Research Tool Codi-Lee Hayes Samantha Mearns Rebecca Yaffe Dr. Thirimacho Bourlai Dr. Aaron Monseau.
: Chapter 12: Image Compression 1 Montri Karnjanadecha ac.th/~montri Image Processing.
Digital Image: Representation & Processing (2/2) Lecture-3
1 Functions 1 Parameter, 1 Return-Value 1. The problem 2. Recall the layout 3. Create the definition 4. "Flow" of data 5. Testing 6. Projects 1 and 2.
By Sky Rolnick UC Riverside HBD Software Status Update 5/13/09 1Sky Rolnick, UC Riverside.
Image Restoration using Iterative Wiener Filter --- ECE533 Project Report Jing Liu, Yan Wu.
December 4, 2014Computer Vision Lecture 22: Depth 1 Stereo Vision Comparing the similar triangles PMC l and p l LC l, we get: Similarly, for PNC r and.
September 5, 2013Computer Vision Lecture 2: Digital Images 1 Computer Vision A simple two-stage model of computer vision: Image processing Scene analysis.
Two –Dimensional Arrays Mrs. C. Furman Java Programming November 19, 2008.
How to Build a CPU Cache COMP25212 – Lecture 2. Learning Objectives To understand: –how cache is logically structured –how cache operates CPU reads CPU.
Chapter 1 Program design Objectives To describe the steps in the program development process To introduce the current program design methodology To introduce.
Introduction to Graphical Hardware Display Technologies
Copyright 2006 Prentice-Hall, Inc. Essentials of Systems Analysis and Design Third Edition Joseph S. Valacich Joey F. George Jeffrey A. Hoffer Chapter.
CS Data Structures I Chapter 2 Principles of Programming & Software Engineering.
240-Current Research Easily Extensible Systems, Octave, Input Formats, SOA.
A* Project Project 1 Due Sep. 26, 2012, 10pm EST Class presentation on Oct. 1, 2012.
Post-processing of JPEG image using MLP Fall 2003 ECE539 Final Project Report Data Fok.
NestedLoops-Mody7-part51 Two-Dimensional Arrays and Nested Loops – part 5 Rotations Barb Ericson Georgia Institute of Technology May 2007.
read and learn from example loop programs develop modular program
Implementation of Least Significant Bit Image Steganography and its Steganalaysis By: Deniz Oran Fourth Quarter.
1 Pre-Exam Lecture 4 Final Examination is scheduled on Monday December 18th at 1:30PM in class 4 There are 8 questions with or without sub- parts and.
1 CSCD 326 Data Structures I Software Design. 2 The Software Life Cycle 1. Specification 2. Design 3. Risk Analysis 4. Verification 5. Coding 6. Testing.
GSD SW & SE Training Bradley Databases Improvements and New Features Introduced in All Bradley Database Templates ( Including Changes Requiring Special.
ECE-1021 Instructor’s Project SIRDS Single Image Random Dot Stereograms STATUS UPDATE #3 25 NOV 03.
Principle Component Analysis (PCA)
EUROPE Nov 27 –Dec 10 November 27 - Dec 10.
ECE-1021 Instructor’s Project SIRDS Single Image Random Dot Stereograms STATUS UPDATE #5 02 DEC 03.
Data Representation. What is data? Data is information that has been translated into a form that is more convenient to process As information take different.
1 Arrays of Arrays An array can represent a collection of any type of object - including other arrays! The world is filled with examples Monthly magazine:
ECE-1021 Instructor’s Project SIRDS Single Image Random Dot Stereograms Final Presentation 04 DEC 03.
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
1 Computational Vision CSCI 363, Fall 2012 Lecture 16 Stereopsis.
Control units In the last lecture, we introduced the basic structure of a control unit, and translated our assembly instructions into a binary representation.
: Chapter 5: Image Filtering 1 Montri Karnjanadecha ac.th/~montri Image Processing.
Essential components of the implementation are:  Formation of the network and weight initialization routine  Pixel analysis of images for symbol detection.
Duke CPS Programming Heuristics l Identify the aspects of your application that vary and separate them from what stays the same ä Take what varies.
Lampel ZIV (LZ) code The Lempel-Ziv algorithm is a variable-to-fixed length code Basically, there are two versions of the algorithm LZ77 and LZ78 are the.
1 Computational Vision CSCI 363, Fall 2012 Lecture 18 Stereopsis III.
Implementation of Least Significant Bit Image Steganography and its Steganalaysis By: Deniz Oran Third Quarter.
Computational Vision CSCI 363, Fall 2012 Lecture 17 Stereopsis II
Deep Belief Network Training Same greedy layer-wise approach First train lowest RBM (h 0 – h 1 ) using RBM update algorithm (note h 0 is x) Freeze weights.
Ductless Heat Pumps (DHP) in Single Family Homes with Zonal Electric Heat UES Measure Update Regional Technical Forum June 17, 2014.
Computational Vision CSCI 363, Fall 2016 Lecture 15 Stereopsis
Functions BIS1523 – Lecture 17.
Sorting "There's nothing in your head the sorting hat can't see. So try me on and I will tell you where you ought to be." -The Sorting Hat, Harry Potter.
CS203 Lecture 15.
Presentation transcript:

ECE-1021 Instructor’s Project SIRDS Single Image Random Dot Stereograms STATUS UPDATE #4 29 NOV 03

Goals for Today’s Date (29 NOV 03) Project Kick-Off: 18 November 2003 Project Demo: 04 December 2003 (16 days) Skeleton Program (Dummy SIRDS Image)  20 Nov 03: Input Data File Format Defined  20 Nov 03: Output Data File Format Defined  22 Nov 03: User Interface Defined  25 Nov 03: Skeleton Program Tested SIRDS Image Generation Algorithm  20 Nov 03: Basic Approach Researched and Understood.  22 Nov 03: User Controllable Parameters Identified.  25 Nov 03: Image Generation Algorithm Finished  29 Nov 03: Algorithm Integrated into Skeleton Program  02 Dec 03: Final Product Testing

Integration went smoothly, largely due to simplifying assumptions. ä Initial Algorithm used many simplifications. ä Assumed image directly over same size data. ä Assumed eyes were centered over image. ä Assumed horizontal data and image rows matched. ä Only grayscale image produced. ä Walked across data extents only. ä Plan is to relax each assumption one at a time after the ability to produce a viable SIRDS is proven.

Original Z Data (lighter is higher)

Resulting SIRDS No discernable 3D pattern. Strange Artifact on right hand side.

Used simpler, more distinct data.

No change, so encoded image Alternated every three lines: row%3 = 0: SIRDS Data row%3 = 0: SIRDS Data row%3 = 1: Left Eye Data (w/green bias) row%3 = 1: Left Eye Data (w/green bias) row%3 = 2: Right Eye Data (w/green bias) row%3 = 2: Right Eye Data (w/green bias) Only one eye is apparent. Close examination shows both eyes are coincident (i.e., no separation). Error in code: left eye pixel stored into both the l_pix array and the r_pix array.

Corrected error, artifact remains No obvious association of artifact with any feature in image except possibly the size of the center hole.

Increased eye separation Increased the eye-separation because it seemed a bit small. Artifact on right side grew considerably.

Alternate encoding revealed error Forced SIRDS data to be GREEN for pixels where data is visible to left eye. Shows that the area at the right is supposedly visible by the left eye. Code examined and logic error discovered.

Another, similar error remained Everything to right of last entry in r_pix array is seed as being viewed by left eye unless an actual l_pix array entry is found. Modified loop to only identify the first r_pix entry. Subsequent entries therefore rely on subsequent l_pix passes - which actually makes more sense.

Image separation now working. Changed color bias to be less annoying. No SIRDS data is encoded in this image. This image is a viewable stereo pair!

Saturation reveals asymmetry Not all pixels in l_pix have an r_pix mate.

Only pair pixels that have a mate. Much more even image - and is a stereo pair! Some artifacts still present, but minor.

Added random dot back in. Is still a stereo pair. Only need to fill in rest with random dots.

Success! A full blown SIRDS!

After removing assumptions.

A color SIRDS

Product testing already accomplished. Final Focus is on Project Presentation and Demo. Project Kick-Off: 18 November 2003 Project Demo: 04 December 2003 (16 days) Skeleton Program (Dummy SIRDS Image)  20 Nov 03: Input Data File Format Defined  20 Nov 03: Output Data File Format Defined  22 Nov 03: User Interface Defined  25 Nov 03: Skeleton Program Tested SIRDS Image Generation Algorithm  20 Nov 03: Basic Approach Researched and Understood.  22 Nov 03: User Controllable Parameters Identified.  25 Nov 03: Image Generation Algorithm Finished  29 Nov 03: Algorithm Integrated into Skeleton Program  02 Dec 03: Final Product Testing and Deliverables Preparation