Clustering-based methods for fast epitome generation. Alain, M., Guillemot, C., Thoreau, D., & Guillotel, P. In 2014 22nd European Signal Processing Conference (EUSIPCO), pages 211-215, Sep., 2014.
Paper abstract bibtex This paper deals with epitome generation, mainly dedicated here to image coding applications. Existing approaches are known to be memory and time consuming due to exhaustive self-similarities search within the image for each non-overlapping block. We propose here a novel approach for epitome construction that first groups close patches together. In a second time the self-similarities search is performed for each group. By limiting the number of exhaustive searches we limit the memory occupation and the processing time. Results show that interesting complexity reduction can be achieved while keeping a good epitome quality (down to 18.08 % of the original memory occupation and 41.39%of the original processing time).
@InProceedings{6952021,
author = {M. Alain and C. Guillemot and D. Thoreau and P. Guillotel},
booktitle = {2014 22nd European Signal Processing Conference (EUSIPCO)},
title = {Clustering-based methods for fast epitome generation},
year = {2014},
pages = {211-215},
abstract = {This paper deals with epitome generation, mainly dedicated here to image coding applications. Existing approaches are known to be memory and time consuming due to exhaustive self-similarities search within the image for each non-overlapping block. We propose here a novel approach for epitome construction that first groups close patches together. In a second time the self-similarities search is performed for each group. By limiting the number of exhaustive searches we limit the memory occupation and the processing time. Results show that interesting complexity reduction can be achieved while keeping a good epitome quality (down to 18.08 % of the original memory occupation and 41.39%of the original processing time).},
keywords = {image coding;pattern clustering;clustering-based methods;fast epitome generation;image coding;exhaustive self-similarity search;memory occupation;complexity reduction;nonoverlapping block;epitome construction;Image reconstruction;Complexity theory;Bismuth;PSNR;Image coding;Approximation methods;Cities and towns;Epitome;clustering;image coding},
issn = {2076-1465},
month = {Sep.},
url = {https://www.eurasip.org/proceedings/eusipco/eusipco2014/html/papers/1569926207.pdf},
}
Downloads: 0
{"_id":"oqwMiyw35aoBysuRR","bibbaseid":"alain-guillemot-thoreau-guillotel-clusteringbasedmethodsforfastepitomegeneration-2014","authorIDs":[],"author_short":["Alain, M.","Guillemot, C.","Thoreau, D.","Guillotel, P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["M."],"propositions":[],"lastnames":["Alain"],"suffixes":[]},{"firstnames":["C."],"propositions":[],"lastnames":["Guillemot"],"suffixes":[]},{"firstnames":["D."],"propositions":[],"lastnames":["Thoreau"],"suffixes":[]},{"firstnames":["P."],"propositions":[],"lastnames":["Guillotel"],"suffixes":[]}],"booktitle":"2014 22nd European Signal Processing Conference (EUSIPCO)","title":"Clustering-based methods for fast epitome generation","year":"2014","pages":"211-215","abstract":"This paper deals with epitome generation, mainly dedicated here to image coding applications. Existing approaches are known to be memory and time consuming due to exhaustive self-similarities search within the image for each non-overlapping block. We propose here a novel approach for epitome construction that first groups close patches together. In a second time the self-similarities search is performed for each group. By limiting the number of exhaustive searches we limit the memory occupation and the processing time. Results show that interesting complexity reduction can be achieved while keeping a good epitome quality (down to 18.08 % of the original memory occupation and 41.39%of the original processing time).","keywords":"image coding;pattern clustering;clustering-based methods;fast epitome generation;image coding;exhaustive self-similarity search;memory occupation;complexity reduction;nonoverlapping block;epitome construction;Image reconstruction;Complexity theory;Bismuth;PSNR;Image coding;Approximation methods;Cities and towns;Epitome;clustering;image coding","issn":"2076-1465","month":"Sep.","url":"https://www.eurasip.org/proceedings/eusipco/eusipco2014/html/papers/1569926207.pdf","bibtex":"@InProceedings{6952021,\n author = {M. Alain and C. Guillemot and D. Thoreau and P. Guillotel},\n booktitle = {2014 22nd European Signal Processing Conference (EUSIPCO)},\n title = {Clustering-based methods for fast epitome generation},\n year = {2014},\n pages = {211-215},\n abstract = {This paper deals with epitome generation, mainly dedicated here to image coding applications. Existing approaches are known to be memory and time consuming due to exhaustive self-similarities search within the image for each non-overlapping block. We propose here a novel approach for epitome construction that first groups close patches together. In a second time the self-similarities search is performed for each group. By limiting the number of exhaustive searches we limit the memory occupation and the processing time. Results show that interesting complexity reduction can be achieved while keeping a good epitome quality (down to 18.08 % of the original memory occupation and 41.39%of the original processing time).},\n keywords = {image coding;pattern clustering;clustering-based methods;fast epitome generation;image coding;exhaustive self-similarity search;memory occupation;complexity reduction;nonoverlapping block;epitome construction;Image reconstruction;Complexity theory;Bismuth;PSNR;Image coding;Approximation methods;Cities and towns;Epitome;clustering;image coding},\n issn = {2076-1465},\n month = {Sep.},\n url = {https://www.eurasip.org/proceedings/eusipco/eusipco2014/html/papers/1569926207.pdf},\n}\n\n","author_short":["Alain, M.","Guillemot, C.","Thoreau, D.","Guillotel, P."],"key":"6952021","id":"6952021","bibbaseid":"alain-guillemot-thoreau-guillotel-clusteringbasedmethodsforfastepitomegeneration-2014","role":"author","urls":{"Paper":"https://www.eurasip.org/proceedings/eusipco/eusipco2014/html/papers/1569926207.pdf"},"keyword":["image coding;pattern clustering;clustering-based methods;fast epitome generation;image coding;exhaustive self-similarity search;memory occupation;complexity reduction;nonoverlapping block;epitome construction;Image reconstruction;Complexity theory;Bismuth;PSNR;Image coding;Approximation methods;Cities and towns;Epitome;clustering;image coding"],"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/Roznn/EUSIPCO/main/eusipco2014url.bib","creationDate":"2021-02-13T17:43:41.584Z","downloads":0,"keywords":["image coding;pattern clustering;clustering-based methods;fast epitome generation;image coding;exhaustive self-similarity search;memory occupation;complexity reduction;nonoverlapping block;epitome construction;image reconstruction;complexity theory;bismuth;psnr;image coding;approximation methods;cities and towns;epitome;clustering;image coding"],"search_terms":["clustering","based","methods","fast","epitome","generation","alain","guillemot","thoreau","guillotel"],"title":"Clustering-based methods for fast epitome generation","year":2014,"dataSources":["A2ezyFL6GG6na7bbs","oZFG3eQZPXnykPgnE"]}