Efficient Generation of Large Amounts of Training Data for Sign Language Recognition: A Semi-Automatic Tool
|
|
- Irene Robinson
- 5 years ago
- Views:
Transcription
1 Efficient Generation of Lare Amounts of Trainin Data for Sin Lanuae Reconition: A Semi-Automatic Tool Ruiduo Yan, Sudeep Sarkar, Barbara Loedin, and Arthur Karshmer University of South Florida, Tampa, FL,60, USA University of South Florida, Lakeland, FL, 80, USA Abstract. We have developed a video hand sementation tool which can help with eneratin hands round truth from sin lanuae imae sequences. This tool may reatly facilitate research in the area of sin lanuae reconition. n this tool, we offer a semi automatic scheme to assistwiththelocalizationofhandpixels,whichisimportantforthe purpose of reconition. A candidate hand enerator is applied by usin the mean shift imae sementation alorithm and a reedy seeds rowin alorithm. After a number of hand candidates is enerated, the user can reduce the candidates by simple mouse clicks. The tool also provides a hand trackin function for faster processin and a face detection function for roundtruthin non manual sinals. n addition, we provided a twopasses roundtruthin scheme unlike other tools that only does one-pass. Our first pass processin is automatic and does not need user interaction. The experiment results demonstrate that based on the first pass s result, one can roundtruth 0,000+ frames of sin lanuae within 8 hours. ntroduction With the rowin capacity of computer vision technoloy, there is more interest bein directed towards the automatic reconition of sin lanuae based solely on imae sequences or videos. We refer the reader to [] for a review of the applications of related vision technoloies. Briefly, if an accurate and reliable method can be developed to reconize and translate from sin sentences to spoken or written lanuaes, this will help alleviate communication difficulties that Deaf people experience daily. This method can be incorporated into an assistive device carried by the Deaf person or available within the computer systems of stores, banks and other places where a Deaf person needs to communicate with non-siners. n a vision-based sin lanuae reconition system, enerally a model will be trained on either a phoneme, sin or sentence level. This requires accurate feature extractions from the imae frames. For example, one may need to extract the facial expression, hand position and hand shape parameters. However, the automatic hand sementation is a challenin problem and unwanted noise will be enerated for real world imae sequences; hence the accuracy of the model
2 can be decreased. For example, an automatic scheme for sementin the hand can be based on hand color model [], stereo depth [], colored loves [] or motion [] information. Nevertheless, a hand color model is not sufficient for real world imaes where a lare variation of lihtin condition exists. Alternatively usin depth imae is slow and will fail when the hand moves to the same plane as the body. n addition, colored loves miht help durin trainin but it still chanes the appearance of hand and makes the siner feel unnatural. And finally, althouh usin motion information is usually robust, it cannot accommodate subtle hand shape chanes and a movin backround. Due to these reasons, a hand roundtruthin step is often taken with an annotation tool before we start the trainin. Sin lanuae trainin databases enerally consist of many video shots and frames, which makes it very hard to roundtruth quickly usin eneral imae processin tool (e.. Photoshop) frame by frame. Even with a vision based video annotation tool, this task could be labor intensive and time-consumin. For example, considerin a small trainin database that has 00 sins, each sin has trainin samples and the averae lenth of one trainin sample is 0 frames. There are a total of x00x0=000 frames. Suppose we were usin a eneral imae processin tool which can enerate roundtruth for one frame in min. The time cost to roundtruth the whole database will be days. n this paper, we offer a semi automatic scheme to assist with the localization of hand pixels, which is important for the purpose of reconition. A candidate hand enerator is applied by usin the mean shift imae sementation alorithm and a reedy seeds rowin alorithm. After a number of hand candidates is enerated, the user can reduce the candidates by simple mouse clicks. n addition, we provided a two-passes roundtruthin scheme unlike other tool that only do one-pass. Our first pass processin is automatic and does not need user interaction. We are aware of many other video annotation tools. However, most focus on scene sementation or key frame detection (e.. BM EVA[6], ESP Game[7]). Some of them combine local feature extraction and temporal trackin toether. For example, the VPER annotation tool proposed by Pfund et.al [8] provides imae sementation, temporal sementation and event annotation toether; ViPer- GT proposed by Doermann et.al [9] can detect multiple objects and track them usin boundin boxes automatically, Marcoteui et.al proposed VOGUE [0], where a number of imae and video sementation techniques are incorporated for object annotation purpose. All of these tools are standalone applications providin semi automatic roundtruthin function with user-friendly interface. Our annotation tool is a side-product of our vision-based American Sin Lanuae(ASL) reconition system. t also provides a semi-automatic scheme for efficient round-truthin. However, its main purpose is to sement the hand pixels frame by frame. nstead of usin the eneral sementation and trackin alorithm as in the existin tools, we advocate a candidate hand enerator approach which is more reliable durin hand shape chane and hand crossin face situation. Unlike the existin tools where only one-pass is conducted, we offer a
3 two-pass scheme for faster processin, where the first pass enerates candidate hands automatically. Fi. illustrates our two-pass scheme. n Fi. (a), ASL video frames are first semented into seed primitives; these primitives are rouped by a roupin enine to enerate overlapped candidate hand roups, where each roup may consist of one or more primitives. This step is automatic and no user interaction is involved. n Fi. (b), where the second pass is taken, the rouped results will be loaded back for user s examination. Note the number of enerated roups could be hue, hence we allow the user to mouse click the hand reion to reduce the number of candidates. At the same time a trackin method is also incorporated amon adjacent frames to improve efficiency. The paper is oranized as follows: in section we will discuss the alorithm used in the first-pass, Section describes the Graphic User nterface(gu), Section shows us the experimental results and we conclude with Section. Groupin = { p, p = { p, p = { p, p = { p, p = { p, p = { p, p links between roups = { p, p = { p, p { = p 6 = { p = { p, p { = p = { p, p = { p, = { p, p p = { p, p, p6 6 = { p, p6 Semented Frames p p p p p p p p p p p p p p 6 p Oriinal Frames Groupin layers and links between roups (a) First Pass : Groupin = { p, p = { p, p = { p, p = { p, p { = p 6 = { p = { p, p = { p, p = { p, p { = p = { p, p = { p, p = { p, p = { p, = { p, p p = { p, p, p6 6 = { p, p6 Oriinal Frames User Selection Trackin User Selection Trackin User Selection (b) Second Pass: Selection Fi.. Overview of the two-pass approach
4 First-Pass : Sementation and Groupin The first-pass annotation can be done completely on the backround since there is no user interaction involved. The oal of this pass is to enerate the hand candidates and store them as a file to be reloaded in the second pass. For existin annotation tools, these two passes are enerally workin at the same time, forcin the user to wait for the sementin and trackin result. With a complex scene, the sementation itself can be very time consumin. (e.. a sementation of one sinle frame with a hihly textured scene with mean shift method [] could take over 0 seconds). On the other hand, many trackin techniques take an iterative approach which could also be slow. Trackin methods also suffer from the requirement of ood initialization, which must be taken for each sin in the trainin dataset separately. For our case, since we tend to enerate as many candidates as possible to accommodate with the fast chanin appearance of the hand while sinin, the processin of one sinle frame will even be slower. For example, with a complex scene there will be over 00 candidate hands enerated, which result in a runnin time for one frame to exceed 0 seconds. Fortunately, unlike other trackin or hand sementation schemes, our approach does not require perfect results or user modification when the candidate hands are bein detected. Hence this step can be done solely in the backround.. Groupin of Primitives We adopt a reedy approach to form the roups. Let us denote the low-level reion patches in the k-th imae frame by S k = {p k,,p k N k. From this initial set of primitives, we select a subset of primitives that are likely to come from the hand, based on the size of the patch. These are our seed patches. Given someknowledeoftheapproximatesizeofthehandsinthesequence,wecan eliminate lare, non-homoeneous reion patches from further consideration. We use a list L to store the possible roups. This list is initialized by choosin each selected primitive to be a sinleton roup. These roups would be mered to form a larer conlomerate. The roupin process starts by pickin the first roup in L, denotedhere by p, and searchin for its neihbors {Np. i Each neihbor Np i is considered for roupin with p to enerate a tentative larer roupin. We select the best local roupin, and denote it as. The roup is further tested to see if it can possibly represent a hand. f the roup passes this test, it is inserted into the final candidate roup list, C, otherwise it is inserted at the end of the list L, to be considered for further roupin.. Associatin Groups Across Frames We denote the jth roup detected in tth frame as G j t. The roups detected in each frame are associated with those detected in previous frames to result in a
5 linked sequence of roups spannin all the frames. We define the predecessors set of each element in each roups set as Pre(G j t)=[g j t,,gjn t ],t, j k c t, () where G j k t is one possible predecessor of G j t. The predecessor relationship between the roups from different time instants is based on feature similarity. t captures how likely the roups are from the same underlyin cause in the imae. We will use the best successors as the trackin result. Second Pass: Graphic User nterface After the candidate roups and their links are enerated, user interaction is needed to select the best roup, with a default roup iven at each frame by the trackin method. We provide functionality that specifically works well for sin sentences. These functions are built upon the candidate enerator discussed in section, a simple trackin technique that work with the links between the candidate roups, a face detector for non-manual information analysis, a lossin tool and various elements that facilitate the hand roundtruthin. The application is coded under the Microsoft Visual Studio Environment, usin MFC class, OpenCV libraries and related windows APs. Fi. illustrate us the GU. mportant functions related to sin lanuae are supported as:. views of current frame: The first is the dominant hand view, the second is the non-dominant hand view, the third is the view for both.. Click to select: One can click on the hand area to reduce the roups to be shown. The shown roups must include the point where the mouse is clicked.. Missin hand checkbox: One can choose the current hand as missin if the hand is out of the scene.. Hand listboxes: The two listboxes below show the list of the candidate dominant hand and candidate non-dominant hands. The list is ranked by their boundary smoothness and the trackin result. The hihlihted item is the candidate hand that is bein selected.. Face detector: automatic face detector, shown as the blue boundin box. 6. Play,Stop,Step Button: Pressin the play button will automatically track all the hands and save the result. Stop Button will stop the trackin. Step button is to allow the application to track one frame and wait for the user s response, which is most often used. 7. Redo Checkbox: Redo Checkbox allows one to re-detect the current sequence. Experiment Result We tested our annotation tool with datasets with different parameters settins. Both of them consist of ASL sin sentences. The first dataset has a simple backround with 067 frames and a resolution of 60x90. On averae there are 00 candidate hands enerated per frame for this dataset, yet it took us
6 Fi.. The Graphic User nterface less than 8 hours to finish roundtruthin both hands. The second dataset has a complex backround with 60x80 resolution. There are 00 candidate hands enerated for each frame. We took 00 frames and established the roundtruth within hour. Note the time we refer to here is the user interaction time, that is, the time of the second pass. n Fi. (a), we show the time taken over the datasets of the two passes. We use a P.G CPU with G memory. The number shown is the time taken per frame in seconds. Our first pass takes relatively loner since we incorporated automatic sementation, face detection, and the reedy seeds rowin alorithm. However it s completed offline. The second pass is done by reloadin the candidate result, takin much shorter time. On the other hand, Fi. (b) shows us the time taken for different method sets of the tool. We choose 00 frames from the simple backround set to do the experiment. Here we refer to C as the method that only uses the enerated result, C+C refers to usin the click-to-select method to reduce the candidate set, C+T refers to usin candidate with trackin method, C++ refers to the method of usin candidate and both click-to-select and trackin method. Trackin contributes a lot because it exploits the temporal relationship. The click-to-select method does help when trackin failed. For example, when a lare motion happens, drastic hand shape chanes and occlusion happens. At the same time, we did an experiment, usin wand tools in a imae editin software to roundtruth 0 frames randomly chosen from the dataset. The averae time taken for each frame exceeds min. Fi. shows us some visual results of the enerated candidate hands. We can see our method can discern the handshape even when there is occlusion and overlaps. n particular, Fi. (c) shows us the result where face crossed hand, and Fi. (f) shows us where the two hands crossed each other.
7 Simple Backround Complex Backround Second Pass.9 6. First Pass. 8.8 (a) 0 C C+C C+T C++ Time ((b) Fi.. (a) Time taken of first pass and second pass (in seconds). (b) Time taken with different method sets. (in seconds) (a) (b) (c) (d) (e) (f) Fi.. (a) Oriinal frame. (b) Semented frame (c) List of candidate roups in frame. (d) Oriinal frame. (e) Semented frame (f) List of candidate roups in in frame
8 Conclusion n this paper, we describe our semi-automatic tool for annotatin sin lanuae video sequences. The objective of this tool is to enerate lare amount of data with labeled hand pixels that can provide reliable trainin process. The tool uses sementation, trackin and offline processin method to considerably save the time to et the reliable hand data. For future work, an assistin edit tool can be added to secure the situation when there are meres amon hand pixels and non-hand pixels where sementation and roupin fail. 6 Acknowledment This work was supported in part by the National Science Foundation under rant S 099. Any opinions, findins and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect those of the National Science Foundation. References. B. L. Loedin, S. Sarkar, A. Parashar and A.. Karshmer.: Proress in Automated Computer Reconition of Sin Lanuae., Lecture Notes in Computer Science, 8(00), T. Starner, and J. Weaver and A. P. Pentland.: Real-time American Sin Lanuae Reconition usin Desk and Wearable Computer Based Video, EEE Transactions on Pattern Analysis and Machine ntellience, (998) L. V. Tsap and M. C. Shin.: Dynamic Disparity Adjustment and Historam-Based Filterin of Rane Data for Fast -D Hand Trackin, Journal of Diital Sinal Processin, (00) A. Just and S. Marcel.: Two-Handed Gesture Reconition, DAP Research nstitute CH-90, 00, Martiny, Switzerland. M.H. Yan., N.Ahuja. and M. Tabb.: Extraction of D Motion Trajectories and its Application to Hand Gesture Reconition., EEE Transactions on Pattern Analysis and Machine ntellience, (00) T. Volkmer and J. R. Smith and A. Natsev.: A Web-based System for Collaborative Annotation of Lare mae and Video Collections: An Evaluation and User Study, MULTMEDA 0: Proceedins of the th annual ACM international conference on Multimedia, (00) L. V. Ahn and L. Dabbish.: Labelin maes with a Computer Game. n Conference on Human Factors in Computin Systems (CH) (00) T. Pfund and S. M. Maillet. A Dynamic Multimedia Annotation tool. n G. Beretta and R. Schettini, editors, n Proceedins of SPE Photonics West, Electronic main 00, nternet main, 67 (00) D. Doermann and D. Mihalcik. Tools and Techniques for Video Performance Evaluation. n Proceedins of the EEE nternational Conference on Pattern Reconistion (CPR 00), (000) B. Marcoteui, P. Correia,A Video Object Generation Tool Allowin Friendly User nteraction.,nternational Conference on mae Processin, (999) D. Comanicu and P. Meer.: Mean shift: A Robust Approach Toward Feature Space Analysis., EEE Transactions on Pattern Analysis and Machine ntellience, (00)
Efficient Generation of Large Amounts of Training Data for Sign Language Recognition: A Semi-automatic Tool
Efficient Generation of Lare Amounts of Trainin Data for Sin Lanuae Reconition: A Semi-automatic Tool Ruiduo Yan, Sudeep Sarkar,BarbaraLoedin, and Arthur Karshmer University of South Florida, Tampa, FL,
More informationA Scene Text-Based Image Retrieval System
A Scene Text-Based Imae Retrieval System Thuy Ho Faculty of Information System University of Information Technoloy Ho Chi Minh city, Vietnam thuyhtn@uit.edu.vn Noc Ly Faculty of Information Technoloy University
More informationA Scene Text-Based Image Retrieval System
A Scene Text-Based Imae Retrieval System ThuyHo Faculty of Information System University of Information Technoloy Ho Chi Minh city, Vietnam thuyhtn@uit.edu.vn Noc Ly Faculty of Information Technoloy University
More informationSCALE SELECTIVE EXTENDED LOCAL BINARY PATTERN FOR TEXTURE CLASSIFICATION. Yuting Hu, Zhiling Long, and Ghassan AlRegib
SCALE SELECTIVE EXTENDED LOCAL BINARY PATTERN FOR TEXTURE CLASSIFICATION Yutin Hu, Zhilin Lon, and Ghassan AlReib Multimedia & Sensors Lab (MSL) Center for Sinal and Information Processin (CSIP) School
More informationChapter - 1 : IMAGE FUNDAMENTS
Chapter - : IMAGE FUNDAMENTS Imae processin is a subclass of sinal processin concerned specifically with pictures. Improve imae quality for human perception and/or computer interpretation. Several fields
More informationMulti-scale Local Binary Pattern Histograms for Face Recognition
Multi-scale Local Binary Pattern Historams for Face Reconition Chi-Ho Chan, Josef Kittler, and Kieron Messer Centre for Vision, Speech and Sinal Processin, University of Surrey, United Kindom {c.chan,.kittler,k.messer}@surrey.ac.uk
More informationChapter 5 THE MODULE FOR DETERMINING AN OBJECT S TRUE GRAY LEVELS
Qian u Chapter 5. Determinin an Object s True Gray evels 3 Chapter 5 THE MODUE OR DETERMNNG AN OJECT S TRUE GRAY EVES This chapter discusses the module for determinin an object s true ray levels. To compute
More informationABSTRACT 1. INTRODUCTION 2. RELATED WORKS
3D-DETNet: a Sinle Stae Video-Based Vehicle Detector Suichan Li School of Information Science and Technoloy, University of Science and Technoloy of China, Hefei 230026, China. ABSTRACT Video-based vehicle
More informationRobust Color Image Enhancement of Digitized Books
29 1th International Conference on Document Analysis and Reconition Robust Color Imae Enhancement of Diitized Books Jian Fan Hewlett-Packard Laboratories, Palo Alto, California, USA jian.fan@hp.com Abstract
More informationImage features extraction using mathematical morphology
Imae features extraction usin mathematical morpholoy Marcin Iwanowski, Sławomir Skoneczny, Jarosław Szostakowski Institute of Control and Industrial Electronics, Warsaw University of Technoloy, ul.koszykowa
More informationSurvey On Image Texture Classification Techniques
Survey On Imae Texture Classification Techniques Vishal SThakare 1, itin Patil 2 and Jayshri S Sonawane 3 1 Department of Computer En, orth Maharashtra University, RCPIT Shirpur, Maharashtra, India 2 Department
More informationIterative Single-Image Digital Super-Resolution Using Partial High-Resolution Data
Iterative Sinle-Imae Diital Super-Resolution Usin Partial Hih-Resolution Data Eran Gur, Member, IAENG and Zeev Zalevsky Abstract The subject of extractin hih-resolution data from low-resolution imaes is
More informationProbabilistic Gaze Estimation Without Active Personal Calibration
Probabilistic Gaze Estimation Without Active Personal Calibration Jixu Chen Qian Ji Department of Electrical,Computer and System Enineerin Rensselaer Polytechnic Institute Troy, NY 12180 chenji@e.com qji@ecse.rpi.edu
More informationCOMPLETED LOCAL DERIVATIVE PATTERN FOR ROTATION INVARIANT TEXTURE CLASSIFICATION. Yuting Hu, Zhiling Long, and Ghassan AlRegib
COMPLETED LOCAL DERIVATIVE PATTERN FOR ROTATION INVARIANT TEXTURE CLASSIFICATION Yutin Hu, Zhilin Lon, and Ghassan AlReib Multimedia & Sensors Lab (MSL) Center for Sinal and Information Processin (CSIP)
More informationProtection of Location Privacy using Dummies for Location-based Services
Protection of Location Privacy usin for Location-based Services Hidetoshi Kido y Yutaka Yanaisawa yy Tetsuji Satoh y;yy ygraduate School of Information Science and Technoloy, Osaka University yyntt Communication
More informationCONTRAST COMPENSATION FOR BACK-LIT AND FRONT-LIT COLOR FACE IMAGES VIA FUZZY LOGIC CLASSIFICATION AND IMAGE ILLUMINATION ANALYSIS
CONTRAST COMPENSATION FOR BACK-LIT AND FRONT-LIT COLOR FACE IMAGES VIA FUZZY LOGIC CLASSIFICATION AND IMAGE ILLUMINATION ANALYSIS CHUN-MING TSAI 1, ZONG-MU YEH 2, YUAN-FANG WANG 3 1 Department of Computer
More informationBus-Based Communication Synthesis on System-Level
Bus-Based Communication Synthesis on System-Level Michael Gasteier Manfred Glesner Darmstadt University of Technoloy Institute of Microelectronic Systems Karlstrasse 15, 64283 Darmstadt, Germany Abstract
More informationCode Optimization Techniques for Embedded DSP Microprocessors
Code Optimization Techniques for Embedded DSP Microprocessors Stan Liao Srinivas Devadas Kurt Keutzer Steve Tjian Albert Wan MIT Department of EECS Synopsys, Inc. Cambride, MA 02139 Mountain View, CA 94043
More informationReversible Image Merging for Low-level Machine Vision
Reversible Imae Merin for Low-level Machine Vision M. Kharinov St. Petersbur Institute for Informatics and Automation of RAS, 14_liniya Vasil evskoo ostrova 39, St. Petersbur, 199178 Russia, khar@iias.spb.su,
More informationMOTION DETECTION BY CLASSIFICATION OF LOCAL STRUCTURES IN AIRBORNE THERMAL VIDEOS
In: Stilla U, Rottensteiner F, Hinz S (Eds) CMRT05. IAPRS, Vol. XXXVI, Part 3/W24 --- Vienna, Austria, Auust 29-30, 2005 MOTION DETECTION BY CLASSIFICATION OF LOCAL STRUCTURES IN AIRBORNE THERMAL VIDEOS
More informationoptimization agents user interface agents database agents program interface agents
A MULTIAGENT SIMULATION OPTIMIZATION SYSTEM Sven Hader Department of Computer Science Chemnitz University of Technoloy D-09107 Chemnitz, Germany E-Mail: sha@informatik.tu-chemnitz.de KEYWORDS simulation
More informationImitation: An Alternative to Generalization in Programming by Demonstration Systems
Imitation: An Alternative to Generalization in Prorammin by Demonstration Systems Technical Report UW-CSE-98-08-06 Amir Michail University of Washinton amir@cs.washinton.edu http://www.cs.washinton.edu/homes/amir/opsis.html
More informationTexture Un mapping. Computer Vision Project May, Figure 1. The output: The object with texture.
Texture Un mappin Shinjiro Sueda sueda@cs.ruters.edu Dinesh K. Pai dpai@cs.ruters.edu Computer Vision Project May, 2003 Abstract In computer raphics, texture mappin refers to the technique where an imae
More informationAffinity Hybrid Tree: An Indexing Technique for Content-Based Image Retrieval in Multimedia Databases
Affinity Hybrid Tree: An Indexin Technique for Content-Based Imae Retrieval in Multimedia Databases Kasturi Chatterjee and Shu-Chin Chen Florida International University Distributed Multimedia Information
More informationModule. Sanko Lan Avi Ziv Abbas El Gamal. and its accompanying FPGA CAD tools, we are focusing on
Placement and Routin For A Field Prorammable Multi-Chip Module Sanko Lan Avi Ziv Abbas El Gamal Information Systems Laboratory, Stanford University, Stanford, CA 94305 Abstract Placemen t and routin heuristics
More informationf y f x f z exu f xu syu s y s x s zl ezl f zl s zu ezu f zu sign logic significand multiplier exponent adder inc multiplexor multiplexor ty
A Combined Interval and Floatin Point Multiplier James E. Stine and Michael J. Schulte Computer Architecture and Arithmetic Laboratory Electrical Enineerin and Computer Science Department Lehih University
More informationProcess Synchronization with Readers and Writers Revisited
Journal of Computin and Information Technoloy - CIT 13, 2005, 1, 43 51 43 Process Synchronization with Readers and Writers Revisited Jalal Kawash Department of Computer Science, American University of
More informationEnhancement of Camera-captured Document Images with Watershed Segmentation
Enhancement of Camera-captured Document Imaes with Watershed Sementation Jian Fan ewlett-packard aboratories jian.fan@hp.com Abstract Document imaes acquired with a diital camera often exhibit various
More informationHCE: A New Channel Exchange Scheme for Handovers in Mobile Cellular Systems
129 HCE: A New Channel Exchane Scheme for Handovers in Mobile Cellular Systems DNESH K. ANVEKAR* and S. SANDEEP PRADHAN Department of Electrical Communication Enineerin ndian nstitute of Science, Banalore
More informationThe Role of Switching in Reducing the Number of Electronic Ports in WDM Networks
1 The Role of Switchin in Reducin the Number of Electronic Ports in WDM Networks Randall A. Berry and Eytan Modiano Abstract We consider the role of switchin in minimizin the number of electronic ports
More informationA Flexible Integration Strategy for In-Car Telematics Systems
A Flexible Interation Stratey for In-Car Telematics Systems Thomas Bauer Jens Herrmann Peter Liesmeyer Christopher Robinson-Mallett University of Potsdam Hasso-Plattner-Institute thomas.bauer @hpi.uni-potsdam.de
More informationTowards Plenoptic Dynamic Textures
Towards Plenoptic Dynamic Textures Gianfranco Doretto UCLA Computer Science Department Los Aneles, CA 90095 Email: doretto@cs.ucla.edu Abstract We present a technique to infer a model of the spatio-temporal
More informationDesign of a Framework for Data-Intensive Wide-Area Applications
Desin of a Framework for Data-Intensive Wide-Area Applications Michael D. Beynon, Tahsin Kurc, Alan Sussman, Joel Saltz Department of Computer Science University of Maryland, Collee Park, MD 2742 fbeynon,kurc,als,saltz@cs.umd.edu
More informationWeb e-transactions. Svend Frolund, Fernando Pedone, Jim Pruyne Software Technology Laboratory HP Laboratories Palo Alto HPL July 12 th, 2001*
Web e-transactions Svend Frolund, Fernando Pedone, Jim Pruyne Software Technoloy Laboratory HP Laboratories Palo Alto HPL-2001-177 July 12 th, 2001* E-mail: {frolund, pedone, pruyne} @ hpl.hp.com reliability,
More informationDesign of a Framework for Data-Intensive Wide-Area Applications
Desin of a Framework for Data-Intensive Wide-Area Applications Michael D. Beynon y, Tahsin Kurc y, Alan Sussman y, Joel Saltz y+ y Institute for Advanced Computer Studies and Dept. of Computer Science
More informationDetecting Coarticulation in Sign Language using Conditional Random Fields
Detecting Coarticulation in Sign Language using Conditional Random Fields Ruiduo Yang and Sudeep Sarkar Computer Science and Engineering Department University of South Florida 4202 E. Fowler Ave. Tampa,
More informationFramework. Fatma Ozcan Sena Nural Pinar Koksal Mehmet Altinel Asuman Dogac. Software Research and Development Center of TUBITAK
Reion Based Query Optimizer Throuh Cascades Query Optimizer Framework Fatma Ozcan Sena Nural Pinar Koksal Mehmet ltinel suman Doac Software Research and Development Center of TUBITK Dept. of Computer Enineerin
More informationGEODESIC RECONSTRUCTION, SADDLE ZONES & HIERARCHICAL SEGMENTATION
Imae Anal Stereol 2001;20:xx-xx Oriinal Research Paper GEODESIC RECONSTRUCTION, SADDLE ZONES & HIERARCHICAL SEGMENTATION SERGE BEUCHER Centre de Morpholoie Mathématique, Ecole des Mines de Paris, 35, Rue
More informationReducing Network Cost of Many-to-Many Communication in Unidirectional WDM Rings with Network Coding
1 Reducin Network Cost of Many-to-Many Communication in Unidirectional WDM Rins with Network Codin Lon Lon and Ahmed E. Kamal, Senior Member, IEEE Abstract In this paper we address the problem of traffic
More informationIN this paper, we establish the computational complexity of optimally solving multi-robot path planning problems
Intractability of Optimal Multi-Robot Path Plannin on Planar Graphs Jinjin Yu Abstract arxiv:504.007v3 [cs.ro] 6 Dec 05 We study the computational complexity of optimally solvin multi-robot path plannin
More informationHeuristic Searching: A* Search
IOSR Journal of Computer Enineerin (IOSRJCE) ISSN: 2278-0661 Volume 4, Issue 2 (Sep.-Oct. 2012), PP 01-05 Nazmul Hasan (Department of Computer Science and Enineerin, Military Institute of Science and Technoloy,
More informationLearning Deep Features for One-Class Classification
1 Learnin Deep Features for One-Class Classification Pramuditha Perera, Student Member, IEEE, and Vishal M. Patel, Senior Member, IEEE Abstract We propose a deep learnin-based solution for the problem
More informationLEGEND. Cattail Sawgrass-Cattail Mixture Sawgrass-Slough. Everglades. National. Park. Area of Enlargement. Lake Okeechobee
An Ecient Parallel Implementation of the Everlades Landscape Fire Model Usin Checkpointin Fusen He and Jie Wu Department of Computer Science and Enineerin Florida Atlantic University Boca Raton, FL 33431
More informationLeveraging Models at Run-time to Retrieve Information for Feature Location
Leverain Models at Run-time to Retrieve Information for Feature Location Lorena Arcea,2, Jaime Font,2 Øystein Hauen 2,3, and Carlos Cetina San Jore University, SVIT Research Group, Zaraoza, Spain {larcea,jfont,ccetina}@usj.es
More informationP2P network traffic control mechanism based on global evaluation values
June 2009, 16(3): 66 70 www.sciencedirect.com/science/ournal/10058885 The Journal of China Universities of Posts and Telecommunications www.buptournal.cn/ben P2P network traffic control mechanism based
More informationAspect-oriented programming with AspectJ
Aspect-oriented prorammin with AspectJ & A. Colyer A. Clement Aspect-oriented prorammin (AOP) is an excitin new development in the field of software enineerin. The open-source AspectJt project has taken
More informationDevelopment and Verification of an SP 3 Code Using Semi-Analytic Nodal Method for Pin-by-Pin Calculation
Journal of Physical Science and Application 7 () (07) 0-7 doi: 0.765/59-5348/07.0.00 D DAVID PUBLISHIN Development and Verification of an SP 3 Code Usin Semi-Analytic Chuntao Tan Shanhai Nuclear Enineerin
More informationElectrical Power System Harmonic Analysis Using Adaptive BSS Algorithm
Sensors & ransducers 2013 by IFSA http://www.sensorsportal.com Electrical Power System Harmonic Analysis Usin Adaptive BSS Alorithm 1,* Chen Yu, 2 Liu Yuelian 1 Zhenzhou Institute of Aeronautical Industry
More informationAutomatic Inspection of Textured Surfaces by Support Vector Machines
Automatic Inspection of Textured Surfaces by Support Vector Machines Sina Jahanbin a, Alan C. Bovik a, Eduardo Pèrez b,dineshnair b a Department of Electrical and Computer Enineerin, the University of
More informationPattern Recognition Letters
attern Reconition Letters 29 (2008) 1596 1602 Contents lists available at ScienceDirect attern Reconition Letters journal homepae: www.elsevier.com/locate/patrec 3D face reconition by constructin deformation
More informationSign Language Recognition using Dynamic Time Warping and Hand Shape Distance Based on Histogram of Oriented Gradient Features
Sign Language Recognition using Dynamic Time Warping and Hand Shape Distance Based on Histogram of Oriented Gradient Features Pat Jangyodsuk Department of Computer Science and Engineering The University
More informationA Mobile Robot that Understands Pedestrian Spatial Behaviors
The 00 IEEE/RSJ International Conference on Intellient Robots and Systems October -, 00, Taipei, Taiwan A Mobile Robot that Understands Pedestrian Spatial Behaviors Shu-Yun Chun and Han-Pan Huan, Member,
More informationChapter 4. Coding systems. 4.1 Binary codes Gray (reflected binary) code
Chapter 4 Codin systems Codin systems define how information is mapped to numbers. Different codin systems try to store/transmit information more efficiently [Sec. 4.], or protect it from damae while it
More informationMorphological Segmentation of 2-D Barcode Gray Scale Image
JOURNAL OF COMPUTERS, VOL. 8, NO. 10, OCTOBER 2013 2461 Morpholoical Sementation of 2-D Barcode Gray Scale Imae Jian-Hua Li 1, a Key Laboratory of Electronic Thin Films and Interated Devices University
More informationContent Based Image Retrieval System with Regency Based Retrieved Image Library
Content Based Imae Retrieval System with Reency Based Retrieved Imae Library Jadhav Seema H. #1,Dr.Sinh Sunita *2, Dr.Sinh Hari #3 #1 Associate Professor, Department of Instru & control, N.D.M.V.P.S s
More informationOptimal design of Fresnel lens for a reading light system with. multiple light sources using three-layered Hierarchical Genetic.
Optimal desin of Fresnel lens for a readin liht system with multiple liht sources usin three-layered Hierarchical Genetic Alorithm Wen-Gon Chen, and Chii-Maw Uan Department of Electrical Enineerin, I Shou
More informationOn Defending Peer-to-Peer System-based Active Worm Attacks
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE GLOBECOM 25 proceedins. On Defendin eer-to-eer System-based Active
More informationAdaptive multiple separation based on information maximization Kuang-Hung Liu and William H. Dragoset, WesternGeco
Adaptive multiple separation based on information maximization Kuan-Hun Liu and William H. Draoset, WesternGeco Summary We are interested in the problem of separatin primary and multiple seismic sinals
More informationThe Gene Expression Messy Genetic Algorithm For. Hillol Kargupta & Kevin Buescher. Computational Science Methods division
The Gene Expression Messy Genetic Alorithm For Financial Applications Hillol Karupta & Kevin Buescher Computational Science Methods division Los Alamos National Laboratory Los Alamos, NM, USA. Abstract
More informationPLEASE THINK BEFORE YOU PRINT. SMART Bridgit 4.2 User s Guide
PLEASE THINK BEFORE YOU PRINT SMART Bridit 4.2 User s Guide Product Reistration If you reister your SMART product, we ll notify you of new features and software uprades. Reister online at www.smarttech.com/reistration.
More informationThe SpecC Methodoloy Technical Report ICS December 29, 1999 Daniel D. Gajski Jianwen Zhu Rainer Doemer Andreas Gerstlauer Shuqin Zhao Department
The SpecC Methodoloy Technical Report ICS-99-56 December 29, 1999 Daniel D. Gajski Jianwen Zhu Rainer Doemer Andreas Gerstlauer Shuqin Zhao Department of Information and Computer Science University of
More informationDesign Of A PI Rate Controller For Mitigating SIP Overload
Desin Of A P Rate Controller For Mitiatin SP Overload Yan Hon, Chanchen Huan, James Yan Dept. of Systems and Computer Enineerin, Carleton University, Ottawa, Canada E-mail: {yanhon, huan}@sce.carleton.ca,
More informationLearning Geometric Concepts with an Evolutionary Algorithm. Andreas Birk. Universitat des Saarlandes, c/o Lehrstuhl Prof. W.J.
Learnin Geometric Concepts with an Evolutionary Alorithm Andreas Birk Universitat des Saarlandes, c/o Lehrstuhl Prof. W.J. Paul Postfach 151150, 66041 Saarbrucken, Germany cyrano@cs.uni-sb.de http://www-wjp.cs.uni-sb.de/cyrano/
More informationFarming in the HERA-B Experiment
The HERA-B data acquisition and trierin systems make use of Linux farms for trierin and online event reconstruction. We present in this paper the requirements, implementation and performance of both farms.
More informationUser Authentication and Authorization in the Java TM Platform
User Authentication and Authorization in the Java TM Platform Charlie Lai Li Gon Larry Koved Anthony Nadalin Roland Schemers Sun Microsystems, Inc. charlie.lai,li.on@sun.com International Business Machines,
More informationMulti-Class Protein Fold Recognition Using Multi-Objective Evolutionary Algorithms
1 Multi-Class Protein Fold Reconition Usin Multi-bjective Evolutionary Alorithms Stanley Y. M. Shi, P. N. Suanthan, Senior Member IEEE and Kalyanmoy Deb, Senior Member IEEE KanGAL Report Number 2004007
More informationTETROBOT: A NOVEL MECHANISM FOR RECONFIGURABLE PARALLEL ROBOTICS. Student, Machine Building Faculty, Technical University of Cluj-Napoca
UNIVERSITATEA TRANSILVANIA DIN BRA0OV Catedra Desin de Produs 1i Robotic2 Simpozionul na8ional cu participare interna8ional9 PRoiectarea ASIstat9 de Calculator P R A S I C ' 02 Vol. I Mecanisme 1i Triboloie
More informationMinimum-Cost Multicast Routing for Multi-Layered Multimedia Distribution
Minimum-Cost Multicast Routin for Multi-Layered Multimedia Distribution Hsu-Chen Chen and Frank Yeon-Sun Lin Department of Information Manaement, National Taiwan University 50, Lane 144, Keelun Rd., Sec.4,
More informationSimulation of Inner Ballistic of Underwater Weapon Based on Flow Field Numerical Calculation
Available online at www.sciencedirect.com Procedia Enineerin 12 (2011) 93 98 2011 SREE Conference on Enineerin Modelin and Simulation Simulation of Inner Ballistic of Underwater Weapon Based on Flow Field
More informationOn Design and Implementation of an Embedded System for Neural-Machine Interface for Artificial Legs
University of Rhode Island DiitalCommons@URI Open Access Dissertations 2013 On Desin and Implementation of an Embedded System for Neural-Machine Interface for Artificial Les Xiaoron Zhan University of
More informationEfficient and Provably Secure Ciphers for Storage Device Block Level Encryption
Efficient and Provably Secure Ciphers for Storae Device Block evel Encryption Yulian Zhen SIS Department, UNC Charlotte yzhen@uncc.edu Yone Wan SIS Department, UNC Charlotte yonwan@uncc.edu ABSTACT Block
More informationDefinition, Detection, and Evaluation of Meeting Events in Airport Surveillance Videos
Definition, Detection, and Evaluation of Meeting Events in Airport Surveillance Videos Sung Chun Lee, Chang Huang, and Ram Nevatia University of Southern California, Los Angeles, CA 90089, USA sungchun@usc.edu,
More informationIntegrated QOS management for disk I/O. Dept. of Comp. Sci. Dept. of Elec. Engg. 214 Zachry. College Station, TX
Interated QOS manaement or disk I/O Ravi Wijayaratne A. L. Narasimha Reddy Dept. o Comp. Sci. Dept. o Elec. En. Texas A & M University 214 Zachry Collee Station, TX 77843-3128 ravi,reddy@ee.tamu.edu Abstract
More informationACTion: Combining Logic Synthesis and Technology Mapping for MUX based FPGAs
IEEE EUROMICRO Conference (EUROMICRO 00) Maastricht, September 2000 ACTion: Combinin Loic Synthesis and Technoloy Mappin for MUX based FPGAs Wolfan Günther Rolf Drechsler Institute of Computer Science
More informationTHE FEASIBILITY OF SMOOTHED PARTICLE HYDRODYNAMICS FOR MULTIPHASE OILFIELD SYSTEMS
Seventh International Conference on CFD in the Minerals and Process Industries CSIRO, Melbourne, Australia 9-11 December 009 THE FEASIBILITY OF SMOOTHED PARTICLE HYDRODYNAMICS FOR MULTIPHASE OILFIELD SYSTEMS
More informationBridgit 4.6. User s guide
Bridit 4.6 User s uide Trade-mark notice Bridit, SMART Board, SMART Meetin Pro, SMART Notebook, SMART Podium, SMART Hub, smarttech, the SMART loo and all SMART talines are trademarks or reistered trade-marks
More informationUser Grouping for Massive MIMO in FDD Systems: New Design Methods and Analysis
SPECIAL SECTION ON 5G WIRELESS TECHNOLOGIES: PERSPECTIVES OF THE NEXT GENERATION MOBILE COMMUNICATIONS AND NETWORKING Received July 13, 2014, accepted July 29, 2014, date of publication Auust 29, 2014,
More informationILR #7: Progress Review 8. Zihao (Theo) Zhang- Team A February 15th, 2017 Teammates: Amit Agarwal, Harry Golash, Yihao Qian, Menghan Zhang
ILR #7: Progress Review 8 Zihao (Theo) Zhang- Team A February 15th, 2017 Teammates: Amit Agarwal, Harry Golash, Yihao Qian, Menghan Zhang Individual Progress After discussing with the team during last
More informationSMART Ink. Windows operating systems. Read this guide on your smart phone or other mobile device. User s guide
SMART Ink Windows operatin systems User s uide Read this uide on your smart phone or other mobile device. Product reistration If you reister your SMART product, we ll notify you of new features and software
More informationReducing network cost of many-to-many communication in unidirectional WDM rings with network coding
Reducin network cost of many-to-many communication in unidirectional WDM rins with network codin Lon Lon and Ahmed E. Kamal Department of Electrical and Computer Enineerin, Iowa State University Email:
More information[2] Gregory R. Andrews. Concurrent Programming: Principles and Practice. [3] K. M. Chandy and C. Kesselman. CC++: A declarative concurrent object
References [1] W. B. Ackerman. Data ow lanuaes. IEEE Computer, 15(2):15{25, February 1982. [2] Greory R. Andrews. Concurrent Prorammin: Principles and Practice. Benjamin/Cummins, Redwood City, CA, 1991.
More informationImplementing the BPG Neural Network Algorithm on. MP-1216 / MP-2216 Massive Parallel SIMD Machines. L. Larsson
Implementin the BPG Neural Network Alorithm on MP- / MP- Massive Parallel SIMD Machines L Larsson University of Hambur, Dept of Computer Science / Group TECH Vot-Kolln-Str 0, D-5 Hambur, Germany e-mail:
More informationPolygonal Approximation of Closed Curves across Multiple Views
Polyonal Approximation of Closed Curves across Multiple Views M. Pawan Kumar Saurah oyal C. V. Jawahar P. J. Narayanan Centre for Visual Information echnoloy International Institute of Information echnoloy
More informationCSSE463: Image Recognition Day 21
CSSE463: Image Recognition Day 21 Sunset detector due. Foundations of Image Recognition completed This wee: K-means: a method of Image segmentation Questions? An image to segment Segmentation The process
More informationM3AR: A Privacy Preserving Algorithm that Maintains Association Rules
M3A: A Privacy Preservin Alorithm that Maintains Association ules Huynh Van Quoc Phuon, ran Khanh Dan, Vo hi Noc Chau Faculty of Computer Science and Enineerin, HCMU National University of Ho Chi Minh
More information... document map. Word category. blurred histogram. map. Word category. map Full text input. encoded context. encoded word.
Exploration of Very Lare Databases by Self-Oranizin Maps Teuvo Kohonen Helsinki University of Technoloy Neural Networks Research Centre Rakentajanaukio 2 C, FIN-02150 Espoo, Finland ABSTRACT This paper
More informationDynamic Reconguration of. Distributed Applications. University of Maryland. College Park, MD Abstract
Dynamic Reconuration of Distributed Applications Christine R. Hofmeister Department of Computer Science University of Maryland Collee Park, MD 20742 Abstract Applications requirin concurrency or access
More informationFunctional Elimination and 0/1/All Constraints. Yuanlin Zhang, Roland H.C. Yap and Joxan Jaar. fzhangyl, ryap,
Functional Elimination and 0/1/All Constraints Yuanlin Zhan, Roland H.C. Yap and Joxan Jaar fzhanyl, ryap, joxan@comp.nus.edu.s Abstract We present new complexity results on the class of 0/1/All constraints.
More informationImproving robotic machining accuracy by real-time compensation
University of Wollonon Research Online Faculty of Enineerin - Papers (Archive) Faculty of Enineerin and Information Sciences 2009 Improvin robotic machinin accuracy by real-time compensation Zeni Pan University
More informationSparsity-promoting migration from surface-related multiples Tim T.Y. Lin*, Ning Tu, and Felix J. Herrmann, University of British Columbia, EOS
Sparsity-promotin miration from surface-related multiples Tim T.Y. Lin*, Nin Tu, and Felix J. Herrmann, University of British Columbia, EOS SUMMARY Seismic imain typically beins with the removal of multiple
More informationB15 Enhancement of Linear Features from Gravity Anomalies by Using Curvature Gradient Tensor Matrix
B5 Enhancement of Linear Features from Gravity Anomalies by Usin Curvature Gradient Tensor Matrix B. Oruç* (Kocaeli University) SUMMARY In this study, a new ede enhancement technique based on the eienvalues
More informationMission Families: a cost effective approach to Mission Control System development
Mission Families: a cost effective approach to Mission Control System development Damiano Guerrucci, Vemund Reestad, Mario Merri, Pierpaolo Emanuelli European Space Aency (ESA) European Space Operations
More informationSBG SDG. An Accurate Error Control Mechanism for Simplification Before Generation Algorihms
An Accurate Error Control Mechanism for Simplification Before Generation Alorihms O. Guerra, J. D. Rodríuez-García, E. Roca, F. V. Fernández and A. Rodríuez-Vázquez Instituto de Microelectrónica de Sevilla,
More informationRE2C { A More Versatile Scanner Generator. Peter Bumbulis Donald D. Cowan. University of Waterloo. April 15, Abstract
RE2C { A More Versatile Scanner Generator Peter Bumbulis Donald D. Cowan Computer Science Department and Computer Systems Group University o Waterloo April 15, 1994 Abstract It is usually claimed that
More informationSlicing Multi-threaded Java Programs : A Case Study
Slicin Multi-threaded Java Prorams : A Case Study Matthew B. Dwyer y, James C. Corbett z, John Hatcliff y, Stefan Sokolowski y, Honjun Zhen y ydepartment of Computin and Information Sciences Kansas State
More informationIN SUPERSCALAR PROCESSORS DAVID CHU LIN. B.S., University of Illinois, 1990 THESIS. Submitted in partial fulllment of the requirements
COMPILER SUPPORT FOR PREDICTED EXECUTION IN SUPERSCLR PROCESSORS BY DVID CHU LIN B.S., University of Illinois, 1990 THESIS Submitted in partial fulllment of the requirements for the deree of Master of
More informationEdgebreaker: Connectivity compression for triangle meshes
J. Rossinac GVU Technical Report GIT-GVU-98-35 (revised version of GIT-GVU-98-7) pae Edebreaker: Connectivity compression for trianle meshes Jarek Rossinac GVU Center, Georia Institute of Technoloy Abstract
More informationEdgebreaker: Connectivity compression for triangle meshes Jarek Rossignac GVU Center, Georgia Institute of Technology
1999 IEEE. Reprinted, with permission from IEEE Transactions onvisualization and Computer Graphics, Vol. 5, No. 1, 1999 Edebreaker: Connectivity compression for trianle meshes Jarek Rossinac GVU Center,
More informationIBM Thomas J. Watson Research Center. Yorktown Heights, NY, U.S.A. The major advantage of BDDs is their eciency for a
Equivalence Checkin Usin Cuts and Heaps Andreas Kuehlmann Florian Krohm IBM Thomas J. Watson Research Center Yorktown Heihts, NY, U.S.A. Abstract This paper presents a verication technique which is specically
More informationParameter Estimation for MRF Stereo
Parameter Estimation for MRF Stereo Li Zhan Steven M. Seitz University of Washinton Abstract This paper presents a novel approach for estimatin parameters for MRF-based stereo alorithms. This approach
More information