dip3d Computing Structural Dip Program dip3d Computation flow chart Volumetric Attributes: Program dip3d

Size: px
Start display at page:

Download "dip3d Computing Structural Dip Program dip3d Computation flow chart Volumetric Attributes: Program dip3d"

Transcription

1 Comuting Structural Di Program di3d Comutation flow chart Program di3d uses a seismic amlitude volume as its inut and generates estimates of inline di, crossline di, di magnitude, di azimuth, and a confidence measure of these estimates The inline and crossline di comonents are critical for almost all subseuent AASPI comutations The di magnitude and di azimuth are useful if you wish to dislay di azimuth modulated by di magnitude using the multiattribute dislay rograms hllot, hslot, hlslot, or corender The confidence volume is used to remove artifacts in the di volumes using rogram filter_di_comonents Initially, these inut seismic amlitude volume would be either your time- or deth-migrated amlitude or acoustic imedance However, as we rogress through the AASPI software, we shall wish to recomute the di comonents from the data that have been subjected to structure-oriented filtering using the rogram sof3d, or have been sectrally balanced using the rograms sec_cm or sec_cwt Seismic amlitude di3d Inline di Crossline di Confidence Di magnitude Di azimuth Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page

2 Parameter descrition To begin, at the to of the aasi_util GUI, click the Volumetric Attributes tab, located to the right of the File tab A down dro menu will aear containing the major AASPI rograms di3d, filter_di_comonents, similarity3d, sof3d, curvature3d, aarent_cmt, euler_curvature, glcm3d, and disorder In general, we will roceed from to to bottom, with the outut of di3d being reuired inut for similarity3d, sof3d, curvature3d, and glcm3d AASPI has AASPI Workflows (Batch Mode), with which you can run set of rograms in seuence with one click, which saves time and effort The outut of sof3d can be used for either di3d or similarity3d, roviding iterative structure-oriented filtering caabilities The following GUI should aear: Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page

3 Click () Browse, and select d_mig_gsb_smallh as your inut seismic data set You also need to () choose a uniue roject name, which will be tacked on to an attribute descritor to organize the outut We urosely used the roject name reviously used in the conversion from segy to AASPI format, but this is not necessary Tye in GSB_small Then (3) select a Suffix If this is the original migrated data and you wish to distinguish between it and a data volume that has gone through two asses of structure-oriented filtering, you might give this run a Suffix = 0 or Suffix = orig, and the nd run a Suffix = c_ Under the Primary arameters tab, note that the default di search will be from -0 0 to +0 0 at increments of 5 0 The reflectors in the GSB_small survey are very flat, rarely exceeding 5 0 Therefore, set the value of (4) Theta Max = 5 0, and (5) Delta Theta = 3 0 The discrete searches will occur over inline di comonents,, and crossline di comonents,, forming a radial grid of discrete dis as described in the algorithm imlementation box Thus, for the values of 5 and 3 above, there will be 9 discrete semblance evaluations along candidate dis Doubling the di search range (Theta Max) but retaining the same search increment (Delta Theta) would uadrule the comutational effort Note that this search is more exhaustive than that rovided in commercial algorithms which limit the search to inline and crossline ((5++5)+(5+5)= discrete semblance evaluations The more exhaustive search rovides suerior results for aliased data and very stee dis Alternatively, you might wish to comare the effect of values of (5) Delta Theta, or of window size of 0 ms and set your suffix to dtheta_5 or window_0ms Remember that you will need to use characters that can form a valid Linux file name (no = lus signs, slashes, blanks, etc) Also, remember that the binary files are being stored in a directory defined in file ~/dataath Even if you run rograms from different directories, files with the same name will overwrite each other in the directory defined by dataath If you wish, you can coy and modify the contents of dataath in your local roject directory This local version of dataath will take recedence over that in your home directory The Conversion velocity (6) is read in from the file aasi_default_arameters, which is currently set to be 4,000 m/s for data measured in m For the GSB_small data, we may wish to use a slower velocity of about 3,000 m/s You will always wish to (7) comute the inline and crossline di comonents, so this box is disabled In contrast, you may or may not wish to comute in (8) di magnitude or (9) di azimuth Let s check this to see what it rovides Want di confidence result? is chosen by default since it will be reuired if you run rogram filter_di_comonents Asking for any of these files does not influence the run time, just the disk sace used Proceeding to the Analysis window arameter tab: Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 3

4 By default, the Di window height will be ±5 samles (for the GSB survey with t=0004 s, ±000 s), and both the () Inline window radius the (3) Crossline window radius will be one trace (in this case, 5 m by 5 m) or 5 traces total If you select (4) the Use rectangular vs ellitical window? otion, you will define a rectangular window, which for this examle contains nine traces Larger windows result in smoother di estimates with a comutational cost roortional to the number of traces that fall within the window For this reason, comutations using rectangular windows run 8 times longer than those using ellitical windows with the same radii The following boxes Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 4

5 rovide more detail on the window definition, the angle definition, and the angle interolation used within our imlementation Imlementation details: Analysis window descrition in the AASPI software Almost all of the AASPI geometric attributes are comuted within a running analysis window Tyically these windows are defined by their length and width in m (or ft) and height is s (or km, kft, m, ft), and are oriented along structural di and azimuth The figure below shows a tyical rectangular analysis window Let s assume the trace searation is dcd=5 m in the inline direction and dline=5 m in the crossline direction If you wanted to have the same di resolution in both directions you may choose an inline_window_radius=*dcd=5 m and crossline_window_radius=dline=5 m The rogram default is to set the window radii to be the inline and crossline trace sacing (bin size) resulting in a 5-trace analysis circular window Larger analysis windows result in longer run times, increased angular resolution, and decreased satial resolution (smearing) If the data are noisy, a circular window radius eual to bins is a good lace to start, resulting in a 3-trace analysis window if dcd=dline The window on the uer right corresonds to a survey with dcd=5 m and dline=5 m A circular window with inline and crossline radii of 5 m therefore contains 7 traces If we lace a check mark in the Use rectangular window? otion, we will obtain the window on the right which contains 5 traces Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 5

6 Imlementation details: Discrete di search Earlier versions of the AASPI software comuted the analytic semblance on a suite of rectangularly defined inline and crossline dis, ranging between -θ max θ x +θ max, and θ max θ y +θ max Di magnitudes that fell beyond θ max are used to hel interolate but otherwise rejected As of February 06, di3d uses olar-defined search angles as shown in the image below For a given angle, density (defined by the angle increment, θ, this new search algorithm uses % fewer angles, resulting in an eual imrovement in run times More imortant, surious interolated angles that fall beyond θ max are avoided Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 6

7 Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 7 Imlementation details: Angle interolation The first ste in di estimation is to search over discrete angle Note in the image below if the angle with the largest semblance is the red angle, it has eight neighbors In contrast, if the angle with the largest semblance is the green angle, it has six neighbors In either case, we define a arabola that intersects each of the neighboring oints of the form ), ( s This euation is evaluated at each of neighboring (8 or 6) discrete angles as well as the center angle, numbered,,,n, to obtain n n n n n n n s s s , or in matrix form, s Pα, with the solution s P I P P α T T ε The maximum of the arabola is found by setting 0, 0, a a a s a a a s and solving the resulting x euation using QR factorization

8 Imlementation details: Structure-oriented analysis All of the AASPI geometric attributes are comuted along structural di The same holds true for the initial search for inline and crossline di comonents While the vertical_window_height arameter defines the half-height of the analysis window, the window itself will always be centered along di, as in the following image: A good rule of thumb is to select a vertical window about the size of the dominant freuency in your data Thus, if your dominant freuency is 0 Hz, the dominant eriod is 0050 s, suggesting a halfwindow height of 005 s If your dominant freuency is about 50 Hz, giving a eriod of 000 s, you may wish to use a half-window height would be 000 s The default is to set the half window height to be 5* t, where t is the seismic samle rate in unit (eg ms, s, ft, m, kft, km) In contrast to the window radii, the window height does not significantly imact run times, but larger windows can result in vertical smearing If your data are articularly noisy, you will want to use larger vertical analysis windows, at least until you have the oortunity to run structure-oriented filtering Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 8

9 Imlementation details: Kuwahara windows Programs di3d, sof3d, and sof_restack all use a modification of overlaing window arameter estimates introduced by Kuwahara et al (976) in medical imaging The original idea is simle If an analysis window contains five traces, then there are total of five windows (a centered window and four adjacent, offset windows) that contain the analysis oint In Kuwahara et al s (976) original work and Luo et al s (00) edge-reserving smoothing algorithm, one calculates the mean and standard deviation of each window That window which has the smallest standard deviation is hyothesized to be less noise-contaminated The mean of this window is then used as the outut for the analysis oint Marfurt (006) modified this aroach for volumetric di calculations where he used 3D rather than D overlaing windows In addition, the semblance of the analytic signal is used rather than the standard deviation to determine which window is least contaminated by noise The inline and crossline comonents of reflector di of this best window are then assigned to be the outut at the analysis oint The figure in the lower left reresents a 3-trace circular analysis window centered about the analysis oint indicated by the red solid dot Each of the traces reresented by the green dots in the figure in the lower right form the center of their own 3-trace analysis windows, yet contains the trace reresented by the red dot The window having the highest analytic semblance best reresents the signal; its di comonents are therefore as the di at the red analysis trace For reasonably good uality seismic data, lace a checkmark to (6) search lateral windows If the data are very noisy, using Kuwahara windows can give rise to a atchy aearance on the di comonents If such blockiness is unaccetable, remove the checkmark in front of search lateral windows For very oor uality seismic data, lace a checkmark in front of (5) search vertical windows This otion will also introduce some blockiness, but avoids smearing angular unconformities, onla, tola, and other configurations imortant to seismic stratigrahy interretation To minimize the atchy aearance that can occur when using Kuwahara windows, (7) set a threshold value of the analytic semblance, s_uer=085 If the semblance of Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 9

10 the centered window is greater than the value s_uer, its value of di and azimuth will be used If the semblance is less than this value of s_uer, the Kuwahara window concet will be imlemented, with the di comonents of the (centered, laterally offset, or vertically offset) window having the highest value of semblance assigned to the analysis oint A deeer discussion of Kuwahara windows can be found in the documentation for rogram sof3d Execution After selecting all your arameters, tye Execute di3d Intermediate outut comes to the xterm from which you launched aasi_util as well as in the file di3d_gsb_smallout Some of the outut aears below: The comutation is comuted using a stencil, with the amount of work divided eually across (in this examle 4 rocessors or core) Thus, the 00 CDPs of the survey are sread eually across the 4 rocessors, most working on 4 CDPS, the others on 4 CDPS As each seismic line is comleted, the results are sent to master rocessor (rocessor 0), saved in an array, and written to disk Progress of the rogram is shown in the bottom of the file above where the master node (indicated by the refix 0: ) indicating the first_line_out, current_line, and last_line_out and an estimated time of Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 0

11 arrival (comletion) ETA measured in hours Near the bottom of the *out file you will see information like this: which give some comutational statistics for each rocess (in this case rocess 0, with a wall clock time of 069 hrs Memory is deallocated, and each rocess echoes out that it has comleted normally: We ve already discussed the di3d_gsb_small_0out file that is a coy of the results that came to the screen di3d also has created the following files: Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page

12 As described in the documentation on the AASPI software environment, each of the AASPI-format files inline_di_gsb_smallh, crossline_di_gsb_smallh, di_azimuth_ GSB_smallH, di_magnitude_gsb_smallh, and conf_gsb_small_0h, (the history files) will have a corresonding *H@@ (header file format) in the local directory, and corresonding *H@ (binary results), and *H@@@ (binary trace headers) that reside in the directory you defined earlier in the dataath file We can lot our di comonents to QC the results by clicking () the AASPI QC Plotting tab in the aasi_util GUI: where () the file inline_di_gsb_small_0h is selected and () will be lotted as time slices: Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page

13 We have also comuted volumetric estimates of di magnitude and di azimuth Using AASPI rogram corender (under the Dislay tab) where () the base layer is set to be Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 3

14 () the di _azimuth lotted against (3) a cyclical color bar with values ranging between (4) and (5) Change the default title to reresent the images co-rendered Then (6) click the tab for layer, and then (3) chose the di magnitude file which will be lotted against (8) a monochrome gray color bar with (9) transarency set such that high values of di magnitude will be transarent, allowing the underling di magnitude value to show through Finally, (0) set the default di magnitude color range to be Smaller ranges will result in brighter colors You should obtain the following image: Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 4

15 To co-rendering with energy-ratio similarity (comuted in rogram similarity3d), return to rogram corender and () choose the Layer 3 tab, () select the energy-ratio similarity volume, (3) lot it against a monochrome black color bar, and (4) set the high coherence values to be transarent, allowing the underlying co-rendered di azimuth vs di magnitude images to show through Finally, (5) adjust the range of the similarity and (6) modify your lot title: Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 5

16 The following image should aear: One can also lot the results in the vertical slice As before, use di azimuth as the base layer, lotted against a cyclical color bar, di magnitude as the second layer lotted against a monochrome gray color bar, with high di magnitude values transarent, but now in rogram corender, under the Layer 3 tab, () select the energy-ratio similarity volume, (3) lot it against a binary black white color bar, and (4) set the low values about amlitude zero crossings to be transarent, allowing the underlying co-rendered di azimuth vs di magnitude images to show through Next, (5) choose Statistical Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 6

17 Ranging of the color bar, and (6) set the Percentage Cli =90, so that the color bar ranges between the 5 and 95 ercentile ranges of the amlitude data Finally, (7) modify your lot title and lot vertical slices: Here are two reresentative images: Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 7

18 at an aroximate : scale, using the value of velocity used in the calculation: Using rogram aarent_cmt, we can comute aarent di at any arbitrary azimuth, φ, using the simle formula a (φ)= cos(φ)+ sin(φ) The aarent_cmt GUI is simle: where here, the GUI asks to comute aarent dis between 0 0 and at 30 0 increments, resulting in six files: Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 8

19 Note that if one comuted to that the next six values will be numerical inverses of those in the oosite direction The inline azimuth of the GSB survey is +5 0 while the crossline azimuth is oriented clockwise at Plotting the results of aarent_cmt at the same time slice, we see the inline and crossline di comonents correctly lotted at 0 0 and 90 0, along with the other comonents Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 9

20 Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page 0

21 Notice, there are some small glitches in di estimation We can comute the confidence that we have at each voxel of the di estimate Since rogram di3d uses a Kuwahara multile overlaing window di search, the confidence is simly the coherence (in this case semblance of the analytic data) of the window used Overall, this is a high uality seismic data volume Not surrisingly, the lowest confidence is adjacent to the major discontinuities Deeer in the survey, we some areas (seen as black) where our di estimates are less accurate: Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page

22 We will try to further imrove our di estimates with some simle median filtering using rogram filter_di_comonents References Davogustto, O, and K J Marfurt, 0, Footrint suression alied to legacy seismic data volumes: to aear in the GCSSEPM 3 st Annual Bob F Perkins Research Conference on Seismic attributes New views on seismic imaging: Their use in exloration and roduction, -34 Kuwahara, M, K Hachimura, S Eiho, and M Kinoshita, 976, Digital rocessing of biomedical images: Plenum Press, Luo, Y, S al-dossary, and M Marhoon, 00, Edge-reserving smoothing and alications: The Leading Edge,, Marfurt, K J, 006, Robust estimates of reflector di and azimuth: Geohysics, 7, 9 40 Attribute-Assisted Seismic Processing and Interretation - 3 January 07 Page

PRESTACK STRUCTURE-ORIENTED FILTERING PROGRAM sof_prestack

PRESTACK STRUCTURE-ORIENTED FILTERING PROGRAM sof_prestack PRESTAK STRUTURE-ORIENTED FILTERING PROGRAM sof_prestack omputation Flow hart Program sof_prestack is a generalization of program sof3d For this reason, the input parameters and workflow of the two algorithms

More information

Improving Dip Estimates Program filter_dip_components

Improving Dip Estimates Program filter_dip_components Improving Dip Estimates Program filter_dip_components Computation flow chart The input to program filter_dip_components is generally computed from program dip3d and includes estimates of the inline and

More information

STRUCTURE-ORIENTED FILTERING OF POSTSTACK DATA Program sof3d

STRUCTURE-ORIENTED FILTERING OF POSTSTACK DATA Program sof3d STRUCTURE-ORIENTED FILTERING OF POSTSTACK DATA Program sof3d Computation flow chart Program sof3d provides the application and blending of anisotropic diffusion filtering described by Fehmers and Höecker

More information

Enhancing faults and axial planes Program fault_enhancement

Enhancing faults and axial planes Program fault_enhancement Enhancing faults and axial planes Program fault_enhancement Overview The fault enhancement attribute is a post-stack attribute which enhances locally planar features within a seismic attribute volume.

More information

MODULATING A POLYCHROMATIC IMAGE BY ONE PLOTTED AGAINST LIGHTNESS: PROGRAM hlplot

MODULATING A POLYCHROMATIC IMAGE BY ONE PLOTTED AGAINST LIGHTNESS: PROGRAM hlplot MODULATING A POLYCHROMATIC IMAGE BY ONE PLOTTED AGAINST LIGHTNESS: PROGRAM hlplot Multiattribute display of dip magnitude modulating dip azimuth Program hlplot AASPI provides two ways to blend a polychromatic

More information

Prestack Workflows: Prestack Structure-Oriented Filtering. The Prestack Structure-Oriented Filtering Workflow. Introduction

Prestack Workflows: Prestack Structure-Oriented Filtering. The Prestack Structure-Oriented Filtering Workflow. Introduction The Prestack Structure-Oriented Filtering Workflow. Introduction Structure-Oriented Filtering (SOF) involve many programs in AASPI software. Particularly, prestack SOF is tedious and time-consuming. To

More information

Lecture 8: Orthogonal Range Searching

Lecture 8: Orthogonal Range Searching CPS234 Comutational Geometry Setember 22nd, 2005 Lecture 8: Orthogonal Range Searching Lecturer: Pankaj K. Agarwal Scribe: Mason F. Matthews 8.1 Range Searching The general roblem of range searching is

More information

521493S Computer Graphics Exercise 3 (Chapters 6-8)

521493S Computer Graphics Exercise 3 (Chapters 6-8) 521493S Comuter Grahics Exercise 3 (Chaters 6-8) 1 Most grahics systems and APIs use the simle lighting and reflection models that we introduced for olygon rendering Describe the ways in which each of

More information

Iterative Fault Enhancement Workflow

Iterative Fault Enhancement Workflow Iterative Fault Enhancement Workflow. Introduction A greater degree of filtering can be obtained using three methods: (1) applying more aggressive filter parameters using the original window, (2) applying

More information

Velocity profile prediction using walkaway VSP data Nobuyasu Hirabayashi and W. Scott Leaney, Schlumberger. Summary

Velocity profile prediction using walkaway VSP data Nobuyasu Hirabayashi and W. Scott Leaney, Schlumberger. Summary Velocity rofile rediction using walkaway VSP data Nobuyasu Hirabayashi and W Scott Leaney, Schlumberger Summary A velocity estimation rocedure is described for walkaway VSP data Ray tracing through a heterogeneous

More information

CMSC 425: Lecture 16 Motion Planning: Basic Concepts

CMSC 425: Lecture 16 Motion Planning: Basic Concepts : Lecture 16 Motion lanning: Basic Concets eading: Today s material comes from various sources, including AI Game rogramming Wisdom 2 by S. abin and lanning Algorithms by S. M. LaValle (Chats. 4 and 5).

More information

Learning Motion Patterns in Crowded Scenes Using Motion Flow Field

Learning Motion Patterns in Crowded Scenes Using Motion Flow Field Learning Motion Patterns in Crowded Scenes Using Motion Flow Field Min Hu, Saad Ali and Mubarak Shah Comuter Vision Lab, University of Central Florida {mhu,sali,shah}@eecs.ucf.edu Abstract Learning tyical

More information

AASPI SOFTWARE PARALLELIZATION

AASPI SOFTWARE PARALLELIZATION AASPI SOFTWARE PARALLELIZATION Introduction Generation of multitrace and multispectral seismic attributes can be computationally intensive. For example, each input seismic trace may generate 50 or more

More information

Shuigeng Zhou. May 18, 2016 School of Computer Science Fudan University

Shuigeng Zhou. May 18, 2016 School of Computer Science Fudan University Query Processing Shuigeng Zhou May 18, 2016 School of Comuter Science Fudan University Overview Outline Measures of Query Cost Selection Oeration Sorting Join Oeration Other Oerations Evaluation of Exressions

More information

Figure 8.1: Home age taken from the examle health education site (htt:// Setember 14, 2001). 201

Figure 8.1: Home age taken from the examle health education site (htt://  Setember 14, 2001). 201 200 Chater 8 Alying the Web Interface Profiles: Examle Web Site Assessment 8.1 Introduction This chater describes the use of the rofiles develoed in Chater 6 to assess and imrove the quality of an examle

More information

Interactive Velocity Analysis (aaspi_iva): Program: Precompute Velocity Semblance, Interactive Velocity Analysis, Velocity Interpolation

Interactive Velocity Analysis (aaspi_iva): Program: Precompute Velocity Semblance, Interactive Velocity Analysis, Velocity Interpolation Interactive Velocity Analysis (aaspi_iva): Program: Precompute Velocity Semblance, Interactive Velocity Analysis, Velocity Interpolation Computational Flowchart Time Migrated Prestack Gathers Post Stack

More information

Texture Mapping with Vector Graphics: A Nested Mipmapping Solution

Texture Mapping with Vector Graphics: A Nested Mipmapping Solution Texture Maing with Vector Grahics: A Nested Mimaing Solution Wei Zhang Yonggao Yang Song Xing Det. of Comuter Science Det. of Comuter Science Det. of Information Systems Prairie View A&M University Prairie

More information

Perception of Shape from Shading

Perception of Shape from Shading 1 Percetion of Shae from Shading Continuous image brightness variation due to shae variations is called shading Our ercetion of shae deends on shading Circular region on left is erceived as a flat disk

More information

The Anubis Service. Paul Murray Internet Systems and Storage Laboratory HP Laboratories Bristol HPL June 8, 2005*

The Anubis Service. Paul Murray Internet Systems and Storage Laboratory HP Laboratories Bristol HPL June 8, 2005* The Anubis Service Paul Murray Internet Systems and Storage Laboratory HP Laboratories Bristol HPL-2005-72 June 8, 2005* timed model, state monitoring, failure detection, network artition Anubis is a fully

More information

A Novel Iris Segmentation Method for Hand-Held Capture Device

A Novel Iris Segmentation Method for Hand-Held Capture Device A Novel Iris Segmentation Method for Hand-Held Cature Device XiaoFu He and PengFei Shi Institute of Image Processing and Pattern Recognition, Shanghai Jiao Tong University, Shanghai 200030, China {xfhe,

More information

(1B) Click Browse and select the AASPI-format file (*.H) that you want to display. After you browse the file, the Colorbar file name (1C), plot title

(1B) Click Browse and select the AASPI-format file (*.H) that you want to display. After you browse the file, the Colorbar file name (1C), plot title QC PLOTTING OF AASPI-FORMAT DATA AND ATTRIBUTES Program aaspi_plot The AASPI QC Plotting tab To further quality control the conversion process, you will wish to plot your data before computing seismic

More information

Convex Hulls. Helen Cameron. Helen Cameron Convex Hulls 1/101

Convex Hulls. Helen Cameron. Helen Cameron Convex Hulls 1/101 Convex Hulls Helen Cameron Helen Cameron Convex Hulls 1/101 What Is a Convex Hull? Starting Point: Points in 2D y x Helen Cameron Convex Hulls 3/101 Convex Hull: Informally Imagine that the x, y-lane is

More information

Efficient Parallel Hierarchical Clustering

Efficient Parallel Hierarchical Clustering Efficient Parallel Hierarchical Clustering Manoranjan Dash 1,SimonaPetrutiu, and Peter Scheuermann 1 Deartment of Information Systems, School of Comuter Engineering, Nanyang Technological University, Singaore

More information

Grouping of Patches in Progressive Radiosity

Grouping of Patches in Progressive Radiosity Grouing of Patches in Progressive Radiosity Arjan J.F. Kok * Abstract The radiosity method can be imroved by (adatively) grouing small neighboring atches into grous. Comutations normally done for searate

More information

Introduction to Visualization and Computer Graphics

Introduction to Visualization and Computer Graphics Introduction to Visualization and Comuter Grahics DH2320, Fall 2015 Prof. Dr. Tino Weinkauf Introduction to Visualization and Comuter Grahics Grids and Interolation Next Tuesday No lecture next Tuesday!

More information

An Efficient and Highly Accurate Technique for Periodic Planar Scanner Calibration with the Antenna Under Test in Situ

An Efficient and Highly Accurate Technique for Periodic Planar Scanner Calibration with the Antenna Under Test in Situ An Efficient and Highly Accurate echnique for Periodic Planar Scanner Calibration with the Antenna Under est in Situ Scott Pierce I echnologies 1125 Satellite Boulevard, Suite 100 Suwanee, Georgia 30024

More information

Process and Measurement System Capability Analysis

Process and Measurement System Capability Analysis Process and Measurement System aability Analysis Process caability is the uniformity of the rocess. Variability is a measure of the uniformity of outut. Assume that a rocess involves a quality characteristic

More information

PREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS

PREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS PREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS Kevin Miller, Vivian Lin, and Rui Zhang Grou ID: 5 1. INTRODUCTION The roblem we are trying to solve is redicting future links or recovering missing links

More information

Source Coding and express these numbers in a binary system using M log

Source Coding and express these numbers in a binary system using M log Source Coding 30.1 Source Coding Introduction We have studied how to transmit digital bits over a radio channel. We also saw ways that we could code those bits to achieve error correction. Bandwidth is

More information

Computation flow chart

Computation flow chart COMPUTING SIMILARITY ATTRIBUTES PROGRAM similarity3d Computation flow chart The input to program similarity3d includes inline and crossline components of reflector dip and a seismic amplitude volume. The

More information

A Study of Protocols for Low-Latency Video Transport over the Internet

A Study of Protocols for Low-Latency Video Transport over the Internet A Study of Protocols for Low-Latency Video Transort over the Internet Ciro A. Noronha, Ph.D. Cobalt Digital Santa Clara, CA ciro.noronha@cobaltdigital.com Juliana W. Noronha University of California, Davis

More information

A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism

A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism Erlin Yao, Mingyu Chen, Rui Wang, Wenli Zhang, Guangming Tan Key Laboratory of Comuter System and Architecture Institute

More information

An Efficient VLSI Architecture for Adaptive Rank Order Filter for Image Noise Removal

An Efficient VLSI Architecture for Adaptive Rank Order Filter for Image Noise Removal International Journal of Information and Electronics Engineering, Vol. 1, No. 1, July 011 An Efficient VLSI Architecture for Adative Rank Order Filter for Image Noise Removal M. C Hanumantharaju, M. Ravishankar,

More information

Privacy Preserving Moving KNN Queries

Privacy Preserving Moving KNN Queries Privacy Preserving Moving KNN Queries arxiv:4.76v [cs.db] 4 Ar Tanzima Hashem Lars Kulik Rui Zhang National ICT Australia, Deartment of Comuter Science and Software Engineering University of Melbourne,

More information

has been retired This version of the software Sage Timberline Office Get Started Document Management 9.8 NOTICE

has been retired This version of the software Sage Timberline Office Get Started Document Management 9.8 NOTICE This version of the software has been retired Sage Timberline Office Get Started Document Management 9.8 NOTICE This document and the Sage Timberline Office software may be used only in accordance with

More information

Trigonometric Functions

Trigonometric Functions Similar Right-Angled Triangles Trigonometric Functions We lan to introduce trigonometric functions as certain ratios determined by similar right-angled triangles. By de nition, two given geometric gures

More information

P Z. parametric surface Q Z. 2nd Image T Z

P Z. parametric surface Q Z. 2nd Image T Z Direct recovery of shae from multile views: a arallax based aroach Rakesh Kumar. Anandan Keith Hanna Abstract Given two arbitrary views of a scene under central rojection, if the motion of oints on a arametric

More information

Dr Pavan Chakraborty IIIT-Allahabad

Dr Pavan Chakraborty IIIT-Allahabad GVC-43 Lecture - 5 Ref: Donald Hearn & M. Pauline Baker, Comuter Grahics Foley, van Dam, Feiner & Hughes, Comuter Grahics Princiles & Practice Dr Pavan Chakraborty IIIT-Allahabad Summary of line drawing

More information

Constructing a Geometric Attribute Workflow

Constructing a Geometric Attribute Workflow Constructing a Geometric Attribute Workflow. Introduction Attribute computation of very large data volumes can take considerable time. Experienced interpreters may already have familiarity with other data

More information

AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS. Ren Chen and Viktor K.

AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS. Ren Chen and Viktor K. inuts er clock cycle Streaming ermutation oututs er clock cycle AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS Ren Chen and Viktor K.

More information

MULTIATTRIBUTE DISPLAY: PROGRAMS hlplot, hsplot, hlsplot, rgbplot, and crossplot

MULTIATTRIBUTE DISPLAY: PROGRAMS hlplot, hsplot, hlsplot, rgbplot, and crossplot MULTIATTRIBUTE DISPLAY: PROGRAMS hlplot, hsplot, hlsplot, rgbplot, and crossplot Multiattribute display of dip magnitude modulating dip azimuth Programs hlplot and hsplot In section 6, pages 12-13, we

More information

Global Illumination with Photon Map Compensation

Global Illumination with Photon Map Compensation Institut für Comutergrahik und Algorithmen Technische Universität Wien Karlslatz 13/186/2 A-1040 Wien AUSTRIA Tel: +43 (1) 58801-18688 Fax: +43 (1) 58801-18698 Institute of Comuter Grahics and Algorithms

More information

Patterned Wafer Segmentation

Patterned Wafer Segmentation atterned Wafer Segmentation ierrick Bourgeat ab, Fabrice Meriaudeau b, Kenneth W. Tobin a, atrick Gorria b a Oak Ridge National Laboratory,.O.Box 2008, Oak Ridge, TN 37831-6011, USA b Le2i Laboratory Univ.of

More information

Spectral Attributes Program spec_cmp. COMPUTING SPECTRAL COMPONENTS USING A COMPLEX MATCHING PURSUITE ALGORITHM PROGRAM spec_cmp

Spectral Attributes Program spec_cmp. COMPUTING SPECTRAL COMPONENTS USING A COMPLEX MATCHING PURSUITE ALGORITHM PROGRAM spec_cmp COMPUTING SPECTRAL COMPONENTS USING A COMPLEX MATCHING PURSUITE ALGORITHM PROGRAM spec_cmp Alternative Spectral Decomposition Algorithms Spectral decomposition methods can be divided into three classes:

More information

Lecture 18. Today, we will discuss developing algorithms for a basic model for parallel computing the Parallel Random Access Machine (PRAM) model.

Lecture 18. Today, we will discuss developing algorithms for a basic model for parallel computing the Parallel Random Access Machine (PRAM) model. U.C. Berkeley CS273: Parallel and Distributed Theory Lecture 18 Professor Satish Rao Lecturer: Satish Rao Last revised Scribe so far: Satish Rao (following revious lecture notes quite closely. Lecture

More information

Fast Shape-based Road Sign Detection for a Driver Assistance System

Fast Shape-based Road Sign Detection for a Driver Assistance System Fast Shae-based Road Sign Detection for a Driver Assistance System Gareth Loy Comuter Vision and Active Percetion Laboratory Royal Institute of Technology (KTH) Stockholm, Sweden Email: gareth@nada.kth.se

More information

Stereo Disparity Estimation in Moment Space

Stereo Disparity Estimation in Moment Space Stereo Disarity Estimation in oment Sace Angeline Pang Faculty of Information Technology, ultimedia University, 63 Cyberjaya, alaysia. angeline.ang@mmu.edu.my R. ukundan Deartment of Comuter Science, University

More information

Numerical Methods for Particle Tracing in Vector Fields

Numerical Methods for Particle Tracing in Vector Fields On-Line Visualization Notes Numerical Methods for Particle Tracing in Vector Fields Kenneth I. Joy Visualization and Grahics Research Laboratory Deartment of Comuter Science University of California, Davis

More information

CLIC CLient-Informed Caching for Storage Servers

CLIC CLient-Informed Caching for Storage Servers CLIC CLient-Informed Caching for Storage Servers Xin Liu Ashraf Aboulnaga Ken Salem Xuhui Li David R. Cheriton School of Comuter Science University of Waterloo February 2009 Two-Tier Caching DBMS storage

More information

COMPUTING APPARENT CURVATURE PROGRAM euler_curvature. Euler curvature computation flow chart. Computing Euler curvature

COMPUTING APPARENT CURVATURE PROGRAM euler_curvature. Euler curvature computation flow chart. Computing Euler curvature COMPUTING APPARENT CURVATURE PROGRAM euler_curvature Euler curvature computation flow chart Inline dip Crossline dip curvature3d k 1 Strike of k 1 k 2 Strike of k 1 euler_curvature (φ=-90 0 ) (φ=0 0 )

More information

CENTRAL AND PARALLEL PROJECTIONS OF REGULAR SURFACES: GEOMETRIC CONSTRUCTIONS USING 3D MODELING SOFTWARE

CENTRAL AND PARALLEL PROJECTIONS OF REGULAR SURFACES: GEOMETRIC CONSTRUCTIONS USING 3D MODELING SOFTWARE CENTRAL AND PARALLEL PROJECTIONS OF REGULAR SURFACES: GEOMETRIC CONSTRUCTIONS USING 3D MODELING SOFTWARE Petra Surynková Charles University in Prague, Faculty of Mathematics and Physics, Sokolovská 83,

More information

Wavelet Based Statistical Adapted Local Binary Patterns for Recognizing Avatar Faces

Wavelet Based Statistical Adapted Local Binary Patterns for Recognizing Avatar Faces Wavelet Based Statistical Adated Local Binary atterns for Recognizing Avatar Faces Abdallah A. Mohamed 1, 2 and Roman V. Yamolskiy 1 1 Comuter Engineering and Comuter Science, University of Louisville,

More information

GEOMETRIC CONSTRAINT SOLVING IN < 2 AND < 3. Department of Computer Sciences, Purdue University. and PAMELA J. VERMEER

GEOMETRIC CONSTRAINT SOLVING IN < 2 AND < 3. Department of Computer Sciences, Purdue University. and PAMELA J. VERMEER GEOMETRIC CONSTRAINT SOLVING IN < AND < 3 CHRISTOPH M. HOFFMANN Deartment of Comuter Sciences, Purdue University West Lafayette, Indiana 47907-1398, USA and PAMELA J. VERMEER Deartment of Comuter Sciences,

More information

A Method to Determine End-Points ofstraight Lines Detected Using the Hough Transform

A Method to Determine End-Points ofstraight Lines Detected Using the Hough Transform RESEARCH ARTICLE OPEN ACCESS A Method to Detere End-Points ofstraight Lines Detected Using the Hough Transform Gideon Kanji Damaryam Federal University, Lokoja, PMB 1154, Lokoja, Nigeria. Abstract The

More information

THE COMPARISON OF DRAINAGE NETWORK EXTRACTION BETWEEN SQUARE AND HEXAGONAL GRID-BASED DEM

THE COMPARISON OF DRAINAGE NETWORK EXTRACTION BETWEEN SQUARE AND HEXAGONAL GRID-BASED DEM The International Archives of the Photogrammetry, Remote Sensing and Satial Information Sciences, Volume XLII-4, 208 ISPRS TC IV Mid-term Symosium 3D Satial Information Science The Engine of Change, 5

More information

Seismic imaging PROGRAM aaspi_azim_offset_mig

Seismic imaging PROGRAM aaspi_azim_offset_mig Seismic imaging PROGRAM aaspi_azim_offset_mig Program aaspi_azim_offset_mig is a prestack time migration based on the Kirchhoff algorithm which adds the anti_aliasing operator based on Gray, S. H. (1992).

More information

Lecture 2: Fixed-Radius Near Neighbors and Geometric Basics

Lecture 2: Fixed-Radius Near Neighbors and Geometric Basics structure arises in many alications of geometry. The dual structure, called a Delaunay triangulation also has many interesting roerties. Figure 3: Voronoi diagram and Delaunay triangulation. Search: Geometric

More information

Constrained Path Optimisation for Underground Mine Layout

Constrained Path Optimisation for Underground Mine Layout Constrained Path Otimisation for Underground Mine Layout M. Brazil P.A. Grossman D.H. Lee J.H. Rubinstein D.A. Thomas N.C. Wormald Abstract The major infrastructure comonent reuired to develo an underground

More information

An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2

An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 Mingliang Chen 1, Weiyao Lin 1*, Xiaozhen Zheng 2 1 Deartment of Electronic Engineering, Shanghai Jiao Tong University, China

More information

NON-UNIFORM TO UNIFORM IMAGE RESAMPLING UTILIZING A 2D FARROW STRUCTURE

NON-UNIFORM TO UNIFORM IMAGE RESAMPLING UTILIZING A 2D FARROW STRUCTURE NON-UNIFORM TO UNIFORM IMAGE RESAMPLING UTILIZING A D FARROW STRUCTURE Harish Essay Sanaran, Mihail Georgiev, Atanas Gotchev and Karen Egiaarian Noia Cororation, Hermianatu, Tamere, FINLAND, harish.essaysanaran@noia.com

More information

CS 450: COMPUTER GRAPHICS 2D TRANSFORMATIONS SPRING 2016 DR. MICHAEL J. REALE

CS 450: COMPUTER GRAPHICS 2D TRANSFORMATIONS SPRING 2016 DR. MICHAEL J. REALE CS 45: COMUTER GRAHICS 2D TRANSFORMATIONS SRING 26 DR. MICHAEL J. REALE INTRODUCTION Now that we hae some linear algebra under our resectie belts, we can start ug it in grahics! So far, for each rimitie,

More information

Earthenware Reconstruction Based on the Shape Similarity among Potsherds

Earthenware Reconstruction Based on the Shape Similarity among Potsherds Original Paer Forma, 16, 77 90, 2001 Earthenware Reconstruction Based on the Shae Similarity among Potsherds Masayoshi KANOH 1, Shohei KATO 2 and Hidenori ITOH 1 1 Nagoya Institute of Technology, Gokiso-cho,

More information

Equality-Based Translation Validator for LLVM

Equality-Based Translation Validator for LLVM Equality-Based Translation Validator for LLVM Michael Ste, Ross Tate, and Sorin Lerner University of California, San Diego {mste,rtate,lerner@cs.ucsd.edu Abstract. We udated our Peggy tool, reviously resented

More information

Folded Structures Satisfying Multiple Conditions

Folded Structures Satisfying Multiple Conditions Journal of Information Processing Vol.5 No.4 1 10 (Oct. 017) [DOI: 1197/isjji.5.1] Regular Paer Folded Structures Satisfying Multile Conditions Erik D. Demaine 1,a) Jason S. Ku 1,b) Received: November

More information

3D RECONSTRUCTION OF ROADS AND TREES FOR CITY MODELLING

3D RECONSTRUCTION OF ROADS AND TREES FOR CITY MODELLING 3D RECONSTRUCTION OF ROADS AND TREES FOR CITY MODELLING George Vosselman Deartment of Geodesy, Delft University of Technology, Thijsseweg 11, NL-2629 JA Delft, The Netherlands g.vosselman@geo.tudelft.nl

More information

Optimizing Dynamic Memory Management!

Optimizing Dynamic Memory Management! Otimizing Dynamic Memory Management! 1 Goals of this Lecture! Hel you learn about:" Details of K&R hea mgr" Hea mgr otimizations related to Assignment #6" Faster free() via doubly-linked list, redundant

More information

Introduction to Parallel Algorithms

Introduction to Parallel Algorithms CS 1762 Fall, 2011 1 Introduction to Parallel Algorithms Introduction to Parallel Algorithms ECE 1762 Algorithms and Data Structures Fall Semester, 2011 1 Preliminaries Since the early 1990s, there has

More information

Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data

Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data Efficient Processing of To-k Dominating Queries on Multi-Dimensional Data Man Lung Yiu Deartment of Comuter Science Aalborg University DK-922 Aalborg, Denmark mly@cs.aau.dk Nikos Mamoulis Deartment of

More information

The Spatial Skyline Queries

The Spatial Skyline Queries The Satial Skyline Queries Mehdi Sharifzadeh Comuter Science Deartment University of Southern California Los Angeles, CA 90089-078 sharifza@usc.edu Cyrus Shahabi Comuter Science Deartment University of

More information

Improved Image Super-Resolution by Support Vector Regression

Improved Image Super-Resolution by Support Vector Regression Proceedings of International Joint Conference on Neural Networks, San Jose, California, USA, July 3 August 5, 0 Imroved Image Suer-Resolution by Suort Vector Regression Le An and Bir Bhanu Abstract Suort

More information

A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH

A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH Jin Lu, José M. F. Moura, and Urs Niesen Deartment of Electrical and Comuter Engineering Carnegie Mellon University, Pittsburgh, PA 15213 jinlu, moura@ece.cmu.edu

More information

Chapter 8: Adaptive Networks

Chapter 8: Adaptive Networks Chater : Adative Networks Introduction (.1) Architecture (.2) Backroagation for Feedforward Networks (.3) Jyh-Shing Roger Jang et al., Neuro-Fuzzy and Soft Comuting: A Comutational Aroach to Learning and

More information

Th SRS1 14 Generalizing and Stabilizing Reverse Time Migration Deconvolution Imaging

Th SRS1 14 Generalizing and Stabilizing Reverse Time Migration Deconvolution Imaging Th SRS1 14 Generalizing and Stabilizing Reverse Time Migration Deconvolution Imaging J. Messud* (CGG) & G. Lambaré (CGG) SUMMARY For reverse time migration, the deconvolution imaging condition offers the

More information

Digital Air Brush a 10 DOF bimanual tool

Digital Air Brush a 10 DOF bimanual tool Digital Air Brush a 10 DOF bimanual tool Paulo Pacheco,1 George Fitzmaurice 1, Ian Ameline 1 William Buxton 1, 1 Alias wavefront Toronto, Ontario Canada Deartment of Comuter Science University of Toronto

More information

A Morphological LiDAR Points Cloud Filtering Method based on GPGPU

A Morphological LiDAR Points Cloud Filtering Method based on GPGPU A Morhological LiDAR Points Cloud Filtering Method based on GPGPU Shuo Li 1, Hui Wang 1, Qiuhe Ma 1 and Xuan Zha 2 1 Zhengzhou Institute of Surveying & Maing, No.66, Longhai Middle Road, Zhengzhou, China

More information

Statistical Detection for Network Flooding Attacks

Statistical Detection for Network Flooding Attacks Statistical Detection for Network Flooding Attacks C. S. Chao, Y. S. Chen, and A.C. Liu Det. of Information Engineering, Feng Chia Univ., Taiwan 407, OC. Email: cschao@fcu.edu.tw Abstract In order to meet

More information

SPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin 2, Mohammad Ali Masnadi-Shirazi 1

SPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin 2, Mohammad Ali Masnadi-Shirazi 1 SPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin, Mohammad Ali Masnadi-Shirazi 1 1. Shiraz University, Shiraz, Iran,. Sabanci University, Istanbul, Turkey ssamadi@shirazu.ac.ir,

More information

Face Recognition Using Legendre Moments

Face Recognition Using Legendre Moments Face Recognition Using Legendre Moments Dr.S.Annadurai 1 A.Saradha Professor & Head of CSE & IT Research scholar in CSE Government College of Technology, Government College of Technology, Coimbatore, Tamilnadu,

More information

MODULATING A POLYCHROMATIC IMAGE BY A 2 ND IMAGE PLOTTED AGAINST SATURATION AND A 3 RD IMAGE PLOTTED AGAINST LIGHTNESS: PROGRAM hlsplot

MODULATING A POLYCHROMATIC IMAGE BY A 2 ND IMAGE PLOTTED AGAINST SATURATION AND A 3 RD IMAGE PLOTTED AGAINST LIGHTNESS: PROGRAM hlsplot MODULATING A POLYCHROMATIC IMAGE BY A 2 ND IMAGE PLOTTED AGAINST SATURATION AND A 3 RD IMAGE PLOTTED AGAINST LIGHTNESS: PROGRAM hlsplot Plotting dip vs. azimuth vs. coherence Program hlsplot Earlier, we

More information

A DEA-bases Approach for Multi-objective Design of Attribute Acceptance Sampling Plans

A DEA-bases Approach for Multi-objective Design of Attribute Acceptance Sampling Plans Available online at htt://ijdea.srbiau.ac.ir Int. J. Data Enveloment Analysis (ISSN 2345-458X) Vol.5, No.2, Year 2017 Article ID IJDEA-00422, 12 ages Research Article International Journal of Data Enveloment

More information

An Exact and Fast Computation of Discrete Fourier Transform for Polar and Spherical Grid

An Exact and Fast Computation of Discrete Fourier Transform for Polar and Spherical Grid An Eact and Fast Comutation of Discrete Fourier Transform for Polar and Sherical Grid Syed Alam Abbas, Student Member, IEEE, Qiyu Sun, Member, IEEE, and Hassan Foroosh, Senior Member, IEEE Abstract Numerous

More information

MAXIMUM ENTROPY SPECTRAL ANALYSIS PROGRAM spec_max_entropy

MAXIMUM ENTROPY SPECTRAL ANALYSIS PROGRAM spec_max_entropy MAXIMUM ENTROPY SPECTRAL ANALYSIS PROGRAM spec_max_entropy Alternative Spectral Decomposition Algorithms Spectral decomposition methods can be divided into three classes: those that use quadratic forms,

More information

Efficient Sequence Generator Mining and its Application in Classification

Efficient Sequence Generator Mining and its Application in Classification Efficient Sequence Generator Mining and its Alication in Classification Chuancong Gao, Jianyong Wang 2, Yukai He 3 and Lizhu Zhou 4 Tsinghua University, Beijing 0084, China {gaocc07, heyk05 3 }@mails.tsinghua.edu.cn,

More information

Sensitivity Analysis for an Optimal Routing Policy in an Ad Hoc Wireless Network

Sensitivity Analysis for an Optimal Routing Policy in an Ad Hoc Wireless Network 1 Sensitivity Analysis for an Otimal Routing Policy in an Ad Hoc Wireless Network Tara Javidi and Demosthenis Teneketzis Deartment of Electrical Engineering and Comuter Science University of Michigan Ann

More information

EE678 Application Presentation Content Based Image Retrieval Using Wavelets

EE678 Application Presentation Content Based Image Retrieval Using Wavelets EE678 Alication Presentation Content Based Image Retrieval Using Wavelets Grou Members: Megha Pandey megha@ee. iitb.ac.in 02d07006 Gaurav Boob gb@ee.iitb.ac.in 02d07008 Abstract: We focus here on an effective

More information

Facial Expression Recognition using Image Processing and Neural Network

Facial Expression Recognition using Image Processing and Neural Network Keerti Keshav Kanchi / International Journal of Comuter Science & Engineering Technology (IJCSET) Facial Exression Recognition using Image Processing and eural etwork Keerti Keshav Kanchi PG Student, Deartment

More information

Theoretical Analysis of Graphcut Textures

Theoretical Analysis of Graphcut Textures Theoretical Analysis o Grahcut Textures Xuejie Qin Yee-Hong Yang {xu yang}@cs.ualberta.ca Deartment o omuting Science University o Alberta Abstract Since the aer was ublished in SIGGRAPH 2003 the grahcut

More information

2-D Fir Filter Design And Its Applications In Removing Impulse Noise In Digital Image

2-D Fir Filter Design And Its Applications In Removing Impulse Noise In Digital Image -D Fir Filter Design And Its Alications In Removing Imulse Noise In Digital Image Nguyen Thi Huyen Linh 1, Luong Ngoc Minh, Tran Dinh Dung 3 1 Faculty of Electronic and Electrical Engineering, Hung Yen

More information

Truth Trees. Truth Tree Fundamentals

Truth Trees. Truth Tree Fundamentals Truth Trees 1 True Tree Fundamentals 2 Testing Grous of Statements for Consistency 3 Testing Arguments in Proositional Logic 4 Proving Invalidity in Predicate Logic Answers to Selected Exercises Truth

More information

Segmentation Induced by Scale Invariance

Segmentation Induced by Scale Invariance IEEE Conference on Comuter Vision and Pattern Recognition, San Diego, CA, June 20-26, 2005. 1 Segmentation Induced by Scale Invariance Stella X. Yu Comuter Science Division University of California, Berkeley

More information

COT5405: GEOMETRIC ALGORITHMS

COT5405: GEOMETRIC ALGORITHMS COT5405: GEOMETRIC ALGORITHMS Objects: Points in, Segments, Lines, Circles, Triangles Polygons, Polyhedra R n Alications Vision, Grahics, Visualizations, Databases, Data mining, Networks, GIS Scientific

More information

Space-efficient Region Filling in Raster Graphics

Space-efficient Region Filling in Raster Graphics "The Visual Comuter: An International Journal of Comuter Grahics" (submitted July 13, 1992; revised December 7, 1992; acceted in Aril 16, 1993) Sace-efficient Region Filling in Raster Grahics Dominik Henrich

More information

Robust Motion Estimation for Video Sequences Based on Phase-Only Correlation

Robust Motion Estimation for Video Sequences Based on Phase-Only Correlation Robust Motion Estimation for Video Sequences Based on Phase-Only Correlation Loy Hui Chien and Takafumi Aoki Graduate School of Information Sciences Tohoku University Aoba-yama 5, Sendai, 98-8579, Jaan

More information

Sage Estimating (formerly Sage Timberline Estimating) Getting Started Guide. Version has been retired. This version of the software

Sage Estimating (formerly Sage Timberline Estimating) Getting Started Guide. Version has been retired. This version of the software Sage Estimating (formerly Sage Timberline Estimating) Getting Started Guide Version 14.12 This version of the software has been retired This is a ublication of Sage Software, Inc. Coyright 2014. Sage Software,

More information

Lecture 3: Geometric Algorithms(Convex sets, Divide & Conquer Algo.)

Lecture 3: Geometric Algorithms(Convex sets, Divide & Conquer Algo.) Advanced Algorithms Fall 2015 Lecture 3: Geometric Algorithms(Convex sets, Divide & Conuer Algo.) Faculty: K.R. Chowdhary : Professor of CS Disclaimer: These notes have not been subjected to the usual

More information

Visualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries

Visualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries Visualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries Qi Tian, Baback Moghaddam 2 and Thomas S. Huang Beckman Institute, University of Illinois, Urbana-Chamaign, IL 680,

More information

Sensitivity of multi-product two-stage economic lotsizing models and their dependency on change-over and product cost ratio s

Sensitivity of multi-product two-stage economic lotsizing models and their dependency on change-over and product cost ratio s Sensitivity two stage EOQ model 1 Sensitivity of multi-roduct two-stage economic lotsizing models and their deendency on change-over and roduct cost ratio s Frank Van den broecke, El-Houssaine Aghezzaf,

More information

Image Segmentation Using Topological Persistence

Image Segmentation Using Topological Persistence Image Segmentation Using Toological Persistence David Letscher and Jason Fritts Saint Louis University Deartment of Mathematics and Comuter Science {letscher, jfritts}@slu.edu Abstract. This aer resents

More information

Volumetric Attributes: Constrained least-squares spectral analysis Program spec_clssa

Volumetric Attributes: Constrained least-squares spectral analysis Program spec_clssa CONSTRAINED LEAST-SQUARES SPECTRAL ANALYSIS PROGRAM spec_clssa Alternative Spectral Decomposition Algorithms Spectral decomposition methods can be divided into three classes: those that use quadratic forms,

More information

Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chip Platform

Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chip Platform Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chi Platform Uzi Vishkin George C. Caragea Bryant Lee Aril 2006 University of Maryland, College Park, MD 20740 UMIACS-TR

More information