@incollection{furht_block_2008,
	title = {Block {Matching}},
	copyright = {©2008 Springer-Verlag},
	isbn = {978-0-387-74724-8 978-0-387-78414-4},
	url = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_132},
	abstract = {DefinitionBlock matching is the most widely used method for disparity estimation in stereo coding algorithms.Disparity/depth estimation is an important key step in many stereo coding algorithms, since it can be used to de-correlate information obtained from a stereo pair. In the predictive coding framework (consisting of disparity estimation/compensation, transform/quantization, and entropy coding), the redundancy is reduced by compensating the target image from the reference image with the disparity vectors.Block matching is the most widely used method for disparity estimation and is simple and effective to implement. The basic idea of block matching is to segment the target image into fixed size blocks and find for each block the corresponding block that provides the best match from the reference image. In general, the block minimizing the estimation error is usually selected as the matching block. However, block matching with a simple error measure may not yield smooth dis ...},
	language = {en},
	urldate = {2016-05-03},
	booktitle = {Encyclopedia of {Multimedia}},
	publisher = {Springer US},
	editor = {Furht, Borko},
	year = {2008},
	note = {00000},
	pages = {55--56}
}

{"_id":"hEN5mPTtcNDbCxHHP","bibbaseid":"furht-blockmatching-2008","authorIDs":[],"bibdata":{"bibtype":"incollection","type":"incollection","title":"Block Matching","copyright":"©2008 Springer-Verlag","isbn":"978-0-387-74724-8 978-0-387-78414-4","url":"http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_132","abstract":"DefinitionBlock matching is the most widely used method for disparity estimation in stereo coding algorithms.Disparity/depth estimation is an important key step in many stereo coding algorithms, since it can be used to de-correlate information obtained from a stereo pair. In the predictive coding framework (consisting of disparity estimation/compensation, transform/quantization, and entropy coding), the redundancy is reduced by compensating the target image from the reference image with the disparity vectors.Block matching is the most widely used method for disparity estimation and is simple and effective to implement. The basic idea of block matching is to segment the target image into fixed size blocks and find for each block the corresponding block that provides the best match from the reference image. In general, the block minimizing the estimation error is usually selected as the matching block. However, block matching with a simple error measure may not yield smooth dis ...","language":"en","urldate":"2016-05-03","booktitle":"Encyclopedia of Multimedia","publisher":"Springer US","editor":[{"propositions":[],"lastnames":["Furht"],"firstnames":["Borko"],"suffixes":[]}],"year":"2008","note":"00000","pages":"55–56","bibtex":"@incollection{furht_block_2008,\n\ttitle = {Block {Matching}},\n\tcopyright = {©2008 Springer-Verlag},\n\tisbn = {978-0-387-74724-8 978-0-387-78414-4},\n\turl = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_132},\n\tabstract = {DefinitionBlock matching is the most widely used method for disparity estimation in stereo coding algorithms.Disparity/depth estimation is an important key step in many stereo coding algorithms, since it can be used to de-correlate information obtained from a stereo pair. In the predictive coding framework (consisting of disparity estimation/compensation, transform/quantization, and entropy coding), the redundancy is reduced by compensating the target image from the reference image with the disparity vectors.Block matching is the most widely used method for disparity estimation and is simple and effective to implement. The basic idea of block matching is to segment the target image into fixed size blocks and find for each block the corresponding block that provides the best match from the reference image. In general, the block minimizing the estimation error is usually selected as the matching block. However, block matching with a simple error measure may not yield smooth dis ...},\n\tlanguage = {en},\n\turldate = {2016-05-03},\n\tbooktitle = {Encyclopedia of {Multimedia}},\n\tpublisher = {Springer US},\n\teditor = {Furht, Borko},\n\tyear = {2008},\n\tnote = {00000},\n\tpages = {55--56}\n}\n\n","editor_short":["Furht, B."],"key":"furht_block_2008","id":"furht_block_2008","bibbaseid":"furht-blockmatching-2008","role":"editor","urls":{"Paper":"http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_132"},"downloads":0,"html":""},"bibtype":"incollection","biburl":"http://www.telemidia.puc-rio.br/~alan/files/all.bib","creationDate":"2020-03-03T14:08:14.133Z","downloads":0,"keywords":[],"search_terms":["block","matching"],"title":"Block Matching","year":2008,"dataSources":["jAxurbvLP8q5LTdLa"]}