cartesian k-means

Post on 05-Jan-2016

65 Views

Category:

Documents

1 Downloads

Preview:

Click to see full reader

DESCRIPTION

Cartesian k-means. Mohammad Norouzi David Fleet. Increasing number of clusters. Problem: Search time, storage cost. We need many clusters. (subspace 2). (subspace 1). (subspace 2). (subspace 1). (subspace 2). (subspace 1). (subspace 2). (subspace 1). (subspace 2). (subspace 1). - PowerPoint PPT Presentation

TRANSCRIPT

Cartesian k-means

Mohammad Norouzi

David Fleet

We need many clusters

Increasing number of clusters

Problem: Search time, storage cost

(subspace 1) (subspace 2)

(subspace 1) (subspace 2)

(subspace 1) (subspace 2)

(subspace 1) (subspace 2)

(subspace 1) (subspace 2)

(subspace 1) (subspace 2)

Compositional representation

Compositional representation

Compositional representation

Which subspaces?

Which subspaces? Learning

k-means

k-means

k-means

Orthogonal k-means

Orthogonal k-means

Orthogonal k-means

Iterative Quantization [Gong & Lazebnik, CVPR’11]

Product Quantization [Jegou, Douze, Schmid, PAMI’11]

Cartesian k-means

Cartesian k-means

Cartesian k-means

Learning Cartesian k-means

Learning Cartesian k-means

Learning Cartesian k-means

Learning Cartesian k-means

Learning Cartesian k-means

Learning Cartesian k-means

Learning Cartesian k-means

Learning Cartesian k-means

Cartesian k-means

Cartesian k-means

compositionality

Codebook learning (CIFAR-10)

Codebook learning (CIFAR-10)

Codebook learning (CIFAR-10)

Run-time complexity

Summary

ok-means

ITQ

ck-means

PQ

Thank you for your attention!

top related