Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates

DOI10.1007/s10852-009-9109-1zbMath1184.68248OpenAlexW2106233376MaRDI QIDQ846172

Karin Oberlechner, Andreas M. Chwatal, Günther R. Raidl

Publication date: 1 February 2010

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-009-9109-1

zbMATH Keywords

combinatorial optimizationmetaheuristicsGRASPmemetic algorithmbiometric template compressionfingerprint minutiaeunordered data set compression

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Pattern recognition, speech recognition (68T10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (3)

Solving the minimum label spanning tree problem by mathematical programming techniques ⋮ A hybrid metaheuristic for the minimum labeling spanning tree problem ⋮ A polyhedral approach to the generalized minimum labeling spanning tree problem

Uses Software

• LEDA
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On implementing the push-relabel method for the maximum flow problem
• The minimum labeling spanning trees
• On the minimum label spanning tree problem
• Greedy randomized adaptive search procedures
• Approximation schemes for covering and packing problems in image processing and VLSI
• Design and analysis of dynamic Huffman codes
• Multidimensional binary search trees used for associative searching
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Handbook of Fingerprint Recognition
• Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem

This page was built for publication: Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates