November 2005 IP-Racine FP6 Integrated Project WP6.2.1 : Affine Manipulation and Image Mapping A key aim of the work on representation and image manipulation.

Slides:

Advertisements

Similar presentations

AP Calculus Notes Section 1.2 9/5/07.

Advertisements

Creative Computing. \\ aims By the end of the session you will be able to: 1.Explain the difference between various image file formats 2.Load in and display.

Disk Storage, Basic File Structures, and Hashing

1.8 Combinations of Functions: Composite Functions The composition of the functions f and g is “f composed by g of x equals f of g of x”

Synthesis, Analysis, and Verification Lecture 04c Lectures: Viktor Kuncak VC Generation for Programs with Data Structures “Beyond Integers”

Compiler Support for Superscalar Processors. Loop Unrolling Assumption: Standard five stage pipeline Empty cycles between instructions before the result.

Composition of functions constructing a function from 2 functions (g o f) = g[f(x)] –for all x in domain of f such that f(x) is in domain of g –f is applied.

In today's media centric consumer environment the movie going audience has come to expect to see the smooth inclusion of computer animated graphics.

Elementary Data Types Prof. Alamdeep Singh. Scalar Data Types Scalar data types represent a single object, i.e. only one value can be derived. In general,

1 Improving the Performance of Distributed Applications Using Active Networks Mohamed M. Hefeeda 4/28/1999.

Isoparametric Elements Element Stiffness Matrices

Predecessor to the Database: Traditional File Processing Records are stored in files. Programs are customized to process the data.

2/7/2001Hofstra University – CSC290B1 Review: Math (Ch 4)

CS263 Lecture 19 Query Optimisation.  Motivation for Query Optimisation  Phases of Query Processing  Query Trees  RA Transformation Rules  Heuristic.

Transfer Functions Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: The following terminology.

METU Department of Computer Eng Ceng 302 Introduction to DBMS Disk Storage, Basic File Structures, and Hashing by Pinar Senkul resources: mostly froom.

Copyright © 2007 Ramez Elmasri and Shamkant B. Navathe Chapter 13 Disk Storage, Basic File Structures, and Hashing.

Elementary Data Types Scalar Data Types Numerical Data Types Other

The Implicit Mapping into Feature Space. In order to learn non-linear relations with a linear machine, we need to select a set of non- linear features.

Introduction to Computer Graphics

MULTIMEDIA TECHNOLOGY SMM 3001 MEDIA - GRAPHICS. In this chapter how the computer creates, stores, and displays graphic images how the computer creates,

1.A file is organized logically as a sequence of records. 2. These records are mapped onto disk blocks. 3. Files are provided as a basic construct in operating.

TERMS TO KNOW. Programming Language A vocabulary and set of grammatical rules for instructing a computer to perform specific tasks. Each language has.

Digital Images Chapter 8 Exploring the Digital Domain.

Java Security. Topics Intro to the Java Sandbox Language Level Security Run Time Security Evolution of Security Sandbox Models The Security Manager.

Computer Systems Nat 4.5 Computing Science Data Representation Lesson 4: Storing Graphics EXTENSION.

1 6 Further System Fundamentals (HL) 6.2 Magnetic Disk Storage.

Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 17 Disk Storage, Basic File Structures, and Hashing.

CNIT 133 Interactive Web Pags – JavaScript and AJAX JavaScript Environment.

3. Multimedia Systems Technology

CS654: Digital Image Analysis Lecture 3: Data Structure for Image Analysis.

Huffman Encoding Veronica Morales.

Chapter 13 Query Processing Melissa Jamili CS 157B November 11, 2004.

Vladimír Smotlacha CESNET Full Packet Monitoring Sensors: Hardware and Software Challenges.

1 Chapter 17 Disk Storage, Basic File Structures, and Hashing Chapter 18 Index Structures for Files.

Chapter 1 Data Storage © 2007 Pearson Addison-Wesley. All rights reserved.

Functions Section 1.4. Relation The value of one variable is related to the value of a second variable A correspondence between two sets If x and y are.

File Structures. 2 Chapter - Objectives Disk Storage Devices Files of Records Operations on Files Unordered Files Ordered Files Hashed Files Dynamic and.

Lecture 7: Intro to Computer Graphics. Remember…… DIGITAL - Digital means discrete. DIGITAL - Digital means discrete. Digital representation is comprised.

Computer Systems Nat 4.5 Computing Science Data Representation Lesson 4: Representing and Storing Graphics EXTENSION.

1 Chapter 7 Skip Lists and Hashing Part 2: Hashing.

INTRODUCTION TO GIS  Used to describe computer facilities which are used to handle data referenced to the spatial domain.  Has the ability to inter-

Image Processing A Study in Pixel Averaging Building a Resolution Pyramid With Parallel Computing Denise Runnels and Farnaz Zand.

Honours Graphics 2008 Session 2. Today’s focus Vectors, matrices and associated math Transformations and concatenation 3D space.

Map image compression for real-time applications UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER SCIENCE Image Compression Research group:

Procedures and Functions Procedures and Functions – subprograms – are named fragments of program they can be called from numerous places  within a main.

Alice terms Chapter 2. camelCase CamelCase is the practice of writing compound names without spaces, but capitalizing the first letter of each name that.

Aim: How do we evaluate algebraic expressions? Do Now: Evaluate. 1. (-4) 2 ÷ [(6+2) ] (6 × ) 3. ( * 5) ÷ 12 √100.

Computer Systems Nat 5 Computing Science Data Representation

Transfer Functions Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: The following terminology.

Everything is a number Everything in a computer memory and on storages is a number. Number  Number Characters  Number by ASCII code Sounds  Number.

MPEG-4 Binary Information for Scenes (BIFS)

Binary Notation and Intro to Computer Graphics

Type Checking Generalizes the concept of operands and operators to include subprograms and assignments Type checking is the activity of ensuring that the.

INTRODUCTION TO GEOGRAPHICAL INFORMATION SYSTEM

Transfer Functions Chapter 4

Adobe Flash Professional CS5 – Illustrated

Intermediate 2 Computing

The University of Adelaide, School of Computer Science

UNIT SELF-TEST QUESTIONS

Images in Binary.

Eugene Gavrin – MSc student

Math I Quarter I Standards

Functions and Their Graphs

Find a power series representation for the function {image}

Computer Systems Nat 4.5 Computing Science Data Representation

Evaluate the integral. {image}

Relations/Sequences Objective: Students will learn how to identify if a relation is a function. They will also be able to create a variable expression.

Find a power series representation for the function {image}

Evaluate the integral {image}

Presentation transcript:

November 2005 IP-Racine FP6 Integrated Project WP6.2.1 : Affine Manipulation and Image Mapping A key aim of the work on representation and image manipulation -Pixel independent representing images (IP image) that assuming the image sequence is a continuous function -IP image uses a superposition of polynomial functions at different scales -IP image functions have 3 real variables restricted to the range 0..1 for x and y and 0..t for time -Image manipulation is delay evaluated

November 2005 IP-Racine FP6 Integrated Project IP Image Representation A Racine IP I is resolution independent, which can be represented as Monadic manipulation can be represented as H M = MApply(M, H s ) Where H s is the source image and H d the destination image and M is a monadic operator. Dyadic manipulation can be represented as H D = DApply(D, H s1, H s2 ) Where H s1 H s2 are the source images and H d the destination image and D is a dyadic operation.

November 2005 IP-Racine FP6 Integrated Project Functions on IP Image We treat IP images as functions. Manipulations on IP images are regarding a composition of functions. The evaluation of an image is defined in terms of the evaluation of its composed functions: The evaluation is defined either on a point in space/time or over a set of points in space/time. It is evident that if such compositions are to be stored in a file and can be subsequently loaded and evaluated, then the process of defining the manipulation API is indirect.

November 2005 IP-Racine FP6 Integrated Project Delayed Image Evaluation An edit session creates a composed set of image pyramids in heap 1, and these are then written to disk. They can be transmitted between sites on magnetic store and then restored to a second heap, from which they are rendered. We are pursuing a delayed evaluation approach pioneered by Friedman (Friedman 1976). The image evaluation will be delayed until it is required * Non-destructive manipulation. * Non-linear, dynamic manipulation. * Reusability

November 2005 IP-Racine FP6 Integrated Project Manipulation Functions Combinators combine functions by performing composition, reduction, fork, currying and generalised matrix product. Functions over points Primitive operators We will need functions over points in several contexts. Images themselves can be viewed as functions. We assume that the basic operations of arithmetic are defined over functions and that in addition we have a matrix product operation to allow affine transforms. We use a byte-code representation of the image manipulation expressions. Expressions are made up of nodes, each of which has a byte code header followed by one or more data fields. Combinators