Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "region-matching scheme"
@article{DBLP:journals/js/LeeP22, author = {Min{-}Jae Lee and Soon{-}Yong Park}, title = {Refinement of Inverse Depth Plane in Textureless and Occluded Regions in a Multiview Stereo Matching Scheme}, journal = {J. Sensors}, volume = {2022}, pages = {1--13}, year = {2022}, url = {https://doi.org/10.1155/2022/7181445}, doi = {10.1155/2022/7181445}, timestamp = {Mon, 26 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/js/LeeP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iet-ipr/PradhanKPB20, author = {Jitesh Pradhan and Sumit Kumar and Arup Kumar Pal and Haider Banka}, title = {Texture and colour region separation based image retrieval using probability annular histogram and weighted similarity matching scheme}, journal = {{IET} Image Process.}, volume = {14}, number = {7}, pages = {1303--1315}, year = {2020}, url = {https://doi.org/10.1049/iet-ipr.2018.6619}, doi = {10.1049/IET-IPR.2018.6619}, timestamp = {Tue, 26 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iet-ipr/PradhanKPB20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/hal/Gales11, author = {Guillaume Gales}, title = {Mise en correspondance de pixels pour la st{\'{e}}r{\'{e}}ovision binoculaire par propagation d'appariements de points d'int{\'{e}}r{\^{e}}t et sondage de r{\'{e}}gions. (Pixel matching for binocular stereovision by propagation of feature points matches and region-based randomized voting scheme)}, school = {University of Toulouse, France}, year = {2011}, url = {https://tel.archives-ouvertes.fr/tel-00622859}, timestamp = {Tue, 21 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/hal/Gales11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isvc/GalesCC10, author = {Guillaume Gales and Alain Crouzil and Sylvie Chambon}, editor = {George Bebis and Richard D. Boyle and Bahram Parvin and Darko Koracin and Ronald Chung and Riad I. Hammoud and Muhammad Hussain and Kar{-}Han Tan and Roger Crawfis and Daniel Thalmann and David L. Kao and Lisa Avila}, title = {A Region-Based Randomized Voting Scheme for Stereo Matching}, booktitle = {Advances in Visual Computing - 6th International Symposium, {ISVC} 2010, Las Vegas, NV, USA, November 29 - December 1, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6454}, pages = {182--191}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17274-8\_18}, doi = {10.1007/978-3-642-17274-8\_18}, timestamp = {Thu, 16 Mar 2023 20:00:32 +0100}, biburl = {https://dblp.org/rec/conf/isvc/GalesCC10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/ChenT03, author = {Liang Chen and Naoyuki Tokuda}, title = {Robustness of regional matching scheme over global matching scheme}, journal = {Artif. Intell.}, volume = {144}, number = {1-2}, pages = {213--232}, year = {2003}, url = {https://doi.org/10.1016/S0004-3702(02)00366-1}, doi = {10.1016/S0004-3702(02)00366-1}, timestamp = {Fri, 15 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/ChenT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/cs-CV-0005001, author = {Liang Chen and Naoyuki Tokuda}, title = {Robustness of Regional Matching Scheme over Global Matching Scheme}, journal = {CoRR}, volume = {cs.CV/0005001}, year = {2000}, url = {https://arxiv.org/abs/cs/0005001}, timestamp = {Fri, 15 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/cs-CV-0005001.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.