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

Robust recovery of eigenimages in the presence of outliers and occlusions

Journal of Computing and Information Technology 1996年第1期4卷 25-38页

作者： Leonardis, Aleš Bischof, Horst Department for Pattern Recognition and Image Processing Technical University Vienna Treitlstraße 3/1832 ViennaA-1040 Austria Computer Vision Laboratory Faculty of Computer and Information Science University of Ljubljana Tržaška 25 Ljubljana1000 Slovenia

The basic limitations of the current appearance-based matching methods using eigenimages are non-robust estimation of coefficients and inability to cope with problems related to occlusions and segmentation. In this paper we present a new approach which successfully solves these problems. The major novelty of our approach lies in the way how the coefficients of the eigenimages are determined. Instead of computing the coefficients by a projection of the data onto the eigenimages. we extract them by a hvpothesize-and-test paradigm using subsets of image points. Competing hypotheses arc then subject to a selection procedure based on the Minimum Description Length principle. The approach enables us not only lo reject outliers and to deal with occlusions but also to simultaneously use multiple classes of eigenimages.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Locating high-density clusters with noisy queries

Locating high-density clusters with noisy queries

引用

International Conference on pattern recognition

作者： Chen Cao Shifeng Chen Changqing Zou Jianzhuang Liu Shenzhen Key Laboratory for Computer Vision and Pattern Recognition Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China Department of Information Engineering Chinese University of Hong Kong China

ISBN: (纸本)9781467322164

Semi-supervised learning (SSL) relies on a few labeled samples to explore data's intrinsic structure through pairwise smooth transduction. The performance of SSL mainly depends on two folds: (1) the accuracy of labeled queries, (2) the integrity of manifolds in data distribution. Both of these qualities would be poor in real applications as data often consist of several irrelevant clusters and discrete noise. In this paper we propose a novel framework to simultaneously remove discrete noise and locate the high-density clusters. Experiments demonstrate that our algorithm is quite effective to solve several problems such as non-feedback image re-ranking and image co-segmentation.

关键词： Noise Noise measurement Clustering algorithms Databases Vectors Manifolds Semisupervised learning

来源：评论

学校读者我要写书评

暂无评论

Zero-Shot Video Restoration and Enhancement Using Pre-Trained Image Diffusion Model

arXiv

引用

arXiv 2024年

作者： Cao, Cong Yue, Huanjing Liu, Xin Yang, Jingyu School of Electrical and Information Engineering Tianjin University Tianjin China Computer Vision and Pattern Recognition Laboratory School of Engineering Science Lappeenranta-Lahti University of Technology LUT Lappeenranta Finland

Diffusion-based zero-shot image restoration and enhancement models have achieved great success in various tasks of image restoration and enhancement. However, directly applying them to video restoration and enhancement results in severe temporal flickering artifacts. In this paper, we propose the first framework for zero-shot video restoration and enhancement based on the pre-trained image diffusion model. By replacing the spatial self-attention layer with the proposed short-long-range (SLR) temporal attention layer, the pre-trained image diffusion model can take advantage of the temporal correlation between frames. We further propose temporal consistency guidance, spatial-temporal noise sharing, and an early stopping sampling strategy to improve temporally consistent sampling. Our method is a plug-and-play module that can be inserted into any diffusion-based image restoration or enhancement methods to further improve their performance. Experimental results demonstrate the superiority of our proposed method. Copyright © 2024, The Authors. All rights reserved.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

Learning to avoid poor images: Towards task-aware C-arm cone-beam CT trajectories

arXiv

引用

arXiv 2019年

作者： Zaech, Jan-Nico Gao, Cong Bier, Bastian Taylor, Russell Maier, Andreas Navab, Nassir Unberath, Mathias Laboratory for Computational Sensing and Robotics Johns Hopkins University Pattern Recognition Lab Friedrich-Alexander-Universität Erlangen-Nürnberg Computer Vision Laboratory Eidgenössische Technische Hochschule Zürich

Metal artifacts in computed tomography (CT) arise from a mismatch between physics of image formation and idealized assumptions during tomographic reconstruction. These artifacts are particularly strong around metal implants, inhibiting widespread adoption of 3D cone-beam CT (CBCT) despite clear opportunity for intra-operative verification of implant positioning, e. g. in spinal fusion surgery. On synthetic and real data, we demonstrate that much of the artifact can be avoided by acquiring better data for reconstruction in a task-aware and patient-specific manner, and describe the first step towards the envisioned task-aware CBCT protocol. The traditional short-scan CBCT trajectory is planar, with little room for scene-specific adjustment. We extend this trajectory by autonomously adjusting out-of-plane angulation. This enables C-arm source trajectories that are scene-specific in that they avoid acquiring"poor images", characterized by beam hardening, photon starvation, and noise. The recommendation of ideal out-of-plane angulation is performed on-the-fly using a deep convolutional neural network that regresses a detectability-rank derived from imaging physics. Copyright © 2019, The Authors. All rights reserved.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Motion constraint patterns

Motion constraint patterns

引用

IEEE Workshop on Qualitative vision

作者： C. Fermuller Department for Pattern Recognition and Image Processing Institute for Automation Technical University of of Vienna Vienna Austria Computer Vision Laboratory Center for Automation Research University of Maryland College Park MD USA

The problem of egomotion recovery has been treated by using as input local image motion, with the published algorithms utilizing the geometric constraint relating 2-D local image motion (optical flow, correspondence, derivatives of the image flow) to 3-D motion and structure. Since it has proved very difficult to achieve accurate input (local image motion), a lot of effort has been devoted to the development of robust techniques. A new approach to the problem of egomotion estimation is taken, based on constraints of a global nature. It is proved that local normal flow measurements form global patterns in the image plane. The position of these patterns is related to the three dimensional motion parameters. By locating some of these patterns, which depend only on subsets of the motion parameters, through a simple search technique, the 3-D motion parameters can be found. The proposed algorithmic procedure is very robust, since it is not affected by small perturbations in the normal flow measurements. As a matter of fact, since only the sign of the normal flow measurement is employed, the direction of translation and the axis of rotation can be estimated with up to 100% error in the image measurements.< >

关键词： Motion estimation computer vision Automation Image motion analysis Fluid flow measurement Motion measurement Rotation measurement Laboratories Educational institutions Geometrical optics

来源：评论

学校读者我要写书评

暂无评论

Box-driven Class-wise Region Masking and Filling Rate Guided Loss for Weakly Supervised Semantic Segmentation

Box-driven Class-wise Region Masking and Filling Rate Guided...

引用

IEEE/CVF Conference on computer vision and pattern recognition

作者： Chunfeng Song Yan Huang Wanli Ouyang Liang Wang Center for Research on Intelligent Perception and Computing (CRIPAC) National Laboratory of Pattern Recognition (NLPR) Institute of Automation Chinese Academy of Sciences (CASIA) The University of Sydney SenseTime Computer Vision Research Group

ISBN: (纸本)9781728132945

Semantic segmentation has achieved huge progress via adopting deep Fully Convolutional Networks (FCN). However, the performance of FCN based models severely rely on the amounts of pixel-level annotations which are expensive and time-consuming. To address this problem, it is a good choice to learn to segment with weak supervision from bounding boxes. How to make full use of the class-level and region-level supervisions from bounding boxes is the critical challenge for the weakly supervised learning task. In this paper, we first introduce a box-driven class-wise masking model (BCM) to remove irrelevant regions of each class. Moreover, based on the pixel-level segment proposal generated from the bounding box supervision, we could calculate the mean filling rates of each class to serve as an important prior cue, then we propose a filling rate guided adaptive loss (FR-Loss) to help the model ignore the wrongly labeled pixels in proposals. Unlike previous methods directly training models with the fixed individual segment proposals, our method can adjust the model learning with global statistical information. Thus it can help reduce the negative impacts from wrongly labeled proposals. We evaluate the proposed method on the challenging PASCAL VOC 2012 benchmark and compare with other methods. Extensive experimental results show that the proposed method is effective and achieves the state-of-the-art results.

关键词： bounding boxes filling rate Masking Semantics Supervision Regulated industries

来源：评论

学校读者我要写书评

暂无评论

Towards Accurate Scene Text recognition With Semantic Reasoning Networks

Towards Accurate Scene Text Recognition With Semantic Reason...

引用

Conference on computer vision and pattern recognition (CVPR)

作者： Deli Yu Xuan Li Chengquan Zhang Tao Liu Junyu Han Jingtuo Liu Errui Ding School of Artificial Intelligence University of Chinese Academy of Sciences National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Department of Computer Vision Technology(VIS) Baidu Inc.

ISBN: (数字)9781728171685

ISBN: (纸本)9781728171692

Scene text image contains two levels of contents: visual texture and semantic information. Although the previous scene text recognition methods have made great progress over the past few years, the research on mining semantic information to assist text recognition attracts less attention, only RNN-like structures are explored to implicitly model semantic information. However, we observe that RNN based methods have some obvious shortcomings, such as time-dependent decoding manner and one-way serial transmission of semantic context, which greatly limit the help of semantic information and the computation efficiency. To mitigate these limitations, we propose a novel end-to-end trainable framework named semantic reasoning network (SRN) for accurate scene text recognition, where a global semantic reasoning module (GSRM) is introduced to capture global semantic context through multi-way parallel transmission. The state-of-the-art results on 7 public benchmarks, including regular text, irregular text and non-Latin long text, verify the effectiveness and robustness of the proposed method. In addition, the speed of SRN has significant advantages over the RNN based methods, demonstrating its value in practical use.

关键词： Semantics Visualization Text recognition Cognition Feature extraction Decoding Robustness

来源：评论

学校读者我要写书评

暂无评论

Learning to predict context-adaptive convolution for semantic segmentation

arXiv

引用

arXiv 2020年

作者： Liu, Jianbo He, Junjun Ren, Jimmy S. Qiao, Yu Li, Hongsheng CUHK-SenseTime Joint Laboratory Chinese University of Hong Kong Shenzhen Key Lab of Computer Vision and Pattern Recognition Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences SenseTime Research

Long-range contextual information is essential for achieving high-performance semantic segmentation. Previous feature re-weighting methods [34] demonstrate that using global context for re-weighting feature channels can effectively improve the accuracy of semantic segmentation. However, the globally-sharing feature re-weighting vector might not be optimal for regions of different classes in the input image. In this paper, we propose a Context-adaptive Convolution Network (CaC-Net) to predict a spatially-varying feature weighting vector for each spatial location of the semantic feature maps. In CaC-Net, a set of context-adaptive convolution kernels are predicted from the global contextual information in a parameter-efficient manner. When used for convolution with the semantic feature maps, the predicted convolutional kernels can generate the spatially-varying feature weighting factors capturing both global and local contextual information. Comprehensive experimental results show that our CaC-Net achieves superior segmentation performance on three public datasets, PASCAL Context, PASCAL VOC 2012 and ADE20K. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Co-Clustering Image Features and Semantic Concepts

Co-Clustering Image Features and Semantic Concepts

引用

IEEE International Conference on Image Processing

作者： Manjeet Rege Ming Dong Farshad Fotouhi Department of Computer Science Machine Vision & Pattern Recognition Laboratory Wayne State University Detroit MI USA Database & Multimedia Systems Group Wayne State University Detroit MI USA

In this paper, we present a novel idea of co-clustering image features and semantic concepts. We accomplish this by modelling user feedback logs and low-level features using a bipartite graph. Our experiments demonstrate that (1) incorporating semantic information achieves better image clustering and (2) feature selection in co-clustering narrows the semantic gap, thus enabling efficient image retrieval.

关键词： Feedback Image retrieval Bipartite graph Image databases Clustering algorithms Machine vision pattern recognition Multimedia databases Spatial databases Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

Finding a Semantic Structure Interactively in Image Databases

Finding a Semantic Structure Interactively in Image Database...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Manjeet Rege Ming Dong Farshad Fotouhi Machine Vision & Pattern Recognition Laboratory Department of Computer Science Wayne State University Detroit MI USA Database & Multimedia Systems Group Department of Computer Science Wayne State University Detroit MI USA

We present a new approach to organize an image database by finding a semantic structure interactively based on multi-user relevance feedback. By treating user relevance feedbacks as weak classifiers and combining them together, we are able to capture the categories in the users' mind and build a semantic structure in the image database. Experiments performed on an image database consisting of general purpose images demonstrate that our system outperforms some of the other conventional methods

关键词： Image databases Feedback Image retrieval Machine learning algorithms Support vector machines Support vector machine classification Information retrieval Machine vision pattern recognition Multimedia databases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：