# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

2 Pages

### Lab6

Course: REU 06, Fall 2009
School: Utah State
Rating:

Word Count: 741

#### Document Preview

Site REU Program in CVIP Summer 2006 Lab 6 Exercise on Filter Techniques in Frequency Domain The extra notes related to frequency domain can be downloaded at the following website: http://www.cs.usu.edu/~xqi/Teaching/REU06/Notes/Supplements.pdf Problem 1: Exercises on Low-pass and High-pass Filters in the Frequency Domain a) Design a butterworth low-pass filter of order 2 with a cutoff frequency of 80 in the...

Register Now

#### Unformatted Document Excerpt

Coursehero >> Utah >> Utah State >> REU 06

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Site REU Program in CVIP Summer 2006 Lab 6 Exercise on Filter Techniques in Frequency Domain The extra notes related to frequency domain can be downloaded at the following website: http://www.cs.usu.edu/~xqi/Teaching/REU06/Notes/Supplements.pdf Problem 1: Exercises on Low-pass and High-pass Filters in the Frequency Domain a) Design a butterworth low-pass filter of order 2 with a cutoff frequency of 80 in the frequency domain. Obtain the filtered image by filtering the original image Sample with the designed butterworth filter. Display the original image, the butterworth low-pass filter (treat it as an image), and the filtered image in figure 1 with the appropriate titles. b) Repeat the step a) by using the corresponding high-pass filter. Display the corresponding images (original image, high-pass filter, and filtered image) in figure 2 with the appropriate titles. c) Close all figures and all variables in the workspace. Problem 2: Exercise on Certain Operations in the Frequency Domain a) Take the FT (Fourier Transform) of the two images Sample and NewCapitol (Note: You need to do the centering so the DC component will be in the center). Display the magnitude and the phase of the two FTed images in figure 1 with the appropriate titles. Conduct an inverse FT on each FTed image by using only its magnitudes. Conduct an inverse FT on each FTed image by using only its phases. Display the four corresponding reconstructed images in figure 2 with appropriate titles. Exchange the phase components of the two FTed images and take an inverse FT. Display the two corresponding reconstructed images in figure 3 with appropriate titles. b) Take the FT of the Lena image. First, set the phase equal to zero, and take the inverse FT. Display the reconstructed image in figure 4 and explain why the resulting image looks nothing like the original via display command. Then, let the phase be the original one and respectively set the magnitude equal to 100 and equal to the average of the original magnitude values and take the inverse FT. Display the two reconstructed images in figure 5 and explain the effect of the different magnitudes via display command. Problem 3: Remove Additive Cosine Noise The noisy image boy_noisy.gif has been generated by adding some noise in the form of a cosine function. Your is goal to remove the cosine interference. This can be done as follows: a) Compute the DFT of the noisy image. b) Compute the magnitude and find the frequencies corresponding to the four largest distinct magnitudes (do not consider the magnitude at the center - very large values) c) Replace each one of these magnitude values by the average of its 8 neighbors (do this averaging both for the real and imaginary parts). d) Take the inverse DFT transform and display the original image and the resulted image side-by-side in figure 1 with the appropriate titles. e) Explain why the four largest distinct values of the magnitude were chosen to do the processing via Matlab display command. f) Close all figures and all variables in the workspace. Problem 4: Preliminary Wavelet Transform 1 a) Apply a maximum-level db2 wavelet decomposition on Lena.jpg by using appropriate Matlab function(s). You need to use an appropriate Matlab function to get the maximum decomposition level. Apply the inverse wavelet transform to restore the image. Use if-else statement to compare your restored image with the original image so the appropriate message indicating the equality or inequality between these two images should be displayed. b) Apply a three-level db2 wavelet decomposition on Lena.jpg by using appropriate Matlab function(s). For each subband image at the horizontal, vertical, and diago...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Utah State - REU - 06
REU Site Program in CVIP Summer 2006 Lab 1 Matlab Warm-up Exercises Problems: 1. Load the image peppers.bmp into a variable A. Display the loaded image A on figure 1 with the message &quot;RGB Original Image&quot; as the figure title. {Think: What is the data
Utah State - REU - 06
Outline Classification MethodsXiaojun Qi Cluster Seeking: K-Means algorithm Feature Selection: Karhunen-Love Expansion Principal Components Analysis (PCA) Classification: Linear Discriminant Analysis (LDA) Statistical Classification: Quadratic
Utah State - CS - 3100
1 2Chapter 13: I/O Systems Chapter 13: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Streams Performance3Objectives Explore the structure of an OSs I/O subsystem
Utah State - CS - 3100
1 2Chapter 3: Processes Chapter 3: Processes Process Concept Process Scheduling Operations on Processes Cooperating Processes Interprocess Communication Communication in Client-Server Systems3Process Concept An operating system executes
Utah State - CS - 5400
xVertex Arrays Efficiency Number of function calls Redundant specification of vertices Enable Arrays glEnableClientState(GLenum array); GL_VERTEX_ARRAY GL_COLOR_ARRAY GL_INDEX_ARRAY GL_NORMAL_ARRAY GL_TEXTURE_COORD_ARRAY GL_EDGE_FLAG_ARRAY Enabling
Utah State - CS - 6890
Network Security Relies on host and application security Networks allow computers to communicate Vulnerabilities are exposed to the world Network accessible vs. inaccessible programs Eavesdropping and network vulnerabilitiesBasic Terminology
Utah State - CS - 6890
Master Project ReportStudent: Min Wu Director: Robert F. Erbacher1Text Categorization Techniques for Intrusion Detection - A N-Gram-Based MethodMin Wu minwu@cs.albany.eduAbstractText categorization techniques have been used in anomaly intru
Utah State - CS - 3100
1 2Chapter 1: Introduction Chapter 1: Introduction What Operating Systems Do Computer-System Organization Computer-System Architecture Operating-System Structure Operating-System Operations Process Management Memory Management Storage M
Utah State - CS - 3100
Chapter 3: Processes Process Concept Process Scheduling Operations on Processes Cooperating Processes Interprocess Communication Communication in Client-Server SystemsChapter 3: ProcessesProcess Concept An operating system executes program
Utah State - CS - 3100
Chapter 1: Introduction What Operating Systems Do Computer-System Organization Computer-System Architecture Operating-System Structure Operating-System Operations Process Management Memory Management Storage Management Protection and Secu
Utah State - CS - 3100
Chapter 8: Memory Management Background Swapping Contiguous Allocation Paging Segmentation Segmentation with PagingChapter 8: Memory ManagementBackground Program must be brought into memory and placed within a process for it to be run Inp
Utah State - CS - 5400
Explicit RepresentationDependant variable is given in terms of the Independant Variable y=f(x) x=g(y), inverted relationship or in 3D y=f(x), z=g(x) surface, z=f(x, y)Implicit Representationf(x, y)=0 line, ax+by+c=0 circle, x2+y2-r2=0 Membership
Utah State - CS - 3100
Objectives To describe the services an operating system provides to users, processes, and other systems To discuss the various ways of structuring an operating system To explain how operating systems are installed and customized and how they boot
Utah State - CS - 6890
OS Security Host-based security Multi-programmed environment Shared resources Programs can interfere with one another Separate from networked issuesObjects Require Protection Memory Sharable IO devices Serially reusable devices, printers
Utah State - CS - 5890
Gene Expression an Overview of Problems &amp; Solutions: 3&amp;4Utah State University Bioinformatics: Problems and Solutions Summer 2006ReviewConsidering several problems &amp; solutions with gene expression data Previously:1: Data quality checks (GIGO; us
Utah State - CS - 6890
Similar Sequence Similar FunctionCharles Yan Spring 2006From Sequence to FunctionProtein sequence determine protein function. Thus similar protein sequences have similar functions One approach to predict function for a new protein is to sea
Utah State - CS - 6670
Matching Problems in BioinformaticsCharles Yan Fall 2008Matching ProblemGiven a string P (pattern) and a long string T (text), find all occurrences, if any, of P in T.Example T: Given a string P (pattern) and a long string T (text), find all o
Utah State - CS - 6890
Gene FindingCharles Yan 1Gene FindingContent sensors Extrinsic content sensorsIntrinsic content sensorsCompare with protein sequences Compare with cDNA and ESTs Genomic comparisons Prediction methodsSignal sensors 2In
Utah State - CS - 5050
ShortestPaths8 B 2 8 2 7 5 E 3 C A 0 4 1 8 F D 5 3 2 9ShortestPaths1OutlineandReadingWeightedgraphs(7.1) Shortestpathproblem Shortestpathproperties Algorithm EdgerelaxationDijkstrasalgorithm(7.1.1) TheBellmanFordalgorithm(7.1.2) Short
Utah State - CS - 6670
Inexact MatchingCharles Yan 2008 1Longest Common Subsequence Given two strings, find a longest subsequence that they share substring vs. subsequence of a string Substring: the characters in a substring of S must occur contiguously in
Utah State - CS - 6100
Intelligence Agents(Chapter 2)1An Agent in its EnvironmentAGENT Sensor Input action outputENVIRONMENT2Agent Environmentsaccessible (get complete state info) vs inaccessible environment (most real world environments) episodic (temporary
Utah State - CS - 5050
Computational Geometry Chapter 121Range queries How do you efficiently find points that are inside of a rectangle? Orthogonal range query ([x1, x2], [y1,y2]): find all points (x, y) such that x1&lt;x&lt;x2 and y1&lt;y&lt;y2 Useful also as a multi-attribu
Utah State - USU - 1360
ErrorsData Errors: Human error Bad Measurements Modeling Errors:Wrong formula Incorrect assumption Incorrect assumptionImplementation Errors:1999 Mars Orbiter lost as Lockheed Martins programmed using English units but NASA used metric units.
Utah State - CS - 5070
Great Principles Project Principles Summary 8/22/07ComputationThese principles define the nature of computational processes, both natural and artificial: what they can and cannot do, and how we cope with inherent and pervasive computational compl
Utah State - CS - 6100
Homework 7 CS 6100 (can be done in groups of 1,2, or 3) Old Exam 2 (Fall 2007) + two questionsFill in the blank using the technical description (1 point each)1. In negotiation, the situation of &quot;if I can help you without hurting me, I will&quot; is ter
Utah State - CS - 5070
Coordination Principles8/12/07These principles concern how autonomous entities work together toward a common result. A coordination system is a set of agents interacting within a finite or infinite game toward a common objective. A. Agents can be
Utah State - CS - 7100
Fuzzy Kernel-Stable Coalitions Between Rational AgentsBastian BlankenburgMatthias KluschDFKI - German Research Center for Artificial Intelligence Stuhlsatzenhausweg 3 66123 Saarbrucken, Germany Onn ShehoryIBM - Haifa Research Lab Tel Aviv Sit
Utah State - CS - 5050
Graphs Chapter 64 17 3802SFO3371843ORDLAX1233DFWGraphs1Graph A graph is a pair (V, E), where V is a set of nodes, called vertices E is a collection (can be duplicated) of pairs of vertices, called edges Vertices and edges are
Utah State - CS - 6100
Dynamic PricingPeter R. Wurman North Carolina State UniversityE-commerce Big PictureInfrastructureTCP/IP HTTP &amp; HTML Anonymity Databases EncryptionE-commerce Big PictureMake ContactWeb mining Data mining XMLRecommendationsInfrastructure
Utah State - CS - 5050
Maximum Flow4/6 s 3/5 v 1/1 3/3 1/1 u 2/2 w 3/3 4/7 1/9 z t 3/51Maximum FlowFlow Network A flow network (or just network) N consists of A weighted digraph G with nonnegative integer edge weights, wherethe weight of an edge e is called the
Utah State - CS - 5050
Chapter 7 Shortest Paths8 B 2 8 2 7 5 E 3 C A 0 4 1 8 D 5 32 9F1Shortest PathsWeighted Graphs In a weighted graph, each edge has an associated numerical value,called the weight of the edge Edge weights may represent, distances, costs,
Utah State - CS - 2420
Traversals of a graphHamiltonian TourHamiltonian path/tour: find a path through the graph such that every vertex is visited exactly once. If you must begin and end at the same point, it is a tour. Otherwise, it is a path. (NP complete) There is no
Utah State - CS - 2420
Chapter 15 Graphs and PathsYou know about trees. They have a rigid structure of each node have a single node that points to it (or none, in the case of the root). Sometimes life isn't so structured. For example: I need to fly to Tokyo. I want to fin
Utah State - CS - 6100
Ideas for 6100 topics. The most important thing is to find something you like. If you do what you like, you won't &quot;work&quot; a day on it. The digital libraries are WONDERFUL. One approach to finding a topic would be: 1. Thumb through the class text looki
Utah State - CS - 5050
R-7.2 (15 points) Algorithm ModifiedDijkstra (G, v) Input: A simple directed graph G with nonnegative edge weights and a vertex v. Output: A label D[u] for each vertex u, such that D[u] is the shortest distance from v to u in G for all u G.vertices(
Utah State - CS - 4700
Sample Midterm Questions 1. In a program you try to compile, if you mistype the constant integer &quot;Count12&quot; as &quot;Count 12&quot;, when would this error be recognized? 2. At lexical analysis 3. At parsing 4. At code generation 5. At load time 2. Your employer
Utah State - FIE - 2000
Session A TECHNOLOGY-ENHANCED LEARNING ENVIRONMENT FOR A GRADUATE/UNDERGRADUATE COURSE ON OPTICAL FIBER COMMUNICATIONSH. Scott Hinton1, Roberto Gonzalez2, Laura L. Tedder3, Sandeep Karandikar4, Harpreet Behl5, Paul C. Smith6, John Wilbanks7, James H
Utah State - FIE - 2000
Session VIRTUAL CIRCUIT LABORATORYHess Hodge1, H. Scott Hinton2, and Michael Lightner3Abstract We present the rationale, implementation and performance features of a virtual lab environment for an electronic circuits course. The primary purpose of
Utah State - ECE - 470
Group #3 Kelvin Khor James F. Kreycik Vivek Kurisunkal Justin Marz Nevin Mcchesney Team Problems (2.18, 2.19, Matlab, 1.1, 1.5, 1.6, 1.7, 1.8) 2.18 Electron Energy: Hydrogen atom En = - mo e 4 [ J s] 2 (4 0 ) 2 h2 n 2 -(9.11 10-31 ) (1.60 10-19
Utah State - ECE - 470
Group #2 Bryce Haas David Hawk Bradley Henry Justin Hermann Peter Hindman EECS 470 Problem Set #2 (1.1, 1.5, 1.6, 1.7, 1.8, 2.18, 2.19, and program) 1.1 a) Face-centered cubic corners 8 1 [atoms] = 1 [atom] 8 sides 6 1 [atoms ] = 3 [atoms ] 2 tot
Utah State - PROC - 250
LEGEND{ascii_file}{graphics_file}Plots a geological legend based on information recorded in an ascii file. Arguments {ascii_file} - name of the ascii file to be read containing information about the geological legend. The default file name lege
Utah State - PROC - 250
/* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /* /** GEOLOGICAL SURVEY OF CANADA --Name: cndlogo.aml Usage: CNDLOGO &lt;UL | CL | LL | UC | CC | LC | UR
Utah State - PROC - 250
7 findreplace.menu /* /* Called by: editanno.menu /* Calls made: findreplace.aml /* /* Description: Menu for entering find and replace annotation strings. /* Find string: %findstring Replace with: %replacestring %proceed %findstring input .ae\$findstr
Utah State - SANTANDER - 2
=eduCommons 2.2.0-final Localization=Summary-Since eduCommons is customized from Plone, it has built-in support for localization of menus,controls, and other chrome. As of June 2006 Plone is available in 56 different translations.eduCommons r
Utah State - EDUCOMMONS - 3
=LinguaPlone Translation Instructions=In the context of Department, Course, and ECObjects, translations must occur in a 'top down'manner. A Department must be translated prior to translating a Course, which must betranslated prior to any objec
Utah State - FRWS - 3800
Deserts in General Regions of sparse life largely because of usual aridity of their climate Biological definition Structurally simple but functionally complex, characterized by contracted to absent perennial vegetation; ephemerals when wet. Ephem
Utah State - RS - 6740
Sean Hammond Assignment #1/ Prospectus FRWS 6740 The project I wish to do coincides directly with my masters project. More specifically my objective is to explore the potential of classifying imagery by fuel loading. The objective is to classify fuel
Utah State - C - 5
These slides have been prepared as a general guide for preparing training data for USGS canopy and impervious predictions. These images have all been classified using different methods, but regardless of the method the end product is what is importan
Utah State - C - 5
NLCD2001 C5 and Cubist TrainingMike Coan (coan@usgs.gov) Limin Yang, Chengquan Huang, Bruce Wylie, Collin Homer Land Cover Strategies TeamEROS Data Center, USGS June 2003Overview Classification tree C5/See5 General description of the algorith
Utah State - C - 5
The following slides are intended to provide a few examples of some problems and issues that come up in Landcover mapping. This will be an ever-growing presentation as more issues and clear examples will arrive in the future. Please feel free to cont
Utah State - PHOTOS - 2
02/01/2004 11:04 AM 5,083,210 AZ020104RM006_1.JPG02/01/2004 11:04 AM 4,531,054 AZ020104RM006_2.JPG02/02/2004 10:00 AM 3,876,458 AZ020204RM001_1.jpg02/03/2005 02:42 PM 657,842 AZ020204RM001_2.jpg05/24/2002 10
Utah State - GIS - 4930
Goals for this week (Sept. 9 - 11)Projections Data storage formats Database Management Systems (tabular) Graphic Database Structure raster, vector, surficial Data compressionRDBMS in GISMedian income in cache county by census tract (19
Utah State - GIS - 4930
Sept 16 - 18Data entry (digitizing, scanning) Editing geodata Quality control and error checking Tiles Edgematching Georeferencing and transformationsEditing geodataOnce you have completed initial data entry, you will still need to clean
Utah State - GIS - 4930
Sep 30 - Oct 2Geographic objects Lowlevel vs. highlevel objects Spatial measurement Calculating area, length, shape, distanceFunctional distance ReclassificationFunctional distanceTuesday, we discussed conceptually the idea of functional
Utah State - GIS - 4930
Goals for this week (Sept. 9 - 11)Projections Data storage formats Database Management Systems (tabular) Graphic Database Structure raster, vector, surficial Data compressionProjectionsIn projecting a map, you are attempting to represen
Utah State - GIS - 4930
Goals for this weekUnderstanding geographicacy Understanding cartographic communication Relationship of scale to cartography Map symbolism Know different families of map projections Familiarity with some geographic grid systems Understand the
Utah State - GISCLASS - 2005
ArcGIS CustomizationsAny customizations added to the normal.mxt template will always be available from ArcGIS when the same user is logged onto the machine (this file is saved in &quot;\Documents and settings\&lt;profile_name&gt;\Application Data\ESRI\ArcMap\T
Utah State - GISCLASS - 2005
Customizing ArcGISWhy learn customization? Make the software suit your preferences Automate repetitive tasks Use tools from other sources Increase the power of the software Looks great on a resumCustomization levels Project-specific saved
Utah State - STREAMREST - 08
Version 4.0.0 March 2008Section - Arrays SizesPlan 01 1 1 0 27 90 F 7 1 0 0 9 9 0 0 0 0
Utah State - STREAMREST - 08
Proj Title=Design Exercise - Generic HEC RAS ModelCurrent Plan=p01Default Exp/Contr=0.3,0.1English UnitsGeom File=g01Flow File=f01Plan File=p01Y Axis Title=ElevationX Axis Title(PF)=Main Channel DistanceX Axis Title(XS)=StationBEGIN DESCRIP
Utah State - STREAMREST - 08
1.0591257542558040.0000000000000000.000000000000000-1.059287684282477460409.9029325585000004484271.707987529200000