R00922016 朱冠宇 r00922042 李哲君 2012/04/17. Hierarchical K-means.

Slides:

Advertisements

Similar presentations

Aggregating local image descriptors into compact codes

Advertisements

Herv´ eJ´ egouMatthijsDouzeCordeliaSchmid INRIA INRIA INRIA

ECE 562 Computer Architecture and Design Project: Improving Feature Extraction Using SIFT on GPU Rodrigo Savage, Wo-Tak Wu.

Empowering visual categorization with the GPU Present by 陳群元我是強壯 !

Packing bag-of-features ICCV 2009 Herv´e J´egou Matthijs Douze Cordelia Schmid INRIA.

Effective Image Database Search via Dimensionality Reduction Anders Bjorholm Dahl and Henrik Aanæs IEEE Computer Society Conference on Computer Vision.

Object retrieval with large vocabularies and fast spatial matching

DNA Microarray Bioinformatics - #27611 Program Normalization exercise (from last week) Dimension reduction theory (PCA/Clustering) Dimension reduction.

Dimension reduction : PCA and Clustering Agnieszka S. Juncker Slides: Christopher Workman and Agnieszka S. Juncker Center for Biological Sequence Analysis.

1 Abstract This paper presents a novel modification to the classical Competitive Learning (CL) by adding a dynamic branching mechanism to neural networks.

Cluster analysis. Partition Methods Divide data into disjoint clusters Hierarchical Methods Build a hierarchy of the observations and deduce the clusters.

Dimension reduction : PCA and Clustering by Agnieszka S. Juncker

Weekly Report Start learning GPU Ph.D. Student: Leo Lee date: Sep. 18, 2009.

Dimension reduction : PCA and Clustering by Agnieszka S. Juncker Part of the slides is adapted from Chris Workman.

Project 2 SIFT Matching by Hierarchical K-means Quantization

What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.

Project 4 Image Search based on BoW model with Inverted File System

DATA MINING CLUSTERING K-Means.

Motion and Force Chapter Three: Motion 3.1 Position and Velocity 3.2 Graphs of Motion 3.3 Acceleration.

AR: An ‘app’ which adds a layer to what you see when looking through your phone or tablet at an object, a poster or perhaps even a building.

Self-organizing map Speech and Image Processing Unit Department of Computer Science University of Joensuu, FINLAND Pasi Fränti Clustering Methods: Part.

Remarks on Big Data Clustering (and its visualization) Big Data and Extreme-scale Computing (BDEC) Charleston SC May Geoffrey Fox

Creating With Code.

04/30/13 Last class: summary, goggles, ices Discrete Structures (CS 173) Derek Hoiem, University of Illinois 1 Image: wordpress.com/2011/11/22/lig.

Vladyslav Kolbasin Stable Clustering. Clustering data Clustering is part of exploratory process Standard definition:  Clustering - grouping a set of.

YOU LI SUPERVISOR: DR. CHU XIAOWEN CO-SUPERVISOR: PROF. LIU JIMING THURSDAY, MARCH 11, 2010 Speeding up k-Means by GPUs 1.

Clustering Methods K- means. K-means Algorithm Assume that K=3 and initially the points are assigned to clusters as follows. C 1 ={x 1,x 2,x 3 }, C 2.

Video Google: A Text Retrieval Approach to Object Matching in Videos Josef Sivic and Andrew Zisserman.

Overview of Machine Learning RPI Robotics Lab Spring 2011 Kane Hadley.

IIIT Hyderabad Scalable Clustering using Multiple GPUs K Wasif Mohiuddin P J Narayanan Center for Visual Information Technology International Institute.

Genetic algorithms (GA) for clustering Pasi Fränti Clustering Methods: Part 2e Speech and Image Processing Unit School of Computing University of Eastern.

DATA CLUSTERING WITH KERNAL K-MEANS++ PROJECT OBJECTIVES o PROJECT GOAL  Experimentally demonstrate the application of Kernel K-Means to non-linearly.

Project Two Adding Web Pages, Links, and Images Define and set a home page Add pages to a Web site Describe Dreamweaver's image accessibility features.

Using to Save Lives Or, Using Digg to find interesting events. Presented by: Luis Zaman, Amir Khakpour, and John Felix.

Radial Basis Function ANN, an alternative to back propagation, uses clustering of examples in the training set.

Total Recall: Automatic Query Expansion with a Generative Feature Model for Object Retrieval O. Chum, et al. Presented by Brandon Smith Computer Vision.

Big data Usman Roshan CS 675. Big data Typically refers to datasets with very large number of instances (rows) as opposed to attributes (columns). Data.

Dendextend: an R package for easier manipulation and visualization of dendrograms useR!2014.

PDAC-10 Middleware Solutions for Data- Intensive (Scientific) Computing on Clouds Gagan Agrawal Ohio State University (Joint Work with Tekin Bicer, David.

Clustering Hongfei Yan School of EECS, Peking University 7/8/2009 Refer to Aaron Kimball’s slides.

Yue Xu Shu Zhang.  A person has already rated some movies, which movies he/she may be interested, too?  If we have huge data of user and movies, this.

SIFT DESCRIPTOR K Wasif Mrityunjay

COMBO-17 Galaxy Dataset Colin Holden COSC 4335 April 17, 2012.

Duc-Tien Dang-Nguyen, Giulia Boato, Alessandro Moschitti, Francesco G.B. De Natale Department to Information and Computer Science –University of Trento.

Maarten Van Lier 2 e Master Computerwetenschappen.

Accelerated Motion. is changing either the speed or direction, or both, of motion. Acceleration is the rate of change of velocity, in other words, how.

Locally Linear Support Vector Machines Ľubor Ladický Philip H.S. Torr.

Exploiting Computing Power of GPU for Data Mining Application Wenjing Ma, Leonid Glimcher, Gagan Agrawal.

Clustering Algorithms Sunida Ratanothayanon. What is Clustering?

Clustering (1) Chapter 7. Outline Introduction Clustering Strategies The Curse of Dimensionality Hierarchical k-means.

Motion and Forces Unit Chapter 1 Section 2. I1. Position can change at different rates. Can be fast SPEED A measure Can be slow Has a particular distance.

Computer Vision Group Department of Computer Science University of Illinois at Urbana-Champaign.

1 Learning Bias & Clustering Louis Oliphant CS based on slides by Burr H. Settles.

GPU Programming Contest. Contents Target: Clustering with Kmeans How to use toolkit1.0 Towards the fastest program.

Given a set of data points as input Randomly assign each point to one of the k clusters Repeat until convergence – Calculate model of each of the k clusters.

Genetic Algorithms for clustering problem Pasi Fränti

Accelerating K-Means Clustering with Parallel Implementations and GPU Computing Janki Bhimani Miriam Leeser Ningfang Mi

Tensorflow Tutorial Homin Yoon.

ECG data classification with deep learning tools

Interactive Website (

Brewing Deep Networks With Caffe

Chapter 4, Section 2 Graphs of Motion.

MNIST Dataset Training with Tensorflow

Tomasulo Algorithm Example

Find the velocity of a particle with the given position function

Unsupervised Learning and Clustering

CS203 – Advanced Computer Architecture

For vectors {image} , find u + v. Select the correct answer:

Visual Programming Week # 13

Оюутны эрдэм шинжилгээний хурлын зорилго:

Presentation transcript:

r 朱冠宇 r 李哲君 2012/04/17

Hierarchical K-means

K-means can be used for lots of applications Market research Social network analysis Recommendation system Image retrieval system

Data: N * d, find K centroids Find the nearest centroid: sub : N * d * k, mul : N * d * k, add : N * d min : O(k) Calculate new centroid: add : N * d, div : K * d Therefore, Hierarchical K-Means (HKM) shows up, but it is still slow for high dimension and large data.

Holiday dataset 1491 pictures vectors centroids Time : 626m55.739s

4/16~4/20K-means(GPU), HKM(CPU) code survey 4/23~5/04HKM GPU basic version 5/07~5/18Code speed up 5/21~6/01Clustering visualization or some app. 6/01~6/12buffer and write poster

1. big dimension (>128 for sift) HKM CUDA lib 2. HKM(GPU) v.s. HKM(CPU) report 3. clustering visualization (optional)