IEEE Transactions on Acoustics Speech and Signal Processing · 1989 · 19 citations · 3 references
ComputingComputer ScienceAlgorithmsAuthenticationData StructuresCoding TheoryData CompressionError-correcting CodesLossy Data CompressionPattern RecognitionSource CodingBinary CodesBlock CodingCodingCompression AlgorithmsEncoding AlgorithmsLinear PredictionSparse CodingSparse Representation Compression
An efficient method is presented for encoding sparse binary patterns. This method is very simple to implement and performs in a near-optimum way. The sparse pattern is assumed to be a memoryless binary source. This kind of pattern is found in a three-dimensional authentication scheme. In the data compression area, the patterns are usually not memoryless sources. However, when LPC (linear prediction coding) is applied, the resulting error pattern is very close to a memoryless model.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
3