检索结果-内蒙古大学图书馆

17th Asian Conference on computer Vision, ACCV 2024

作者： Ye, Weining Li, Zhixuan Jiang, Tingting School of Computer Science Peking University Beijing100871 China College of Computing and Data Science Nanyang Technological University Singapore Singapore National Engineering Research Center of Visual Technology National Key Laboratory for Multimedia Information Processing School of Computer Science National Biomedical Imaging Center Peking University Beijing100871 China

ISBN: (纸本)9789819609680

While the multi-view 3D reconstruction task has made significant progress, existing methods simply fuse multi-view image features without effectively leveraging available auxiliary information, especially the viewpoint information for guiding and associating features of different views. To this end, we propose to enhance multi-view 3D reconstruction with the power of viewpoint information. Specifically, a simple-yet-effective viewpoint estimator is designed to learn and provide comprehensive viewpoint knowledge for locating and associating learned features from different views. Moreover, to improve the 3D reconstruction quality when 2D images of only very few viewpoints are available, we propose to learn the shape prior knowledge to provide sufficient shape information for compensating the limited 2D observations. Overall, we present VIPNet, benefiting from Viewpoint Information and Shape Prior learning for high-quality multi-view 3D reconstruction. Extensive experiments validate the effectiveness of the proposed VIPNet, which achieves state-of-the-art performance on challenging datasets and shows well generalization ability in real-world scenarios. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： 3D modeling

来源：评论

学校读者我要写书评

暂无评论

Boundedly Rational Agents in Sequential Posted Pricing

引用

Journal of Shanghai Jiaotong University (science) 2023年 1-15页

作者： Huang, Wenhan Deng, Xiaotie Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China Center on Frontiers of Computing Studies Peking University Beijing100871 China

We consider the well-studied sequential posted pricing scenarios. In these scenarios, an auctioneer typically learns the value distributions of all agents as prior information and then offers a take-it-or-leave-it price to each sequentially coming agent. If the value distributions are correctly learned, the dominant strategy of each agent is telling the truth. However, an agent could manipulate her value distribution to exploit the auctioneer. We study the behavior of sophisticated agents predicted by two prominent bounded rationality models: the level-fc and the cognitive hierarchy models. We begin with analyzing the structure of the optimal reported distributions and then provide algorithms to compute the optimal distributions for each model. In the continuous scenarios, we show that both models are ill-defined by some examples. Moreover, we evaluate both models in discrete scenarios with different numbers of agents, different minimum units of the values, and different risk tolerances. The empirical results and a brief discussion about the Bayesian Nash equilibrium of the experimental scenarios show that both the level-fc model and the equilibrium suggest the highest possible prices. In contrast, the cognitive hierarchy model suggests low prices. The level-fc model and the equilibrium somehow explain the "winner’s curse" in online markets. The models and the equilibrium fail to explain that the same item could have different prices in different shops. To explain the different-price phenomenon, we suggest trying other bounded rationality models for agents and/or considering the auctioneers with bounded rationality. © 2023, Shanghai Jiao Tong University.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Automated Classification of Inherited Retinal Diseases in Optical Coherence Tomography Images Using Few-shot Learning

引用

Biomedical and Environmental sciences 2023年第5期36卷 431-440页

作者： ZHAO Qi MAI Si Wei LI Qian HUANG Guan Chong GAO Ming Chen YANG Wen Li WANG Ge MA Ya LI Lei PENG Xiao Yan Department of Ophthalmology Beijing Tongren Eye CenterBeijing Tongren HospitalCapital Medical UniversityBeijing Key Laboratory of Ophthalmology and Visual SciencesBeijing 100730China Department of Computer Science RutgersThe State University of New JerseyNew Brunswick 08901USA Department of Computer Science and Engineering University at BuffaloBuffalo 14260USA Beijing Institute of Ophthalmology Beijing Tongren HospitalCapital Medical UniversityBeijing Ophthalmology and Visual Science KeyLaboratoryBeijing 100730China

Objective To develop a few-shot learning(FSL) approach for classifying optical coherence tomography(OCT) images in patients with inherited retinal disorders(IRDs).Methods In this study, an FSL model based on a student–teacher learning framework was designed to classify images. 2,317 images from 189 participants were included. Of these, 1,126 images revealed IRDs, 533 were normal samples, and 658 were control *** The FSL model achieved a total accuracy of 0.974–0.983, total sensitivity of 0.934–0.957, total specificity of 0.984–0.990, and total F1 score of 0.935–0.957, which were superior to the total accuracy of the baseline model of 0.943–0.954, total sensitivity of 0.866–0.886, total specificity of 0.962–0.971,and total F1 score of 0.859–0.885. The performance of most subclassifications also exhibited advantages. Moreover, the FSL model had a higher area under curves(AUC) of the receiver operating characteristic(ROC) curves in most *** This study demonstrates the effective use of the FSL model for the classification of OCT images from patients with IRDs, normal, and control participants with a smaller volume of data. The general principle and similar network architectures can also be applied to other retinal diseases with a low prevalence.

关键词： Few-shot learning Student-teacher learning Knowledge distillation Transfer learning Optical coherence tomography Retinal degeneration Inherited retinal diseases

来源：评论

学校读者我要写书评

暂无评论

GenRec: Unifying Video Generation and Recognition with Diffusion Models 38

GenRec: Unifying Video Generation and Recognition with Diffu...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Weng, Zejia Yang, Xitong Xing, Zhen Wu, Zuxuan Jiang, Yu-Gang Shanghai Key Lab of Intell. Info. Processing School of CS Fudan University China Shanghai Collaborative Innovation Center of Intelligent Visual Computing China Department of Computer Science University of Maryland United States

Video diffusion models are able to generate high-quality videos by learning strong spatial-temporal priors on large-scale datasets. In this paper, we aim to investigate whether such priors derived from a generative process are suitable for video recognition, and eventually joint optimization of generation and recognition. Building upon Stable Video Diffusion, we introduce GenRec, the first unified framework trained with a random-frame conditioning process so as to learn generalized spatial-temporal representations. The resulting framework can naturally supports generation and recognition, and more importantly is robust even when visual inputs contain limited information. Extensive experiments demonstrate the efficacy of GenRec for both recognition and generation. In particular, GenRec achieves competitive recognition performance, offering 75.8% and 87.2% accuracy on SSV2 and K400, respectively. GenRec also performs the best on class-conditioned image-to-video generation, achieving 46.5 and 49.3 FVD scores on SSV2 and EK-100 datasets. Furthermore, GenRec demonstrates extraordinary robustness in scenarios that only limited frames can be observed. Code will be available at https://***/wengzejia1/GenRec. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SCTAP: Supporting Scenario-Centric Trigger-Action Programming based on Software-Defined Physical Environments 23

SCTAP: Supporting Scenario-Centric Trigger-Action Programmin...

引用

2023 World Wide Web Conference, WWW 2023

作者： Sun, Bingkun Shen, Liwei Peng, Xin Wang, Ziming Fudan University China School of Computer Science Shanghai Key Laboratory of Data Science Fudan University China Shanghai Collaborative Innovation Center of Intelligent Visual Computing China

ISBN: (纸本)9781450394161

The physical world we live in is accelerating digitalization with the vigorous development of Internet of Things (IoT). Following this trend, Web of Things (WoT) further enables fast and efficient creation of various applications that perceive and act on the physical world using standard Web technologies. A popular way for creating WoT applications is Trigger-Action Programming (TAP), which allows users to orchestrate the capabilities of IoT devices in the form of "if trigger, then action". However, existing TAP approaches don't support scenario-centric WoT applications which involve abstract modeling of physical environments and complex spatio-temporal dependencies between events and actions. In this paper, we propose an approach called SCTAP which supports Scenario-Centric Trigger-Action Programming based on software-defined physical environments. SCTAP defines a structured and conceptual representation for physical environments, which provides the required programming abstractions for WoT applications. Based on the representation, SCTAP defines a grammar for specifying scenario-centric WoT applications with spatio-temporal dependencies. Furthermore, we design a service-based architecture for SCTAP which supports the integration of device access, event perception, environment representation, and rule execution in a loosely-coupled and extensible way. We implement SCTAP as a WoT infrastructure and evaluate it with two case studies including a smart laboratory and a smart coffee house. The results confirm the usability, feasibility and efficiency of SCTAP and its implementation. © 2023 ACM.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

TPS++: Attention-Enhanced Thin-Plate Spline for Scene Text Recognition 32

TPS++: Attention-Enhanced Thin-Plate Spline for Scene Text R...

引用

32nd International Joint Conference on Artificial Intelligence, IJCAI 2023

作者： Zheng, Tianlun Chen, Zhineng Bai, Jinfeng Xie, Hongtao Jiang, Yu-Gang Shanghai Collaborative Innovation Center of Intelligent Visual Computing School of Computer Science Fudan University China Tomorrow Advance Life China University of Science and Technology of China China

ISBN: (纸本)9781956792034

Text irregularities pose significant challenges to scene text recognizers. Thin-Plate Spline (TPS)based rectification is widely regarded as an effective means to deal with them. Currently, the calculation of TPS transformation parameters purely depends on the quality of regressed text borders. It ignores the text content and often leads to unsatisfactory rectified results for severely distorted text. In this work, we introduce TPS++, an attention-enhanced TPS transformation that incorporates the attention mechanism to text rectification for the first time. TPS++ formulates the parameter calculation as a joint process of foreground control point regression and content-based attention score estimation, which is computed by a dedicated designed gated-attention block. TPS++ builds a more flexible content-aware rectifier, generating a natural text correction that is easier to read by the subsequent recognizer. Moreover, TPS++ shares the feature backbone with the recognizer in part and implements the rectification at feature-level rather than image-level, incurring only a small overhead in terms of parameters and inference time. Experiments on public benchmarks show that TPS++ consistently improves the recognition and achieves state-of-the-art accuracy. Meanwhile, it generalizes well on different backbones and recognizers. Code is at https://***/simplify23/TPS PP. © 2023 International Joint Conferences on Artificial Intelligence. All rights reserved.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

HiHiSpMV: Sparse Matrix Vector Multiplication with Hierarchical Row Reductions on FPGAs with High Bandwidth Memory 32

HiHiSpMV: Sparse Matrix Vector Multiplication with Hierarchi...

引用

32nd IEEE Annual International Symposium on Field-Programmable Custom computing Machines, FCCM 2024

作者： Tareen, Abdul Rehman Meyer, Marius Plessl, Christian Kenter, Tobias Paderborn University Paderborn Center for Parallel Computing Department of Computer Science Warburger Str. 100 Paderborn33098 Germany

ISBN: (纸本)9798350372434

The multiplication of a sparse matrix with a dense vector is a vital operation in linear algebra, with applications in numerous contexts. After earlier research on FPGA acceleration of this operation had shown the potential to achieve a high bandwidth efficiency, this workload has received renewed attention with the introduction of high bandwidth memory on FPGA platforms. However, previous designs fell short of scaling to the full bandwidth potential of current FPGA platforms with high bandwidth memory. In this work, we present HiHiSpMV with a novel design approach around hierarchical accumulation, which allows us to overcome several limitations of the related work. Our design is completely implemented with high-level synthesis and compiled with Vitis, and instantiates 16 independent compute units, each processing up to 16 matrix elements per clock cycle. The reduction of these elements is performed without any latency or resource overhead and the subsequent accumulation uses the well-established shift-register design pattern. Due to the independent nature of compute units, our design can connect to all of the 32 high bandwidth memory pseudo-channels in 512-bit interface mode on an Alveo U280 FPGA board. In our tests, we reach up to 86% of the theoretical available bandwidth of this FPGA platform, enabling a computational throughput of up to 98 GFLOPS. This is about 1.5 × faster than the peak throughput of the best related work in that regard, Serpens. On average, the throughput of HiHiSpMV is even 2.7× higher than Serpens. © 2024 IEEE.

关键词： Shift registers

来源：评论

学校读者我要写书评

暂无评论

On the Scalability of computing Genomic Diversity Using SparkLeBLAST: A Feasibility Study

On the Scalability of Computing Genomic Diversity Using Spar...

引用

2024 IEEE High Performance Extreme computing Conference, HPEC 2024

作者： Prabhu, Ritvik Moussad, Bernard Youssef, Karim Vatai, Emil Feng, Wu-Chun Virginia Tech Department of Computer Science United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States Riken Center for Computational Science Japan

ISBN: (纸本)9798350387131

Studying the genomic diversity of viruses can help us understand how viruses evolve and how that evolution can impact human health. Rather than use a laborious and tedious wet-lab approach to conduct a genomic diversity study, we take a computational approach, using the ubiquitous NCBI BLAST and our parallel and distributed SparkLeBLAST, across 53 patients (40,000,000 query sequences) on Fugaku, the world's fastest homogeneous supercomputer with 158,976 nodes, where each code contains a 48-core A64FX processor and 32 GB RAM. To project how long BLAST and SparkLeBLAST would take to complete a genomic diversity study of COVID-19, we first perform a feasibility study on a subset of 50 query sequences from a single COVID-19 patient to identify bottlenecks in sequence alignment processing. We then create a model using Amdahl's law to project the run times of NCBI BLAST and SparkLeBLAST on supercomputing systems like Fugaku. Based on the data from this 50-sequence feasibility study, our model predicts that NCBI BLAST, when running on all the cores of the Fugaku supercomputer, would take approximately 26.7 years to complete the full-scale study. In contrast, SparkLeBLAST, using both our query and database segmentation, would reduce the execution time to 0.026 years (i.e., 22.9 hours) - resulting in more than a 10,000× speedup over using the ubiquitous NCBI BLAST. © 2024 IEEE.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

science IS EXPLORATION: Computational Frontiers for Conceptual Metaphor Theory

SCIENCE IS EXPLORATION: Computational Frontiers for Conceptu...

引用

2024 Computational Humanities Research Conference, CHR 2024

作者： Hicke, Rebecca M.M. Kristensen-McLachlan, Ross Deans Department of Computer Science Cornell University United States Center for Humanities Computing Aarhus University Denmark Department of Linguistics Cognitive Science and Semiotics Aarhus University Denmark

Metaphors are everywhere. They appear extensively across all domains of natural language, from the most sophisticated poetry to seemingly dry academic prose. A significant body of research in the cognitive science of language argues for the existence of conceptual metaphors, the systematic structuring of one domain of experience in the language of another. Conceptual metaphors are not simply rhetorical flourishes but are crucial evidence of the role of analogical reasoning in human cognition. In this paper, we ask whether Large Language Models (LLMs) can accurately identify and explain the presence of such conceptual metaphors in natural language data. Using a novel prompting technique based on metaphor annotation guidelines, we demonstrate that LLMs are a promising tool for large-scale computational research on conceptual metaphors. Further, we show that LLMs are able to apply procedural guidelines designed for human annotators, displaying a surprising depth of linguistic knowledge. © 2024 Copyright for this paper by its authors.

关键词： Linguistics

来源：评论

学校读者我要写书评

暂无评论

Uncer2Natural: Uncertainty-Aware Unsupervised Image Denoising 48

Uncer2Natural: Uncertainty-Aware Unsupervised Image Denoisin...

引用

48th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2023

作者： Huang, Chenyu Tan, Weimin Shi, Jiaxing Xing, Zhen Yan, Bo Shanghai Collaborative Innovation Center of Intelligent Visual Computing Fudan University School of Computer Science Shanghai Key Laboratory of Intelligent Information Processing Shanghai China

ISBN: (纸本)9781728163277

Recently, unsupervised image denoising methods learning from paired noisy samples have received increasing attention. These methods build on the idea that the mean of multiple noisy images of the same scene is the ideal clean image. However, these methods ignore the effect of Aleatoric uncertainty in the noisy image (e.g., pixels deviating from the expected distribution). The presence of Aleatoric uncertainty causes degradation of the reconstructed target pixels, resulting in high uncertainty for these pixels (i.e., low confidence), which in turn leads to sub-optimal denoising results. To address this problem, we propose a novel uncertainty-aware unsupervised image denoising method named Uncer2Natural (U2N). It dynamically predicts the Aleatoric uncertainty for each noisy sample and produces satisfactory denoising results by reducing the effect of Aleatoric uncertainty. Extensive experimental results show that U2N outperforms state-of-the- art unsupervised image denoising methods in terms of both quantitative metrics and qualitative visual quality. © 2023 IEEE.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：