• Title/Summary/Keyword: Residual Network

Search Result 463, Processing Time 0.029 seconds

Energy-Aware Data Compression and Transmission Range Control Scheme for Energy-Harvesting Wireless Sensor Networks (에너지 수집형 무선 센서 네트워크를 위한 에너지 적응형 데이터 압축 및 전송 범위 결정 기법)

  • Yi, Jun Min;Oh, Eomji;Noh, Dong Kun;Yoon, Ikjune
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.11 no.4
    • /
    • pp.243-249
    • /
    • 2016
  • Energy-harvesting nodes in wireless sensor networks(WSNs) can be exhausted due to a heavy workload even though they can harvest energy from their environment. On contrast, they can sometimes fully charged, thus waste the harvested energy due to the limited battery-capacity. In order to utilize the harvested energy efficiently, we introduce a selective data compression and transmission range control scheme for energy-harvesting nodes. In this scheme, if the residual energy of a node is expected to run over the battery capacity, the node spends the surplus energy to exploit the data compression or the transmission range expansion; these operations can reduce the burden of intermediate nodes at the expanse of its own energy. Otherwise, the node performs only basic operations such as sensing or transmitting so as to avoid its blackout time. Simulation result verifies that the proposed scheme gathers more data with fewer number of blackout nodes than other schemes by consuming energy efficiently.

Neighbor Gradient-based Multicast Routing for Service-Oriented Applications

  • Wang, Hui;Mao, Jianbiao;Li, Tao;Sun, Zhigang;Gong, Zhenghu;Lv, Gaofeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.9
    • /
    • pp.2231-2252
    • /
    • 2012
  • With the prevalence of diverse services-oriented applications, such as IPTV systems and on-line games, the current underlying communication networks face more and more challenges on the aspects of flexibility and adaptability. Therefore, an effective and efficient multicast routing mechanism, which can fulfill different requirements of different personalized services, is critical and significant. In this paper, we first define the neighbor gradient, which is calculated based on the weighted sum of attributes such as residual link capacity, normalized hop count, etc. Then two distributed multicast routing algorithms which are neighbor Gradient-based Multicast Routing for Static multicast membership (GMR-S) and neighbor Gradient-based Multicast Routing for Dynamic multicast membership (GMR-D), are proposed. GMR-S is suitable for static membership situation, while GMR-D can be used for the dynamic membership network environment. Experimental results demonstrate the effectiveness and efficiency of our proposed methods.

GAN-based shadow removal using context information

  • Yoon, Hee-jin;Kim, Kang-jik;Chun, Jun-chul
    • Journal of Internet Computing and Services
    • /
    • v.20 no.6
    • /
    • pp.29-36
    • /
    • 2019
  • When dealing with outdoor images in a variety of computer vision applications, the presence of shadow degrades performance. In order to understand the information occluded by shadow, it is essential to remove the shadow. To solve this problem, in many studies, involves a two-step process of shadow detection and removal. However, the field of shadow detection based on CNN has greatly improved, but the field of shadow removal has been difficult because it needs to be restored after removing the shadow. In this paper, it is assumed that shadow is detected, and shadow-less image is generated by using original image and shadow mask. In previous methods, based on CGAN, the image created by the generator was learned from only the aspect of the image patch in the adversarial learning through the discriminator. In the contrast, we propose a novel method using a discriminator that judges both the whole image and the local patch at the same time. We not only use the residual generator to produce high quality images, but we also use joint loss, which combines reconstruction loss and GAN loss for training stability. To evaluate our approach, we used an ISTD datasets consisting of a single image. The images generated by our approach show sharp and restored detailed information compared to previous methods.

A Cluster-based Routing Protocol with Energy Consumption Balance in Distributed Wireless Sensor Networks (분산 무선센서 네트워크의 클러스터-기반 에너지 소비 균형 라우팅 프로토콜)

  • Kim, Tae-Hyo;Ju, Yeon-Jeong;Oh, Ho-Suck;Kim, Min-Kyu;Jung, Yong-Bae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.15 no.4
    • /
    • pp.155-161
    • /
    • 2014
  • In this paper, a cluster-based routing protocol in distributed sensor network is proposed, which enable the balanced energy consumption in the sensor nodes densely deployed in the sensor fields. This routing protocol is implemented based on clusters with hierarchical scheme. The clusters are formed by the closely located sensor nodes. A cluster node with maximum residual energy in the cluster, can be selected as cluster head node. In routing, one of the nodes in the intersection area between two clusters is selected as a relay-node and this method can extend the lifetime of all the sensor nodes in view of the balanced consumption of communication energy.

Development of ResNet-based WBC Classification Algorithm Using Super-pixel Image Segmentation

  • Lee, Kyu-Man;Kang, Soon-Ah
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.4
    • /
    • pp.147-153
    • /
    • 2018
  • In this paper, we propose an efficient WBC 14-Diff classification which performs using the WBC-ResNet-152, a type of CNN model. The main point of view is to use Super-pixel for the segmentation of the image of WBC, and to use ResNet for the classification of WBC. A total of 136,164 blood image samples (224x224) were grouped for image segmentation, training, training verification, and final test performance analysis. Image segmentation using super-pixels have different number of images for each classes, so weighted average was applied and therefore image segmentation error was low at 7.23%. Using the training data-set for training 50 times, and using soft-max classifier, TPR average of 80.3% for the training set of 8,827 images was achieved. Based on this, using verification data-set of 21,437 images, 14-Diff classification TPR average of normal WBCs were at 93.4% and TPR average of abnormal WBCs were at 83.3%. The result and methodology of this research demonstrates the usefulness of artificial intelligence technology in the blood cell image classification field. WBC-ResNet-152 based morphology approach is shown to be meaningful and worthwhile method. And based on stored medical data, in-depth diagnosis and early detection of curable diseases is expected to improve the quality of treatment.

A Routing Protocol for Improving Path Stability in Mobile Ad-hoc Networks (애드혹 네트워크에서 경로 안정성 향상을 위한 라우팅 프로토콜)

  • Kim, Hyungjik;Choi, Sunwoong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.7
    • /
    • pp.1561-1567
    • /
    • 2015
  • Nodes of Mobile ad-hoc network usually use the energy-limited battery. Balanced energy consumptionis important to maintain path's stability. In this paper, we focus on improving the stability of the routing path in mobile ad-hoc networks. For that purpose, we propose a new routing protocol to find the highest minimum node residual energy path among shortest paths. The largest path of minimum value of the remain energy has a longer life than other paths to improve the reliability to data-transmission. Using ns-3 simulator, we show that the proposed routing protocol can provide more long-life stable routing path than AODV and EA-AODV.

Performance Evaluation of k-means and k-medoids in WSN Routing Protocols

  • SeaYoung, Park;Dai Yeol, Yun;Chi-Gon, Hwang;Daesung, Lee
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.4
    • /
    • pp.259-264
    • /
    • 2022
  • In wireless sensor networks, sensor nodes are often deployed in large numbers in places that are difficult for humans to access. However, the energy of the sensor node is limited. Therefore, one of the most important considerations when designing routing protocols in wireless sensor networks is minimizing the energy consumption of each sensor node. When the energy of a wireless sensor node is exhausted, the node can no longer be used. Various protocols are being designed to minimize energy consumption and maintain long-term network life. Therefore, we proposed KOCED, an optimal cluster K-means algorithm that considers the distances between cluster centers, nodes, and residual energies. I would like to perform a performance evaluation on the KOCED protocol. This is a study for energy efficiency and validation. The purpose of this study is to present performance evaluation factors by comparing the K-means algorithm and the K-medoids algorithm, one of the recently introduced machine learning techniques, with the KOCED protocol.

Buckling behavior of intermediate filaments based on Euler Bernoulli and Timoshenko beam theories

  • Muhammad Taj;Muzamal Hussain;Mohamed A. Khadimallah;Muhammad Safeer;S.R. Mahmoud;Zafer Iqbal;Mohamed R. Ali;Aqib Majeed;Abdelouahed Tounsi;Manzoor Ahmad
    • Advances in concrete construction
    • /
    • v.15 no.3
    • /
    • pp.171-178
    • /
    • 2023
  • Cytoskeleton components play key role in maintaining cell structure and in giving shape to the cell. These components include microtubules, microfilaments and intermediate filaments. Among these filaments intermediate filaments are the most rigid and bear large compressive force. Actually, these filaments are surrounded by other filaments like microtubules and microfilaments. This network of filaments makes a layer as a surface on intermediate filaments that have great impact on buckling behavior of intermediate filaments. In the present article, buckling behavior of intermediate filaments is studied by taking into account the effects of surface by using Euler Bernoulli and Timoshenko beam theories. It is found that effects of surface greatly affect the critical buckling force of intermediate filaments. Further, it is observed that the critical buckling force is inversely proportional to the length of filament. Such types of observations are helpful for further analysis of nanofibrous in their actual environments within the cell.

Residual Convolutional Recurrent Neural Network-Based Sound Event Classification Applicable to Broadcast Captioning Services (자막방송을 위한 잔차 합성곱 순환 신경망 기반 음향 사건 분류)

  • Kim, Nam Kyun;Kim, Hong Kook;Ahn, Chung Hyun
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2021.06a
    • /
    • pp.26-27
    • /
    • 2021
  • 본 논문에서는 자막방송 제공을 위해 방송콘텐츠를 이해하는 방법으로 잔차 합성곱 순환신경망 기반 음향 사건 분류 기법을 제안한다. 제안된 기법은 잔차 합성곱 신경망과 순환 신경망을 연결한 구조를 갖는다. 신경망의 입력 특징으로는 멜-필터벵크 특징을 활용하고, 잔차 합성곱 신경망은 하나의 스템 블록과 5개의 잔차 합성곱 신경망으로 구성된다. 잔차 합성곱 신경망은 잔차 학습으로 구성된 합성곱 신경망과 기존의 합성곱 신경망 대비 특징맵의 표현 능력 향상을 위해 합성곱 블록 주의 모듈로 구성한다. 추출된 특징맵은 순환 신경망에 연결되고, 최종적으로 음향 사건 종류와 시간정보를 추출하는 완전연결층으로 연결되는 구조를 활용한다. 제안된 모델 훈련을 위해 라벨링되지 않는 데이터 활용이 가능한 평균 교사 모델을 기반으로 훈련하였다. 제안된 모델의 성능평가를 위해 DCASE 2020 챌린지 Task 4 데이터 셋을 활용하였으며, 성능 평가 결과 46.8%의 이벤트 단위의 F1-score를 얻을 수 있었다.

  • PDF

Cascaded-Hop For DeepFake Videos Detection

  • Zhang, Dengyong;Wu, Pengjie;Li, Feng;Zhu, Wenjie;Sheng, Victor S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.5
    • /
    • pp.1671-1686
    • /
    • 2022
  • Face manipulation tools represented by Deepfake have threatened the security of people's biological identity information. Particularly, manipulation tools with deep learning technology have brought great challenges to Deepfake detection. There are many solutions for Deepfake detection based on traditional machine learning and advanced deep learning. However, those solutions of detectors almost have problems of poor performance when evaluated on different quality datasets. In this paper, for the sake of making high-quality Deepfake datasets, we provide a preprocessing method based on the image pixel matrix feature to eliminate similar images and the residual channel attention network (RCAN) to resize the scale of images. Significantly, we also describe a Deepfake detector named Cascaded-Hop which is based on the PixelHop++ system and the successive subspace learning (SSL) model. By feeding the preprocessed datasets, Cascaded-Hop achieves a good classification result on different manipulation types and multiple quality datasets. According to the experiment on FaceForensics++ and Celeb-DF, the AUC (area under curve) results of our proposed methods are comparable to the state-of-the-art models.