Robustness of regional matching scheme over global matching scheme

DOI10.1016/S0004-3702(02)00366-1MaRDI QIDQ814437zbMATH OpenOpenAlexFDO

Authors Liang Chen, Naoyuki Tokuda

Publication date 7 February 2006

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0004-3702(02)00366-1

zbMATH Keywords

Decision makingGlobal matchingNoisePattern recognitionRegional matchingStabilityVoting

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies for image processing (68U10) Voting theory (91B12)

Recommendations

• scientific article; zbMATH DE number 1166376
• Robustness instead of accuracy should be the primary objective for subjective pattern recognition research: stability analysis on multicandidate electoral college versus direct popular vote
• Robust computer vision. Theory and applications.
• Comparing robustness of pairwise and multiclass neural-network systems for face recognition
• Computational Science – ICCS 2005

Cites work

• Approximation schemes for covering and packing problems in image processing and VLSI
• scientific article; zbMATH DE number 49909 (Why is no real title available?)
• scientific article; zbMATH DE number 108366 (Why is no real title available?)
• Principal component analysis.

Cited in

(2)

• A general stability analysis on regional and national voting schemes against noise -- why is an electoral college more stable than a direct popular election?
• Robustness instead of accuracy should be the primary objective for subjective pattern recognition research: stability analysis on multicandidate electoral college versus direct popular vote

This page was built for publication: Robustness of regional matching scheme over global matching scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814437)