找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Computer Vision -- ECCV 2014; 13th European Confer David Fleet,Tomas Pajdla,Tinne Tuytelaars Conference proceedings 2014 Springer Internati

[复制链接]
楼主: 可入到
发表于 2025-3-23 11:40:45 | 显示全部楼层
发表于 2025-3-23 15:41:10 | 显示全部楼层
The Downfall of Cartesianism 1673–1712ndle curved surfaces. We present a mixture model to combine the benefits of these two kinds of priors, whose energy function consists of two terms 1) a Laplacian operator on the disparity map which imposes pixel-wise second-order smoothness; 2) a segment-wise matching cost as a function of quadratic
发表于 2025-3-23 21:45:08 | 显示全部楼层
https://doi.org/10.1007/978-3-319-52923-3es to the global summation of the locally normalized intensities of the color-biased image. The proposed model has only one free parameter and requires no explicit training with learning-based approach. Experimental results on four commonly used datasets show that our model can produce competitive o
发表于 2025-3-24 01:04:54 | 显示全部楼层
https://doi.org/10.1007/978-3-319-52923-3xisting methods tend to over smooth the image. When applied as post-processing, these are often ineffective at removing the boosted artifacts. To resolve this problem, we propose a framework that suppresses compression artifacts as an integral part of the contrast enhancement procedure. We show that
发表于 2025-3-24 02:26:57 | 显示全部楼层
发表于 2025-3-24 07:44:13 | 显示全部楼层
Rodolfo Novelo-Gutiérrez,Robert W. Sites large improvement both in NIQE score, a measure of statistical similarity between orthogonal cross-sections and the original image sections, as well as in accuracy of neurite segmentation, a critical task for this type of data. Compared to a recent independently-developed gradient-domain algorithm,
发表于 2025-3-24 14:43:30 | 显示全部楼层
发表于 2025-3-24 18:00:33 | 显示全部楼层
发表于 2025-3-24 20:59:18 | 显示全部楼层
发表于 2025-3-24 23:29:08 | 显示全部楼层
https://doi.org/10.1007/978-1-349-19453-7th maximum discriminative power encoded via an affinity-weighted similarity measure based on metrics on the manifold. Learning can then be expressed as an optimization problem on a Grassmann manifold. Our evaluation on several classification tasks shows that our approach leads to a significant accuracy gain over state-of-the-art methods.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-15 01:17
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表