SHREYAS PARNERKAR. Motivation Texture analysis is important in many applications of computer image analysis for classification or segmentation of images.

Slides:



Advertisements
Similar presentations
Processes and Threads Chapter 3 and 4 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College,
Advertisements

Gestures Recognition. Image acquisition Image acquisition at BBC R&D studios in London using eight different viewpoints. Sequence frame-by-frame segmentation.
Accelerating Real-Time Shading with Reverse Reprojection Caching Diego Nehab 1 Pedro V. Sander 2 Jason Lawrence 3 Natalya Tatarchuk 4 John R. Isidoro 4.
WHAT MAKES UP A COMPUTER BY SABRINA & BETH. MOTHERBOARD On the Computer, the Motherboard is where all the different parts are connected too work the computer.
Image Repairing: Robust Image Synthesis by Adaptive ND Tensor Voting IEEE Computer Society Conference on Computer Vision and Pattern Recognition Jiaya.
Instructor Notes This lecture discusses three important optimizations The performance impact of mapping threads to data on the GPU is subtle but extremely.
O AK R IDGE N ATIONAL L ABORATORY U. S. D EPARTMENT OF E NERGY 1 A Brief Summer Recap Flocking, CUDA, GPU, Ants, and More Jesse St.Charles.
1er. Escuela Red ProTIC - Tandil, de Abril, 2006 Principal component analysis (PCA) is a technique that is useful for the compression and classification.
1.  Texturing is a core process for modeling surface details in computer graphics applications › Texture mapping › Surface texture synthesis › Procedural.
Enhanced LIC Pencil Filter A project proposal by David Coyne.
DCABES 2009 China University Of Geosciences 1 The Parallel Models of Coronal Polarization Brightness Calculation Jiang Wenqian.
Self-Supervised Segmentation of River Scenes Supreeth Achar *, Bharath Sankaran ‡, Stephen Nuske *, Sebastian Scherer *, Sanjiv Singh * * ‡
Parallel Computation of the Minimum Separation Distance of Bezier Curves and Surfaces Lauren Bissett, Nicholas Woodfield,
Efficient Parallelization for AMR MHD Multiphysics Calculations Implementation in AstroBEAR.
Digital Image Processing
Feature extraction Feature extraction involves finding features of the segmented image. Usually performed on a binary image produced from.
Geometric Approaches to Reconstructing Time Series Data Project Update 29 March 2007 CSC/Math 870 Computational Discrete Geometry Connie Phong.
Cmpt-225 Simulation. Application: Simulation Simulation  A technique for modeling the behavior of both natural and human-made systems  Goal Generate.
Clustering Vertices of 3D Animated Meshes
Computing Platform Benchmark By Boonyarit Changaival King Mongkut’s University of Technology Thonburi (KMUTT)
IIIT Hyderabad Atif Iqbal and Anoop Namboodiri Cascaded.
A Survey of Parallel Tree- based Methods on Option Pricing PRESENTER: LI,XINYING.
DATA LOCALITY & ITS OPTIMIZATION TECHNIQUES Presented by Preethi Rajaram CSS 548 Introduction to Compilers Professor Carol Zander Fall 2012.
Efficient Pseudo-Random Number Generation for Monte-Carlo Simulations Using GPU Siddhant Mohanty, Subho Shankar Banerjee, Dushyant Goyal, Ajit Mohanty.
CuMAPz: A Tool to Analyze Memory Access Patterns in CUDA
Venkatram Ramanathan 1. Motivation Evolution of Multi-Core Machines and the challenges Summary of Contributions Background: MapReduce and FREERIDE Wavelet.
IIIT, Hyderabad Performance Primitives for Massive Multithreading P J Narayanan Centre for Visual Information Technology IIIT, Hyderabad.
Parallel Applications Parallel Hardware Parallel Software IT industry (Silicon Valley) Users Efficient Parallel CKY Parsing on GPUs Youngmin Yi (University.
Computational Biology, Part E Basic Principles of Computer Graphics Robert F. Murphy Copyright  1996, 1999, 2000, All rights reserved.
Lecture 3 : Direct Volume Rendering Bong-Soo Sohn School of Computer Science and Engineering Chung-Ang University Acknowledgement : Han-Wei Shen Lecture.
Interactive Time-Dependent Tone Mapping Using Programmable Graphics Hardware Nolan GoodnightGreg HumphreysCliff WoolleyRui Wang University of Virginia.
An efficient method of license plate location Pattern Recognition Letters 26 (2005) Journal of Electronic Imaging 11(4), (October 2002)
®® Microsoft Windows 7 for Power Users Tutorial 9 Evaluating System Performance.
Porting Irregular Reductions on Heterogeneous CPU-GPU Configurations Xin Huo, Vignesh T. Ravi, Gagan Agrawal Department of Computer Science and Engineering.
DEVELOPMENT OF ALGORITHM FOR PANORAMA GENERATION, AND IMAGE SEGMENTATION FROM STILLS OF UNDERVEHICLE INSPECTION Balaji Ramadoss December,06,2002.
Evaluating FERMI features for Data Mining Applications Masters Thesis Presentation Sinduja Muralidharan Advised by: Dr. Gagan Agrawal.
Texture scale and image segmentation using wavelet filters Stability of the features Through the study of stability of the eigenvectors and the eigenvalues.
Parallel Algorithms Patrick Cozzi University of Pennsylvania CIS Spring 2012.
Tone Mapping on GPUs Cliff Woolley University of Virginia Slides courtesy Nolan Goodnight.
Ch 4. Linear Models for Classification (1/2) Pattern Recognition and Machine Learning, C. M. Bishop, Summarized and revised by Hee-Woong Lim.
A Parallel Implementation of MSER detection GPGPU Final Project Lin Cao.
IIIT Hyderabad Scalable Clustering using Multiple GPUs K Wasif Mohiuddin P J Narayanan Center for Visual Information Technology International Institute.
Implementing GIST on the GPU. Refrence Original Work  Aude Oliva, Antonio Torralba  Modeling the shape of the scene: a holistic representation of the.
QCAdesigner – CUDA HPPS project
Levels of Image Data Representation 4.2. Traditional Image Data Structures 4.3. Hierarchical Data Structures Chapter 4 – Data structures for.
Computer Vision Chapter 1 Introduction.  The goal of computer vision is to make useful decisions about real physical objects and scenes based on sensed.
Big data Usman Roshan CS 675. Big data Typically refers to datasets with very large number of instances (rows) as opposed to attributes (columns). Data.
Supervisor: Nakhmani Arie Semester: Winter 2007 Target Recognition Harmatz Isca.
Discontinuous Displacement Mapping for Volume Graphics, Volume Graphics 2006, July 30, Boston, MA Discontinuous Displacement Mapping for Volume Graphics.
Introducing Error Co-variances in the ARM Variational Analysis Minghua Zhang (Stony Brook University/SUNY) and Shaocheng Xie (Lawrence Livermore National.
MACHINE LEARNING 7. Dimensionality Reduction. Dimensionality of input Based on E Alpaydın 2004 Introduction to Machine Learning © The MIT Press (V1.1)
Sudhanshu Khemka.  Treats each document as a vector with one component corresponding to each term in the dictionary  Weight of a component is calculated.
CUDA Memory Types All material not from online sources/textbook copyright © Travis Desell, 2012.
Threads. Readings r Silberschatz et al : Chapter 4.
Heterogeneous Computing using openCL lecture 4 F21DP Distributed and Parallel Technology Sven-Bodo Scholz.
Performed by:Liran Sperling Gal Braun Instructor: Evgeny Fiksman המעבדה למערכות ספרתיות מהירות High speed digital systems laboratory.
Fast and parallel implementation of Image Processing Algorithm using CUDA Technology On GPU Hardware Neha Patil Badrinath Roysam Department of Electrical.
Color Image Segmentation Mentor : Dr. Rajeev Srivastava Students: Achit Kumar Ojha Aseem Kumar Akshay Tyagi.
Accelerating K-Means Clustering with Parallel Implementations and GPU Computing Janki Bhimani Miriam Leeser Ningfang Mi
Copyright ©2008, Thomson Engineering, a division of Thomson Learning Ltd.
From Turing Machine to Global Illumination
Speedup over Ji et al.'s work
ECE 759 Project Presentation University of Wisconsin - Madison
University College London (UCL), UK
Array Processor.
NVIDIA Fermi Architecture
Static Image Filtering on Commodity Graphics Processors
Parallelization of Sparse Coding & Dictionary Learning
6- General Purpose GPU Programming
Presentation transcript:

SHREYAS PARNERKAR

Motivation Texture analysis is important in many applications of computer image analysis for classification or segmentation of images based on local spatial variations of intensity or color. Applications include industrial and biomedical surface inspection, for example for defects and disease, segmentation of satellite or aerial imagery, segmentation of textured regions in document analysis. Most texture classification methods derive features based on output of large filter banks (13 – 48 dimensional feature space).

Motivation Tuzel et al. use image intensities and first and second order derivatives of intensities in both x and y direction for texture classification which results in a 5 dimensional feature space. These features are used to calculate co-variance matrices using Integral images (P & Q). Calculation of integral images is computationally intensive because of highly nested loops.

Algorithm: Integral Image Calculations

Dependence Graph ROWS COLUMNS

GPU Utilization concerns Such scheduling results in a maximum of W or H elements to be executed in parallel. But at other instances, it is always less than the maximum. GPU utilization drops down resulting in slow-down since plenty of threads are idle. Such scheduling is hence not good for GPU implementation.

Memory Concerns Shared Memory Limited to 4kB. Cannot put entire image in shared memory. Global memory is slow compared to shared memory. Uploading entire image in global memory causes interference with the graphic display (??). Put just the required data in shared memory. Required data can be entire image.

Updated Dependence Graph COLUMNS ROWS COLUMNS + =

Results

CPU Over- Head

Results

Yet to come…. Scope to improve the speed up

In Conclusion… Implement parallel reduction for even more speed up. (In progress) Use calculated P-Q integral images to calculate covariance. ( Can be done on CPU ) Read Data from actual images (Currently sample random data is generated). Compare Memory Usage for CPU vs GPU implementation.