Machine Vision. Laboratory Exercise Name: Student ID: S

Size: px
Start display at page:

Download "Machine Vision. Laboratory Exercise Name: Student ID: S"

Transcription

1 Mahine Vision S Laoratory Eerise 2011 Name: Student D:

2 General nformation To pass these laoratory works, you should answer all questions (Q.y) with an understandale handwriting either in English or in Finnish. Continue the answers to an attahment if you will, ut rememer to mark whih answer is for whih question. Return the orretly filled report to Juho Kannala (room TS333) and all the MATLAB sripts (m-files) resulting from tasks (T.y) should e (in)zipped and send to juho.kannala (at) ee.oulu.fi. Name the funtions as Ty.m. lease note that this work should e done individually. 1. BNARY MAGE ANALYSS 1.1. mage Thresholding mage thresholding means that an image is onverted into a inary image y assigning eah piel the values 1 or 0 aording to a threshold (or thresholds). Q1.1. n whih ways a graysale image an e thresholded? (See Chapter 3 in ourse material.) Q1.2. Eplain what kind of information ould e used to determine a suitale threshold automatially. n MATLAB, image thresholding an e implemented in various ways. Here is an eample sript whih thresholds a graysale image aove with a threshold of 128 and displays the images: = imread( kuva.tif ); in = >128; suplot(1,2,1),imshow(),title( Graysale ) suplot(1,2,1),imshow(in),title( Binary ) Two inary images an e omined with logial itwise operators & (and), (or) and ~ (not): A = B & C; T1.1. rite a MATLAB funtion that selets automatially two thresholds for an input image and thresholds the image oth etween and outside these two thresholds. Test your funtion with the image rose.jpg (you should e ale to separate the most of the rose from the akground). 2/13

3 1.2. Conneted Components Laeling A laeling algorithm an e used to ount inary ojets in an image. Usually, morphologial operation(s) preede this. The ojets an e onsidered as 4- or 8-onneted. The outome of a laeling algorithm is an image, with 1 s replaed with numers assigned for separate inary areas. Laeling ould e used, for eample, for ounting alls in an image like Figure 1. Figure 1. mage alls.gif ontaining a large numer of alls. T1.2. Study funtion wlael and write a sript that ounts the alls in Figure 1 (alls.gif). Use morphologial operation(s) to separate the alls. hih operation(s) did you use? How many alls are there? Q1.3. hat kind of properties ould e alulated to inary ojets for further, higher-level analysis? 1.3. attern Reognition attern reognition is a very general term and (inary) image analysis is only one appliation area of it. n this eerise we fous on register plate reognition prolem. Basi onept of the solution is to represent a harater in a register plate with some feature vetor and assign this feature vetor to a predetermined lass aording some riteria. That is, we represent eah lass with a feature vetor etrated from sample haraters (learning phase) and then ompare the feature vetor etrated from an input image to the (learned) lass representatives. Start y studying asi region properties and pattern reognition onepts in leture material (hapter 3, slides 19-21, and hapter 4, respetively). Study also MATLAB mage roessing Toolo funtions regionprops, imsale, and imrotate. T1.3. mplement a register plate reognition program in order to reognize haraters in the 14 plate images register1.mp,, register14.mp. Note, that images are aptured with different lighting and optis settings, as well as in different sales and rotations. So your ode should e (at least 3/13

4 in some amount) invariant to these fators. You an find eamples for region property omputation and image saling in MATLAB sript regplate.m. Your program should inlude: a) A teahing sript (use regmodel.mp for teahing) in whih you ompute feature vetors representatives for all five haraters (R, F, 6, 3, and 8) of the imaged plate. Name this as T13a.m ) A reognition sript in whih you ompute feature vetor for eah harater deteted in atual register plate images, ompare these measured feature vetors to learned ones y using some appropriate method or distane measure (e.g. nearest neighor lassifier and Eulidean distane), and display the haraters reognized. Name this as T13.m. (NOTE: Your program does not need to e ale to reognize all haraters in all given images, see Q1.6. ) Q1.4. hih features did you use for the representation of the haraters? hy just these? Q1.5. hih distane measure or method did you use for the lassifiation? hy? hat kind of limitations the method you hose might have in this ase? Q1.6. Study the reognition performane of your program for given images. n whih ases your ode suess and why, in whih ases it fails and why? 4/13

5 2. COLOR ANALYSS n this setion we onsider prolems related to leture material Chapter 6. n addition of analyzing different olor oding shemes, a method known as histogram akprojetion is introdued for skin detetion in images Color Spaes Color offers lot of information aout an image. Usually, digital image piels are RGB oded, where individual hannels stand for intensity of the wavelengths that are interpreted as red, green and lue y the human visual system. RGB oordinates are the usual output of image apturing hardware, ut for olor analysis it is usually more useful to sort the hromatiity and intensity information to different omponents. Besides the ourse material, information aout olor spaes an e found e.g. from ikipedia: Q2.1. List at least three different olor oding shemes esides RGB. Q2.2. Eplain what the omponents of HS olor spae stands for in your own words. Q2.3. n general olor oding shemes define the intensity and hromatiity of olor what are their physial meanings? 2.2. Skin Detetion Color an e used for image segmentation. For eample, skin areas an e deteted in images ased on their disriminative hromatiity. Net, we uild a simple skin piel lassifier ased on a simple yet effetive method alled the histogram akprojetion, whih is a way of reording how well the piels fit the distriution of piels in a histogram model. The first task is to onvert the images into some olor spae revealing hromatiity. Here we use normalized RGB oordinates, also referred as normalized olor oordinates (NCC). The omponents are formed from RGB oordinates as follows: = R + G + B r = R G g = B =. 5/13

6 Seondly, two-dimensional olor histogram H(n r, n g ) is reated from a sample image. The sample image is onverted to r,g oordinates and quantized to N (numer of ins in the histogram) levels. nitially the histogram is set to zero. The sample image is sanned through pielwise, and for eah piel the in speified y the quantized oordinates is inremented. Now we have a olor model that represents the sample image. Net, a olor likelihood image LH (,y) is reated y projeting the olor model to an image under analysis (,y). The piel values of the likelihood image tell how well a piel mathes with the olor model. For eah piel in the likelihood image, a in value from the olor histogram is assigned. The in is speified y the image olor oordinates of the orresponding piel: LH (,y) = H(n r, n g ), where (n r, n g ) are the normalized olor oordinates of piel (,y). (,y) LH (,y) H(n r, n g ) N N- Figure 2. llustration of histogram akprojetion 1 and how the piel values and the histogram are related. T2.1. rite a funtion that implements the aove mentioned method using the skin.mp as a sample image. The funtion must onvert the sample image to normalized olor oordinates, quantize them to 128 levels and reate a histogram of the sample. Then the funtion transforms and quantizes the image, from whih the skin piels ought to e deteted, as aove. Finally the funtion reates a olor likelihood image whih is thresholded to a inary image, where 1 s and 0 s denote skin and non-skin piels respetively. You an use the prewritten funtion skindetetion.m. Try it on images dudes.jpg and fae.mp in addition with random skin ontaining piture seleted from images.google.fi. Q2.4. hy does the lassifier not detet all the skin piels and why does it make false detetions? 6/13

7 3. CONTENT BASED MAGE RETREVAL mages an e retrieved from a dataase ased on their ontent. Although ontent ased image retrieval still operates on rather primitive data, ommerial and researh systems are already uilt. dea in retrieval is to measure image similarity etween a query image and images in dataase and result most similar images mage Comparison mage Features mage Features Math Resulting image(s) Figure 3. A simple ase of ontent ased image retrieval. Q3.1. hat are the major similarity measures for image omparison? T3.1. Take few minutes to test different measures with a test dataase in the address 7/13

8 3.2. Teture Similarity n this part, we eamine the Loal Binary attern (LB) operator as a measure of teture. LB has numerous variations, ut in this eerise we use the simple 33-neighourhood graysale LB. Eah piel in an image an e assigned with a LB-value y evaluating its 33-neighorhood. Neighoring piels are thresholded as 0 s and 1 s with entral piel value. The thresholded piels are then weighted and summed as illustrated in Figure 4. Figure 4. A simple 33-neighourhood LB. An image an e presented with a LB-histogram, whih is uilt y using a LB-operator for eah piel (eept the ordering piels) in a graysale image. An eample ode for LB-histogram omputation is given in LB.m. The similarity of two histograms an e evaluated y some metri. Among others, a simple measure of similarity is S H1, H 2 n min( H i 1 = n i H [ i], H 2[ i] [] i 1 ). ith this measure, a ontent ased retrieval an e implemented y omparing query-images similarity S H1,H2 to all of the images in the dataase. T3.2. Q3.2. mplement a dataase retrieval funtion that takes an image as an input and displays five losest images in a figure. Use the similarity metri aove and images im1.mp,, im16.mp as a dataase. Test the system y using dataase images as query images and see if similar images result. Use the prewritten funtion retrieve.m. Define the terms preision and reall in the ontet of image retrieval. Q3.3. Mention at least two other teture features esides the LB. 8/13

9 4. MOTON FROM 2-D MAGE SEQUENCES Aquiring motion from image sequenes is ommon researh area in omputer vision. rolems range from simple movement detetion to high-level analysis of multiple ojet shape and motion. The ompleity of the prolem is defined y many things, inluding the numer of ojets eing traked simultaneously and is the amera stati or moving. Bakground Sutration n the ase of stati amera and stati akground, ojets an e traked with a method alled akground sutration. A simple version of that is to detet hanges in images y sutrating them from an image ontaining the akground and thresholding the result as Figure 5 depits. image1 - image1-image2 Deteted ojets image2 Figure 5. Bakground sutration for moving ojet detetion. Usually the inary image aquired y thresholding is enhaned with morphologial operations for eample, losing ould e used to fuse neighoring areas. Also small noise regions should e removed. After morphologial operations, image is laeled for further ojet analysis. Sutration an happen etween susequent images or etween urrent image and an image of an empty sene. Q4.1. n whih situations akground sutration methods ould fail? hy? T4.1. mplement a traffi traker system that uses the akground sutration method. The system should detet moving ojets and display the urrent frame with ounding oes for the ojets. Use the prewritten sript traker.m. 9/13

10 5. CAMERA CALBRATON AND 3D MEASUREMENT Camera aliration means aquiring transformation from real world oordinates to image oordinates. The dependeny etween the two oordinate systems an e presented ompatly y a amera matri C, so that s = y s y C, z s 1 = C, where is the oordinates in the image plane and is the oordinates in the real world. Camera aliration is needed, for eample, when images are used for measuring purposes. Figure 6 illustrates the amera and the world oordinates. Figure 6. orld point projetion to a amera plane. n pratie, aliration means alulating the 11 parameters of the amera matri: C = Best Affine Caliration Matri One approah to estimate the matri C is to solve so alled est affine amera (or aliration) matri as presented in leture slides (Chapter 13). n this setion we try to alirate a we-amera y imaging a normal offie ookshelf. After the aliration we eperiment to use the otained amera matries for 3D measurements. T5.1. rite a MATLAB funtion that omputes the est affine amera (or aliration) matri given the image oordinates of known world points. You an use the method eplained in Chapter 13 of ourse material. Also, hek that your ode produes results similar to the eample of Chapter 13. (Eample data is given in Figure in the ourse ook or on the slide Best affine aliration matri: eample in the leture material.) 10/13

11 T5.2. rite a MATLAB sript that solves amera matries for images ookshelf1.jpg and ookshelf2.jpg with your funtion T51.m (you need to solve the amera matri for oth images separately, eause the amera has een moved etween the shots). Knowledge of the dimensions of the shelf (see Figure 7) together with the image oservations an e used to estimate the amera matri as follows: a) Fi world oordinate system (origin and oordinate ais diretions) somehow to the ookshelf and determine world oordinates of at least si (preferaly more) visile orners of the ookshelf in this oordinate system. Use orners from different depths in the shelf. ) Detet image oordinates orresponding to these orners. You an do this manually, MATLAB funtions ginput and pselet may e useful for this task. List si of the oordinates (inluding origin) into the tale elow. ) Estimate the est affine amera matries using the orresponding world and image oordinates and your funtion T51.m. ookshelf1.jpg ookshelf2.jpg orld y 2 2 y y z Computing 3D oints Using Two Cameras Assuming we have two images with known amera matries B and C and a same 3D point seen from oth images, the following equations an e derived s = s y s y z 1, and t t 2 2 = y t y. z 1 From these, we get y eliminating sale fators s and t y y y y y y = y z y y , or equivalently A =, of whih the oordinates of the 3D point an estimated, for eample, y using the least squares method. 11/13

12 T5.3. rite a MATLAB sript that omputes 3D oordinates of some points visile in oth ookshelf1.jpg and ookshelf2.jpg using prewritten funtion ompute3d.m. Eamine the feasiility of the approah for 3D measurements as follows: a) Detet orresponding image oordinates for some shelf orners visile in oth images. Again, you an do this manually, for eample, y utilizing ginput or pselet. ) Estimate the 3D oordinates separately for eah orner point. ) Study the auray of the estimated oordinates y omparing them to the known ones (study separately points that you used in the amera matri estimation and points that you did not use in that phase). For instane, you an determine the dimensions of the ookshelf ased on the 3D estimates and ompare them to the atual values. Q5.1. How do you omment the auray of the estimates in general? hih may e the main error soures in this ase? rite here your feedak aout the ourse (letures, eerises, and laoratory work). Thank you. 12/13

13 800 mm mm 22 mm 22 mm Figure 7. Dimensions of the ookshelf. 13/13

Figure 1. LBP in the field of texture analysis operators.

Figure 1. LBP in the field of texture analysis operators. L MEHODOLOGY he loal inary pattern (L) texture analysis operator is defined as a gray-sale invariant texture measure, derived from a general definition of texture in a loal neighorhood. he urrent form

More information

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu

More information

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and

More information

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah

More information

A {k, n}-secret Sharing Scheme for Color Images

A {k, n}-secret Sharing Scheme for Color Images A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University

More information

Face and Facial Feature Tracking for Natural Human-Computer Interface

Face and Facial Feature Tracking for Natural Human-Computer Interface Fae and Faial Feature Traking for Natural Human-Computer Interfae Vladimir Vezhnevets Graphis & Media Laboratory, Dept. of Applied Mathematis and Computer Siene of Mosow State University Mosow, Russia

More information

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens

More information

Path Sharing and Predicate Evaluation for High-Performance XML Filtering*

Path Sharing and Predicate Evaluation for High-Performance XML Filtering* Path Sharing and Prediate Evaluation for High-Performane XML Filtering Yanlei Diao, Mihael J. Franklin, Hao Zhang, Peter Fisher EECS, University of California, Berkeley {diaoyl, franklin, nhz, fisherp}@s.erkeley.edu

More information

Extracting Partition Statistics from Semistructured Data

Extracting Partition Statistics from Semistructured Data Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk

More information

FUZZY WATERSHED FOR IMAGE SEGMENTATION

FUZZY WATERSHED FOR IMAGE SEGMENTATION FUZZY WATERSHED FOR IMAGE SEGMENTATION Ramón Moreno, Manuel Graña Computational Intelligene Group, Universidad del País Vaso, Spain http://www.ehu.es/winto; {ramon.moreno,manuel.grana}@ehu.es Abstrat The

More information

International Journal of Advancements in Research & Technology, Volume 3, Issue 3, March-2014 ISSN

International Journal of Advancements in Research & Technology, Volume 3, Issue 3, March-2014 ISSN International Journal of Advanements in Researh & Tehnology, Volume 3, Issue 3, Marh-204 ISSN 2278-773 47 Phrase Based Doument Retrieving y Comining Suffix Tree index data struture and Boyer- Moore faster

More information

Projections. Let us start with projections in 2D, because there are easier to visualize.

Projections. Let us start with projections in 2D, because there are easier to visualize. Projetions Let us start ith projetions in D, beause there are easier to visualie. Projetion parallel to the -ais: Ever point in the -plane ith oordinates (, ) ill be transformed into the point ith oordinates

More information

Incremental Mining of Partial Periodic Patterns in Time-series Databases

Incremental Mining of Partial Periodic Patterns in Time-series Databases CERIAS Teh Report 2000-03 Inremental Mining of Partial Periodi Patterns in Time-series Dataases Mohamed G. Elfeky Center for Eduation and Researh in Information Assurane and Seurity Purdue University,

More information

Transition Detection Using Hilbert Transform and Texture Features

Transition Detection Using Hilbert Transform and Texture Features Amerian Journal of Signal Proessing 1, (): 35-4 DOI: 1.593/.asp.1.6 Transition Detetion Using Hilbert Transform and Texture Features G. G. Lashmi Priya *, S. Domni Department of Computer Appliations, National

More information

A scheme for racquet sports video analysis with the combination of audio-visual information

A scheme for racquet sports video analysis with the combination of audio-visual information A sheme for raquet sports video analysis with the ombination of audio-visual information Liyuan Xing a*, Qixiang Ye b, Weigang Zhang, Qingming Huang a and Hua Yu a a Graduate Shool of the Chinese Aadamy

More information

Image Interpolation Using Classification-based Neural Networks

Image Interpolation Using Classification-based Neural Networks Image Interpolation Using Classifiation-ased eural etworks Hao Hu, Student Memer, IEEE, Paul M. Hofman and Gerard de Haan, Senior Memer, IEEE Astrat Standard interpolation metods generally use a uniform

More information

Chromaticity-matched Superimposition of Foreground Objects in Different Environments

Chromaticity-matched Superimposition of Foreground Objects in Different Environments FCV216, the 22nd Korea-Japan Joint Workshop on Frontiers of Computer Vision Chromatiity-mathed Superimposition of Foreground Objets in Different Environments Yohei Ogura Graduate Shool of Siene and Tehnology

More information

特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing

特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper

More information

Automated Test Generation from Vulnerability Signatures

Automated Test Generation from Vulnerability Signatures Automated Test Generation from Vulneraility Signatures Adulaki Aydin, Muath Alkhalaf, and Tevfik Bultan Computer Siene Department University of California, Santa Barara Email: {aki,muath,ultan}@s.us.edu

More information

Triangle LMN and triangle OPN are similar triangles. Find the angle measurements for x, y, and z.

Triangle LMN and triangle OPN are similar triangles. Find the angle measurements for x, y, and z. 1 Use measurements of the two triangles elow to find x and y. Are the triangles similar or ongruent? Explain. 1a Triangle LMN and triangle OPN are similar triangles. Find the angle measurements for x,

More information

A Coarse-to-Fine Classification Scheme for Facial Expression Recognition

A Coarse-to-Fine Classification Scheme for Facial Expression Recognition A Coarse-to-Fine Classifiation Sheme for Faial Expression Reognition Xiaoyi Feng 1,, Abdenour Hadid 1 and Matti Pietikäinen 1 1 Mahine Vision Group Infoteh Oulu and Dept. of Eletrial and Information Engineering

More information

Detection and Recognition of Non-Occluded Objects using Signature Map

Detection and Recognition of Non-Occluded Objects using Signature Map 6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,

More information

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

Evolutionary Feature Synthesis for Image Databases

Evolutionary Feature Synthesis for Image Databases Evolutionary Feature Synthesis for Image Databases Anlei Dong, Bir Bhanu, Yingqiang Lin Center for Researh in Intelligent Systems University of California, Riverside, California 92521, USA {adong, bhanu,

More information

FOREGROUND OBJECT EXTRACTION USING FUZZY C MEANS WITH BIT-PLANE SLICING AND OPTICAL FLOW

FOREGROUND OBJECT EXTRACTION USING FUZZY C MEANS WITH BIT-PLANE SLICING AND OPTICAL FLOW FOREGROUND OBJECT EXTRACTION USING FUZZY C EANS WITH BIT-PLANE SLICING AND OPTICAL FLOW SIVAGAI., REVATHI.T, JEGANATHAN.L 3 APSG, SCSE, VIT University, Chennai, India JRF, DST, Dehi, India. 3 Professor,

More information

Video Data and Sonar Data: Real World Data Fusion Example

Video Data and Sonar Data: Real World Data Fusion Example 14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu

More information

A New RBFNDDA-KNN Network and Its Application to Medical Pattern Classification

A New RBFNDDA-KNN Network and Its Application to Medical Pattern Classification A New RBFNDDA-KNN Network and Its Appliation to Medial Pattern Classifiation Shing Chiang Tan 1*, Chee Peng Lim 2, Robert F. Harrison 3, R. Lee Kennedy 4 1 Faulty of Information Siene and Tehnology, Multimedia

More information

1 Disjoint-set data structure.

1 Disjoint-set data structure. CS 124 Setion #4 Union-Fin, Greey Algorithms 2/20/17 1 Disjoint-set ata struture. 1.1 Operations Disjoint-set ata struture enale us to effiiently perform operations suh as plaing elements into sets, querying

More information

INTEGRATING PHOTOGRAMMETRY AND INERTIAL SENSORS FOR ROBOTICS NAVIGATION AND MAPPING

INTEGRATING PHOTOGRAMMETRY AND INERTIAL SENSORS FOR ROBOTICS NAVIGATION AND MAPPING INTEGRATING PHOTOGRAMMETRY AND INERTIAL SENSORS FOR ROBOTICS NAVIGATION AND MAPPING Fadi Bayoud, Jan Skaloud, Bertrand Merminod Eole Polytehnique Fédérale de Lausanne (EPFL) Geodeti Engineering Laoratory

More information

Graph-Based vs Depth-Based Data Representation for Multiview Images

Graph-Based vs Depth-Based Data Representation for Multiview Images Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:

More information

Defect Detection and Classification in Ceramic Plates Using Machine Vision and Naïve Bayes Classifier for Computer Aided Manufacturing

Defect Detection and Classification in Ceramic Plates Using Machine Vision and Naïve Bayes Classifier for Computer Aided Manufacturing Defet Detetion and Classifiation in Cerami Plates Using Mahine Vision and Naïve Bayes Classifier for Computer Aided Manufaturing 1 Harpreet Singh, 2 Kulwinderpal Singh, 1 Researh Student, 2 Assistant Professor,

More information

New Fuzzy Object Segmentation Algorithm for Video Sequences *

New Fuzzy Object Segmentation Algorithm for Video Sequences * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 521-537 (2008) New Fuzzy Obet Segmentation Algorithm for Video Sequenes * KUO-LIANG CHUNG, SHIH-WEI YU, HSUEH-JU YEH, YONG-HUAI HUANG AND TA-JEN YAO Department

More information

Outline. CS38 Introduction to Algorithms. Administrative Stuff. Administrative Stuff. Motivation/Overview. Administrative Stuff

Outline. CS38 Introduction to Algorithms. Administrative Stuff. Administrative Stuff. Motivation/Overview. Administrative Stuff Outline CS38 Introdution to Algorithms Leture 1 April 1, 2014 administrative stuff motivation and overview of the ourse stale mathings example graphs, representing graphs graph traversals (BFS, DFS) onnetivity,

More information

The Implementation of RRTs for a Remote-Controlled Mobile Robot

The Implementation of RRTs for a Remote-Controlled Mobile Robot ICCAS5 June -5, KINEX, Gyeonggi-Do, Korea he Implementation of RRs for a Remote-Controlled Mobile Robot Chi-Won Roh*, Woo-Sub Lee **, Sung-Chul Kang *** and Kwang-Won Lee **** * Intelligent Robotis Researh

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. Improvement of low illumination image enhancement algorithm based on physical mode

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. Improvement of low illumination image enhancement algorithm based on physical mode [Type text] [Type text] [Type text] ISSN : 0974-7435 Volume 10 Issue 22 BioTehnology 2014 An Indian Journal FULL PAPER BTAIJ, 10(22), 2014 [13995-14001] Improvement of low illumination image enhanement

More information

Gradient based progressive probabilistic Hough transform

Gradient based progressive probabilistic Hough transform Gradient based progressive probabilisti Hough transform C.Galambos, J.Kittler and J.Matas Abstrat: The authors look at the benefits of exploiting gradient information to enhane the progressive probabilisti

More information

Boosted Random Forest

Boosted Random Forest Boosted Random Forest Yohei Mishina, Masamitsu suhiya and Hironobu Fujiyoshi Department of Computer Siene, Chubu University, 1200 Matsumoto-ho, Kasugai, Aihi, Japan {mishi, mtdoll}@vision.s.hubu.a.jp,

More information

timestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else

timestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else 3rd International Conferene on Multimedia Tehnolog(ICMT 013) An Effiient Moving Target Traking Strateg Based on OpenCV and CAMShift Theor Dongu Li 1 Abstrat Image movement involved bakground movement and

More information

Tracking Table Tennis Balls in Real Match Scenes for Umpiring Applications

Tracking Table Tennis Balls in Real Match Scenes for Umpiring Applications British Journal of Mathematis & Computer Siene 1(4): 228-241, 2011 SCIENCEDOMAIN international www.sienedomain.org Traking Tale Tennis Balls in Real Math Senes for Umpiring Appliations K. C. P. Wong 1*

More information

Efficient and scalable trie-based algorithms for computing set containment relations

Efficient and scalable trie-based algorithms for computing set containment relations Effiient and salale trie-ased algorithms for omputing set ontainment relations Yongming Luo #1, George H. L. Flether #2, Jan Hidders 3, Paul De Bra #4 # Eindhoven University of Tehnology, The Netherlands

More information

Test Case Generation from UML State Machines

Test Case Generation from UML State Machines Test Case Generation from UML State Mahines Dirk Seifert Loria Université Nany 2 Campus Sientifique, BP 239 F-54506 Vandoeuvre lès Nany edex Dirk.Seifert@Loria.fr inria-00268864, version 2-23 Apr 2008

More information

Polyhedron Volume-Ratio-based Classification for Image Recognition

Polyhedron Volume-Ratio-based Classification for Image Recognition Polyhedron Volume-Ratio-based Classifiation for Image Reognition Qingxiang Feng, Jeng-Shyang Pan, Senior Member, IEEE, Jar-Ferr Yang, Fellow, IEEE and Yang-ing Chou Abstrat In this paper, a novel method,

More information

the data. Structured Principal Component Analysis (SPCA)

the data. Structured Principal Component Analysis (SPCA) Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving

More information

Routing Protocols for Wireless Ad Hoc Networks Hybrid routing protocols Theofanis Kilinkaridis

Routing Protocols for Wireless Ad Hoc Networks Hybrid routing protocols Theofanis Kilinkaridis Routing Protools for Wireless Ad Ho Networks Hyrid routing protools Theofanis Kilinkaridis tkilinka@.hut.fi Astrat This paper presents a partiular group of routing protools that aim to omine the advantages

More information

Constrained Extreme Learning Machines: A Study on Classification Cases

Constrained Extreme Learning Machines: A Study on Classification Cases > REPLACE HIS LINE IH YOUR PAPER IDENIFICAION NUMBER (DOUBLE-CLICK HERE O EDI) < Constrained Extreme Learning Mahines: A Study on Classifiation Cases entao Zhu, Jun Miao, and Laiyun Qing Astrat Extreme

More information

represent = as a finite deimal" either in base 0 or in base. We an imagine that the omputer first omputes the mathematial = then rounds the result to

represent = as a finite deimal either in base 0 or in base. We an imagine that the omputer first omputes the mathematial = then rounds the result to Sientifi Computing Chapter I Computer Arithmeti Jonathan Goodman Courant Institute of Mathemaial Sienes Last revised January, 00 Introdution One of the many soures of error in sientifi omputing is inexat

More information

Abstract. We describe a parametric hybrid Bezier patch that, in addition. schemes are local in that changes to part of the data only aect portions of

Abstract. We describe a parametric hybrid Bezier patch that, in addition. schemes are local in that changes to part of the data only aect portions of A Parametri Hyrid Triangular Bezier Path Stephen Mann and Matthew Davidhuk Astrat. We desrie a parametri hyrid Bezier path that, in addition to lending interior ontrol points, lends oundary ontrol points.

More information

A Novel Validity Index for Determination of the Optimal Number of Clusters

A Novel Validity Index for Determination of the Optimal Number of Clusters IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers

More information

DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT

DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT 1 ZHANGGUO TANG, 2 HUANZHOU LI, 3 MINGQUAN ZHONG, 4 JIAN ZHANG 1 Institute of Computer Network and Communiation Tehnology,

More information

Structural Topology Optimization Based on the Smoothed Finite Element Method

Structural Topology Optimization Based on the Smoothed Finite Element Method 378 Strutural Topology Optimization Based on the Smoothed Finite Element Method Astrat In this paper, the smoothed finite element method, inorporated with the level set method, is employed to arry out

More information

A Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering

A Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering A Novel Bit Level Time Series Representation with Impliation of Similarity Searh and lustering hotirat Ratanamahatana, Eamonn Keogh, Anthony J. Bagnall 2, and Stefano Lonardi Dept. of omputer Siene & Engineering,

More information

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and

More information

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese

More information

Circular Pruning for Lazy Diagnosis of Active Systems

Circular Pruning for Lazy Diagnosis of Active Systems Cirular Pruning for Lazy Diagnosis of Ative Systems Andrea Duoli, Gianfrano Lamperti, Emanuele Piantoni, Marina Zanella Dipartimento di Elettronia per l Automazione, Università di Bresia, Italy Astrat:

More information

CA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1

CA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1 Exam (CAT-600) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation

More information

Semi-Supervised Affinity Propagation with Instance-Level Constraints

Semi-Supervised Affinity Propagation with Instance-Level Constraints Semi-Supervised Affinity Propagation with Instane-Level Constraints Inmar E. Givoni, Brendan J. Frey Probabilisti and Statistial Inferene Group University of Toronto 10 King s College Road, Toronto, Ontario,

More information

CSCI-4972/6963 Advanced Computer Graphics

CSCI-4972/6963 Advanced Computer Graphics Luo Jr. CSCI-497/696 Advaned Computer Graphis http://www.s.rpi.edu/~utler/lasses/advanedgraphis/s8/ Professor Barb Cutler utler@s.rpi.edu MRC 9A Piar Animation Studios, 986 Topis for the Semester Mesh

More information

3D-TV Rendering from Multiple Cameras

3D-TV Rendering from Multiple Cameras Master s Thesis 3D-TV Rendering from Multiple Cameras Thesis ommittee: Prof. dr. ir. Jan Biemond Dr. C.P. Botha Dr. Emile A. Hendriks Dr. ir. Andre Redert Author Anastasia Manta Email amantamio@hotmail.om

More information

CleanUp: Improving Quadrilateral Finite Element Meshes

CleanUp: Improving Quadrilateral Finite Element Meshes CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)

More information

arxiv: v1 [cs.gr] 10 Apr 2015

arxiv: v1 [cs.gr] 10 Apr 2015 REAL-TIME TOOL FOR AFFINE TRANSFORMATIONS OF TWO DIMENSIONAL IFS FRACTALS ELENA HADZIEVA AND MARIJA SHUMINOSKA arxiv:1504.02744v1 s.gr 10 Apr 2015 Abstrat. This work introdues a novel tool for interative,

More information

Expert Systems with Applications

Expert Systems with Applications Expert Systems with Appliations 39 (2012) 2842 2855 Contents lists available at SiVerse SieneDiret Expert Systems with Appliations journal homepage: www.elsevier.om/loate/eswa An automated vision system

More information

ASSESSMENT OF TWO CHEAP CLOSE-RANGE FEATURE EXTRACTION SYSTEMS

ASSESSMENT OF TWO CHEAP CLOSE-RANGE FEATURE EXTRACTION SYSTEMS ASSESSMENT OF TWO CHEAP CLOSE-RANGE FEATURE EXTRACTION SYSTEMS Ahmed Elaksher a, Mohammed Elghazali b, Ashraf Sayed b, and Yasser Elmanadilli b a Shool of Civil Engineering, Purdue University, West Lafayette,

More information

Recursion examples: Problem 2. (More) Recursion and Lists. Tail recursion. Recursion examples: Problem 2. Recursion examples: Problem 3

Recursion examples: Problem 2. (More) Recursion and Lists. Tail recursion. Recursion examples: Problem 2. Recursion examples: Problem 3 Reursion eamples: Problem 2 (More) Reursion and s Reursive funtion to reverse a string publi String revstring(string str) { if(str.equals( )) return str; return revstring(str.substring(1, str.length()))

More information

NOISE REMOVAL FOR OBJECT TRACKING BASED ON HSV COLOR SPACE PARAMETER USING CAMSHIFT

NOISE REMOVAL FOR OBJECT TRACKING BASED ON HSV COLOR SPACE PARAMETER USING CAMSHIFT International Journal of Computational Intelligene & Teleommuniation Sstems () 0 pp. 39-45 NOISE REOVAL FOR OBJECT TRACKING BASED ON HSV COLOR SPACE PARAETER USING CASHIFT P. Raavel G. Appasami and R.

More information

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? 3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg

More information

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University

More information

Performance Enhancement Techniques for InfiniBand TM Architecture

Performance Enhancement Techniques for InfiniBand TM Architecture Performane Enhanement Tehniques for InfiniBand TM Arhiteture Eun Jung Kim? Ki Hwan Yum y Chita R. Das? Mazin Yousif z JoséDuato x? Department of Computer Siene and Engineering The Pennsylvania State University

More information

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of

More information

A Practical Tool for Visualizing and Data Mining Medical Time Series

A Practical Tool for Visualizing and Data Mining Medical Time Series A Pratial Tool for Visualizing and Data Mining Medial Time Series Astrat The inreasing interest in time series data mining in the last deade has had surprisingly little impat on real world medial appliations.

More information

Gray Codes for Reflectable Languages

Gray Codes for Reflectable Languages Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings

More information

5.2.1 Ant, indispensable Ant

5.2.1 Ant, indispensable Ant 5.2.1 Ant, indispensale Ant Apahe s Ant produt (http://ant.apahe.org/) is a uild tool that lets you easily ompile and test appliations (among other things). It is the de fato standard for uilding Java

More information

A Support-Based Algorithm for the Bi-Objective Pareto Constraint

A Support-Based Algorithm for the Bi-Objective Pareto Constraint A Support-Based Algorithm for the Bi-Ojetive Pareto Constraint Renaud Hartert and Pierre Shaus UCLouvain, ICTEAM, Plae Sainte Bare 2, 1348 Louvain-la-Neuve, Belgium {renaud.hartert, pierre.shaus,}@ulouvain.e

More information

Using Augmented Measurements to Improve the Convergence of ICP

Using Augmented Measurements to Improve the Convergence of ICP Using Augmented Measurements to Improve the onvergene of IP Jaopo Serafin, Giorgio Grisetti Dept. of omputer, ontrol and Management Engineering, Sapienza University of Rome, Via Ariosto 25, I-0085, Rome,

More information

LAB 4: Operations on binary images Histograms and color tables

LAB 4: Operations on binary images Histograms and color tables LAB 4: Operations on binary images Histograms an olor tables Computer Vision Laboratory Linköping University, Sween Preparations an start of the lab system You will fin a ouple of home exerises (marke

More information

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer

More information

A Support-Based Algorithm for the Bi-Objective Pareto Constraint

A Support-Based Algorithm for the Bi-Objective Pareto Constraint Proeedings of the Twenty-Eighth AAAI Conferene on Artifiial Intelligene A Support-Based Algorithm for the Bi-Ojetive Pareto Constraint Renaud Hartert and Pierre Shaus UCLouvain, ICTEAM, Plae Sainte Bare

More information

Relevance for Computer Vision

Relevance for Computer Vision The Geometry of ROC Spae: Understanding Mahine Learning Metris through ROC Isometris, by Peter A. Flah International Conferene on Mahine Learning (ICML-23) http://www.s.bris.a.uk/publiations/papers/74.pdf

More information

Triangles. Learning Objectives. Pre-Activity

Triangles. Learning Objectives. Pre-Activity Setion 3.2 Pre-tivity Preparation Triangles Geena needs to make sure that the dek she is building is perfetly square to the brae holding the dek in plae. How an she use geometry to ensure that the boards

More information

Measurement of the stereoscopic rangefinder beam angular velocity using the digital image processing method

Measurement of the stereoscopic rangefinder beam angular velocity using the digital image processing method Measurement of the stereosopi rangefinder beam angular veloity using the digital image proessing method ROMAN VÍTEK Department of weapons and ammunition University of defense Kouniova 65, 62 Brno CZECH

More information

Unsupervised color film restoration using adaptive color equalization

Unsupervised color film restoration using adaptive color equalization Unsupervised olor film restoration using adaptive olor equalization A. Rizzi 1, C. Gatta 1, C. Slanzi 1, G. Cioa 2, R. Shettini 2 1 Dipartimento di Tenologie dell Informazione Università degli studi di

More information

Color Image Fusion for Concealed Weapon Detection

Color Image Fusion for Concealed Weapon Detection In: E.M. Carapezza (Ed.), Sensors, and ommand, ontrol, ommuniations, and intelligene (C3I) tehnologies for homeland defense and law enforement II, SPIE-571 (pp. 372-379). Bellingham, WA., USA: The International

More information

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0; Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;

More information

Mining Edge-Weighted Call Graphs to Localise Software Bugs

Mining Edge-Weighted Call Graphs to Localise Software Bugs Mining Edge-Weighted Call Graphs to Loalise Software Bugs Frank Eihinger, Klemens Böhm, and Matthias Huer Institute for Program Strutures and Data Organisation (IPD), Universität Karlsruhe (TH), Germany

More information

Multi-Level Modeling of Concurrent and Distributed Systems

Multi-Level Modeling of Concurrent and Distributed Systems Multi-Level Modeling of Conurrent and Distriuted Systems Peter Taeling Hasso-Plattner-Institute for Software Systems Engineering P.O. Box 90 04 60, 14440 Potsdam, Germany taeling@hpi.uni-potsdam.de strat

More information

arxiv: v1 [cs.db] 13 Sep 2017

arxiv: v1 [cs.db] 13 Sep 2017 An effiient lustering algorithm from the measure of loal Gaussian distribution Yuan-Yen Tai (Dated: May 27, 2018) In this paper, I will introdue a fast and novel lustering algorithm based on Gaussian distribution

More information

Cluster-Based Cumulative Ensembles

Cluster-Based Cumulative Ensembles Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,

More information

HEXA: Compact Data Structures for Faster Packet Processing

HEXA: Compact Data Structures for Faster Packet Processing Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for

More information

Colouring contact graphs of squares and rectilinear polygons de Berg, M.T.; Markovic, A.; Woeginger, G.

Colouring contact graphs of squares and rectilinear polygons de Berg, M.T.; Markovic, A.; Woeginger, G. Colouring ontat graphs of squares and retilinear polygons de Berg, M.T.; Markovi, A.; Woeginger, G. Published in: nd European Workshop on Computational Geometry (EuroCG 06), 0 Marh - April, Lugano, Switzerland

More information

Multiple-Criteria Decision Analysis: A Novel Rank Aggregation Method

Multiple-Criteria Decision Analysis: A Novel Rank Aggregation Method 3537 Multiple-Criteria Deision Analysis: A Novel Rank Aggregation Method Derya Yiltas-Kaplan Department of Computer Engineering, Istanbul University, 34320, Avilar, Istanbul, Turkey Email: dyiltas@ istanbul.edu.tr

More information

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of

More information

CA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0

CA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0 Implementation Proven Professional Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer

More information

University of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): /ICIP.2016.

University of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): /ICIP.2016. Anantrasirihai, P., Gilhrist, I., & Bull, D. (2016). Fixation identifiation for low-sample-rate mobile eye trakers. In IEEE International Conferene on Image Proessing (ICIP), 2016 Institute of Eletrial

More information

CA API Management 8.x Implementation Proven Professional Exam (CAT-560) Study Guide Version 1.1

CA API Management 8.x Implementation Proven Professional Exam (CAT-560) Study Guide Version 1.1 Exam (CAT-560) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information

Dynamic Algorithms Multiple Choice Test

Dynamic Algorithms Multiple Choice Test 3226 Dynami Algorithms Multiple Choie Test Sample test: only 8 questions 32 minutes (Real test has 30 questions 120 minutes) Årskort Name Eah of the following 8 questions has 4 possible answers of whih

More information

Developing Dually Optimal LCA Features in Sensory and Action Spaces for Classification

Developing Dually Optimal LCA Features in Sensory and Action Spaces for Classification Developing Dually Optimal LCA Features in Sensory and Ation Spaes for Classifiation Nikita Wagle and Juyang Weng Department of Computer Siene & Engineering Mihigan State University East Lansing, Mihigan

More information

Shape Outlier Detection Using Pose Preserving Dynamic Shape Models

Shape Outlier Detection Using Pose Preserving Dynamic Shape Models Shape Outlier Detetion Using Pose Preserving Dynami Shape Models Chan-Su Lee Ahmed Elgammal Department of Computer Siene, Rutgers University, Pisataway, NJ 8854 USA CHANSU@CS.RUTGERS.EDU ELGAMMAL@CS.RUTGERS.EDU

More information

TUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM

TUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM TUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM M. Murugeswari 1, M.Gayathri 2 1 Assoiate Professor, 2 PG Sholar 1,2 K.L.N College of Information

More information

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425) Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University

More information

Context-Aware Activity Modeling using Hierarchical Conditional Random Fields

Context-Aware Activity Modeling using Hierarchical Conditional Random Fields Context-Aware Ativity Modeling using Hierarhial Conditional Random Fields Yingying Zhu, Nandita M. Nayak, and Amit K. Roy-Chowdhury Abstrat In this paper, rather than modeling ativities in videos individually,

More information