{"id":15627656,"url":"https://github.com/ufoym/recursive-bf","last_synced_at":"2025-04-07T15:07:34.971Z","repository":{"id":45769966,"uuid":"91296015","full_name":"ufoym/recursive-bf","owner":"ufoym","description":"A lightweight C++ library for recursive bilateral filtering [Yang, Qingxiong. \"Recursive bilateral filtering\". European Conference on Computer Vision, 2012].","archived":false,"fork":false,"pushed_at":"2021-12-04T03:38:03.000Z","size":154,"stargazers_count":347,"open_issues_count":2,"forks_count":57,"subscribers_count":17,"default_branch":"master","last_synced_at":"2024-10-29T22:43:40.556Z","etag":null,"topics":["bilateral-filter","computer-vision","image-processing"],"latest_commit_sha":null,"homepage":"http://ufoym.com/recursive-bf","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ufoym.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2017-05-15T04:45:06.000Z","updated_at":"2024-09-29T18:33:00.000Z","dependencies_parsed_at":"2022-08-30T23:22:02.348Z","dependency_job_id":null,"html_url":"https://github.com/ufoym/recursive-bf","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ufoym%2Frecursive-bf","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ufoym%2Frecursive-bf/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ufoym%2Frecursive-bf/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ufoym%2Frecursive-bf/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ufoym","download_url":"https://codeload.github.com/ufoym/recursive-bf/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247358435,"owners_count":20926219,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["bilateral-filter","computer-vision","image-processing"],"created_at":"2024-10-03T10:18:30.726Z","updated_at":"2025-04-07T15:07:34.945Z","avatar_url":"https://github.com/ufoym.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"Recursive bilateral filtering (developed by Qingxiong Yang) is pretty fast compared with most edge-preserving filtering methods\n- computational complexity is linear in both input size and dimensionality:\n- takes about 43 ms to process a one megapixel color image (i7 1.8GHz \u0026 4GB mem)\n- about 18x faster than *Fast high-dimensional filtering using the permutohedral lattice*\n- about 86x faster than *Gaussian kd-trees for fast high-dimensional filtering*\n\n## Results\n\u003ctable\u003e\n\u003ctr\u003e\n\u003ctd\u003e\u003cimg src=\"https://cloud.githubusercontent.com/assets/2270240/26041579/7d7c034e-3960-11e7-9549-912685043e39.jpg\" width=\"300px\"\u003e\u003cbr/\u003e\u003cp align=\"center\"\u003eOriginal Image\u003c/p\u003e\u003c/td\u003e\n\u003ctd\u003e\u003cimg src=\"https://cloud.githubusercontent.com/assets/2270240/26041586/8b4afb42-3960-11e7-9bd8-62bbb924f1e9.jpg\" width=\"300px\"\u003e\u003cbr/\u003e\u003cp align=\"center\"\u003eOpenCV's BF (896ms)\u003c/p\u003e\u003c/td\u003e\n\u003ctd\u003e\u003cimg src=\"https://cloud.githubusercontent.com/assets/2270240/26041590/8d08c16c-3960-11e7-8a0c-95a77d6d9085.jpg\" width=\"300px\"\u003e\u003cbr/\u003e\u003cp align=\"center\"\u003eRecursiveBF (18ms)\u003c/p\u003e\u003c/td\u003e\n\u003c/tr\u003e\n\u003ctr\u003e\n\u003ctd\u003e\u003c/td\u003e\n\u003ctd\u003e\u003cimg src=\"https://cloud.githubusercontent.com/assets/2270240/26041583/86ea7b22-3960-11e7-8ded-5109b76966ca.jpg\" width=\"300px\"\u003e\u003cbr/\u003e\u003cp align=\"center\"\u003eGaussian Blur\u003c/p\u003e\u003c/td\u003e\n\u003ctd\u003e\u003cimg src=\"https://cloud.githubusercontent.com/assets/2270240/26041584/88dfc9b4-3960-11e7-8c9d-2634eac098d0.jpg\" width=\"300px\"\u003e\u003cbr/\u003e\u003cp align=\"center\"\u003eMedian Blur\u003c/p\u003e\u003c/td\u003e\n\u003c/tr\u003e\u003c/table\u003e\n\nFor more details of the algorithm, please refer to the original paper\n\n    @inproceedings{yang2012recursive,\n        title={Recursive bilateral filtering},\n        author={Yang, Qingxiong},\n        booktitle={European Conference on Computer Vision},\n        pages={399--413},\n        year={2012},\n        organization={Springer}\n    }\n\nOptionally, you can cite this repo\n\n    @misc{ming2017recursive,\n        author = {Ming Yang},\n        title = {A lightweight C++ library for recursive bilateral filtering},\n        year = {2017},\n        publisher = {GitHub},\n        journal = {GitHub repository},\n        howpublished = {\\url{https://github.com/ufoym/RecursiveBF}}\n    }\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fufoym%2Frecursive-bf","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fufoym%2Frecursive-bf","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fufoym%2Frecursive-bf/lists"}