• No results found

Optimal spectral descriptors

N/A
N/A
Protected

Academic year: 2022

Share "Optimal spectral descriptors"

Copied!
18
0
0

Laster.... (Se fulltekst nå)

Fulltekst

(1)

Optimal spectral descriptors

GenericQ-dimensional spectral descriptor of the form

fτ(x) = X

k≥1

τ1k) ... τQk)

φ2k(x)

| {z }

g(x)

=Ag(x)

parametrized by frequency responsesτ(λ) = (τ1(λ), . . . , τQ(λ))>

represented in some fixed basisβ1(λ), . . . , βM(λ)by anQ×M matrixA

(2)

Optimal spectral descriptors

GenericQ-dimensional spectral descriptor of the form

fA(x) = X

k≥1

A

β1k) ... βMk)

φ2k(x)

| {z }

g(x)

=Ag(x)

parametrized by frequency responsesτ(λ) = (τ1(λ), . . . , τQ(λ))>

represented in some fixed basisβ1(λ), . . . , βM(λ)by anQ×M matrixA

0 0.2 0.4 0.6 0.8 1

(3)

Optimal spectral descriptors

GenericQ-dimensional spectral descriptor of the form

fA(x) = AX

k≥1

β1k) ... βMk)

φ2k(x)

| {z }

g(x)

=Ag(x)

parametrized by linear combination coefficientsAofgeometry vectors g(x) = (g1(x), . . . , gM(x))>

(4)

Optimal spectral descriptors

GenericQ-dimensional spectral descriptor of the form

fA(x) = AX

k≥1

β1k) ... βMk)

φ2k(x)

| {z }

g(x)

=Ag(x)

parametrized by linear combination coefficientsAofgeometry vectors g(x) = (g1(x), . . . , gM(x))>

(5)

Optimal spectral descriptors

GenericQ-dimensional spectral descriptor of the form

fA(x) = AX

k≥1

β1k) ... βMk)

φ2k(x)

| {z }

g(x)

=Ag(x)

parametrized by linear combination coefficientsAofgeometry vectors g(x) = (g1(x), . . . , gM(x))>

Optimal Ain the spirit ofWiener filter:

attenuate frequencies with large noise content (deformation) pass frequencies with large signal content (discriminative geometric features)

Hard to model axiomatically... ...yet easy to learnfrom examples!

(6)

Optimal spectral descriptors

GenericQ-dimensional spectral descriptor of the form

fA(x) = AX

k≥1

β1k) ... βMk)

φ2k(x)

| {z }

g(x)

=Ag(x)

parametrized by linear combination coefficientsAofgeometry vectors g(x) = (g1(x), . . . , gM(x))>

Optimal Ain the spirit ofWiener filter:

attenuate frequencies with large noise content (deformation) pass frequencies with large signal content (discriminative geometric features)

Hard to model axiomatically...

...yet easy to learnfrom examples!

(7)

Optimal spectral descriptors

GenericQ-dimensional spectral descriptor of the form

fA(x) = AX

k≥1

β1k) ... βMk)

φ2k(x)

| {z }

g(x)

=Ag(x)

parametrized by linear combination coefficientsAofgeometry vectors g(x) = (g1(x), . . . , gM(x))>

Optimal Ain the spirit ofWiener filter:

attenuate frequencies with large noise content (deformation) pass frequencies with large signal content (discriminative geometric features)

Hard to model axiomatically...

...yet easy to learnfrom examples!

(8)

Optimal spectral descriptors

Given a set of pointsx, knowingly similar points (positive)x+, and knowingly dissimilar points (negative)x, with respective geometry vectors g,g+,g

Find optimal Aby

min

A:A>A=I

where C±=E(g−g±)(g−g±)> is covariance matrix

(9)

Optimal spectral descriptors

Given a set of pointsx, knowingly similar points (positive)x+, and knowingly dissimilar points (negative)x, with respective geometry vectors g,g+,g

Find optimal Aby minimizing the loss

min

A:A>A=I EγkfA(x)−fA(x+)k2−(1−γ)kfA(x)−fA(x)k2

where C±=E(g−g±)(g−g±)> is covariance matrix

(10)

Optimal spectral descriptors

Given a set of pointsx, knowingly similar points (positive)x+, and knowingly dissimilar points (negative)x, with respective geometry vectors g,g+,g

Find optimal Aby minimizing the loss

min

A:A>A=I EγkAg−Ag+k2−(1−γ)kAg−Agk2

where C±=E(g−g±)(g−g±)> is covariance matrix

(11)

Optimal spectral descriptors

Given a set of pointsx, knowingly similar points (positive)x+, and knowingly dissimilar points (negative)x, with respective geometry vectors g,g+,g

Find optimal Aby minimizing the loss

min

A:A>A=I

trace A(γC+−(1−γ)C)A>

where C±=E(g−g±)(g−g±)> is covariance matrix

(12)

Optimal spectral descriptors

Given a set of pointsx, knowingly similar points (positive)x+, and knowingly dissimilar points (negative)x, with respective geometry vectors g,g+,g

Find optimal AbyMahalanobis metric learning

min

A:A>A=I

trace A(γC+−(1−γ)C)A>

(13)

Optimal spectral descriptor

0 0.005 0.01 0.015 0.02 0.025 0.03 0.035 0.04 0.045 0.05

−0.5 0 0.5 1

Optimal transfer functions learned from positive and negative examples

...

f f f

(14)

Descriptor robustness

Near-isometric deformation

Non-isometric deformation

Topo.

noise Geom.

noise

Uniform subsample

Nonunif.

subsample Missing

parts

Descriptors: Sun, Ovsjanikov, Guibas 2009; Aubry, Schlickewei, Cremers 2011; Litman

(15)

Descriptor robustness

Near-isometric deformation

Non-isometric deformation

Topo.

noise Geom.

noise

Uniform subsample

Nonunif.

subsample Missing

parts

HKS descriptor distance

Descriptors: Sun, Ovsjanikov, Guibas 2009; Aubry, Schlickewei, Cremers 2011; Litman Bronstein 2014; Evaluation: Masci, Boscaini, Bronstein, Vandergheynst 2015; data:

(16)

Descriptor robustness

Near-isometric deformation

Non-isometric deformation

Topo.

noise Geom.

noise

Uniform subsample

Nonunif.

subsample Missing

parts

WKS descriptor distance

Descriptors: Sun, Ovsjanikov, Guibas 2009; Aubry, Schlickewei, Cremers 2011; Litman

(17)

Descriptor robustness

Near-isometric deformation

Non-isometric deformation

Topo.

noise Geom.

noise

Uniform subsample

Nonunif.

subsample Missing

parts

Optimal Spectral descriptor distance

Descriptors: Sun, Ovsjanikov, Guibas 2009; Aubry, Schlickewei, Cremers 2011; Litman Bronstein 2014; Evaluation: Masci, Boscaini, Bronstein, Vandergheynst 2015; data:

(18)

Descriptor performance

CMC

0 20 40 60 80 100 0

0.2 0.4 0.6 0.8 1

number of matches

hitrate

ROC

0.001 0.01 0.1 1

0 0.2 0.4 0.6 0.8 1

false positive rate

truepositiverate

Corr. quality

0 0.1 0.2 0.3

0 0.2 0.4 0.6

geodesic radius

%correctcorrespondences

HKS WKS OSD

Descriptor performance (training and testing: FAUST)

Referanser

RELATERTE DOKUMENTER

The performance evaluation of the SHREC’09- Generic Shape Retrieval Contest is based on 6 different metrics.. Categories and Subject Descriptors (according to ACM CCS) : I.5.4

Since each SIFT descriptor is a low-level feature, the entire set of descriptors extracted from the image collection is divided into a fixed number of clusters with each cluster

Alex Bronstein, Michael Bronstein, Umberto Castellani Spectral methods in shape analysis... Dimensions

In this paper we described a theoretical model for the design of parameter spaces for the analysis of segmented structures in biological image data.. We exemplified our

In this paper, we have presented a sparse representation based framework to integrate local shape descriptors into a global shape descriptor for non-rigid 3D shape retrieval. The

It is based on a combination of a single view 3D shape descriptor and a temporal descriptor (initially used to accumulate appearance descriptors of an object over time) that

This paper introduces an enhanced 3D object retrieval technique using a compact and highly discriminative feature point descriptor.. The key idea is based on integrating Bag of

The first is based on the local curvature of the hand contour, while the second represents the thickness of the hand region close to each contour point using a distance transform..