DOCSLIB.ORG

Efficient Implementations of Machine Vision Algorithms Using a Dynamically Typed Programming Language

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Efficient Implementations of Machine Vision Algorithms Using a Dynamically Typed Programming Language Efficient implementations of machine vision algorithms using a dynamically typed programming language WEDEKIND, Jan Available from the Sheffield Hallam University Research Archive (SHURA) at: http://shura.shu.ac.uk/6633/ A Sheffield Hallam University thesis This thesis is protected by copyright which belongs to the author. The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the author. When referring to this work, full bibliographic details including the author, title, awarding institution and date of the thesis must be given. Please visit http://shura.shu.ac.uk/6633/ and http://shura.shu.ac.uk/information.html for further details about copyright and re-use permissions. Efficient implementations of machine vision algorithms using a dynamically typed programming language WEDEKIND, Jan Available from Sheffield Hallam University Research Archive (SHURA) at: http://shura.shu.ac.uk/6633/ This document is the author deposited version. You are advised to consult the publisher's version if you wish to cite from it. Published version WEDEKIND, Jan (2012). Efficient implementations of machine vision algorithms using a dynamically typed programming language. Doctoral, Sheffield Hallam University. Repository use policy Copyright © and Moral Rights for the papers on this site are retained by the individual authors and/or other copyright owners. Users may download and/or print one copy of any article(s) in SHURA to facilitate their private study or for non- commercial research. You may not engage in further distribution of the material or use it for any profit-making activities or any commercial gain. Sheffield Hallam University Research Archive http://shura.shu.ac.uk Efficient Implementations of Machine Vision Algorithms using a Dynamically Typed Programming Language Jan Wedekind A thesis submitted in partial fulfilment of the requirements of Sheffield Hallam University for the degree of Doctor of Philosophy February 2012 Abstract Current machine vision systems (or at least their performance critical parts) are predo- minantly implemented using statically typed programming languages such as C, C++, or Java. Statically typed languages however are unsuitable for development and maintenance of large scale systems. When choosing a programming language, dynamically typed languages are usually not considered due to their lack of support for high-performance array operations. This thesis presents efficient implementations of machine vision algorithms with the (dynam- ically typed) Ruby programming language. The Ruby programming language was used, because it has the best support for meta-programming among the currently popular pro- gramming languages. Although the Ruby programming language was used, the approach presented in this thesis could be applied to any programming language which has equal or stronger support for meta-programming (e.g. Racket (former PLT Scheme)). A Ruby library for performingI /O and array operations was developed as part of this thesis. It is demonstrated how the library facilitates concise implementations of machine vision algorithms commonly used in industrial automation. That is, this thesis is about a different way of implementing machine vision systems. The work could be applied to prototype and in some cases implement machine vision systems in industrial automation and robotics. The development of real-time machine vision software is facilitated as follows 1. A just-in-time compiler is used to achieve real-time performance. It is demonstrated that the Ruby syntax is sufficient to integrate the just-in-time compiler transparently. 2. VariousI /O devices are integrated for seamless acquisition, display, and storage of video and audio data. In combination these two developments preserve the expressiveness of the Ruby program- ming language while providing good run-time performance of the resulting implementa- tion. To validate this approach, the performance of different operations is compared with the performance of equivalent C/C++ programs. i Publications Refereed Journal Articles • M. Boissenin, J. Wedekind, A. N. Selvan, B. P. Amavasai, F. Caparrelli, and J. R. Travis. Computer vision methods for optical microscopes. Image and Vision Computing, 25(7):1107–16, 07/01 2007 (Boissenin et al., 2007) • A. J. Lockwood, J. Wedekind, R. S. Gay, M. S. Bobji, B. P. Amavasai, M. Howarth, G. Mobus,¨ and B. J. Inkson. Advanced transmission electron microscope triboprobe with automated closed-loop nanopositioning. Measurement Science and Technol- ogy, 21(7):075901, 2010 (Lockwood et al., 2010) Refereed Conference Publications • Jan Wedekind, Manuel Boissenin, Balasundram P. Amavasai, Fabio Caparrelli, and Jon R. Travis. Object Recognition and Real-Time Tracking in Microscope Imaging. Proceedings of the 2006 Irish Machine Vision and Image Processing Conference (IMVIP 2006), pages 164–171, Dublin City University, 2006. (Wedekind et al., 2006) • J. Wedekind, B. P. Amavasai, and K. Dutton. Steerable filters generated with the hypercomplex dual-tree wavelet transform. In 2007 IEEE International Confer- ence on Signal Processing and Communications, pages 1291–4, Piscataway, NJ, USA, 24–27 Nov. 2007 2008. Mater. & Eng. Res. Inst., Sheffield Hallam Univ., Sheffield, UK, IEEE (Wedekind et al.,a) • J. Wedekind, B. P. Amavasai, K. Dutton, and M. Boissenin. A machine vision extension for the Ruby programming language. In 2008 International Conference on Information and Automation (ICIA), pages 991–6, Piscataway, NJ, USA, 20– 23 June 2008 2008. Microsyst. & Machine Vision Lab., Sheffield Hallam Univ., Sheffield, UK, IEEE (Wedekind et al.,b) Formal Presentations • Jan Wedekind. Real-time Computer Vision with Ruby. O’Reilly Open Source Con- vention (OSCON), Portland, Oregon, USA, July 23rd 2008 (Wedekind, 2008) ii • Jan Wedekind. Computer Vision Using Ruby and libJIT. (RubyConf), San Fran- cisco, California, USA, Nov. 19th 2009 (Wedekind, 2009) • Jan Wedekind, Jacques Penders, Hussein Abdul-Rahman, Martin Howarth, Ken Dutton, and Aiden Lockwood. Implementing Machine Vision Systems with a Dy- namically Typed Language. 25th European Conference on Object-Oriented Pro- gramming, Lancaster, United Kingdom, July 28th 2011 (Wedekind et al., 2011) Published Software Packages • malloc1 • multiarray2 • hornetseye-alsa3 • hornetseye-dc13944 • hornetseye-ffmpeg5 • hornetseye-fftw36 • hornetseye-frame7 • hornetseye-kinect8 • hornetseye-linalg9 • hornetseye-narray10 • hornetseye-opencv11 • hornetseye-openexr12 • hornetseye-qt413 • hornetseye-rmagick14 1http://github.com/wedesoft/malloc/ 2http://github.com/wedesoft/multiarray/ 3http://github.com/wedesoft/hornetseye-alsa/ 4http://github.com/wedesoft/hornetseye-dc1394/ 5http://github.com/wedesoft/hornetseye-ffmpeg/ 6http://github.com/wedesoft/hornetseye-fftw3/ 7http://github.com/wedesoft/hornetseye-frame/ 8http://github.com/wedesoft/hornetseye-kinect/ 9http://github.com/wedesoft/hornetseye-linalg/ 10http://github.com/wedesoft/hornetseye-narray/ 11http://github.com/wedesoft/hornetseye-opencv/ 12http://github.com/wedesoft/hornetseye-openexr/ 13http://github.com/wedesoft/hornetseye-qt4/ 14http://github.com/wedesoft/hornetseye-rmagick/ iii • hornetseye-v4l15 • hornetseye-v4l216 • hornetseye-xorg17 15http://github.com/wedesoft/hornetseye-v4l/ 16http://github.com/wedesoft/hornetseye-v4l2/ 17http://github.com/wedesoft/hornetseye-xorg/ iv Acknowledgements First I would like to thank Bala Amavasai for his supervision, support, and his unshakable optimism. He developed a large part of the Mimas C++ computer vision library and organised the Nanorobotics grant. Without him I would not have been able to do this work. I am also very indebted to Jon Travis who has been a valuable source of help and advice when coming to the UK and while working at university. I would also like to thank Ken Dutton, Jacques Penders, and Martin Howarth for continuing supervision of the PhD, for their advice and support and for giving me room to do research work. I would also like to thank Arul Nirai Selvan, Manuel Boissenin, Kim Chuan Lim, Kang Song Tan, Amir Othman, Stephen, Shuja Ahmed and others for being good col- leagues and for creating a friendly working environment. In particular I would like to express my gratitude to Georgios Chliveros for his advice and moral support. Thanks to Julien Faucher who introduced 3D camera calibration to the research group. A special thanks to Koichi Sasada for his research visit and for the many interesting and motivating discussions. Thanks to Aiden Lockwood, Jing Jing Wang, Ralph Gay, Xiaojing Xu, Zineb Saghi, Gunter¨ Mobus,¨ and Beverly Inkson for their valuable help in applying the work to trans- mission electron microscopy in context of the Nanorobotics project. Finally I would like to thank my parents who sacrificed a lot so that I can achieve the best in my life. Without their support I would not have made it this far. A seven year part-time PhD is a long time to work and make friends. My apologies but there is just not enough room to mention you all. The work presented in this thesis was partially funded by the EPSRC Nanorobotics18 project. I also received a student bursary of the Materials and Engineering Research Institute. 18http://gow.epsrc.ac.uk/ViewGrant.aspx?GrantRef=GR/S85696/01 v Declaration Sheffield Hallam University Materials and Engineering Research Institute Mobile Machines and Vision Laboratory The undersigned hereby certify that they have read and recommend to the Faculty of Arts, Computing, Engineering and Sciences for acceptance
Load more

Recommended publications
  • Programming for Engineers Pointers in C Programming: Part 02
    Programming For Engineers Pointers in C Programming: Part 02 by Wan Azhar Wan Yusoff1, Ahmad Fakhri Ab. Nasir2 Faculty of Manufacturing Engineering [email protected], [email protected] PFE – Pointers in C Programming: Part 02 by Wan Azhar Wan Yusoff and Ahmad Fakhri Ab. Nasir 0.0 Chapter’s Information • Expected Outcomes – To further use pointers in C programming • Contents 1.0 Pointer and Array 2.0 Pointer and String 3.0 Pointer and dynamic memory allocation PFE – Pointers in C Programming: Part 02 by Wan Azhar Wan Yusoff and Ahmad Fakhri Ab. Nasir 1.0 Pointer and Array • We will review array data type first and later we will relate array with pointer. • Previously, we learn about basic data types such as integer, character and floating numbers. In C programming language, if we have 5 test scores and would like to average the scores, we may code in the following way. PFE – Pointers in C Programming: Part 02 by Wan Azhar Wan Yusoff and Ahmad Fakhri Ab. Nasir 1.0 Pointer and Array PFE – Pointers in C Programming: Part 02 by Wan Azhar Wan Yusoff and Ahmad Fakhri Ab. Nasir 1.0 Pointer and Array • This program is manageable if the scores are only 5. What should we do if we have 100,000 scores? In such case, we need an efficient way to represent a collection of similar data type1. In C programming, we usually use array. • Array is a fixed-size sequence of elements of the same data type.1 • In C programming, we declare an array like the following statement: PFE – Pointers in C Programming: Part 02 by Wan Azhar Wan Yusoff and Ahmad Fakhri Ab.
    [Show full text]
  • Software Optimization Guide for Amd Family 15H Processors (.Pdf)
    Software Optimization Guide for AMD Family 15h Processors Publication No. Revision Date 47414 3.06 January 2012 Advanced Micro Devices © 2012 Advanced Micro Devices, Inc. All rights reserved. The contents of this document are provided in connection with Advanced Micro Devices, Inc. (“AMD”) products. AMD makes no representations or warranties with respect to the accuracy or completeness of the contents of this publication and reserves the right to make changes to specifications and product descriptions at any time without notice. The infor- mation contained herein may be of a preliminary or advance nature and is subject to change without notice. No license, whether express, implied, arising by estoppel or other- wise, to any intellectual property rights is granted by this publication. Except as set forth in AMD’s Standard Terms and Conditions of Sale, AMD assumes no liability whatsoever, and disclaims any express or implied warranty, relating to its products including, but not limited to, the implied warranty of merchantability, fitness for a particular purpose, or infringement of any intellectual property right. AMD’s products are not designed, intended, authorized or warranted for use as compo- nents in systems intended for surgical implant into the body, or in other applications intended to support or sustain life, or in any other application in which the failure of AMD’s product could create a situation where personal injury, death, or severe property or environmental damage may occur. AMD reserves the right to discontinue or make changes to its products at any time without notice. Trademarks AMD, the AMD Arrow logo, and combinations thereof, AMD Athlon, AMD Opteron, 3DNow!, AMD Virtualization and AMD-V are trademarks of Advanced Micro Devices, Inc.
    [Show full text]
  • Abschlussarbeit Im Fachbereich Elektrotechnik & Informatik an Der
    Bachelorthesis Adriana Bostandzhieva Design and Implementation of System for Managing Training Data for Artificial Intelligence Algorithms Fakultät Technik und Informatik Faculty of Engineering and Computer Science Department Informations- und Department of Information and Elektrotechnik Electrical Engineering Adriana Bostandzhieva Design and Implementation of System for Managing Training Data for Artificial Intelligence Algorithms Bachelorthesisbased on the study regulations for the Bachelor of Engineering degree programme Information Engineering at the Department of Information and Electrical Engineering of the Faculty of Engineering and Computer Science of the Hamburg University of Aplied Sciences Supervising examiner : Prof. Dr. -Ing. Lutz Leutelt Second Examiner : Prof. Dr. Klaus Jünemann Day of delivery 3. Juli 2019 Adriana Bostandzhieva Title of the Bachelorthesis Design and Implementation of System for Managing Training Data for Artificial Intelli- gence Algorithms Keywords AI, training data, database, labels, video Abstract This paper is part of a pilot project of the Hamburg University of Applied Sciences. The project aims to utilise object detection algorithms and visual data to analyse complex road scenes. The aim of this thesis is to determine the best tool to use to label data for training artificial intelligence algorithms, to specify what data should be saved and to determine what database is to be used to save the data. The validity of the findings is proved by building a small prototype to showcase integration between the labelling tool and the database. Adriana Bostandzhieva Titel der Arbeit Entwicklung und Aufbau eines System zur Verwaltung von Trainingsdaten für Algo- rithmen der künstlichen Intelligenz Stichworte Trainingsdaten, Datenbanke, Video, KI Kurzzusammenfassung Diese Arbeit ist Teil eines Pilotprojekts der Hochschule für Angewandte Wissenschaf- ten Hamburg.
    [Show full text]
  • C Programming: Data Structures and Algorithms
    C Programming: Data Structures and Algorithms An introduction to elementary programming concepts in C Jack Straub, Instructor Version 2.07 DRAFT C Programming: Data Structures and Algorithms, Version 2.07 DRAFT C Programming: Data Structures and Algorithms Version 2.07 DRAFT Copyright © 1996 through 2006 by Jack Straub ii 08/12/08 C Programming: Data Structures and Algorithms, Version 2.07 DRAFT Table of Contents COURSE OVERVIEW ........................................................................................ IX 1. BASICS.................................................................................................... 13 1.1 Objectives ...................................................................................................................................... 13 1.2 Typedef .......................................................................................................................................... 13 1.2.1 Typedef and Portability ............................................................................................................. 13 1.2.2 Typedef and Structures .............................................................................................................. 14 1.2.3 Typedef and Functions .............................................................................................................. 14 1.3 Pointers and Arrays ..................................................................................................................... 16 1.4 Dynamic Memory Allocation .....................................................................................................
    [Show full text]
  • A 3D Interactive Multi-Object Segmentation Tool Using Local Robust Statistics Driven Active Contours
    A 3D interactive multi-object segmentation tool using local robust statistics driven active contours The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters Citation Gao, Yi, Ron Kikinis, Sylvain Bouix, Martha Shenton, and Allen Tannenbaum. 2012. A 3D Interactive Multi-Object Segmentation Tool Using Local Robust Statistics Driven Active Contours. Medical Image Analysis 16, no. 6: 1216–1227. doi:10.1016/j.media.2012.06.002. Published Version doi:10.1016/j.media.2012.06.002 Citable link http://nrs.harvard.edu/urn-3:HUL.InstRepos:28548930 Terms of Use This article was downloaded from Harvard University’s DASH repository, and is made available under the terms and conditions applicable to Other Posted Material, as set forth at http:// nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of- use#LAA NIH Public Access Author Manuscript Med Image Anal. Author manuscript; available in PMC 2013 August 01. NIH-PA Author ManuscriptPublished NIH-PA Author Manuscript in final edited NIH-PA Author Manuscript form as: Med Image Anal. 2012 August ; 16(6): 1216–1227. doi:10.1016/j.media.2012.06.002. A 3D Interactive Multi-object Segmentation Tool using Local Robust Statistics Driven Active Contours Yi Gaoa,*, Ron Kikinisb, Sylvain Bouixa, Martha Shentona, and Allen Tannenbaumc aPsychiatry Neuroimaging Laboratory, Brigham & Women's Hospital, Harvard Medical School, Boston, MA 02115 bSurgical Planning Laboratory, Brigham & Women's Hospital, Harvard Medical School, Boston, MA 02115 cDepartments of Electrical and Computer Engineering and Biomedical Engineering, Boston University, Boston, MA 02115 Abstract Extracting anatomical and functional significant structures renders one of the important tasks for both the theoretical study of the medical image analysis, and the clinical and practical community.
    [Show full text]
  • Data Structure
    EDUSAT LEARNING RESOURCE MATERIAL ON DATA STRUCTURE (For 3rd Semester CSE & IT) Contributors : 1. Er. Subhanga Kishore Das, Sr. Lect CSE 2. Mrs. Pranati Pattanaik, Lect CSE 3. Mrs. Swetalina Das, Lect CA 4. Mrs Manisha Rath, Lect CA 5. Er. Dillip Kumar Mishra, Lect 6. Ms. Supriti Mohapatra, Lect 7. Ms Soma Paikaray, Lect Copy Right DTE&T,Odisha Page 1 Data Structure (Syllabus) Semester & Branch: 3rd sem CSE/IT Teachers Assessment : 10 Marks Theory: 4 Periods per Week Class Test : 20 Marks Total Periods: 60 Periods per Semester End Semester Exam : 70 Marks Examination: 3 Hours TOTAL MARKS : 100 Marks Objective : The effectiveness of implementation of any application in computer mainly depends on the that how effectively its information can be stored in the computer. For this purpose various -structures are used. This paper will expose the students to various fundamentals structures arrays, stacks, queues, trees etc. It will also expose the students to some fundamental, I/0 manipulation techniques like sorting, searching etc 1.0 INTRODUCTION: 04 1.1 Explain Data, Information, data types 1.2 Define data structure & Explain different operations 1.3 Explain Abstract data types 1.4 Discuss Algorithm & its complexity 1.5 Explain Time, space tradeoff 2.0 STRING PROCESSING 03 2.1 Explain Basic Terminology, Storing Strings 2.2 State Character Data Type, 2.3 Discuss String Operations 3.0 ARRAYS 07 3.1 Give Introduction about array, 3.2 Discuss Linear arrays, representation of linear array In memory 3.3 Explain traversing linear arrays, inserting & deleting elements 3.4 Discuss multidimensional arrays, representation of two dimensional arrays in memory (row major order & column major order), and pointers 3.5 Explain sparse matrices.
    [Show full text]
  • Open Source Computer Vision-Based Layer-Wise 3D Printing Analysis
    Open Source Computer Vision-based Layer-wise 3D Printing Analysis Aliaksei L. Petsiuk1 and Joshua M. Pearce1,2,3 1Department of Electrical & Computer Engineering, Michigan Technological University, Houghton, MI 49931, USA 2Department of Material Science & Engineering, Michigan Technological University, Houghton, MI 49931, USA 3Department of Electronics and Nanoengineering, School of Electrical Engineering, Aalto University, Espoo, FI-00076, Finland [email protected], [email protected] Graphical Abstract Highlights • Developed a visual servoing platform using a monocular multistage image segmentation • Presented algorithm prevents critical failures during additive manufacturing • The developed system allows tracking printing errors on the interior and exterior Abstract The paper describes an open source computer vision-based hardware structure and software algorithm, which analyzes layer-wise the 3-D printing processes, tracks printing errors, and generates appropriate printer actions to improve reliability. This approach is built upon multiple- stage monocular image examination, which allows monitoring both the external shape of the printed object and internal structure of its layers. Starting with the side-view height validation, the developed program analyzes the virtual top view for outer shell contour correspondence using the multi-template matching and iterative closest point algorithms, as well as inner layer texture quality clustering the spatial-frequency filter responses with Gaussian mixture models and segmenting structural anomalies with the agglomerative hierarchical clustering algorithm. This allows evaluation of both global and local parameters of the printing modes. The experimentally- verified analysis time per layer is less than one minute, which can be considered a quasi-real-time process for large prints. The systems can work as an intelligent printing suspension tool designed to save time and material.
    [Show full text]
  • Programming the Capabilities of the PC Have Changed Greatly Since the Introduction of Electronic Computers
    1 www.onlineeducation.bharatsevaksamaj.net www.bssskillmission.in INTRODUCTION TO PROGRAMMING LANGUAGE Topic Objective: At the end of this topic the student will be able to understand: History of Computer Programming C++ Definition/Overview: Overview: A personal computer (PC) is any general-purpose computer whose original sales price, size, and capabilities make it useful for individuals, and which is intended to be operated directly by an end user, with no intervening computer operator. Today a PC may be a desktop computer, a laptop computer or a tablet computer. The most common operating systems are Microsoft Windows, Mac OS X and Linux, while the most common microprocessors are x86-compatible CPUs, ARM architecture CPUs and PowerPC CPUs. Software applications for personal computers include word processing, spreadsheets, databases, games, and myriad of personal productivity and special-purpose software. Modern personal computers often have high-speed or dial-up connections to the Internet, allowing access to the World Wide Web and a wide range of other resources. Key Points: 1. History of ComputeWWW.BSSVE.INr Programming The capabilities of the PC have changed greatly since the introduction of electronic computers. By the early 1970s, people in academic or research institutions had the opportunity for single-person use of a computer system in interactive mode for extended durations, although these systems would still have been too expensive to be owned by a single person. The introduction of the microprocessor, a single chip with all the circuitry that formerly occupied large cabinets, led to the proliferation of personal computers after about 1975. Early personal computers - generally called microcomputers - were sold often in Electronic kit form and in limited volumes, and were of interest mostly to hobbyists and technicians.
    [Show full text]
  • Motmot Documentation Release 0
    motmot Documentation Release 0 Andrew Straw June 26, 2010 CONTENTS 1 Overview 3 1.1 The name motmot............................................3 1.2 Packages within motmot.........................................3 1.3 Mailing list................................................4 1.4 Related Software.............................................4 2 Download and installation instructions5 2.1 Quick install: FView application on Windows..............................5 3 Full install information 7 3.1 Supported operating systems.......................................7 3.2 Download.................................................7 3.3 Installation................................................7 3.4 Download direct from the source code repository............................8 4 Gallery of applications built on motmot packages9 4.1 Open source...............................................9 4.2 Closed source............................................... 12 5 Frequently Asked Questions 13 5.1 What cameras are supported?...................................... 13 5.2 What frame rates, image sizes, bit depths are possible?......................... 13 5.3 Which way is up? (Why are my images flipped or rotated?)...................... 13 6 Writing FView plugins 15 6.1 Overview................................................. 15 6.2 Register your FView plugin....................................... 15 6.3 Tutorials................................................. 15 7 Camera trigger device with precise timing and analog input 25 7.1 camtrig – Camera trigger
    [Show full text]
  • About This Document Opencv and Matlab Mex Files Recommended Knowledge General Concepts Mex Files
    1 About this document ABOUT THIS DOCUMENT This document was created as part of a final project for a BSc degree at the Academic College of Tel- Aviv Yaffo, by Rachely Esman and Yoad Snapir, under the supervision of Tal Hassner. As part of the project, we used Intel's OpenCV library, calling its functions from MATLAB. We found the subject tricky and thus decided to share the experience of our work with others describing the common pitfalls. You can use this document freely according to the copyrights noted below but under your sole responsibility. Rachely and Yoad. OPENCV AND MATLAB MEX FILES This guide will provide a quick walk through on compiling C++ OpenCV modules as MEX runtime files of MATLAB under: MS Visual Studio 2005 MATLAB 7.5.0 Windows 32bit And will probably be clear enough for other platforms / versions. RECOMMENDED KNOWLEDGE Good understanding of C++ Compilation and linkage concepts. DLL general usage Visual Studio 2005 environment Basic MATLAB and MEX files knowledge GENERAL CONCEPTS MEX FILES MEX files are actually simple .DLL files compiled with extension .MEXW32 using ordinary compilation tools provided with VS2005. Those .DLL files have a fixed entry point "mexFunction" with a fixed signature. (List of IN/OUT parameters) Follow this link to get an overview of MEX files and information on using them: http://www.mathworks.com/support/tech-notes/1600/1605.html#intro MEX files are compiled (and linked) from within the MATLAB environment using the following syntax: mex 'srcfile1.cpp' 'srcfile2.cpp' 'objfile1.obj' … Before compiling, you need to setup the compilation options using the command: Copyright © 2008 R.
    [Show full text]
  • Anastasia Tyurina [email protected]
    1 Anastasia Tyurina [email protected] Summary A specialist in applying or creating mathematical methods to solving problems of developing technologies. A rare expert in solving problems starting from the stage of a stated “word problem” to proof of concept and production software development. Such successful uses of an educational background in mathematics, intellectual courage, and tenacious character include: • developed a unique method of statistical analysis of spectral composition in 1D and 2D stochastic processes for quality control in ultra-precision mirror polishing • developed novel methods of detection, tracking and classification of small moving targets for aerial IR and EO sensors. Used SIFT, and SIRF features, and developed innovative feature-signatures of motion of interest. • developed image processing software for bioinformatics, point source (diffraction objects) detection semiconductor metrology, electron microscopy, failure analysis, diagnostics, system hardware support and pattern recognition • developed statistical software for surface metrology assessment, characterization and generation of statistically similar surfaces to assist development of new optical systems • documented, published and patented original results helping employers technical communications • supported sales with prototypes and presentations • worked well with people – colleagues, customers, researchers, scientists, engineers Tools MATLAB, Octave, OpenCV, ImageJ, Scion Image, Aphelion Image, Gimp, PhotoShop, C/C++, (Visual C environment), GNU development tools, UNIX (Solaris, SGI IRIX), Linux, Windows, MS DOS. Positions and Experience Second Star Algonumerixs – 2008-present, founder and CEO http://www.secondstaralgonumerix.com/ 1) Developed a method of statistical assessment, characterisation and generation of random surface metrology for sper precision X-ray mirror manufacturing in collaboration with Lawrence Berkeley National Laboratory of University of California Berkeley.
    [Show full text]
  • Lecture Notes)
    Sri Vidya College of Engineering & Technology Course Material ( Lecture Notes) Data structures can be classified as · Simple data structure · Compound data structure · Linear data structure · Non linear data structure Simple Data Structure: Simple data structure can be constructed with the help of primitive data structure. A primitive data structure used to represent the standard data types of any one of the computer languages. Variables, arrays, pointers, structures, unions, etc. are examples of primitive data structures. Compound Data structure: Compound data structure can be constructed with the help of any one of the primitive data structure and it is having a specific functionality. It can be designed by user. It can be classified as 1) Linear data structure 2) Non-linear data structure Linear data structure : Collection of nodes which are logically adjacent in which logical adjacency is maintained by pointers (or) Linear data structures can be constructed as a continuous arrangement of data elements in the memory. It can be constructed by using array data type. In the linear Data Structures the relation ship of adjacency is maintained between the Data elements. Operations applied on linear data structure : The following list of operations applied on linear data structures 1. Add an element 2. Delete an element 3. Traverse 4. Sort the list of elements CS8391 – Data Structures - Unit I Page 1 Sri Vidya College of Engineering & Technology Course Material ( Lecture Notes) 5. Search for a data element By applying one or more functionalities to create different types of data structures For example Stack, Queue, Tables, List, and Linked Lists. Non-linear data structure: Non-linear data structure can be constructed as a collection of randomly distributed set of data item joined together by using a special pointer (tag).
    [Show full text]