PyTorchKR Papers

최신 논문

총 134편
태그·기간 등 상세 필터

카테고리 탐색

로그인 후 이 태그 구독

arXiv:1506.03648공식 코드 · Papers with Code

Constrained Convolutional Neural Networks for Weakly Supervised Segmentation

We present an approach to learn a dense pixel-wise labeling from image-level tags. Each image-level tag imposes constraints on the output labeling of a Convolutional Neural Network (CNN) classifier. We propose Constrained CNN (CCNN), a method which uses a novel loss function to optimize for any set of linear constraints on the output space (i.e. predicted label distribution) of a CNN. Our loss formulation is easy to optimize and can be incorporated directly into standard stochastic gradient descent optimization. The key idea is to phrase the training objective as a biconvex optimization for linear models, which we then relax to nonlinear deep networks. Extensive experiments demonstrate the generality of our new learning framework. The constrained loss yields state-of-the-art results on weakly supervised semantic image segmentation. We further demonstrate that adding slightly more supervision can greatly improve the performance of the learning algorithm.

arXiv:1610.01238

Find Your Own Way: Weakly-Supervised Segmentation of Path Proposals for Urban Autonomy

We present a weakly-supervised approach to segmenting proposed drivable paths in images with the goal of autonomous driving in complex urban environments. Using recorded routes from a data collection vehicle, our proposed method generates vast quantities of labelled images containing proposed paths and obstacles without requiring manual annotation, which we then use to train a deep semantic segmentation network. With the trained network we can segment proposed paths and obstacles at run-time using a vehicle equipped with only a monocular camera without relying on explicit modelling of road or lane markings. We evaluate our method on the large-scale KITTI and Oxford RobotCar datasets and demonstrate reliable path proposal and obstacle segmentation in a wide variety of environments under a range of lighting, weather and traffic conditions. We illustrate how the method can generalise to multiple path proposals at intersections and outline plans to incorporate the system into a framework for autonomous urban driving.

arXiv:1802.07008

Segmentation hiérarchique faiblement supervisée

Image segmentation is the process of partitioning an image into a set of meaningful regions according to some criteria. Hierarchical segmentation has emerged as a major trend in this regard as it favors the emergence of important regions at different scales. On the other hand, many methods allow us to have prior information on the position of structures of interest in the images. In this paper, we present a versatile hierarchical segmentation method that takes into account any prior spatial information and outputs a hierarchical segmentation that emphasizes the contours or regions of interest while preserving the important structures in the image. An application of this method to the weakly-supervised segmentation problem is presented.

arXiv:1707.01086

Discriminative Localization in CNNs for Weakly-Supervised Segmentation of Pulmonary Nodules

Automated detection and segmentation of pulmonary nodules on lung computed tomography (CT) scans can facilitate early lung cancer diagnosis. Existing supervised approaches for automated nodule segmentation on CT scans require voxel-based annotations for training, which are labor- and time-consuming to obtain. In this work, we propose a weakly-supervised method that generates accurate voxel-level nodule segmentation trained with image-level labels only. By adapting a convolutional neural network (CNN) trained for image classification, our proposed method learns discriminative regions from the activation maps of convolution units at different scales, and identifies the true nodule location with a novel candidate-screening framework. Experimental results on the public LIDC-IDRI dataset demonstrate that, our weakly-supervised nodule segmentation framework achieves competitive performance compared to a fully-supervised CNN-based segmentation method.

arXiv:1712.06020

An ILP Solver for Multi-label MRFs with Connectivity Constraints

Integer Linear Programming (ILP) formulations of Markov random fields (MRFs) models with global connectivity priors were investigated previously in computer vision, e.g., \cite{globalinter,globalconn}. In these works, only Linear Programing (LP) relaxations \cite{globalinter,globalconn} or simplified versions \cite{graphcutbase} of the problem were solved. This paper investigates the ILP of multi-label MRF with exact connectivity priors via a branch-and-cut method, which provably finds globally optimal solutions. The method enforces connectivity priors iteratively by a cutting plane method, and provides feasible solutions with a guarantee on sub-optimality even if we terminate it earlier. The proposed ILP can be applied as a post-processing method on top of any existing multi-label segmentation approach. As it provides globally optimal solution, it can be used off-line to generate ground-truth labeling, which serves as quality check for any fast on-line algorithm. Furthermore, it can be used to generate ground-truth proposals for weakly supervised segmentation. We demonstrate the power and usefulness of our model by several experiments on the BSDS500 and PASCAL image dataset, as well as on medical images with trained probability maps.

arXiv:1803.05858

Pseudo Mask Augmented Object Detection

In this work, we present a novel and effective framework to facilitate object detection with the instance-level segmentation information that is only supervised by bounding box annotation. Starting from the joint object detection and instance segmentation network, we propose to recursively estimate the pseudo ground-truth object masks from the instance-level object segmentation network training, and then enhance the detection network with top-down segmentation feedbacks. The pseudo ground truth mask and network parameters are optimized alternatively to mutually benefit each other. To obtain the promising pseudo masks in each iteration, we embed a graphical inference that incorporates the low-level image appearance consistency and the bounding box annotations to refine the segmentation masks predicted by the segmentation network. Our approach progressively improves the object detection performance by incorporating the detailed pixel-wise information learned from the weakly-supervised segmentation network. Extensive evaluation on the detection task in PASCAL VOC 2007 and 2012 [12] verifies that the proposed approach is effective.

arXiv:1711.05998공식 코드 · Papers with Code

Minimizing Supervision for Free-space Segmentation

Identifying "free-space," or safely driveable regions in the scene ahead, is a fundamental task for autonomous navigation. While this task can be addressed using semantic segmentation, the manual labor involved in creating pixelwise annotations to train the segmentation model is very costly. Although weakly supervised segmentation addresses this issue, most methods are not designed for free-space. In this paper, we observe that homogeneous texture and location are two key characteristics of free-space, and develop a novel, practical framework for free-space segmentation with minimal human supervision. Our experiments show that our framework performs better than other weakly supervised methods while using less supervision. Our work demonstrates the potential for performing free-space segmentation without tedious and costly manual annotation, which will be important for adapting autonomous driving systems to different types of vehicles and environments

arXiv:1804.02391

Learn To Pay Attention

We propose an end-to-end-trainable attention module for convolutional neural network (CNN) architectures built for image classification. The module takes as input the 2D feature vector maps which form the intermediate representations of the input image at different stages in the CNN pipeline, and outputs a 2D matrix of scores for each map. Standard CNN architectures are modified through the incorporation of this module, and trained under the constraint that a convex combination of the intermediate 2D feature vectors, as parameterised by the score matrices, must \textit{alone} be used for classification. Incentivised to amplify the relevant and suppress the irrelevant or misleading, the scores thus assume the role of attention values. Our experimental observations provide clear evidence to this effect: the learned attention maps neatly highlight the regions of interest while suppressing background clutter. Consequently, the proposed function is able to bootstrap standard CNN architectures for the task of image classification, demonstrating superior generalisation over 6 unseen benchmark datasets. When binarised, our attention maps outperform other CNN-based attention maps, traditional saliency maps, and top object proposals for weakly supervised segmentation as demonstrated on the Object Discovery dataset. We also demonstrate improved robustness against the fast gradient sign method of adversarial attack.

arXiv:1805.04628공식 코드 · Papers with Code

Constrained-CNN losses for weakly supervised segmentation

Weakly-supervised learning based on, e.g., partially labelled images or image-tags, is currently attracting significant attention in CNN segmentation as it can mitigate the need for full and laborious pixel/voxel annotations. Enforcing high-order (global) inequality constraints on the network output (for instance, to constrain the size of the target region) can leverage unlabeled data, guiding the training process with domain-specific knowledge. Inequality constraints are very flexible because they do not assume exact prior knowledge. However, constrained Lagrangian dual optimization has been largely avoided in deep networks, mainly for computational tractability reasons. To the best of our knowledge, the method of [Pathak et al., 2015] is the only prior work that addresses deep CNNs with linear constraints in weakly supervised segmentation. It uses the constraints to synthesize fully-labeled training masks (proposals) from weak labels, mimicking full supervision and facilitating dual optimization. We propose to introduce a differentiable penalty, which enforces inequality constraints directly in the loss function, avoiding expensive Lagrangian dual iterates and proposal generation. From constrained-optimization perspective, our simple penalty-based approach is not optimal as there is no guarantee that the constraints are satisfied. However, surprisingly, it yields substantially better results than the Lagrangian-based constrained CNNs in [Pathak et al., 2015], while reducing the computational demand for training. By annotating only a small fraction of the pixels, the proposed approach can reach a level of segmentation performance that is comparable to full supervision on three separate tasks. While our experiments focused on basic linear constraints such as the target-region size and image tags, our framework can be easily extended to other non-linear constraints.

arXiv:1805.10344

Pathology Segmentation using Distributional Differences to Images of Healthy Origin

Fully supervised segmentation methods require a large training cohort of already segmented images, providing information at the pixel level of each image. We present a method to automatically segment and model pathologies in medical images, trained solely on data labelled on the image level as either healthy or containing a visual defect. We base our method on CycleGAN, an image-to-image translation technique, to translate images between the domains of healthy and pathological images. We extend the core idea with two key contributions. Implementing the generators as residual generators allows us to explicitly model the segmentation of the pathology. Realizing the translation from the healthy to the pathological domain using a variational autoencoder allows us to specify one representation of the pathology, as this transformation is otherwise not unique. Our model hence not only allows us to create pixelwise semantic segmentations, it is also able to create inpaintings for the segmentations to render the pathological image healthy. Furthermore, we can draw new unseen pathology samples from this model based on the distribution in the data. We show quantitatively, that our method is able to segment pathologies with a surprising accuracy being only slightly inferior to a state-of-the-art fully supervised method, although the latter has per-pixel rather than per-image training information. Moreover, we show qualitative results of both the segmentations and inpaintings. Our findings motivate further research into weakly-supervised segmentation using image level annotations, allowing for faster and cheaper acquisition of training data without a large sacrifice in segmentation accuracy.

arXiv:1805.04574

Revisiting Dilated Convolution: A Simple Approach for Weakly- and Semi- Supervised Semantic Segmentation

Despite the remarkable progress, weakly supervised segmentation approaches are still inferior to their fully supervised counterparts. We obverse the performance gap mainly comes from their limitation on learning to produce high-quality dense object localization maps from image-level supervision. To mitigate such a gap, we revisit the dilated convolution [1] and reveal how it can be utilized in a novel way to effectively overcome this critical limitation of weakly supervised segmentation approaches. Specifically, we find that varying dilation rates can effectively enlarge the receptive fields of convolutional kernels and more importantly transfer the surrounding discriminative information to non-discriminative object regions, promoting the emergence of these regions in the object localization maps. Then, we design a generic classification network equipped with convolutional blocks of different dilated rates. It can produce dense and reliable object localization maps and effectively benefit both weakly- and semi- supervised semantic segmentation. Despite the apparent simplicity, our proposed approach obtains superior performance over state-of-the-arts. In particular, it achieves 60.8% and 67.6% mIoU scores on Pascal VOC 2012 test set in weakly- (only image-level labels are available) and semi- (1,464 segmentation masks are available) supervised settings, which are the new state-of-the-arts.

arXiv:1806.04066

Joint Learning of Motion Estimation and Segmentation for Cardiac MR Image Sequences

Cardiac motion estimation and segmentation play important roles in quantitatively assessing cardiac function and diagnosing cardiovascular diseases. In this paper, we propose a novel deep learning method for joint estimation of motion and segmentation from cardiac MR image sequences. The proposed network consists of two branches: a cardiac motion estimation branch which is built on a novel unsupervised Siamese style recurrent spatial transformer network, and a cardiac segmentation branch that is based on a fully convolutional network. In particular, a joint multi-scale feature encoder is learned by optimizing the segmentation branch and the motion estimation branch simultaneously. This enables the weakly-supervised segmentation by taking advantage of features that are unsupervisedly learned in the motion estimation branch from a large amount of unannotated data. Experimental results using cardiac MRI images from 220 subjects show that the joint learning of both tasks is complementary and the proposed models outperform the competing methods significantly in terms of accuracy and speed.

arXiv:2607.19877v1cs.CV

약지도 볼륨 분할을 위한 강건한 활성화 맵 보정: 시간적 일관성이라는 공짜 점심

Robust Activation Map Rectification for Weakly Supervised Volumetric Segmentation: Temporal Coherence as a Free Lunch

약지도 분할은 목표 영역을 초기에 국한화하기 위해 클래스 활성화 맵(CAM)에 크게 의존한다. 그러나 CAM은 종종 노이즈가 많고 치명적 실패에 취약하다. 기존 해결책은 보통 추가 학습 단계나 프로토타입 학습을 도입하여 계산 비용을 늘리고 강건성을 저하시킨다. 본 논문에서는 볼륨 데이터의 시간적·구조적 일관성을 공짜 점심으로 활용하여 신뢰할 수 없는 CAM을 보정하는, 학습 없이(training-free) 프로토타입 없이(prototype-free) 동작하는 프레임워크를 제안한다. 우리 접근법은 두 가지 핵심 구성 요소로 이루어진다. 첫째, 노이즈를 억제하고 일관된 의미 신호를 증폭하는 분산 감소 활성화 집계(Variance-Reduced Activation Aggregation, VRAA)를 도입한다. CAM을 고차원 랜덤 벡터로 모델링하고 집계가 입증 가능한 분산 감소를 가져온다는 이론적 근거를 제시한다. 둘째, 양방향 극단값 검사를 통해 비현실적인 활성화를 탐지·보정하는 양방향 극단값 보정(Bidirectional Extremity Rectification, BER) 메커니즘을 설계하여, 추가 파라미터 학습 없이 극단값 실패를 효과적으로 완화한다. 제안 방법은 모델에 구애받지 않으며(model-agnostic) 기존 파이프라인에 원활하게 통합할 수 있다. 여러 공개 벤치마크에 대한 광범위한 실험에서 최신 약지도 방법 대비 Dice 최대 20%, mIoU 최대 40% 향상과 추론 시간 5배 이상 단축을 포함한 유의미한 개선을 보여준다. 이 결과는 일관성을 암묵적 귀납적 바이어스(implicit inductive bias)로 활용하는 것이 약지도 볼륨 분할을 안정화하는 원칙적이고 효율적인 접근임을 시사한다. 코드는 공개 예정이다.

arXiv:2606.20250v1cs.CV

약한 지도 조직병리 분할을 위한 단일 단계 계층적 보정

Single-Stage Hierarchical Rectification for Weakly Supervised Histopathology Segmentation

계산 병리학의 기존 약한 지도 시맨틱 분할(WSSS) 방법들은 클래스 활성화 맵(CAM) 생성, 오프라인 의사 마스크(pseudo-mask) 정제, 완전 지도 재학습으로 구성된 다단계 패러다임에 의존합니다. 확립된 방식이지만, 이 비결합(decoupled) 접근법은 근본적인 한계를 가집니다. 다단계 프로세스는 높은 계산 학습 비용을 초래할 뿐만 아니라 오류 전파 문제도 겪습니다. 얕은 CNN 레이어의 국부적 텍스처 편향은 거짓 양성 인공물을 생성하는데, 후속 정제 단계에서 이를 수정하지 못하는 경우가 많습니다. 우리는 간단하면서도 매우 효과적인 접근법을 통해 이러한 지속적인 과제를 해결하기 위해 단일 단계 계층적 보정(SSHR) 프레임워크를 제안합니다. 사후에 CAM을 수동적으로 정제하는 대신, 본 방법은 순전파(forward pass) 도중 중간 특징(feature) 표현을 능동적으로 정화합니다. 우리는 얕은 레이어의 국부적 이상치를 필터링하기 위해 깊은 전역 시맨틱 컨텍스트를 활용하는 계층적 특징(feature) 보정 모듈(HFRM)을 도입합니다. 이 메커니즘은 단일 학습 루프(training loop) 내에서 직접 고충실도 활성화 맵을 생성합니다. LUAD-HistoSeg 및 BCSS 데이터셋에 대한 실험 결과, SSHR이 최신(SOTA) 다단계 방법보다 우수한 성능을 보임을 입증했습니다. 또한, SSHR은 학습 시간을 2배에서 5배 단축합니다. 이러한 효율성은 계산 오버헤드를 최소화하고 대규모 조직병리 워크플로우의 임상 전환을 가속화합니다. 코드는 https://github.com/trongduc-nguyen/SSHR 에서 확인할 수 있습니다.