Complexity Scalable MPEG Encoding Stephan Mietens

Total Page:16

File Type:pdf, Size:1020Kb

Complexity Scalable MPEG Encoding Stephan Mietens Complexity Scalable MPEG Encoding Stephan Mietens CIP-DATA LIBRARY TECHNISCHE UNIVERSITEIT EINDHOVEN Mietens, Stephan O. Complexity scalable MPEG encoding / by Stephan O. Mietens. - Eindhoven : Technische Universiteit Eindhoven, 2004. Proefschrift. - ISBN 90-386-2040-3 NUR 992 Trefw.: complexiteit van berekening / beeldcodering / codering. Subject headings: computational complexity / video coding / encoding. Schlagwörter: Skalierbarkeit / MPEG / Videokompression / Encoding. ­c Copyright 2004 Stephan Mietens All rights are reserved. No part of this book may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission from the copyright owner. Complexity Scalable MPEG Encoding PROEFSCHRIFT ter verkrijging van de graad van doctor aan de Technische Universiteit Eindhoven, op gezag van de Rector Magnificus, prof.dr. R.A. van Santen, voor een commissie aangewezen door het College voor Promoties in het openbaar te verdedigen op woensdag 18 februari 2004 om 16.00 uur door Stephan Oliver Mietens geboren te Frankfurt am Main, Duitsland Dit proefschrift is goedgekeurd door de promotoren: prof.dr.ir. P.H.N. de With en prof.dr.ir. R.L. Lagendijk Copromotor: Prof. Dr.-Ing. habil. C. Hentschel ISBN 90-386-2040-3 to my family Contents 1 Introduction 1 1.1 Problem statement ....................... 1 1.1.1 Context . ....................... 1 1.1.2 Terms and system requirements ............ 3 1.1.3 Approaches towards MPEG complexity scalability . 5 1.1.4 Structure of the conducted research .......... 6 1.2 Programmable hardware . ................. 8 1.2.1 Emerging flexible architectures ............ 8 1.2.2 Signal flow-graph programming ............ 10 1.2.3 Dynamic multi-window TV . ............ 12 1.3 Scalable system design ..................... 13 1.3.1 Motivation for embedded applications . ...... 13 1.3.2 Scalable systems using scalable video algorithms . 15 1.3.3 Overall system architecture with scalability ...... 16 1.4 MPEG-2 video compression standard . ............ 19 1.4.1 Basics of MPEG video coding . ............ 21 1.4.2 Processing of MPEG video coding ........... 22 1.4.3 MPEG Scalability . ................. 28 1.5 Outline of the thesis ....................... 30 1.6 Background of the chapters . ................. 33 2 Discrete cosine transformation 37 2.1 Introduction ........................... 37 2.2 Mathematical background . ................. 38 2.2.1 Forward Transformation ................ 38 2.2.2 Inverse Transformation ................. 39 2.2.3 Periodic properties of the cosine function . ...... 40 i ii Contents 2.3 Examples of DCT algorithms . ................. 40 2.3.1 Lee-Huang recursive algorithm ............ 41 2.3.2 Cho-Lee 2-D algorithm ................. 41 2.3.3 Arai-Agui-Nakajima 1-D algorithm .......... 42 2.3.4 Alternative DCT algorithms . ............ 43 2.4 Complexity comparison of DCT algorithms .......... 44 2.5 Accuracy-reduced DCT ..................... 47 2.5.1 Merhav-Vasudev multiplication-free algorithm . 47 2.5.2 Pao-Sun adaptive DCT modeling ........... 48 2.5.3 Lengwehasatit-Ortega var.-complexity algorithm . 48 2.6 Discussion ............................ 49 3 Complexity scalable DCT computation 51 3.1 Introduction ........................... 51 3.2 DCT-algorithm analysis ..................... 53 3.2.1 Concept for the new technique . ............ 53 3.2.2 Trade-off criterion for computations and quality . 54 3.2.3 Priority weighting . ................. 54 3.3 Implementation aspects of a fast-DCT algorithm analysis . 55 3.3.1 Database construction ................. 55 3.3.2 Construction of a database for analysis results ..... 57 3.3.3 Algorithmic example . ................. 59 3.4 Enhancements using priority weighting ............ 60 3.5 Experimental results ...................... 61 3.5.1 Computational results of the experiments . ...... 61 3.5.2 Pictorial results of the experiments ........... 63 3.6 Discussions and conclusions . ................. 66 4 Motion estimation 71 4.1 Introduction ........................... 71 4.2 Block-matching criteria ..................... 72 4.3 Fast ME algorithms ....................... 74 4.3.1 Full Search (2DFS) . ................. 74 4.3.2 One Dimensional Full Search (1DFS) . ...... 74 4.3.3 Block-Based Gradient Descent Search (BBGDS) . 76 4.3.4 Diamond Search . ................. 76 4.3.5 Three Step Search (TSS) ................ 77 4.3.6 New Three Step Search (NTSS) ............ 77 4.3.7 Simple Recursive Motion Estimation (simple RME) . 77 4.4 Motion-vector refinement . ................. 80 Contents iii 4.5 Comparison of ME algorithms ................. 81 4.5.1 Picture quality of motion-compensated frames . 81 4.5.2 Computational complexity comparison . ...... 83 4.5.3 Complexity vs. picture quality . ............ 84 4.6 Conclusion ........................... 85 5 Scalable motion estimation 87 5.1 Introduction ........................... 87 5.1.1 A view on the ME process . ............ 87 5.1.2 State-of-the-art ME . ................. 88 5.1.3 Contribution of this chapter to scalable ME ...... 90 5.2 Notations ............................ 91 5.3 SMART, a structural-level technique . ............ 92 5.3.1 Algorithm . ....................... 92 5.3.2 Modifications in the MPEG encoder architecture . 94 5.3.3 Scalability aspects . ................. 96 5.3.4 Experimental verification ................ 99 5.4 Block classification supporting the DCT and ME . ......103 5.4.1 Algorithm . .......................104 5.4.2 Experimental verification ................105 5.5 CARES, a vector-selection level technique ...........106 5.5.1 A concept for content-dependent ME . ......106 5.5.2 Algorithm . .......................108 5.5.3 Experimental verification ................109 5.6 Discussion and conclusions . .................111 6 System experiments and enhancements 113 6.1 Experimental environment . .................113 6.2 Inserting scalable DCT and related optimizations . ......115 6.2.1 Effect of proposed scalable DCT ............115 6.2.2 Selective DCT computation based on block classifica- tion ...........................118 6.2.3 Cyclical DCT for interframe coding ..........120 6.3 Combining SMART and CARES into one scalable ME system 123 6.4 Combined effect of scalable DCT and scalable ME ......128 6.4.1 Open-loop MPEG encoder . ............129 6.4.2 Closed-loop MPEG encoder . ............131 6.4.3 MPEG encoder with variable GOP and bit rate . 132 6.5 Discussion on further optimization of the scalable encoder . 135 6.6 Conclusions ...........................137 iv Contents 7 Conclusions 139 7.1 Conclusions of the thesis chapters . ............139 7.2 Memory-resource usage .....................143 7.3 Future work on MPEG scalability . ............143 7.3.1 System optimization . .................143 7.3.2 Bit-based processing . .................144 7.3.3 Modifying the input signal . ............144 7.3.4 Differentiating scalable DCT for intra- and intercoding 145 7.4 Applicability to other video applications ............145 7.4.1 MPEG-incompatible DCT coefficient coding .....145 7.4.2 Segmentation (MPEG-4) ................146 7.4.3 Multi-temporal ME (H.264) . ............146 References 149 A Derivation of computation order 159 B Computational complexity of ME algorithms 165 B.1 Number of block comparisons .................166 B.2 Computational complexity of a single block comparison . 167 B.3 Vector Refinement .......................167 B.4 Example configurations for motion estimation . ......168 B.5 Statistics of real computational effort . ............169 C Reduced processing resolution 171 C.1 Scalable DCT based on bit-slices ................171 C.1.1 Overview . .......................171 C.1.2 Architecture .......................172 C.1.3 Experimental results . .................175 C.2 Bit-based computation of ME . .................176 C.2.1 Simply reduced bit-resolution of input values .....176 C.2.2 One-Bit Motion Estimation (1BME) ..........176 D Test sequences 181 D.1 “Girl” . ............................181 D.2 “Voit” . ............................182 D.3“Teeny”.............................182 D.4 “Renata” . ............................183 D.5 “Stefan” . ............................183 D.6 “Foreman” ............................184 Contents v D.7 “Table tennis” . .......................184 Summary 187 Samenvatting 189 Zusammenfassung 193 Acknowledgments 197 Biography 199 CHAPTER 1 Introduction his chapter forms an introduction to the research that aims at realizing computational complexity scalability for MPEG Ìencoding. The chapter commences with the general problem statement of scalable MPEG processing: i.e. a scalable range of pic- ture quality with corresponding resource usage of the system. Re- source usage is expressed in terms of computation power, memory and communication bandwidth. Additional sections present an exemplary flexible and programmable hardware architecture showing the con- cept of scalable video processing, the principles of scalable system design, and a brief description of the MPEG coding standard, in or- der to deepen the insights of the problem statement. Furthermore, this chapter summarizes the subsequent individual chapters and presents their publication history. 1.1 Problem statement 1.1.1 Context The current burgeoning market for consumer digital video applications has lead to widely accepted consumer products based on MPEG coding, such as 2 Introduction DVD players, set-top boxes and digital video cameras. This thesis
Recommended publications
  • Participant Reference Guide
    Participant Reference Guide Table of Contents Introduction System Requirements Definitions Audio Conferencing How to Join Phone Keypad Commands Playback Instructions Online Meetings How to Join Meeting Wall Meeting Resources Chat Radio Technical Support Introduction FreeConferenceCall.com is an intuitive and agile collaboration tool packed with features to allow participants to join audio conference calls and online meetings. All accounts include high-definition audio, screen sharing and video conferencing for up to 1,000 participants at no cost. During a conference, use phone keypad commands to mute, hear instructions and more. Access the host’s Meeting Wall to find important information and resources for a meeting. For assistance, go to www.freeconferencecall.com/support to live chat with 24/7 Customer ​ ​ Care, email [email protected] or call (844) 844-1322. ​ ​ System Requirements FreeConferenceCall.com audio conferencing can be accessed at any time by calling from a landline, mobile phone, VoIP call (through the internet using a computer, tablet or mobile device) or a third-party VoIP call. In order to access the FreeConferenceCall.com website and use online meetings with screen sharing and video conferencing, the following system requirements must be met: Browsers: ● Chrome™ 29 or newer (recommended) ● Firefox® 22 or newer ● Safari® 6.0 or newer (Mac only) ● Internet Explorer® 10 or newer (Windows only) (Javascript) Operating systems: ● Windows 7 and up ● Mac OS X 10.7 and up ● Ubuntu 14.04 and up Note for Linux: ○ Preferred Windows Manager environment: Compiz ○ Desktop Environment: Unity, Gnome ● Bandwidth 100Kb/s (HD Audio), 400Kb/s (screen sharing), 500 Kb/s (video) ● Video camera supported by OS, integrated or external Definitions In order to use the FreeConferenceCall.com reference guide effectively, the following list of terminology has been provided: ● Dial-in number - A phone number that is dialed to join a meeting.
    [Show full text]
  • Cruising the Information Highway: Online Services and Electronic Mail for Physicians and Families John G
    Technology Review Cruising the Information Highway: Online Services and Electronic Mail for Physicians and Families John G. Faughnan, MD; David J. Doukas, MD; Mark H. Ebell, MD; and Gary N. Fox, MD Minneapolis, Minnesota; Ann Arbor and Detroit, Michigan; and Toledo, Ohio Commercial online service providers, bulletin board ser­ indirectly through America Online or directly through vices, and the Internet make up the rapidly expanding specialized access providers. Today’s online services are “information highway.” Physicians and their families destined to evolve into a National Information Infra­ can use these services for professional and personal com­ structure that will change the way we work and play. munication, for recreation and commerce, and to obtain Key words. Computers; education; information services; reference information and computer software. Com m er­ communication; online systems; Internet. cial providers include America Online, CompuServe, GEnie, and MCIMail. Internet access can be obtained ( JFam Pract 1994; 39:365-371) During past year, there has been a deluge of articles information), computer-based communications, and en­ about the “information highway.” Although they have tertainment. Visionaries imagine this collection becoming included a great deal of exaggeration, there are some the marketplace and the workplace of the nation. In this services of real interest to physicians and their families. article we focus on the latter interpretation of the infor­ This paper, which is based on the personal experience mation highway. of clinicians who have played and worked with com­ There are practical medical and nonmedical reasons puter communications for the past several years, pre­ to explore the online world. America Online (AOL) is one sents the services of current interest, indicates where of the services described in detail.
    [Show full text]
  • A Public Transport Bus Assignment Problem: Parallel Metaheuristics Assessment
    David Fernandes Semedo Licenciado em Engenharia Informática A Public Transport Bus Assignment Problem: Parallel Metaheuristics Assessment Dissertação para obtenção do Grau de Mestre em Engenharia Informática Orientador: Prof. Doutor Pedro Barahona, Prof. Catedrático, Universidade Nova de Lisboa Co-orientador: Prof. Doutor Pedro Medeiros, Prof. Associado, Universidade Nova de Lisboa Júri: Presidente: Prof. Doutor José Augusto Legatheaux Martins Arguente: Prof. Doutor Salvador Luís Bettencourt Pinto de Abreu Vogal: Prof. Doutor Pedro Manuel Corrêa Calvente de Barahona Setembro, 2015 A Public Transport Bus Assignment Problem: Parallel Metaheuristics Assess- ment Copyright c David Fernandes Semedo, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa A Faculdade de Ciências e Tecnologia e a Universidade Nova de Lisboa têm o direito, perpétuo e sem limites geográficos, de arquivar e publicar esta dissertação através de exemplares impressos reproduzidos em papel ou de forma digital, ou por qualquer outro meio conhecido ou que venha a ser inventado, e de a divulgar através de repositórios científicos e de admitir a sua cópia e distribuição com objectivos educacionais ou de investigação, não comerciais, desde que seja dado crédito ao autor e editor. Aos meus pais. ACKNOWLEDGEMENTS This research was partly supported by project “RtP - Restrict to Plan”, funded by FEDER (Fundo Europeu de Desenvolvimento Regional), through programme COMPETE - POFC (Operacional Factores de Competitividade) with reference 34091. First and foremost, I would like to express my genuine gratitude to my advisor profes- sor Pedro Barahona for the continuous support of my thesis, for his guidance, patience and expertise. His general optimism, enthusiasm and availability to discuss and support new ideas helped and encouraged me to push my work always a little further.
    [Show full text]
  • Solving the Maximum Weight Independent Set Problem Application to Indirect Hex-Mesh Generation
    Solving the Maximum Weight Independent Set Problem Application to Indirect Hex-Mesh Generation Dissertation presented by Kilian VERHETSEL for obtaining the Master’s degree in Computer Science and Engineering Supervisor(s) Jean-François REMACLE, Amaury JOHNEN Reader(s) Jeanne PELLERIN, Yves DEVILLE , Julien HENDRICKX Academic year 2016-2017 Acknowledgments I would like to thank my supervisor, Jean-François Remacle, for believing in me, my co-supervisor Amaury Johnen, for his encouragements during this project, as well as Jeanne Pellerin, for her patience and helpful advice. 3 4 Contents List of Notations 7 List of Figures 8 List of Tables 10 List of Algorithms 12 1 Introduction 17 1.1 Background on Indirect Mesh Generation . 17 1.2 Outline . 18 2 State of the Art 19 2.1 Exact Resolution . 19 2.1.1 Approaches Based on Graph Coloring . 19 2.1.2 Approaches Based on MaxSAT . 20 2.1.3 Approaches Based on Integer Programming . 21 2.1.4 Parallel Implementations . 21 2.2 Heuristic Approach . 22 3 Hybrid Approach to Combining Tetrahedra into Hexahedra 25 3.1 Computation of the Incompatibility Graph . 25 3.2 Exact Resolution for Small Graphs . 28 3.2.1 Complete Search . 28 3.2.2 Branch and Bound . 29 3.2.3 Upper Bounds Based on Clique Partitions . 31 3.2.4 Upper Bounds based on Linear Programming . 32 3.3 Construction of an Initial Solution . 35 3.3.1 Local Search Algorithms . 35 3.3.2 Local Search Formulation of the Maximum Weight Independent Set . 36 3.3.3 Strategies to Escape Local Optima .
    [Show full text]
  • Cognicrypt: Supporting Developers in Using Cryptography
    CogniCrypt: Supporting Developers in using Cryptography Stefan Krüger∗, Sarah Nadiy, Michael Reifz, Karim Aliy, Mira Meziniz, Eric Bodden∗, Florian Göpfertz, Felix Güntherz, Christian Weinertz, Daniel Demmlerz, Ram Kamathz ∗Paderborn University, {fistname.lastname}@uni-paderborn.de yUniversity of Alberta, {nadi, karim.ali}@ualberta.ca zTechnische Universität Darmstadt, {reif, mezini, guenther, weinert, demmler}@cs.tu-darmstadt.de, [email protected], [email protected] Abstract—Previous research suggests that developers often reside on the low level of cryptographic algorithms instead of struggle using low-level cryptographic APIs and, as a result, being more functionality-oriented APIs that provide convenient produce insecure code. When asked, developers desire, among methods such as encryptFile(). When it comes to tool other things, more tool support to help them use such APIs. In this paper, we present CogniCrypt, a tool that supports support, participants suggested tools like a CryptoDebugger, developers with the use of cryptographic APIs. CogniCrypt analysis tools that find misuses and provide code templates assists the developer in two ways. First, for a number of common or generate code for common functionality. These suggestions cryptographic tasks, CogniCrypt generates code that implements indicate that participants not only lack the domain knowledge, the respective task in a secure manner. Currently, CogniCrypt but also struggle with APIs themselves and how to use them. supports tasks such as data encryption, communication over secure channels, and long-term archiving. Second, CogniCrypt In this paper, we present CogniCrypt, an Eclipse plugin that continuously runs static analyses in the background to ensure enables easier use of cryptographic APIs. In previous work, a secure integration of the generated code into the developer’s we outlined an early vision for CogniCrypt [2].
    [Show full text]
  • QUICK USER GUIDE OVERVIEW in Idle Mode: Press and Hold to Record a Memo
    Wall Mounting Charging the batteries Press to playback OGM. Charge the batteries for at least 12 hours when charging for In TAM message playback mode: Press to go back to the first time. previous message. MEMO/SKIP FORWARD ( ) QUICK USER GUIDE OVERVIEW In Idle mode: Press and hold to record a memo. Base In TAM message playback mode: Press to skip to next Base message. 1- LCD DISPLAY DOWN/REDIAL LIST (▼) In idle mode: Press to access the redial list. 2- IN USE ( ) : On during a call. In menu mode: Press to scroll down the menu items. 3- RING light ( ) In Phonebook list / Redial list / Call list view mode: Press Flashes when there is an incoming call. to scroll down the list. Steadily on when the answering machine is turned on. Flashes In editing mode: Press to move the cursor one character to when there are new memos or messages in the answering the right. machine. During a call or TAM message playback: Press to decrease 4- MENU/OK ( ) the volume. Insert Photos for speed dial keys In idle mode: Press to access the main menu. 13-ANS ON/OFF ( ) In sub-menu mode: Press to confirm the selection. In Idle: Press to switch the answering machine ON or OFF. In Redial list/Call list: Press to store the number into 14. PLAY/STOP ( / ) Phonebook. In idle mode: Press to playback messages. 5- PHONEBOOK ( ) During TAM message playback: Press to stop playing In Idle: Press to access the phonebook. messages. 6- CALLS (CALL LIST) ( ) 15. DELETE ( ) In Idle mode: Press to access the call list.
    [Show full text]
  • Conferencing
    CONFERENCING 1. GENERAL 1.1 Service Definition 1.2 Standard Service Features 1.3 Customer Responsibilities 2. SUPPLEMENTAL TERMS 2.1 Emergency Calling 2.2 Protected Health Information (U.S. only) 2.3 On Line Password for Access to Service and CPNI 2.4 Cisco Universal Cloud Terms 2.5 Call Recording 2.6 India Regulations 2.7 Service Commitment Period 2.8 Audit and Extraordinary Events 3. SERVICE LEVEL AGREEMENT 4. FINANCIAL TERMS 4.1 General 4.2 Optimized Services 4.3 Non-Optimized Services 5. DEFINITIONS Appendix - Cloud Connect Audio Schedule 1 – Inspection Pro Forma And Cover Letter From The Indian Based Customer, Or Where Customer Is Not Based In India, From Customer’s Indian Based Affiliate/Participating Entity/End User 1. GENERAL 1.1 Service Definition. Verizon Conferencing Services bring together Cisco Webex conferencing with Verizon’s dial-in and dial-out reach for audio connectivity. The Service provides a multipoint service that enables Customer to conduct a collaboration session allowing text, documents, data or images (collectively, Data) to be transmitted via the Internet. A session may be used to provide Data on a one- way, one-to-many, view-only basis or on a multipoint, many-to-many, collaborative basis. To initiate a session, a Meeting Leader and Participants must have browser access to the Internet. The meeting Leader and Participants may also access an accompanying Audio Conferencing call. Customer’s use of the Services features and functions, including new features and functions, whether or not listed herein, will be deemed as Customer’s agreement to the terms and conditions related to such features and functions including, but not limited to, the then-current standard rates.
    [Show full text]
  • Analysis and Processing of Cryptographic Protocols
    Analysis and Processing of Cryptographic Protocols Submitted in partial fulfilment of the requirements of the degree of Bachelor of Science (Honours) of Rhodes University Bradley Cowie Grahamstown, South Africa November 2009 Abstract The field of Information Security and the sub-field of Cryptographic Protocols are both vast and continually evolving fields. The use of cryptographic protocols as a means to provide security to web servers and services at the transport layer, by providing both en- cryption and authentication to data transfer, has become increasingly popular. However, it is noted that it is rather difficult to perform legitimate analysis, intrusion detection and debugging on data that has passed through a cryptographic protocol as it is encrypted. The aim of this thesis is to design a framework, named Project Bellerophon, that is capa- ble of decrypting traffic that has been encrypted by an arbitrary cryptographic protocol. Once the plain-text has been retrieved further analysis may take place. To aid in this an in depth investigation of the TLS protocol was undertaken. This pro- duced a detailed document considering the message structures and the related fields con- tained within these messages which are involved in the TLS handshake process. Detailed examples explaining the processes that are involved in obtaining and generating the var- ious cryptographic components were explored. A systems design was proposed, considering the role of each of the components required in order to produce an accurate decryption of traffic encrypted by a cryptographic protocol. Investigations into the accuracy and the efficiency of Project Bellerophon to decrypt specific test data were conducted.
    [Show full text]
  • MULTIVALUED SUBSETS UNDER INFORMATION THEORY Indraneel Dabhade Clemson University, [email protected]
    Clemson University TigerPrints All Theses Theses 8-2011 MULTIVALUED SUBSETS UNDER INFORMATION THEORY Indraneel Dabhade Clemson University, [email protected] Follow this and additional works at: https://tigerprints.clemson.edu/all_theses Part of the Applied Mathematics Commons Recommended Citation Dabhade, Indraneel, "MULTIVALUED SUBSETS UNDER INFORMATION THEORY" (2011). All Theses. 1155. https://tigerprints.clemson.edu/all_theses/1155 This Thesis is brought to you for free and open access by the Theses at TigerPrints. It has been accepted for inclusion in All Theses by an authorized administrator of TigerPrints. For more information, please contact [email protected]. MULTIVALUED SUBSETS UNDER INFORMATION THEORY _______________________________________________________ A Thesis Presented to the Graduate School of Clemson University _______________________________________________________ In Partial Fulfillment of the Requirements for the Degree Master of Science Industrial Engineering _______________________________________________________ by Indraneel Chandrasen Dabhade August 2011 _______________________________________________________ Accepted by: Dr. Mary Beth Kurz, Committee Chair Dr. Anand Gramopadhye Dr. Scott Shappell i ABSTRACT In the fields of finance, engineering and varied sciences, Data Mining/ Machine Learning has held an eminent position in predictive analysis. Complex algorithms and adaptive decision models have contributed towards streamlining directed research as well as improve on the accuracies in forecasting. Researchers in the fields of mathematics and computer science have made significant contributions towards the development of this field. Classification based modeling, which holds a significant position amongst the different rule-based algorithms, is one of the most widely used decision making tools. The decision tree has a place of profound significance in classification-based modeling. A number of heuristics have been developed over the years to prune the decision making process.
    [Show full text]
  • The Maritime Pickup and Delivery Problem with Cost and Time Window Constraints: System Modeling and A* Based Solution
    The Maritime Pickup and Delivery Problem with Cost and Time Window Constraints: System Modeling and A* Based Solution CHRISTOPHER DAMBAKK SUPERVISOR Associate Professor Lei Jiao University of Agder, 2019 Faculty of Engineering and Science Department of ICT Abstract In the ship chartering business, more and more shipment orders are based on pickup and delivery in an on-demand manner rather than conventional scheduled routines. In this situation, it is nec- essary to estimate and compare the cost of shipments in order to determine the cheapest one for a certain order. For now, these cal- culations are based on static, empirical estimates and simplifications, and do not reflect the complexity of the real world. In this thesis, we study the Maritime Pickup and Delivery Problem with Cost and Time Window Constraints. We first formulate the problem mathe- matically, which is conjectured NP-hard. Thereafter, we propose an A* based prototype which finds the optimal solution with complexity O(bd). We compare the prototype with a dynamic programming ap- proach and simulation results show that both algorithms find global optimal and that A* finds the solution more efficiently, traversing fewer nodes and edges. iii Preface This thesis concludes the master's education in Communication and Information Technology (ICT), at the University of Agder, Nor- way. Several people have supported and contributed to the completion of this project. I want to thank in particular my supervisor, Associate Professor Lei Jiao. He has provided excellent guidance and refreshing perspectives when the tasks ahead were challenging. I would also like to thank Jayson Mackie, co-worker and friend, for proofreading my report.
    [Show full text]
  • Computer Professionals for Social Responsibility Records M1633
    http://oac.cdlib.org/findaid/ark:/13030/c8nc6728 No online items Guide to the Computer Professionals for Social Responsibility Records M1633 Department of Special Collections and University Archives 2019 Green Library 557 Escondido Mall Stanford 94305-6064 [email protected] URL: http://library.stanford.edu/spc Guide to the Computer M1633 1 Professionals for Social Responsibility Records M1633 Language of Material: English Contributing Institution: Department of Special Collections and University Archives Title: Computer Professionals for Social Responsibility records source: Computer Professionals for Social Responsibility creator: Computer Professionals for Social Responsibility Identifier/Call Number: M1633 Physical Description: 48 Linear Feet(96 boxes) Date (inclusive): 1980-2004 Abstract: Records of the policy group Computer Professionals for Social Responsibility (CPSR), consisting of correspondence, memoranda, newsletters, board minutes, publications, media, and other material. Finding aid contains folder listing only; collection has not been physically processed. Related Materials Stanford University Archives holds the Stanford University Computer Professionals for Social Responsibility records (SC1199) https://searchworks.stanford.edu/view/10556271 The Charles Babbage Institute at the University of Minnesota also holds a CPSR collection: http://purl.umn.edu/40803 Conditions Governing Access Open for research. Note that material must be requested at least 36 hours in advance of intended use. Audiovisual and computer media material is not available in original format, and must be reformatted to digital use copies. Conditions Governing Use While Special Collections is the owner of the physical and digital items, permission to examine collection materials is not an authorization to publish. These materials are made available for use in research, teaching, and private study.
    [Show full text]
  • Author Guidelines for 8
    Proceedings of the 53rd Hawaii International Conference on System Sciences | 2020 Easy and Efficient Hyperparameter Optimization to Address Some Artificial Intelligence “ilities” Trevor J. Bihl Joseph Schoenbeck Daniel Steeneck & Jeremy Jordan Air Force Research Laboratory, USA The Perduco Group, USA Air Force Institute of Technology, USA [email protected] [email protected] {Daniel.Steeneck; Jeremy.Jordan}@afit.edu hyperparameters. This is a complex trade space due to Abstract ML methods being brittle and not robust to conditions outside of those on which they were trained. While Artificial Intelligence (AI), has many benefits, attention is now given to hyperparameter selection [4] including the ability to find complex patterns, [5], in general, as mentioned in Mendenhall [6], there automation, and meaning making. Through these are “no hard-and-fast rules” in their selection. In fact, benefits, AI has revolutionized image processing their selection is part of the “art of [algorithm] design” among numerous other disciplines. AI further has the [6], as appropriate hyperparameters can depend potential to revolutionize other domains; however, this heavily on the data under consideration itself. Thus, will not happen until we can address the “ilities”: ML methods themselves are often hand-crafted and repeatability, explain-ability, reliability, use-ability, require significant expertise and talent to appropriately train and deploy. trust-ability, etc. Notably, many problems with the “ilities” are due to the artistic nature of AI algorithm development, especially hyperparameter determination. AI algorithms are often crafted products with the hyperparameters learned experientially. As such, when applying the same Accuracy w w w w algorithm to new problems, the algorithm may not w* w* w* w* w* perform due to inappropriate settings.
    [Show full text]