Methods Anti-Aliasing Super Sampling

Slides:



Advertisements
Similar presentations
5.1 Si23_03 SI23 Introduction to Computer Graphics Lecture 5 – Drawing A Line.
Advertisements

CS 445 / 645 Introduction to Computer Graphics Lecture 18 Antialiasing Antialiasing.
Line Drawing Algorithms. Rasterization-Process of determining which pixels give the best approximation to a desired line on the screen. Scan Conversion-Digitizing.
Computer Graphics Viewing, Rendering, Antialiasing گرد آوري و تاليف: دكتر احمد رضا نقش نيل چي دانشگاه اصفهان گروه مهندسي كامپيوتر.
CS 551 / CS 645 Antialiasing. What is a pixel? A pixel is not… –A box –A disk –A teeny tiny little light A pixel is a point –It has no dimension –It occupies.
CS 376 Introduction to Computer Graphics 02 / 05 / 2007 Instructor: Michael Eckmann.
University of British Columbia CPSC 414 Computer Graphics © Tamara Munzner 1 Sampling Week 7, Fri 17 Oct 2003 p1 demos sampling.
Aliasing and Anti-Aliasing Copyright Zachary Wartell, University of North Carolina at Charlotte, All Rights Reserved Revision: 10/24/2007 3:38:00 AM ©Zachary.
Computer Graphics, KKU. Lecture 9
Circle Drawing algo..
Quadratic Expressions and Equations Expanding quadratic expressions using the grid method (C)
Sampling theorem In order to accurately reconstruct a signal from a periodically sampled version of it, the sampling frequency must be at least twice the.
DTFT And Fourier Transform
Geometric Objects Computer Graphics Lab. Sun-Jeong Kim.
CGMB214: Introduction to Computer Graphics
1 Image Basics Hao Jiang Computer Science Department Sept. 4, 2014.
Graphics Graphics Korea University cgvr.korea.ac.kr Raster Graphics 고려대학교 컴퓨터 그래픽스 연구실.
1 Introduction Line attribute Color and gray scale Area filled attribute Anti-aliasing.
1 Aliasing & Anti-Aliasing. 2 What is aliasing? An artifact (loss of detail and false details) Caused by discretization (finite resolution) A rasterized.
Computational Biology, Part 22 Biological Imaging II Robert F. Murphy Copyright  1996, 1999, All rights reserved.
H M V Amortized Supersampling Dec. 18, 2009, Pacifico Yokohama, Japan L EI Y ANG H, D IEGO N EHAB M, P EDRO V. S ANDER H, P ITCHAYA S ITTHI - AMORN V,
Attributes of Graphics Primitives Hearn & Baker Chapter 4 Some slides are taken from Robert Thomsons notes.
BIEN425 – Lecture 15 By the end of this lecture, you should be able to: –Design and implement integer decimators and interpolators –Design and implement.
GPU Accelerated MRI Reconstruction Professor Kevin Skadron Computer Science, School of Engineering and Applied Science University of Virginia, Charlottesville,
Lecture 13: Raster Graphics and Scan Conversion
1 Dr. Scott Schaefer Antialiasing. 2/70 What is aliasing?
Bresenham’s Line Algorithm
David Luebke 3/17/2016 Advanced Computer Graphics Antialiasing David Luebke
Attributes of Graphics Primitives Chapter 4
Objectives Understand Bresenhams line drawing algorithm. Apply the algorithm to plot a line with the end points specified.
Primitive graphic objects
Sampling Week 7, Fri 17 Oct 2003 p1 demos sampling.
Line Drawing Algorithms
MID-POINT CIRCLE ALGORITHM
Attributes of Graphics Primitives Hearn & Baker Chapter 4
Lecture 9 Line Drawing Algorithms (Bresenham’s Line Algorithm)
Vector vs. Bitmap.
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
Lecture 05: Mid-point Ellipse algorithm Dr. Manal Helal – Fall 2014
Chapter Three Part I Output Primitives CS 380.
Midterm Review Computer Graphics Hardware Point and Line Drawing
EE Audio Signals and Systems
Advanced Computer Graphics:
Antialiasing Dr. Scott Schaefer.
Computer Graphics 5: Line Drawing Algorithms
Computer Graphics 5: Line Drawing Algorithms
Joshua Barczak CMSC435 UMBC
Rasterizing Lines 2 Lecture 33 Wed, Nov 14, 2007.
Adding Decimals.
EEE 501 Applied Digital Image Processing Dr. Türker İnce
o عَلَّمَهُ الْبَيَانَ
Designing Algorithms for Multiplication of Fractions
Line Drawing Algorithms
Computer Graphics 5: Line Drawing Algorithms
數位控制理論簡介.
Designing Algorithms for Multiplication of Fractions
Scan Conversion (From geometry to pixels)
Chapter 3 Graphics Output Primitives
Primitive Drawing Algorithm
Anti-aliased and accelerated ray tracing
NOTE.
Type to enter a caption. Computer Graphics Week 1 Lecture 2.
Primitive Drawing Algorithm
Where We Stand At this point we know how to: Next thing:
Line Drawing Algorithms
Introduction to Ray Tracing
INTERACTIVE COMPUTER GRAPHICS
OUTPUT PRIMITIVES / DISPLAY TECHNIQUES
Visualizing Sea Level Rise from Temperature Record
Presentation transcript:

Methods Anti-Aliasing Super Sampling Multiple sample points across a finer grid to determine pixel intensity High Resolution Computation Low Resolution display Obtain intensity information from multiple points that contribute to intensity of pixel. Run Bresenham’s algorithm on microgrid. Set pixel intensities Aliasing Distortion of information due to low frequency sampling Under sampling Anti-aliasing Compensates for this distortion If pixels have more than one intensity Vary the intensity levels to compensate

SuperSampling Plot (0,0 to 2,1) Δx = 2, Δy = 1 Multiply both directions by 3 (adding a 3x3 grid) Plotting (microgrid) Δx = 8, Δy = 4 P0 = 2Δy – Δx = 0 0 0 K PK XK+1 YK+1 0 0 1 1 1 -8 2 1 2 0 3 2 3 -8 4 2 4 0 5 3 5 -8 6 3 6 0 7 4 7 -8 8 4 If PK < 0 plot XK+1, YK PK+1 = PK +2Δy Else plot XK+1, YK+1 PK+1 = PK +2Δy -2Δx

Anti-aliasing Normal weighting Anti-aliasing Weighted 1 2 1 2 4 2 1 2 1 1 7 3 1/3 1 7 2/3 7 3 At most 3 micro-pixels filled 4 levels of intensity (including off) 3 = full, 2 = 2/3, 1= 1/3, 0=0