DOCSLIB.ORG

Improved Similarity Search for Large Data in Machine Learning and Robotics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Improved Similarity Search for Large Data in Machine Learning and Robotics The University of Newcastle, Australia Doctoral Thesis Improved Similarity Search for Large Data in Machine Learning and Robotics Author: Josiah Walker B. Computer Science (Hons), The University of Newcastle A thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Interdisciplinary Machine Learning Research Group School of Electrical Engineering and Computing The University of Newcastle, Australia Submitted April 2016 Declaration of Authorship Statement of Originality I, Josiah Walker, declare that this thesis titled, ‘Improved Similarity Search for Large Data in Machine Learning and Robotics’ and the work presented in it are my own. I confirm that this thesis contains no material which has been accepted for the award of any other degree or diploma in any university or other tertiary institution and, to the best of my knowledge and belief, contains no material previously published or written by another person, except where due reference has been made in the text. I give consent to the final version of my thesis being made available worldwide when deposited in the University’s Digital Repository, subject to the provisions of the Copyright Act 1968. Signed: Date: i Acknowledgements I wish to thank everybody who has supported and encouraged me to make the completion of this thesis possible. This list includes too many friends, family, and colleagues to list, who have all been understanding of the difficulties involved and the unusual work hours sometimes required to finish work on time, and have provided encouragement and inspiration along the way. I want to especially thank my wife Rebecca, for sharing our marriage with my PhD, for being understanding and patient through all the various stages of my candidacy, and for consistently providing support during these times. This work would not have been possible without the support, advice, and instruction of my wonderful supervisors Stephan Chalup and Ljiljana Brankovic. Thankyou both for being supportive, patient, and encouraging during this time. ii Dedicated to my great-grandmother Mary Bade Iwillalwaysrememberyourfaithandcourage. iii Contents Declaration of Authorship i Acknowledgements ii Contents iv List of Figures vii List of Tables ix Abstract x 1Overview 1 1.1 Applications of Nearest-Neighbour Search ................... 2 1.1.1 Motivation: Improving NNS for Machine Learning Applications ... 4 1.2 Contributions ................................... 4 1.2.1 Subsampled Locality Sensitive Hashing (Chapter 3) ......... 5 1.2.2 Approximate Boosted Similarity-Sensitive Collections (Chapter 4) . 5 1.2.3 Approximate Cover Tree Search (Chapter 5) ............. 6 1.2.4 Exact Streaming All-Nearest-Neighbours (Chapter 6) ........ 6 1.3 Thesis Organization ............................... 7 2 Introduction 8 2.1 The Nearest-Neighbour Search Problem .................... 8 2.1.1 Measures of Similarity .......................... 9 2.1.2 Feature Extraction for Similarity Search ................ 10 2.2 Exact Methods for k-Nearest-Neighbour Search ................ 12 2.2.1 KD-trees ................................. 12 2.2.2 Metric trees ................................ 15 2.2.3 Cover trees ................................ 18 2.2.4 Empirical Comparison on Large Benchmark Data ........... 22 2.3 Approximate Nearest-Neighbour Tree Search ................. 25 2.3.1 Spill-trees ................................. 27 iv Contents v 2.3.2 Low-dimensional Projections ...................... 30 2.4 Locality-Sensitive Hashing ............................ 30 2.4.1 LSH Query Methods ........................... 32 2.4.1.1 Naive Multi-Table Search ................... 33 2.4.1.2 Hamming Ball Search ..................... 34 2.4.1.3 Multiprobe Search ....................... 36 2.4.1.4 LSH Forest Search ....................... 37 2.4.2 Query Method Performance Comparison ................ 38 2.4.3 Randomly Constructed Hash Families ................. 40 2.4.3.1 Gaussian Random Projections ................ 40 2.4.3.2 P-Stable projections ...................... 41 2.4.3.3 Double Hadamard Projections ................ 42 2.4.3.4 Shift Invariant Kernels .................... 43 2.4.4 Data Driven Hash Families ....................... 44 2.4.4.1 PCA Hashing with Random Rotations ............ 44 2.4.4.2 Iterative Quantization ..................... 45 2.4.4.3 SPLH .............................. 45 2.4.4.4 K-Means Hashing ....................... 46 2.4.4.5 Product Quantization ..................... 47 2.4.4.6 Boosted Similarity-Sensitive Coding ............. 48 2.4.4.7 Spectral Hashing and Manifold Methods .......... 49 2.4.5 Hierarchical Hashing ........................... 50 2.4.5.1 Beyond LSH .......................... 50 2.4.5.2 Locally Optimized Product Quantization .......... 51 2.5 Optimizing Approximate Search Collections .................. 52 2.5.0.1 Boosted Search Forests .................... 52 2.5.0.2 Data-Sensitive Hashing .................... 53 2.5.0.3 Reciprocal Dominant Hash Functions ............ 54 2.6 Chapter Summary ................................ 55 3 Subsampling for fast Locality Sensitive Hashing 56 3.1 Locality-Sensitive Hash Functions ........................ 58 3.2 Sub-sampled Locality Sensitive Hashing (SLSH) ................ 60 3.2.1 Sub-sampling on Sparse Data ...................... 61 3.3 Experimental Protocols ............................. 62 3.3.1 Test Data ................................. 63 3.3.2 Test Procedure .............................. 64 3.4 Precision and Recall Results ........................... 68 3.5 Timed Performance Results ........................... 70 3.6 Chapter Summary ................................ 73 4 Approximate Boosting for Locality Sensitive Hashing 75 4.1 Introduction .................................... 75 4.2 Related Work ................................... 77 Contents vi 4.2.1 Locality-sensitive Hash-Function Families ............... 79 4.2.2 Optimising Locality Sensitive Hash Collections ............ 80 4.3 Approximate Boosting For Hash Function Collections ............ 82 4.3.1 Approximate Boosting for RDHF .................... 84 4.3.2 Simple Boosted Hash-Function Collections ............... 88 4.4 Methodology ................................... 92 4.5 Results ....................................... 94 4.5.1 E↵ects of Training Data Size ...................... 94 4.5.2 Comparative Performance ........................ 95 4.6 Chapter Summary ................................ 98 5 Improved Approximate Euclidean Search with Cover Trees 99 5.1 s-Approximate Cover Tree Search ........................100 5.1.1 Children within the Cover Tree are Approximately Uniformly Dis- tributed ..................................101 5.1.2 A Spherical Cap Bounds Intersection Volume .............103 5.1.3 Local Intrinsic Dimensionality Matters .................106 5.2 s-Approximate Cover Tree Search ........................107 5.3 Experimental Results ...............................108 5.3.1 Comparison to Theoretical Results ...................110 5.3.2 Performance for Varying Values of k ..................112 5.3.3 Comparison to Locality-sensitive Hashing and Leaf-search ......115 5.4 Chapter Summary ................................118 6 Creating Large-Scale Incremental K-Nearest-Neighbour Graphs 120 6.1 Constructing k-NN Graphs Incrementally Using max(✏, k)-NN queries ...123 6.2 Incremental k-NN Graphs with Cover Trees ..................125 6.2.1 Complexity ................................130 6.2.2 Experimental Results ..........................131 6.3 Chapter Summary ................................134 7 Conclusion 136 7.1 Subsampled Locality-Sensitive Hashing (Chapter 3) .............136 7.2 Subsampled Locality-Sensitive Hashing (Chapter 4) .............137 7.3 Approximate Cover Tree Search (Chapter 5) ..................138 7.4 Incremental k-NN Graph Construction (Chapter 6) ..............138 7.5 Further Work ...................................139 7.6 Final Remarks ..................................140 A Additional Publications During PhD Candidacy 142 Bibliography 144 List of Figures 2.1 Visualisation of KD-Tree Queries ........................ 15 2.2 Visualisation of Metric Tree Queries ...................... 18 2.3 Visualisation of Cover Tree Queries ....................... 19 2.4 PCA-projected standard deviations of BigANN datasets ........... 23 2.5 Exact tree search time comparison ....................... 25 2.6 Leaf-limited approximate tree search times .................. 26 2.7 Leaf-limited approximate tree search recalls .................. 27 2.8 Spill-tree timed performance ........................... 28 2.9 Spill-tree memory performance ......................... 29 2.10 Visualisation of LSH naive multi-table search ................. 33 2.11 Visualisation of LSH Hamming ball search ................... 35 2.12 Visualisation of LSH Multiprobe search .................... 36 2.13 LSH-forest search visualisation ......................... 38 2.14 LSH query method search times ......................... 39 3.1 Sparse summed LSH precision for varying sum sizes ............. 62 3.2 SLSH Precision-Recall on Reuters and TDT-2 ................. 65 3.3 SLSH Precision-Recall on CIFAR-10 and LabelMe .............. 66 3.4 SLSH Precision-Recall on BigANN GIST and SIFT .............. 67 3.5 Performance of SLSH with increasing data size ................ 69 3.6 Tuned SLSH performance comparison ..................... 71 3.7 Tuned SLSH construction performance ..................... 72 4.1 SimpleBoost optimisation gains with
Load more

Recommended publications
  • EMBO Conference on Fission Yeast: Pombe 2013 7Th International Fission Yeast Meeting London, United Kingdom, 24 - 29 June 2013
    Abstracts of papers presented at the EMBO Conference on Fission Yeast: pombe 2013 7th International Fission Yeast Meeting London, United Kingdom, 24 - 29 June 2013 Meeting Organizers: Jürg Bähler UCL, UK Jacqueline Hayles CRUK-LRI, UK Scientific Programme: Robin Allshire UK Rob Martienssen USA Paco Antequera Spain Hisao Masai Japan Francois Bachand Canada Jonathan Millar UK Jürg Bähler UK Sergio Moreno Spain Pernilla Bjerling Sweden Jo Murray UK Fred Chang USA Toru Nakamura USA Gordon Chua Canada Chris Norbury UK Peter Espenshade USA Kunihiro Ohta Japan Kathy Gould USA Snezhka Oliferenko Singapore Juraj Gregan Austria Janni Petersen UK Edgar Hartsuiker UK Paul Russell USA Jacqueline Hayles UK Geneviève Thon Denmark Elena Hidalgo Spain Iva Tolic-Nørrelykke Germany Charlie Hoffman USA Elizabeth Veal UK Zoi Lygerou Greece Yoshi Watanabe Japan Henry Levin USA Jenny Wu France These abstracts may not be cited in bibliographies. Material contained herein should be treated as personal communication and should be cited as such only with the consent of the authors. Printed by SLS Print, London, UK Page 1 Poster Prize Judges: Coordinated by Sara Mole & Mike Bond UCL, UK Poster Prizes sponsored by UCL, London’s Global University Rosa Aligué Spain Hiroshi Murakami Japan José Ayté Spain Eishi Noguchi USA Hugh Cam USA Martin Převorovský Czech Republic Rafael Daga Spain Luis Rokeach Canada Jacob Dalgaard UK Ken Sawin UK Da-Qiao Ding Japan Melanie Styers USA Tim Humphrey UK Irene Tang USA Norbert Käufer Germany Masaru Ueno Japan Makoto Kawamukai Japan
    [Show full text]
  • Generalized Tonnetze and Zeitnetz, and the Topology of Music Concepts
    June 25, 2019 Journal of Mathematics and Music tonnetzTopologyRev Submitted exclusively to the Journal of Mathematics and Music Last compiled on June 25, 2019 Generalized Tonnetze and Zeitnetz, and the Topology of Music Concepts Jason Yust∗ School of Music, Boston University () The music-theoretic idea of a Tonnetz can be generalized at different levels: as a network of chords relating by maximal intersection, a simplicial complex in which vertices represent notes and simplices represent chords, and as a triangulation of a manifold or other geomet- rical space. The geometrical construct is of particular interest, in that allows us to represent inherently topological aspects to important musical concepts. Two kinds of music-theoretical geometry have been proposed that can house Tonnetze: geometrical duals of voice-leading spaces, and Fourier phase spaces. Fourier phase spaces are particularly appropriate for Ton- netze in that their objects are pitch-class distributions (real-valued weightings of the twelve pitch classes) and proximity in these space relates to shared pitch-class content. They admit of a particularly general method of constructing a geometrical Tonnetz that allows for interval and chord duplications in a toroidal geometry. The present article examines how these du- plications can relate to important musical concepts such as key or pitch-height, and details a method of removing such redundancies and the resulting changes to the homology the space. The method also transfers to the rhythmic domain, defining Zeitnetze for cyclic rhythms. A number of possible Tonnetze are illustrated: on triads, seventh chords, ninth-chords, scalar tetrachords, scales, etc., as well as Zeitnetze on a common types of cyclic rhythms or time- lines.
    [Show full text]
  • Evaluation of Test Collections Generated from Transaction Logs in Digital Humanities
    Evaluation of Test Collections Generated from Transaction Logs in Digital Humanities a dissertation presented by Neil Hickey to The School of Computer Science and Statistics in partial fulfillment of the requirements for the degree of Master of Computer Science in the subject of Knowledge and Data Engineering Supervised by Dr. Séamus Lawless May 2017 Declaration I, Neil Hickey, declare that the following dissertation, except where otherwise stated, is entirely my own work; that it has not previously been submitted as an exercise for a degree, either in Trinity College Dublin, or in any other University; and that the library may lend or copy it or any part thereof on request. Signed: Date: ii Thesis advisor: Dr. Séamus Lawless Neil Hickey Summary The rise of digital collections being made available publicly online has led toa greater desire to give users the most relevant documents for their needs. These relevance judgments must be bench-marked to determine how well they satisfy the needs of the searcher, which involves the use of a test collection. A test collection provides a set of information needs and the documents which have been deemed to satisfy this need. This dissertation uses two digital collections from the Cultura Project, namely the 1916 and the 1641 collections. These digital collections are a set of witness testimony documents related to key events in Irish history. The proposed experiment uses these collections as a means to evaluate an automatically generated test collection. In this dissertation, an evaluation of whether extracted binary judgments of relevance, from transaction logs, are suitable for the automatic generation of a test collection from the digital libraries transaction logs, has been carried out.
    [Show full text]
  • [Math.AG] 13 Nov 2006 N Oti H Otgnrlfruain N Opeeproofs
    PATCHWORKING REAL ALGEBRAIC VARIETIES OLEG VIRO Introduction This paper is a translation of the first chapter of my dissertation 1 which was defended in 1983. I do not take here an attempt of updating. The results of the dissertation were obtained in 1978-80, announced in [Vir79a, Vir79b, Vir80], a short fragment was published in detail in [Vir83a] and a con- siderable part was published in paper [Vir83b]. The later publication appeared, however, in almost inaccessible edition and has not been translated into English. In [Vir89] I presented almost all constructions of plane curves contained in the dissertation, but in a simplified version: without description of the main underlying patchwork construction of algebraic hypersurfaces. Now I regard the latter as the most important result of the dissertation with potential range of application much wider than topology of real algebraic varieties. It was the subject of the first chapter of the dissertation, and it is this chapter that is presented in this paper. In the dissertation the patchwork construction was applied only in the case of plane curves. It is developed in considerably higher generality. This is motivated not only by a hope on future applications, but mainly internal logic of the subject. In particular, the proof of Main Patchwork Theorem in the two-dimensional situation is based on results related to the three-dimensional situation and analogous to the two-dimensional results which are involved into formulation of the two-dimensional Patchwork Theorem. Thus, it is natural to formulate and prove these results once for all dimensions, but then it is not natural to confine Patchwork Theorem itself to the two-dimensional case.
    [Show full text]
  • SRB012) – a Collection of Published Meeting Documents
    IPHC Scientific Review Board (SRB012) – A Collection of Published Meeting Documents 19 – 21 June 2018, Seattle, WA DISTRIBUTION: NONE BIBLIOGRAPHIC ENTRY Available for download at www.iphc.int. IPHC Secretariat. 2019. Int. Pac. Halibut Comm. A Collection Last updated: 21 May 2018 of Published Meeting Documents. The designations employed and the presentation of material in this publication and its lists do not imply the expression of any opinion whatsoever on the part of the International Pacific Halibut Commission (IPHC) concerning the legal or development status of any country, territory, city or area or of its authorities, or concerning the delimitation of its frontiers or boundaries. This work is protected by copyright. Fair use of this material for scholarship, research, news reporting, criticism or commentary is permitted. Selected passages, tables or diagrams may be reproduced for such purposes provided acknowledgment of the source is included. Major extracts or the entire document may not be reproduced by any process without the written permission of the Executive Director, IPHC. The IPHC has exercised due care and skill in the preparation and compilation of the information and data set out in this publication. Notwithstanding, the IPHC, its employees and advisers, assert all rights and immunities, and disclaim all liability, including liability for negligence, for any loss, damage, injury, expense or cost incurred by any person as a result of accessing, using or relying upon any of the information or data set out in this publication, to the maximum extent permitted by law including the International Organizations Immunities Act. Contact details: International Pacific Halibut Commission 2320 W.
    [Show full text]
  • Applications of DFT to the Theory of Twentieth-Century Harmony
    Applications of DFT to the Theory of Twentieth-Century Harmony Jason Yust Boston University, 855 Comm. Ave., Boston, Mass., 02215, United States [email protected] http://people.bu.edu/jyust Abstract. Music theorists have only recently, following groundbreaking work by Quinn, recognized the potential for the DFT on pcsets, initially proposed by Lewin, to serve as the foundation of a theory of harmony for the twentieth century. This paper investigates pcset \arithmetic" { subset structure, transpositional combination, and interval content { through the lens of the DFT. It discusses relationships between inter- val classes and DFT magnitudes, considers special properties of dyads, pcset products, and generated collections, and suggest methods of us- ing the DFT in analysis, including interpreting DFT magnitudes, using phase spaces to understand subset structure, and interpreting the DFT of Lewin's interval function. Webern's op. 5/4 and Bartok's String Quartet 4, iv, are discussed. Keywords: Discrete Fourier transform, pitch-class set theory, twentieth- century harmony, posttonal theory, Webern, Bartok, generated sets 1 Introduction In American music theory of the 1960s and 1970s, the era of Allen Forte's am- bitiously titled book The Structure of Atonal Music [12], a theory of harmony for the twentieth century seemed not only a possible but a natural goal of the discipline. In latter years, the idea of pursuing a general theory for such an eclec- tic century would come to seem increasingly audacious. But recent advances in mathematical music theory should reignite this enterprise: in particular the ap- plication of the Fourier transform to pcsets [3, 5, 9, 15, 18, 19].
    [Show full text]
  • Negative Representations of Information
    Negative Representations of Information by Carlos Fernando Esponda Darlington B.S., Instituto Tecnol´ogico Aut´onomo de M´exico, 1995 DISSERTATION Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy Computer Science The University of New Mexico Albuquerque, New Mexico December 2005 !c 2005, Carlos Fernando Esponda Darlington iii Dedication Para mi Luciernaga preciosa. iv Acknowledgments IwouldliketothankmyDad,MomandSister;Mom,DadandSister; Sister, Mom and Dad; Mom, Sister and Dad; Dad, Sister and Mom; Sister, Dad and Mom in no particular order and with all my heart. IwanttothankandacknowledgeStephanieForrestmentor,collaborator and friend, Paul Helman who taught me a lot and whose input made this work robust, and Elena Ackley for helping me make it real. Throughout the years the people at the adaptive computation laboratory have listened and provided input, in particular Todd Kaplan, Dennis Chao, Anil Somayaji, Matt Glickman, Josh Karlin, Rob Abbott, Ken Ingham, Hajime Inoue, Gabriela Barrantes, Haixia Jia, Justin Balthrop and Ryan Gerety. Terran Lane, professor and committee member continually poses challenges that enrich my research (thanks). I thank Nitant Kenkre for being in my committee and providing a different perspective on things. My friends Gerardo, Horacio, Vladimir, Todd, Dennis, Lucinda and Alejandro (Barru) have provided input and support that is impossible toquantify.Mysisters Le, Gaby, Susi and Flor have been my strong advocates and have always helped me along the way. In particular, I want to thank Gaby and Xavier for always making my trips back home pleasurable. Finally, I gratefully acknowledge the support of the National Science Foundation (CCR-0331580, DBI-0309147, CCR-0311686), Defense Advanced Research Projects Agency (grant AGR F30602-00-2-0584), the Intel Corporation, and the Santa Fe In- stitute.
    [Show full text]
  • Imagery Support Data (ISD) Documentation
    Imagery Support Data (ISD) Documentation v. 1.1.2 Disclaimer & Copyright Copyright © 2014 DigitalGlobe, Inc. All rights reserved. Access to DigitalGlobe products and sensors is limited to existing re-seller terms and conditions. THIS PUBLICATION IS PROVIDED "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, OR NON-INFRINGEMENT. THIS PUBLICATION COULD INCLUDE TECHNICAL INACCURACIES OR TYPOGRAPHICAL ERRORS. CHANGES ARE PERIODICALLY ADDED TO THE INFORMATION HEREIN; THESE CHANGES WILL BE INCORPORATED IN NEW EDITIONS OF THE PUBLICATION. DIGITALGLOBE MAY MAKE IMPROVEMENTS AND/OR CHANGES TO THE PRODUCT(S) AND/OR THE PROGRAM(S) DESCRIBED IN THIS PUBLICATION AT ANY TIME. DigitalGlobe Imagery Support Data (ISD) Documentation v. 1.1.2 October 2014 2 Contents Disclaimer & Copyright ........................................................................................................................... 2 List of Figures .......................................................................................................................................... 4 List of Tables ........................................................................................................................................... 5 1 Introduction ......................................................................................................................................... 6 2 Image Support Data ............................................................................................................................
    [Show full text]
  • Functional Interrogation of Genetically Simple and Complex Cancers
    FUNCTIONAL INTERROGATION OF GENETICALLY SIMPLE AND COMPLEX CANCERS by Edward R. Kastenhuber A Dissertation Presented to the Faculty of the Louis V. Gerstner, Jr. Graduate School of Biomedical Sciences, Memorial Sloan Kettering Cancer Center in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy New York, NY December, 2018 ___________________ ___________________ Scott W. Lowe Date Dissertation Mentor Copyright ©2018 by Edward Kastenhuber Dedication To my parents, for all their love and support. iii ABSTRACT The rapid expansion of cancer genomics over recent years has provided a valuable catalog of the events that drive malignancy, but functional dissection of oncogenes and tumor suppressor genes are needed to fully appreciate the roles of cancer-associated genes. Cancer types vary dramatically in genomic complexity, with pediatric cancers tending towards low mutation rates and certain other diseases tending towards hypermutation and highly rearranged genomes. Targeting driving oncogenes for therapy has precedent, particularly in low complexity cancers, and pre-clinical models provide an opportunity to refine such strategies. Treating high complexity tumors remains particularly challenging in part due to intratumoral heterogeneity, presumed to be linked to enhanced adaptability of cancer cell populations. Patterns of evolution supporting intratumoral heterogeneity have been extensively observed, but functional dissection of heterogeneity has been limited. Fibrolamellar hepatocellular carcinoma (FL-HCC) is a rare but lethal liver cancer that primarily affects adolescents and young adults. It has been described to harbor only one recurrent genetic event: somatic deletion of a segment of chromosome 19, resulting in DNAJB1-PRKACA gene fusion. Efforts to understand and treat FL-HCC have been confounded by a lack of models that accurately reflect the genetics and biology of the disease.
    [Show full text]
  • Music and Twentieth-Century Tonality Routledge Studies in Music Theory
    Music and Twentieth-Century Tonality Routledge Studies in Music Theory 1 Music and Twentieth-Century Tonality Harmonic Progression Based on Modality and the Interval Cycles Paolo Susanni and Elliott Antokoletz Music and Twentieth-Century Tonality Harmonic Progression Based on Modality and the Interval Cycles Paolo Susanni and Elliott Antokoletz NEW YORK LONDON First published 2012 by Routledge 711 Third Avenue, New York, NY 10017 Simultaneously published in the UK by Routledge 2 Park Square, Milton Park, Abingdon, Oxon OX14 4RN Routledge is an imprint of the Taylor & Francis Group, an informa business © 2012 Taylor & Francis The right of Paolo Susanni and Elliott Antokoletz to be identified as author of this work has been asserted by them in accordance with sections 77 and 78 of the Copyright, Designs and Patents Act 1988. All rights reserved. No part of this book may be reprinted or reproduced or utilised in any form or by any electronic, mechanical, or other means, now known or hereafter invented, including photocopying and recording, or in any information storage or retrieval system, without permission in writing from the publishers. Trademark Notice: Product or corporate names may be trademarks or registered trademarks, and are used only for identification and explanation without intent to infringe. Library of Congress Cataloging-in-Publication Data Susanni, Paolo, author. Music and twentieth-century tonality : harmonic progression based on modality and the interval cycles / Paolo Susanni and Elliott Antokoletz. pages cm — (Routledge studies in music theory ; 1) Includes bibliographical references and index. 1. Music—20th century—Analysis, appreciation. 2. Musical analysis. I. Antokoletz, Elliott, author.
    [Show full text]
  • Pinnacle Studio 25 User Guide
    Pinnacle Studio™ 25 User Guide Including Pinnacle Studio™ Plus and Pinnacle Studio™ Ultimate Contents Before you start . 1 Abbreviations and conventions . 1 Buttons, menus, dialog boxes and windows . 2 Help and Tooltips . 2 Finding your version information. 3 Upgrading . 3 Using Pinnacle Studio . 5 The Welcome tab . 5 The Import tab. 5 The Export tab . 6 The Edit tab . 7 Creating your first movie in Edit. 8 Editing media and assets . 9 Overlays . 10 Pinnacle Studio Projects. 11 The Library. 13 What can you find in the Library? . 14 Instant gratification: SmartMovie . 15 Understanding the Library. 15 The Navigator . 17 Project Bins. 18 Projects . 18 Collections . 18 Favorites . 20 Managing Library assets . 21 The Library Browser . 22 Thumbnails and details . 23 Optional indicators and controls . 25 The Library preview. 27 Choosing what to display in the Library . 29 Contents i Tags . 31 Video scene detection . 34 Correcting media. 35 SmartMovie . 35 Edit . 39 Edit tab components . 40 The Editor panel . 41 Using keyframes . 42 Previewing edits in the Player . 44 The Project Timeline . 47 The Timeline toolbar. 51 Markers . 58 3-point and 4-point editing . 59 The timeline track header . 62 Editing Movies . 64 Title Editors, ScoreFitter, voice-over . 68 Deleting clips . 69 Clip operations . 69 Rotating video . 71 Camera properties . 71 Trimming video . 72 Using Slip, Slide, Roll, or Stretch tools on the Timeline . 80 Using the Clipboard . 82 Controlling speed with Time Remapping . 83 Using Time Freeze to freeze frames. 86 Movies within movies (nested projects) . 87 Picture-in-Picture (PIP) . 88 Track Transparency . 89 Blend Modes .
    [Show full text]
  • Unnamed Document
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Northumbria Research Link Northumbria Research Link Citation: Leishman, Donna (2019) Perceptual fail: Female power, mobile technologies and images of self. In: ELO 2019: Peripheries Conference and Media Arts Festival, 15-17th July 2019, University College Cork, Cork. URL: https://cora.ucc.ie/handle/10468/8128 <https://cora.ucc.ie/handle/10468/8128> This version was downloaded from Northumbria Research Link: http://nrl.northumbria.ac.uk/42852/ Northumbria University has developed Northumbria Research Link (NRL) to enable users to access the University’s research output. Copyright © and moral rights for items on NRL are retained by the individual author(s) and/or other copyright owners. Single copies of full items can be reproduced, displayed or performed, and given to third parties in any format or medium for personal research or study, educational, or not-for-profit purposes without prior permission or charge, provided the authors, title and full bibliographic details are given, as well as a hyperlink and/or URL to the original metadata page. The content must not be changed in any way. Full items must not be sold commercially in any format or medium without formal permission of the copyright holder. The full policy is available online: http://nrl.northumbria.ac.uk/pol i cies.html This document may differ from the final, published version of the research and has been made available online in accordance with publisher policies. To read and/or cite from the published version of the research, please visit the publisher’s website (a subscription may be required.) UCC Library and UCC researchers have made this item openly available.
    [Show full text]