Optimal fitting polynomial for linear time bilateral filters
文献类型：期刊论文
| 作者 | Dai, Longquan ; Yuan, Mengke; Zhang, Xiaopeng
|
| 刊名 | ELECTRONICS LETTERS
 |
| 出版日期 | 2015-08-06 |
| 卷号 | 51期号:16页码:1249-1250 |
| 英文摘要 | The bilateral filter (BF) has showed great effectiveness for a variety of problems. However, its brute-force implementation is time consuming. One way of accelerating a BF is to approximate the nonlinear range kernel of the BF by a set of linear time shiftable kernels. To achieve this goal, only finite values of the kernel of the BF have been used to perform smoothing due to the quantisation of digital images. Thus, the filtering results are not changed by substituting the range kernel with the function having the same values at finite discrete points. The Lagrange interpolation polynomial can exactly pass through predefined points and therefore can be employed to replace original kernels for accurate by accelerating the BF. To speed up the BF at the cost of small approximation error, two approximation methods are proposed to obtain the optimal fitting polynomial. The performance of the proposed method is validated by extensive experiments. |
| WOS标题词 | Science & Technology ; Technology |
| 类目[WOS] | Engineering, Electrical & Electronic |
| 研究领域[WOS] | Engineering |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000359811900018 |
| 源URL | [http://ir.ia.ac.cn/handle/173211/8961]  |
| 专题 | 自动化研究所_模式识别国家重点实验室_多媒体计算与图形学团队 |
| 作者单位 | Chinese Acad Sci, Inst Automat, NLPR, Beijing, Peoples R China |
| 推荐引用方式 GB/T 7714 | Dai, Longquan,Yuan, Mengke,Zhang, Xiaopeng. Optimal fitting polynomial for linear time bilateral filters[J]. ELECTRONICS LETTERS,2015,51(16):1249-1250. |
| APA | Dai, Longquan,Yuan, Mengke,&Zhang, Xiaopeng.(2015).Optimal fitting polynomial for linear time bilateral filters.ELECTRONICS LETTERS,51(16),1249-1250. |
| MLA | Dai, Longquan,et al."Optimal fitting polynomial for linear time bilateral filters".ELECTRONICS LETTERS 51.16(2015):1249-1250. |
入库方式： OAI收割
来源：自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。