scholarly journals Residual refinement for interactive skin lesion segmentation

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Dalei Jiang ◽  
Yin Wang ◽  
Feng Zhou ◽  
Hongtao Ma ◽  
Wenting Zhang ◽  
...  
Keyword(s):  
Skin Lesion ◽  
User Interaction ◽  
Universal Method ◽  
Lesion Segmentation ◽  
Feature Maps ◽  
Classic Problem ◽  
Novel Approach ◽  
Wide Range ◽  
Public Datasets ◽  
Segmentation Task

Abstract Background Image segmentation is a difficult and classic problem. It has a wide range of applications, one of which is skin lesion segmentation. Numerous researchers have made great efforts to tackle the problem, yet there is still no universal method in various application domains. Results We propose a novel approach that combines a deep convolutional neural network with a grabcut-like user interaction to tackle the interactive skin lesion segmentation problem. Slightly deviating from grabcut user interaction, our method uses boxes and clicks. In addition, contrary to existing interactive segmentation algorithms that combine the initial segmentation task with the following refinement task, we explicitly separate these tasks by designing individual sub-networks. One network is SBox-Net, and the other is Click-Net. SBox-Net is a full-fledged segmentation network that is built upon a pre-trained, state-of-the-art segmentation model, while Click-Net is a simple yet powerful network that combines feature maps extracted from SBox-Net and user clicks to residually refine the mistakes made by SBox-Net. Extensive experiments on two public datasets, PH2 and ISIC, confirm the effectiveness of our approach. Conclusions We present an interactive two-stage pipeline method for skin lesion segmentation, which was demonstrated to be effective in comprehensive experiments.

scholarly journals Skin Lesion Segmentation Using Deep Learning with Auxiliary Task

2021 ◽  
Vol 7 (4) ◽  
pp. 67
Author(s):  
Lina Liu ◽  
Ying Y. Tsui ◽  
Mrinal Mandal
Keyword(s):  
Deep Learning ◽  
Skin Lesion ◽  
Auxiliary Information ◽  
Classification Task ◽  
Lesion Segmentation ◽  
Feature Maps ◽  
Learning Framework ◽  
Multi Scale ◽  
Task Learning ◽  
Segmentation Task

Skin lesion segmentation is a primary step for skin lesion analysis, which can benefit the subsequent classification task. It is a challenging task since the boundaries of pigment regions may be fuzzy and the entire lesion may share a similar color. Prevalent deep learning methods for skin lesion segmentation make predictions by ensembling different convolutional neural networks (CNN), aggregating multi-scale information, or by multi-task learning framework. The main purpose of doing so is trying to make use of as much information as possible so as to make robust predictions. A multi-task learning framework has been proved to be beneficial for the skin lesion segmentation task, which is usually incorporated with the skin lesion classification task. However, multi-task learning requires extra labeling information which may not be available for the skin lesion images. In this paper, a novel CNN architecture using auxiliary information is proposed. Edge prediction, as an auxiliary task, is performed simultaneously with the segmentation task. A cross-connection layer module is proposed, where the intermediate feature maps of each task are fed into the subblocks of the other task which can implicitly guide the neural network to focus on the boundary region of the segmentation task. In addition, a multi-scale feature aggregation module is proposed, which makes use of features of different scales and enhances the performance of the proposed method. Experimental results show that the proposed method obtains a better performance compared with the state-of-the-art methods with a Jaccard Index (JA) of 79.46, Accuracy (ACC) of 94.32, SEN of 88.76 with only one integrated model, which can be learned in an end-to-end manner.

scholarly journals FAC-Net: Feedback Attention Network Based on Context Encoder Network for Skin Lesion Segmentation

Sensors ◽  
2021 ◽  
Vol 21 (15) ◽  
pp. 5172
Author(s):  
Yuying Dong ◽  
Liejun Wang ◽  
Shuli Cheng ◽  
Yongming Li
Keyword(s):  
Skin Lesion ◽  
Real Life ◽  
Good Deal ◽  
Experimental Tests ◽  
Skin Lesions ◽  
Lesion Segmentation ◽  
Attention Network ◽  
Effective Feedback ◽  
Public Datasets ◽  
Learning Architectures

Considerable research and surveys indicate that skin lesions are an early symptom of skin cancer. Segmentation of skin lesions is still a hot research topic. Dermatological datasets in skin lesion segmentation tasks generated a large number of parameters when data augmented, limiting the application of smart assisted medicine in real life. Hence, this paper proposes an effective feedback attention network (FAC-Net). The network is equipped with the feedback fusion block (FFB) and the attention mechanism block (AMB), through the combination of these two modules, we can obtain richer and more specific feature mapping without data enhancement. Numerous experimental tests were given by us on public datasets (ISIC2018, ISBI2017, ISBI2016), and a good deal of metrics like the Jaccard index (JA) and Dice coefficient (DC) were used to evaluate the results of segmentation. On the ISIC2018 dataset, we obtained results for DC equal to 91.19% and JA equal to 83.99%, compared with the based network. The results of these two main metrics were improved by more than 1%. In addition, the metrics were also improved in the other two datasets. It can be demonstrated through experiments that without any enhancements of the datasets, our lightweight model can achieve better segmentation performance than most deep learning architectures.

Directional Vector-Based Skin Lesion Segmentation — A Novel Approach to Skin Segmentation

2020 ◽  
Vol 20 (03) ◽  
pp. 2050021
Author(s):  
P. Nikesh ◽  
G. Raju
Keyword(s):  
Skin Lesion ◽  
Automatic Segmentation ◽  
High Accuracy ◽  
Lesion Segmentation ◽  
Seed Point ◽  
Skin Segmentation ◽  
Novel Approach ◽  
Segmentation Algorithms ◽  
Computer Aided ◽  
Aided Diagnosis

Efficient skin lesion segmentation algorithms are required for computer aided diagnosis of skin cancer. Several algorithms were proposed for skin lesion segmentation. The existing algorithms are short of achieving ideal performance. In this paper, a novel semi-automatic segmentation algorithm is proposed. The fare concept of the proposed is 8-directional search based on threshold for lesion pixel, starting from a user provided seed point. The proposed approach is tested on 200 images from PH2 and 900 images from ISBI 2016 datasets. In comparison to a chosen set of algorithms, the proposed approach gives high accuracy and specificity values. A significant advantage of the proposed method is the ability to deal with discontinuities in the lesion.

Efficient Unet with depth-aware gated fusion for automatic skin lesion segmentation

2021 ◽  
pp. 1-13
Author(s):  
Xiangwen Ding ◽  
Shengsheng Wang
Keyword(s):  
Skin Lesion ◽  
Skin Lesions ◽  
Background Information ◽  
Lesion Segmentation ◽  
Feature Maps ◽  
Irregular Shapes ◽  
Large Size ◽  
Application Potential ◽  
Different Depths ◽  
Serious Disease

Melanoma is a very serious disease. The segmentation of skin lesions is a critical step for diagnosing melanoma. However, skin lesions possess the characteristics of large size variations, irregular shapes, blurring borders, and complex background information, thus making the segmentation of skin lesions remain a challenging problem. Though deep learning models usually achieve good segmentation performance for skin lesion segmentation, they have a large number of parameters and FLOPs, which limits their application scenarios. These models also do not make good use of low-level feature maps, which are essential for predicting detailed information. The Proposed EUnet-DGF uses MBconv to implement its lightweight encoder and maintains a strong encoding ability. Moreover, the depth-aware gated fusion block designed by us can fuse feature maps of different depths and help predict pixels on small patterns. The experiments conducted on the ISIC 2017 dataset and PH2 dataset show the superiority of our model. In particular, EUnet-DGF only accounts for 19% and 6.8% of the original Unet in terms of the number of parameters and FLOPs. It possesses a great application potential in practical computer-aided diagnosis systems.

scholarly journals A Self-Spatial Adaptive Weighting Based U-Net for Image Segmentation

Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 348
Author(s):  
Choongsang Cho ◽  
Young Han Lee ◽  
Jongyoul Park ◽  
Sangkeun Lee
Keyword(s):  
Image Segmentation ◽  
Medical Image ◽  
Medical Image Segmentation ◽  
Feature Maps ◽  
Data Set ◽  
Feature Map ◽  
Adaptive Weighting ◽  
Spatially Adaptive ◽  
Wide Range ◽  
Decoder Architecture

Semantic image segmentation has a wide range of applications. When it comes to medical image segmentation, its accuracy is even more important than those of other areas because the performance gives useful information directly applicable to disease diagnosis, surgical planning, and history monitoring. The state-of-the-art models in medical image segmentation are variants of encoder-decoder architecture, which is called U-Net. To effectively reflect the spatial features in feature maps in encoder-decoder architecture, we propose a spatially adaptive weighting scheme for medical image segmentation. Specifically, the spatial feature is estimated from the feature maps, and the learned weighting parameters are obtained from the computed map, since segmentation results are predicted from the feature map through a convolutional layer. Especially in the proposed networks, the convolutional block for extracting the feature map is replaced with the widely used convolutional frameworks: VGG, ResNet, and Bottleneck Resent structures. In addition, a bilinear up-sampling method replaces the up-convolutional layer to increase the resolution of the feature map. For the performance evaluation of the proposed architecture, we used three data sets covering different medical imaging modalities. Experimental results show that the network with the proposed self-spatial adaptive weighting block based on the ResNet framework gave the highest IoU and DICE scores in the three tasks compared to other methods. In particular, the segmentation network combining the proposed self-spatially adaptive block and ResNet framework recorded the highest 3.01% and 2.89% improvements in IoU and DICE scores, respectively, in the Nerve data set. Therefore, we believe that the proposed scheme can be a useful tool for image segmentation tasks based on the encoder-decoder architecture.

scholarly journals Responsive and Personalized Web Layouts with Integer Programming

2021 ◽  
Vol 5 (EICS) ◽  
pp. 1-23
Author(s):  
Markku Laine ◽  
Yu Zhang ◽  
Simo Santala ◽  
Jussi P. P. Jokinen ◽  
Antti Oulasvirta
Keyword(s):  
Integer Programming ◽  
Web Design ◽  
Web Pages ◽  
Web Page Design ◽  
Automated Generation ◽  
Novel Approach ◽  
Wide Range ◽  
Responsive Design ◽  
Responsive Web Design ◽  
Page Design

Over the past decade, responsive web design (RWD) has become the de facto standard for adapting web pages to a wide range of devices used for browsing. While RWD has improved the usability of web pages, it is not without drawbacks and limitations: designers and developers must manually design the web layouts for multiple screen sizes and implement associated adaptation rules, and its "one responsive design fits all" approach lacks support for personalization. This paper presents a novel approach for automated generation of responsive and personalized web layouts. Given an existing web page design and preferences related to design objectives, our integer programming -based optimizer generates a consistent set of web designs. Where relevant data is available, these can be further automatically personalized for the user and browsing device. The paper includes presentation of techniques for runtime adaptation of the designs generated into a fully responsive grid layout for web browsing. Results from our ratings-based online studies with end users (N = 86) and designers (N = 64) show that the proposed approach can automatically create high-quality responsive web layouts for a variety of real-world websites.

Mining discriminative patches for script identification in natural scene images

2021 ◽  
Vol 40 (1) ◽  
pp. 551-563
Author(s):  
Liqiong Lu ◽  
Dong Wu ◽  
Ziwei Tang ◽  
Yaohua Yi ◽  
Faliang Huang
Keyword(s):  
Neural Networks ◽  
Experimental Results ◽  
The Other ◽  
Natural Scene ◽  
Fixed Size ◽  
Script Identification ◽  
Aspect Ratios ◽  
Novel Approach ◽  
Public Datasets ◽  
Natural Scene Images

This paper focuses on script identification in natural scene images. Traditional CNNs (Convolution Neural Networks) cannot solve this problem perfectly for two reasons: one is the arbitrary aspect ratios of scene images which bring much difficulty to traditional CNNs with a fixed size image as the input. And the other is that some scripts with minor differences are easily confused because they share a subset of characters with the same shapes. We propose a novel approach combing Score CNN, Attention CNN and patches. Attention CNN is utilized to determine whether a patch is a discriminative patch and calculate the contribution weight of the discriminative patch to script identification of the whole image. Score CNN uses a discriminative patch as input and predict the score of each script type. Firstly patches with the same size are extracted from the scene images. Secondly these patches are used as inputs to Score CNN and Attention CNN to train two patch-level classifiers. Finally, the results of multiple discriminative patches extracted from the same image via the above two classifiers are fused to obtain the script type of this image. Using patches with the same size as inputs to CNN can avoid the problems caused by arbitrary aspect ratios of scene images. The trained classifiers can mine discriminative patches to accurately identify some confusing scripts. The experimental results show the good performance of our approach on four public datasets.

scholarly journals Density Guarantee on Finding Multiple Subgraphs and Subtensors

2021 ◽  
Vol 15 (5) ◽  
pp. 1-32
Author(s):  
Quang-huy Duong ◽  
Heri Ramampiaro ◽  
Kjetil Nørvåg ◽  
Thu-lan Dam
Keyword(s):  
Lower Bound ◽  
State Of The Art ◽  
The State ◽  
The Other ◽  
Exact Methods ◽  
Practical Solution ◽  
Novel Approach ◽  
Wide Range ◽  
Real World Datasets ◽  
Tensor Data

Dense subregion (subgraph & subtensor) detection is a well-studied area, with a wide range of applications, and numerous efficient approaches and algorithms have been proposed. Approximation approaches are commonly used for detecting dense subregions due to the complexity of the exact methods. Existing algorithms are generally efficient for dense subtensor and subgraph detection, and can perform well in many applications. However, most of the existing works utilize the state-or-the-art greedy 2-approximation algorithm to capably provide solutions with a loose theoretical density guarantee. The main drawback of most of these algorithms is that they can estimate only one subtensor, or subgraph, at a time, with a low guarantee on its density. While some methods can, on the other hand, estimate multiple subtensors, they can give a guarantee on the density with respect to the input tensor for the first estimated subsensor only. We address these drawbacks by providing both theoretical and practical solution for estimating multiple dense subtensors in tensor data and giving a higher lower bound of the density. In particular, we guarantee and prove a higher bound of the lower-bound density of the estimated subgraph and subtensors. We also propose a novel approach to show that there are multiple dense subtensors with a guarantee on its density that is greater than the lower bound used in the state-of-the-art algorithms. We evaluate our approach with extensive experiments on several real-world datasets, which demonstrates its efficiency and feasibility.

Sign in / Sign up

Export Citation Format

Share Document