Zepeda J.Türkan, MehmetThoreau D.2023-06-162023-06-1620159.78E+12https://doi.org/10.1109/EUSIPCO.2015.7362352https://hdl.handle.net/20.500.14365/352523rd European Signal Processing Conference, EUSIPCO 2015 -- 31 August 2015 through 4 September 2015 -- 118897Template matching methods have been shown to offer bit-rate savings of up to 15% when used for in-loop prediction in compression. Yet the required nearest-template search process results in prohibitive complexity. Hence, in this paper we use approximate nearest neighbor search methods to successfully address this drawback of template matching methods. Our approach uses a template index that is updated during the decoding process, yet the incurred overhead pays off in reduced nearest-template search complexity, resulting in a significant gain in template search complexity. Rate-distortion experiments further indicate that there is no rate-distortion penalty resulting from our proposed approximate template search method, and in fact a small gain of 0.1 dB is observed. © 2015 EURASIP.eninfo:eu-repo/semantics/closedAccessapproximate nearest neighborimage compressionindexingintra-codingTemplate matchingElectric distortionImage codingImage compressionImage matchingIndexing (of information)Nearest neighbor searchSignal distortionSignal processingBit-rate savingsDecoding processintra-codingLoop predictionsRate distortionsSearch complexitySearch processTemplate matching methodTemplate matchingConference Object10.1109/EUSIPCO.2015.73623522-s2.0-84963945173