Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Minimax rates in permutation estimation for feature matching

From MaRDI portal
Publication:2810764
Jump to:navigation, search

zbMath1360.62262arXiv1310.4661MaRDI QIDQ2810764

Arnak S. Dalalyan, Olivier Collier

Publication date: 6 June 2016

Full work available at URL: https://arxiv.org/abs/1310.4661


zbMATH Keywords

feature matchingminimax rate of separationpermutation estimation


Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Integer programming (90C10) Pattern recognition, speech recognition (68T10)


Related Items (10)

Isotonic regression with unknown permutations: statistics, computation and adaptation ⋮ Iterative algorithm for discrete structure recovery ⋮ Optimal full ranking from pairwise comparisons ⋮ Optimal Permutation Recovery in Permuted Monotone Matrix Model ⋮ Optimality of the Least Sum of Logarithms in the Problem of Matching Map Recovery in the Presence of Noise and Outliers ⋮ Estimation of Monge matrices ⋮ Linear regression with sparsely permuted data ⋮ Optimal rates of statistical seriation ⋮ Towards optimal estimation of bivariate isotonic matrices with unknown permutations ⋮ Optimal detection of the feature matching map in presence of noise and outliers


Uses Software

  • SeDuMi
  • SIFT
  • SURF



This page was built for publication: Minimax rates in permutation estimation for feature matching

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2810764&oldid=15718659"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 18:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki