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

Fast Cost-Volume Filtering for Visual Correspondence and Beyond

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2013年第2期35卷 504-511页

作者： Hosni, Asmaa Rhemann, Christoph Bleyer, Michael Rother, Carsten Gelautz, Margrit Vienna Univ Technol Inst Software Technol & Interact Syst Interact Media Syst Grp Favoritenstr 9-11-188-2 A-1040 Vienna Austria Microsoft Res Cambridge Cambridge England

Many computer vision tasks can be formulated as labeling problems. The desired solution is often a spatially smooth labeling where label transitions are aligned with color edges of the input image. We show that such solutions can be efficiently achieved by smoothing the label costs with a very fast edge-preserving filter. In this paper, we propose a generic and simple framework comprising three steps: 1) constructing a cost volume, 2) fast cost volume filtering, and 3) Winner-Takes-All label selection. Our main contribution is to show that with such a simple framework state-of-the-art results can be achieved for several computer vision applications. In particular, we achieve 1) disparity maps in real time whose quality exceeds those of all other fast (local) approaches on the Middlebury stereo benchmark, and 2) optical flow fields which contain very fine structures as well as large displacements. To demonstrate robustness, the few parameters of our framework are set to nearly identical values for both applications. Also, competitive results for interactive image segmentation are presented. With this work, we hope to inspire other researchers to leverage this framework to other application areas.

关键词： Stereo matching optical flow interactive image segmentation

来源：评论

学校读者我要写书评

暂无评论

SwipeCut: interactive segmentation via Seed Grouping

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2020年第9期30卷 2959-2970页

作者： Chen, Ding-Jie Chen, Hwann-Tzong Chang, Long-Wen Acad Sinica Inst Informat Sci Taipei 115 Taiwan Natl Tsing Hua Univ Dept Comp Sci Hsinchu 300 Taiwan Natl Tsing Hua Univ Inst Informat Syst & Applicat Hsinchu 300 Taiwan

interactive image segmentation algorithms rely on the user to provide annotations as the guidance. When the task of interactive segmentation is performed on a small touchscreen device, the requirement of providing precise annotations could be cumbersome to the user. We design a new interaction mechanism that actively queries seeds for guiding the user to label. Our method enforces sparsity and diversity criteria on the selection of query seeds, and at each round of interaction, the user is only presented with a small number of informative query seeds that are far apart from each other. Therefore, the user merely has to swipe through on the ROI-relevant query seeds for checking which ones of the query seeds are inside the region of interest (ROI). This kind of interaction should be easy since those gestures are commonly used on a touchscreen. As a result, we are able to derive a user-friendly interaction mechanism for annotation on small touchscreen devices. The performance of our algorithm is evaluated on six publicly available datasets. The evaluation results show that our algorithm achieves high segmentation accuracy, with short computational time and less user feedback.

关键词： image segmentation Proposals Labeling Task analysis Performance evaluation Indexes Electronic mail interactive image segmentation touchscreen seed proposals

来源：评论

学校读者我要写书评

暂无评论

USER DRIVEN SPARSE POINT-BASED image segmentation

USER DRIVEN SPARSE POINT-BASED IMAGE SEGMENTATION

引用

IEEE International Conference on image Processing

作者： Sachin Meena Kannappan Palaniappan Guna Seetharaman Department of Computer Science University of Missouri-Columbia US Naval Research Laboratory

ISBN: (纸本)9781467399623

Reducing the amount of user driven input for interactive image segmentation enables faster and more precise foreground extraction of objects. A sparse collection of labeled seed points sampled over image regions can be quickly provided by the user using a few mouse clicks. Seed points are used for training an Elastic Body Spline classifier mapping function. We evaluate the efficiency and accuracy of user defined point inputs compared to fully manual boundary drawing that can be time consuming and automatic image segmentation methods that may not have sufficient accuracy. We show that using an average of just 8 labeled pixels (i.e. sparse set of seed points) the proposed EBS foreground-background thresholding method can achieve 90 percent accuracy compared to manual ground truth on the Berkeley BSDS500 benchmark.

关键词： interactive image segmentation Seed points Semi-supervised regression Elastic body splines image segmentation Consumers images region of an image mouse-click Seeds manual elastic bodies

来源：评论

学校读者我要写书评

暂无评论

Multi-Branch U-Net for interactive segmentation

引用

IEEE SIGNAL PROCESSING LETTERS 2024年 31卷 974-978页

作者： Li, Zhicheng Wang, Tao Mei, Chun Pei, Zhenyu Nanjing Univ Sci & Technol Sch Comp Sci & Engn Nanjing 210094 Peoples R China

In deep learning-based interactive segmentation, one of the key issues is how to effectively incorporate label prior into the network. The sparsity of clicks and the difference between images and label information limit the compatibility of user intent embedding in the deep long-path network. This letter aims to explore more effective embedding strategy of label prior in the neural network, and proposes a multi-branch U-net architecture for the interactive segmentation task. A principled fusion manner is adopted to progressively enhance the semantics of features based on the layer-by-layer promotion of the label prior guidance. Vast experiments on the popular GrabCut, Berkeley, DAVIS and SBD datasets verified the effectiveness of the proposed method.

关键词： image annotation interactive image segmentation multi-branch U-net label diffusion

来源：评论

学校读者我要写书评

暂无评论

Learning interactive multi-object segmentation through appearance embedding and spatial attention

引用

IET image PROCESSING 2022年第10期16卷 2722-2737页

作者： Gui, Yan Zhou, Bingqiang Zhang, Jianming Sun, Cheng Xiang, Lingyun Zhang, Jin Changsha Univ Sci & Technol Sch Comp & Commun Engn Changsha Peoples R China Changsha Univ Sci & Technol Hunan Prov Key Lab Intelligent Proc Big Data Tran Changsha Peoples R China Hunan Normal Univ Sch Math & Stat Changsha Peoples R China

Deep learning approaches to interactive image segmentation are typically formulated as a binary labeling problem. A model trained to make predictions within a fixed set of labels (i.e., foreground and background labels) cannot be used to directly predict the binary masks of multiple objects of interest, which greatly limits its flexibility and adaptivity. The use of different classes of clicks as input is opted for and the first end-to-end learning model for multi-object segmentation, based on a new designed neural network, is developed. The network consists of a visual feature extractor, a recurrent attention module and a dynamic segmentation head, extracts user click-adapted appearance embedding features and spatial attention features, and then learns to transform this information into a segmentation of multiple objects. It is also proposed to train the network using a joint loss function, taking the embedding learning into account for segmentation. Comprehensive experiments are conducted on three benchmark datasets to demonstrate the effectiveness of the proposed method. It performs favorably against state-of-the-art approaches on the multiple object segmentation task, for example, with 0.15 s per image, 0.06 s per object and mean IoU & F1 score of 84.90% on Pascal VOC 2012 validation set. It is further shown that the method can be used in numerous vision applications such as image recoloring and colorization.

关键词： spatial attention features colorization visual feature extractor interactive multiobject segmentation recurrent neural nets foreground background labels embedding learning joint loss function learning (artificial intelligence) multiple objects feature extraction binary masks image segmentation deep learning (artificial intelligence) image recoloring end-to-end learning model flexibility user click-adapted appearance embedding features recurrent attention module interactive image segmentation object detection multiple object segmentation task designed neural network dynamic segmentation head binary labeling problem

来源：评论

学校读者我要写书评

暂无评论

Online background subtraction with freely moving cameras using different motion boundaries

引用

image AND VISION COMPUTING 2018年 76卷 76-92页

作者： Sugimura, Daisuke Teshima, Fumihiro Hamamoto, Takayuki Tsuda Univ Dept Comp Sci Tokyo 1878577 Japan Tokyo Univ Sci Dept Elect Engn Tokyo 1258585 Japan

We propose a method for online background subtraction from a successive-frame video captured using a freely moving camera. Our method exploits a technique of interactive image segmentation with seeds (the subsets of pixels marked as "foreground" and "background"). The key novelty of our method is to automatically estimate the seeds by exploiting two different motion boundaries that are respectively computed using the magnitude and direction of the flow field. The magnitude of flow field is likely to be useful in differentiating the foreground and background motions when the moving objects and the camera make a movement towards the same direction. In contrast, the direction of flow field helps in discriminating the observed motions when the amount of displacement of the moving objects and the camera is the same. By adaptively exploiting the advantages of these different motion boundaries, our method enables to estimate the reliable foreground/background seeds. With the estimated seeds, our method performs accurate background subtraction even when the complex camera movements (e.g., large pan-tilt-zoom, rotation) are made. Our experiments demonstrate the effectiveness of our method using public dataset and other real image sequences. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Online background subtraction Freely moving camera interactive image segmentation Seeds estimation Motion boundary

来源：评论

学校读者我要写书评

暂无评论

Semi-Supervised Classification via Local Spline Regression

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2010年第11期32卷 2039-2053页

作者： Xiang, Shiming Nie, Feiping Zhang, Changshui Chinese Acad Sci Inst Automat Natl Lab Pattern Recognit Beijing 100190 Peoples R China Tsinghua Univ Dept Automat Tsinghua Natl Lab Informat Sci & Technol State Key Lab Intelligent Technol & Syst Beijing 100084 Peoples R China

This paper presents local spline regression for semi-supervised classification. The core idea in our approach is to introduce splines developed in Sobolev space to map the data points directly to be class labels. The spline is composed of polynomials and Green's functions. It is smooth, nonlinear, and able to interpolate the scattered data points with high accuracy. Specifically, in each neighborhood, an optimal spline is estimated via regularized least squares regression. With this spline, each of the neighboring data points is mapped to be a class label. Then, the regularized loss is evaluated and further formulated in terms of class label vector. Finally, all of the losses evaluated in local neighborhoods are accumulated together to measure the global consistency on the labeled and unlabeled data. To achieve the goal of semi-supervised classification, an objective function is constructed by combining together the global loss of the local spline regressions and the squared errors of the class labels of the labeled data. In this way, a transductive classification algorithm is developed in which a globally optimal classification can be finally obtained. In the semi-supervised learning setting, the proposed algorithm is analyzed and addressed into the Laplacian regularization framework. Comparative classification experiments on many public data sets and applications to interactive image segmentation and image matting illustrate the validity of our method.

关键词： Semi-supervised classification local spline regression interactive image segmentation

来源：评论

学校读者我要写书评

暂无评论

Personal Fixations-Based Object segmentation With Object Localization and Boundary Preservation

引用

IEEE TRANSACTIONS ON image PROCESSING 2021年 30卷 1461-1475页

作者： Li, Gongyang Liu, Zhi Shi, Ran Hu, Zheng Wei, Weijie Wu, Yong Huang, Mengke Ling, Haibin Shanghai Univ Shanghai Inst Adv Commun & Data Sci Shanghai 200444 Peoples R China Shanghai Univ Sch Commun & Informat Engn Shanghai 200444 Peoples R China Nanjing Univ Sci & Technol Sch Comp Sci & Engn Nanjing 210094 Peoples R China SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA

As a natural way for human-computer interaction, fixation provides a promising solution for interactive image segmentation. In this paper, we focus on Personal Fixations-based Object segmentation (PFOS) to address issues in previous studies, such as the lack of appropriate dataset and the ambiguity in fixations-based interaction. In particular, we first construct a new PFOS dataset by carefully collecting pixel-level binary annotation data over an existing fixation prediction dataset, such dataset is expected to greatly facilitate the study along the line. Then, considering characteristics of personal fixations, we propose a novel network based on Object Localization and Boundary Preservation (OLBP) to segment the gazed objects. Specifically, the OLBP network utilizes an Object Localization Module (OLM) to analyze personal fixations and locates the gazed objects based on the interpretation. Then, a Boundary Preservation Module (BPM) is designed to introduce additional boundary information to guard the completeness of the gazed objects. Moreover, OLBP is organized in the mixed bottom-up and top-down manner with multiple types of deep supervision. Extensive experiments on the constructed PFOS dataset show the superiority of the proposed OLBP network over 17 state-of-the-art methods, and demonstrate the effectiveness of the proposed OLM and BPM components. The constructed PFOS dataset and the proposed OLBP network are available at https://***/MathLee/OLBPNet4PFOS.

关键词： image segmentation Object segmentation Task analysis Visualization Visual systems Measurement image edge detection Personal fixations interactive image segmentation object localization boundary preservation

来源：评论

学校读者我要写书评

暂无评论

Mining Semantic Correlations Between Mispredictions and Corrections for interactive Semantic segmentation

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2024年第5期36卷 8036-8048页

作者： Gao, Yutong Lang, Congyan Liu, Fayao Foo, Chuan-Sheng Cao, Yuanzhouhan Sun, Lijuan Wei, Yunchao Beijing Jiaotong Univ Sch Comp & Informat Technol Key Lab Big Data & Artificial Intelligence Transpo Minist Educ Beijing 100044 Peoples R China Minzu Univ China Sch Informat Engn Key Lab Ethn Language Intelligent Anal & Secur Gov Minist Educ Beijing 100081 Peoples R China Beijing Jiaotong Univ Sch Comp & Informat Technol Beijing Key Lab Traff Data Anal & Min Beijing 100044 Peoples R China ASTAR Inst Infocomm Res Singapore 138632 Singapore Beijing Jiaotong Univ Sch Comp Sci & Informat Technol Beijing 100044 Peoples R China Beihang Univ Intellectual Property Informat Serv Ctr Beijing 100044 Peoples R China Beijing Jiaotong Univ Inst Informat Sci Beijing 100044 Peoples R China

interactive semantic segmentation pursues high-quality segmentation results at the cost of a small number of user clicks. It is attracting more and more research attention for its convenience in labeling semantic pixel-level data. Existing interactive segmentation methods often pursue higher interaction efficiency by mining the latent information of user clicks or exploring efficient interaction manners. However, these works neglect to explicitly exploit the semantic correlations between user corrections and model mispredictions, thus suffering from two flaws. First, similar prediction errors frequently occur in actual use, causing users to repeatedly correct them. Second, the interaction difficulty of different semantic classes varies across images, but existing models use monotonic parameters for all images which lack semantic pertinence. Therefore, in this article, we explore the semantic correlations existing in corrections and mispredictions by proposing a simple yet effective online learning solution to the above problems, named correction-misprediction correlation mining (CM2). Specifically, we leverage the correction-misprediction similarities to design a confusion memory module (CMM) for automatic correction when similar prediction errors reappear. Furthermore, we measure the semantic interaction difficulty by counting the correction-misprediction pairs and design a challenge adaptive convolutional layer (CACL), which can adaptively switch different parameters according to interaction difficulties to better segment the challenging classes. Our method requires no extra training besides the online learning process and can effectively improve interaction efficiency. Our proposed CM2 achieves state-of-the-art results on three public semantic segmentation benchmarks.

关键词： Semantics Correlation Semantic segmentation Training Task analysis Annotations Switches interactive image segmentation semantic image segmentation

来源：评论

学校读者我要写书评

暂无评论

Privacy preservation network with global-aware focal loss for interactive Personal Visual Privacy Preservation

引用

NEUROCOMPUTING 2024年 602卷

作者： Xiao, Zhiqiang Lin, Jiacheng Chen, Jiajun Fu, Haolong Li, Yifan Yuan, Jin Li, Zhiyong Hunan Univ Coll Comp Sci & Elect Engn Changsha 410082 Peoples R China Hunan Univ Sch Robot Changsha 410082 Peoples R China

Existing visual privacy preservation methods often encounter the challenge of over-protection, which usually fails to accurately protect a specified person in an image. This paper introduces a novel task called "interactive Personal Visual Privacy Preservation (IPVPP)", with the objective of safeguarding a desired individual in an image based on user-click prompts. We propose a new framework, Privacy Preservation Network (PPNet) with Global-aware Focal Loss, tailored for IPVPP task. To address the sample imbalance issue in IPVPP, we present a Global-aware Focal Loss (GFL), which introduces global and local difficulty balance weights to dynamically adjust the overall decision boundary, thereby mitigating the sample imbalance problem for better optimization of models. Furthermore, to tackle the insufficient fusion between click and visual features, we propose a Click- image Fusion (CIF) module, which effectively emphasizes the interaction between click and image features, providing robust query inputs to the model. We finally employ generative adversarial networks to ensure the reusability of privacy images, striking a balance between privacy preservation and image value. Experimental results on the DAVIS dataset demonstrate the effectiveness of PPNet, achieving improvements measured in NoC 90, IS, SSIM, F-1, and DIR, with 0.22, 0.19, 0.009, 4.23, and 2.15 improvements, respectively.

关键词： Global-aware focal loss Click-image fusion Visual privacy preservation interactive image segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：