We apply our sparse correspondences algorithm on several examples (see Fig. 10), and compare to NBB [1]. Our method is more robust to changes in pose, scale, appearance and non-rigid deformations.
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
| NBB | Ours | |||
|---|---|---|---|---|
![]() |
![]() |
![]() |
![]() |
|
[1] Neural Best Buddies: Sparse Cross-Domain Correspondences. Aberman et al. TOG 2018