dual view hashing

Dual-view Hashing MOHAMMAD RASTEGARI JONGHYUN CHOI SHOBEIR - PowerPoint PPT Presentation

Sep 28, 2022 •118 likes •281 views

Predictable Dual-view Hashing MOHAMMAD RASTEGARI JONGHYUN CHOI SHOBEIR FAKHRAEI* HAL DAUM III LARRY S. DAVIS University of Maryland, College Park, MD, USA Integrate information from different modalities Text - Image Human Riding

  1. Predictable Dual-view Hashing MOHAMMAD RASTEGARI JONGHYUN CHOI SHOBEIR FAKHRAEI* HAL DAUMÉ III LARRY S. DAVIS University of Maryland, College Park, MD, USA

  2. Integrate information from different modalities  Text - Image Human Riding Horse  Sound - Text ICML 2013 | Atlanta | Predictable Dual-view Hashing

  3. Dual-View Hashing Textual Space Visual Space Human riding a horse Person laughing at restaurant Cow standing in a farm Hamming Space 010111010 101010101 110010101 ICML 2013 | Atlanta | Predictable Dual-view Hashing

  4. Binary code assignments with splits 0 1 1 0 001 1 0 101 ICML 2013 | Atlanta | Predictable Dual-view Hashing

  5. Predictability 14 01?101 12 10 8 6 4 2 0 -2 -20 -15 -10 -5 0 5 10 15 20 25 ICML 2013 | Atlanta | Predictable Dual-view Hashing

  6. Predictability 11 0 110 14 10 0 110 01 ? 101 12 01 0 110 01 0 011 10 8 6 4 2 0 -2 -20 -15 -10 -5 0 5 10 15 20 25 ICML 2013 | Atlanta | Predictable Dual-view Hashing

  7. Predictability 14 CCA 12 10 8 6 4 2 0 -2 -20 -15 -10 -5 0 5 10 15 20 25 ICML 2013 | Atlanta | Predictable Dual-view Hashing

  8. Predictability 14 PDH CCA 12 10 8 6 margin 4 2 0 -2 -20 -15 -10 -5 0 5 10 15 20 25 ICML 2013 | Atlanta | Predictable Dual-view Hashing

  9. Optimization Solved by a block coordinate descent algorithm ICML 2013 | Atlanta | Predictable Dual-view Hashing

  10. Predictable dual-view hashing Modality 1 Modality 2 1101 0101 0010 1110 label 1010 1010 0101 0101 1110 1001 ICML 2013 | Atlanta | Predictable Dual-view Hashing

  11. Predictable dual-view hashing Modality 1 Modality 2 1101 0101 0010 1110 label 1010 1010 0101 0101 1110 1001 ICML 2013 | Atlanta | Predictable Dual-view Hashing

  12. Image  image (with 32 bits) ICML 2013 | Atlanta | Predictable Dual-view Hashing

  13. Text  Image (with 32 bits) ICML 2013 | Atlanta | Predictable Dual-view Hashing

  14. Image Retrieval Pascal Sentence [Farhadi et al] Sun Attribute [Peterson et al] ICML 2013 | Atlanta | Predictable Dual-view Hashing

  15. Thank you Predictable Dual-view Hashing Mohammad Rastegari, Jonghyun Choi, Shobeir Fakhraei*, Hal Daumé III and Larry S. Davis University of Maryland, College Park, MD, USA

Recommend

Today. Cuckoo hashing. Today. Cuckoo hashing. Johnson-Lindenstrass. Cuckoo hashing. Hashing

Today. Cuckoo hashing. Today. Cuckoo hashing. Johnson-Lindenstrass. Cuckoo hashing. Hashing

Today. Cuckoo hashing. Today. Cuckoo hashing. Johnson-Lindenstrass. Cuckoo hashing. Hashing with two choices: max load O ( loglog n ) . Cuckoo hashing. Hashing with two choices: max load O ( loglog n ) . Cuckoo hashing: Cuckoo hashing.

1.69k views • 147 slides
14. Hashing Hash Tables, Pre-Hashing, Hashing, Resolving Collisions using Chaining, Simple

14. Hashing Hash Tables, Pre-Hashing, Hashing, Resolving Collisions using Chaining, Simple

14. Hashing Hash Tables, Pre-Hashing, Hashing, Resolving Collisions using Chaining, Simple Uniform Hashing, Popular Hash Functions, Table-Doubling, Open Addressing: Probing, Uniform Hashing, Universal Hashing, Perfect Hashing [Ottman/Widmayer,

1.25k views • 98 slides
Overview Intro to Hashing Intro to Hashing Hashing with Chaining Whats hashing?

Overview Intro to Hashing Intro to Hashing Hashing with Chaining Whats hashing?

Overview Intro to Hashing Intro to Hashing Hashing with Chaining Whats hashing? Distribute key/value pairs across bins with a hash function , Hashing Performance Hashing (Application of Probability) which maps elements from

497 views • 3 slides
14. Hashing Hash Tables, Pre-Hashing, Hashing, Resolving Collisions using Chaining, Simple

14. Hashing Hash Tables, Pre-Hashing, Hashing, Resolving Collisions using Chaining, Simple

14. Hashing Hash Tables, Pre-Hashing, Hashing, Resolving Collisions using Chaining, Simple Uniform Hashing, Popular Hash Functions, Table-Doubling, Open Addressing: Probing, Uniform Hashing, Universal Hashing, Perfect Hashing [Ottman/Widmayer,

1.5k views • 58 slides
Database Systems Index: Hashing Based on slides by Feifei Li, University of Utah Hashing n

Database Systems Index: Hashing Based on slides by Feifei Li, University of Utah Hashing n

Database Systems Index: Hashing Based on slides by Feifei Li, University of Utah Hashing n Hash-based indexes are best for equality selections . Cannot support range searches. n Static and dynamic hashing techniques exist. 2 Static Hashing n #

454 views • 41 slides
Hashing (Application of Probability) Ashwinee Panda Final CS 70 Lecture! 9 Aug 2018 Overview

Hashing (Application of Probability) Ashwinee Panda Final CS 70 Lecture! 9 Aug 2018 Overview

Hashing (Application of Probability) Ashwinee Panda Final CS 70 Lecture! 9 Aug 2018 Overview Intro to Hashing Hashing with Chaining Hashing Performance Hash Families Balls and Bins Load Balancing Universal Hashing

726 views • 18 slides
Hashing Connections 2-Universal Hash Function Perfect Hashing Anil Maheshwari Proofs

Hashing Connections 2-Universal Hash Function Perfect Hashing Anil Maheshwari Proofs

Hashing Anil Maheshwari Setting Balls & Bins Hashing Connections 2-Universal Hash Function Perfect Hashing Anil Maheshwari Proofs anil@scs.carleton.ca School of Computer Science Carleton University Canada Outline Hashing Anil

372 views • 21 slides
Union-Find [10] In the last class Hashing Collision Handling for Hashing Closed

Union-Find [10] In the last class Hashing Collision Handling for Hashing Closed

Algorithm : Design & Analysis Union-Find [10] In the last class Hashing Collision Handling for Hashing Closed Address Hashing Open Address Hashing Hash Functions Array Doubling and Amortized Analysis Union-Find

618 views • 33 slides
Hashing Chapter 5 1 Objectives Understand the idea of hashing Compare hashing to sorting

Hashing Chapter 5 1 Objectives Understand the idea of hashing Compare hashing to sorting

Hashing Chapter 5 1 Objectives Understand the idea of hashing Compare hashing to sorting Design a hashtable Identify the applications that require the hashtable data structure Understand the terminology of hashtables Distinguish between

319 views • 14 slides
Hashing Hashing What is it? A form of narcotic intake? A side order for your eggs? A

Hashing Hashing What is it? A form of narcotic intake? A side order for your eggs? A

Hashing Hashing What is it? A form of narcotic intake? A side order for your eggs? A combination of the two? Hashing 1 Problem RT&T is a large phone company, and they want to provide caller ID capability: - given a phone number,

267 views • 14 slides
Lecture 8: Hashing I Lecture Overview Dictionaries and Python Motivation Prehashing

Lecture 8: Hashing I Lecture Overview Dictionaries and Python Motivation Prehashing

Lecture 8 Hashing I 6.006 Fall 2011 Lecture 8: Hashing I Lecture Overview Dictionaries and Python Motivation Prehashing Hashing Chaining Simple uniform hashing Good hash functions Dictionary Problem Abstract

452 views • 21 slides
Chapter 11: Indexing and Hashing Basic Concepts Ordered Indices B + -Tree Index Files

Chapter 11: Indexing and Hashing Basic Concepts Ordered Indices B + -Tree Index Files

' $ Chapter 11: Indexing and Hashing Basic Concepts Ordered Indices B + -Tree Index Files B-Tree Index Files Static Hashing Dynamic Hashing Comparison of Ordered Indexing and Hashing Index Definition in SQL

635 views • 29 slides
Advanced Algorithms COMS31900 Hashing part two Static Perfect Hashing Rapha el Clifford

Advanced Algorithms COMS31900 Hashing part two Static Perfect Hashing Rapha el Clifford

Advanced Algorithms COMS31900 Hashing part two Static Perfect Hashing Rapha el Clifford Slides by Benjamin Sach Dictionaries and Hashing recap A dynamic dictionary stores ( key , value ) -pairs and supports: add ( key , value ) ,

1.14k views • 99 slides
Calhoun Community College Dual Enrollment Info Session for Students & Parents What is Dual

Calhoun Community College Dual Enrollment Info Session for Students & Parents What is Dual

Calhoun Community College Dual Enrollment Info Session for Students & Parents What is Dual Enrollment & Dual Credit? Dual Enrollment/Dual Credit is a program which allows eligible high school students to enroll in college classes

196 views • 15 slides
DUAL CREDIT WHAT IS DUAL CREDIT? Dual credit means two things are happening at once. Students

DUAL CREDIT WHAT IS DUAL CREDIT? Dual credit means two things are happening at once. Students

DUAL CREDIT WHAT IS DUAL CREDIT? Dual credit means two things are happening at once. Students are earning high school credit while also earning college credit. Dual credit courses are taught at the college level. Expect the class to be

323 views • 21 slides
Lenguaje dual en el distrito 47 Dual Language in District 47 2017-2018 What is Dual Language?

Lenguaje dual en el distrito 47 Dual Language in District 47 2017-2018 What is Dual Language?

Lenguaje dual en el distrito 47 Dual Language in District 47 2017-2018 What is Dual Language? Dual Language programs integrate native English speaking students with native Spanish speaking students to receive academic instruction in both

549 views • 18 slides
Extended and generalized weight enumerators Relinde Jurrius Ruud Pellikaan Eindhoven University

Extended and generalized weight enumerators Relinde Jurrius Ruud Pellikaan Eindhoven University

Extended and generalized weight enumerators Relinde Jurrius Ruud Pellikaan Eindhoven University of Technology, The Netherlands International Workshop on Coding and Cryptography, 2009 1/23 Outline Previous work Codes, weights and weight

484 views • 32 slides
Runtime Analysis of Convex Evolutionary Search Convex Evolutionary Search Alberto Moraglio &

Runtime Analysis of Convex Evolutionary Search Convex Evolutionary Search Alberto Moraglio &

Runtime Analysis of Convex Evolutionary Search Convex Evolutionary Search Alberto Moraglio & Dirk Sudholt University of Birmingham & University of Sheffield Research Goal Aim: identify matches between topographic features of

411 views • 28 slides
Locality-Sensitive Hashing CS 395T: Visual Recognition and Search Marc Alban Feb 22, 2008 1

Locality-Sensitive Hashing CS 395T: Visual Recognition and Search Marc Alban Feb 22, 2008 1

Locality-Sensitive Hashing CS 395T: Visual Recognition and Search Marc Alban Feb 22, 2008 1 Nearest Neighbor Given a query any point , return the point q closest to . q Useful for finding similar objects in a database. Brute

489 views • 26 slides
LSH: A Survey of Hashing for Similarity Search CS 584: Big Data Analytics LSH Problem Definition

LSH: A Survey of Hashing for Similarity Search CS 584: Big Data Analytics LSH Problem Definition

LSH: A Survey of Hashing for Similarity Search CS 584: Big Data Analytics LSH Problem Definition Randomized c-approximate R-near neighbor or (c,r)-NN: Given a set P of points in a d- dimensional space, and parameters R > 0, >

354 views • 34 slides
Data-dependent Hashing for Nearest Neighbor Search Alex Andoni (Columbia University) Based on

Data-dependent Hashing for Nearest Neighbor Search Alex Andoni (Columbia University) Based on

Data-dependent Hashing for Nearest Neighbor Search Alex Andoni (Columbia University) Based on joint work with: Piotr Indyk, Huy Nguyen, Ilya Razenshteyn Nearest Neighbor Search (NNS) Preprocess: a set of points Query: given a

542 views • 19 slides
Discrete Factorization Machines for Fast Feature-based Recommendation Han Liu 1 , Xiangnan He 2 ,

Discrete Factorization Machines for Fast Feature-based Recommendation Han Liu 1 , Xiangnan He 2 ,

Discrete Factorization Machines for Fast Feature-based Recommendation Han Liu 1 , Xiangnan He 2 , Fuli Feng 2 , Liqiang Nie 1 , Rui Liu 3 , Hanwang Zhang 4 1.Shandong University 2.National University of Singapore 3.University of Electronic

328 views • 17 slides
Outline 1 Introduction to LWE The LWE Problem Motivation 2 Background and reformulating LWE 3 The

Outline 1 Introduction to LWE The LWE Problem Motivation 2 Background and reformulating LWE 3 The

Combinatorial methods for solving LWE 1 Thomas Johansson 1 1 Dept. of Electrical and Information Technology, Lund University 1 Last part to appear at Asiacrypt 2018 London September, 2017 Outline 1 Introduction to LWE The LWE Problem Motivation

1.15k views • 71 slides
Great antipodal sets on unitary groups and Hamming graphs Hirotake Kurihara National Institute

Great antipodal sets on unitary groups and Hamming graphs Hirotake Kurihara National Institute

Great antipodal sets on unitary groups and Hamming graphs Hirotake Kurihara National Institute of Technology, Kitakyushu College The Japanese Conference on Combinatorics and its Applications May 21, 2018 H. Kurihara (Nit Kit) GAS on U ( n )

462 views • 14 slides

More recommend