• 대한임베디드공학회논문지
• /
• 제17권6호
• /
• pp.309-317
• /
• 2022

In this paper, we propose a machine learning-based copy-move forgery detection network with dual branches. Because the rotation or scaling operation is frequently involved in copy-move forger, the conventional convolutional neural network is not effectively applied in detecting copy-move tampering. Therefore, we divide the input into rotation-invariant and scaling-invariant features based on the wavelet coefficients. Each of the features is input to different branches having the same structure, and is fused in the combination module. Each branch comprises feature extraction, correlation, and mask decoder modules. In the proposed network, VGG16 is used for the feature extraction module. To check similarity of features generated by the feature extraction module, the conventional correlation module used. Finally, the mask decoder model is applied to develop a pixel-level localization map. We perform experiments on test dataset and compare the proposed method with state-of-the-art tampering localization methods. The results demonstrate that the proposed scheme outperforms the existing approaches.

• 전기학회논문지
• /
• 제67권12호
• /
• pp.1657-1664
• /
• 2018

This paper proposes a decision making scheme for choosing the best move at each state of game in order to implement an artificial intelligence othello game player. The proposed decision making scheme predicts the various possible states of the game when the game has progressed from the current state, evaluates the degree of possibility of winning or losing the game at the states, and searches the best move based on the evaluation. In this paper, we generate learning data by decomposing the records of professional players' real game into states, matching and accumulating winning points to the states, and using the Artificial Neural Network that learned them, we evaluated the value of each predicted state and applied the Minimax search to determine the best move. We implemented an artificial intelligence player of the Othello game by applying the proposed scheme and evaluated the performance of the game player through games with three different artificial intelligence players.

• ETRI Journal
• /
• 제37권2호
• /
• pp.262-272
• /
• 2015

In particular, for a practical mobile robot team to perform such a task as that of carrying out a search and rescue mission in a disaster area, the network connectivity and localization have to be guaranteed even in an environment where the network infrastructure is destroyed or a Global Positioning System is unavailable. This paper proposes the new collective intelligence network management architecture of multiple mobile robots supporting seamless network connectivity and cooperative localization. The proposed architecture includes a resource manager that makes the robots move around and not disconnect from the network link by considering the strength of the network signal and link quality. The location manager in the architecture supports localizing robots seamlessly by finding the relative locations of the robots as they move from a global outdoor environment to a local indoor position. The proposed schemes assuring network connectivity and localization were validated through numerical simulations and applied to a search and rescue robot team.

• 한국인터넷방송통신학회논문지
• /
• 제15권1호
• /
• pp.147-155
• /
• 2015

본 논문에서는 인력이 접근하기 힘든 오염지역 감시를 위하여 다수 무인기 기반 이동센서네트워크를 고려한다. 개별 무인기의 센싱 범위는 제한되어 있으므로 효과적인 지역 감시를 위해서는 무인기가 서로 협력하여 효과적인 센싱 커버리지를 획득하고 보다 많은 유해물질이 검출되는 지점으로 이동할 수 있어야 한다. 본 논문에서는 센싱 및 통신 거리의 제약을 극복하기 위하여 가상력 기반의 알고리즘을 이용하는 감시 네트워크를 제안하고 테스트베드를 구축한다. 감시 네트워크에서 각 무인기는 이웃 무인기의 센싱값과 위치 정보를 바탕으로 최적 커버리지를 획득하고 감시 지역의 센싱 최대치 지점으로 이동하게 된다. 야외 테스트베드를 이용한 시험을 통해 제안하는 유해 물질 감시 센서 네트워크는 오염 지역에 자발적 접근이 가능하고 높은 가중 커버리지(Weighted Coverage) 획득이 가능함을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권12호
• /
• pp.5442-5463
• /
• 2016

Designing efficient routing protocols for a wireless sensor network with mobile sinks (mWSN) is a challenging task since the network topology and data paths change frequently as sink nodes move. In this paper, we design a novel lightweight reactive ring based routing protocol called R3, which removes the need of proactively maintaining data paths to mobile sinks as they move in the network. To achieve high packet delivery ratio and low transmission cost, R3 combines ring based forwarding and trail based forwarding together. To support efficient ring based forwarding, we build a ring based structure for a network in a way such that each node in the network can easily obtain its ring ID and virtual angle information. For this purpose, we artificially create a virtual hole in the central area of the network and accordingly find a shortest cycled path enclosing the hole, which serves as base ring and is used for generating the remaining ring based structure. We accordingly present the detailed design description for R3, which only requires each node to keep very limited routing information. We derive the communication overhead by ring based forwarding. Extensive simulation results show that R3 can achieve high routing performance as compared with existing work.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1936-1939
• /
• 2002

Much recent attention on wireless technologies s put on topology-less wireless network, in which all nodes an be mobile and can communicate over wireless links, due to its ease of deployment, high flexibility and low expenses. One key in topology-less wireless network is mobile base stations (MBSs), which provides access points or mobile terminals (MTs) to wireless backbone network. MBSs can move to anywhere in accordance with changes in geographical distribution of MTs. They serve as dynamic odes. However, in order to utilize network resources and take full advantage of this topology-less network, MBSs must move to suitable position according to the current tate of network use. Moreover, MBSs have to consider the distance among them to avoid the crash and gap area of MBSs. Therefore, this paper proposes MBS movement algorithm by implementing push-pull method to fulfill the corporation of MBSs and considering the center of covered MTs or centroid to satisfy the MT coverage. From the simulation results, the proposed algorithm increases the performance of system when comparing with the centroid-based algoriom〔7〕, such as coverage area, MT coverage and call drops rate.

• 제어로봇시스템학회논문지
• /
• 제12권5호
• /
• pp.473-479
• /
• 2006

A global path planning algorithm using modified self-organizing feature map(SOFM) which is a method among a number of neural network is presented. The SOFM uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified method in this research uses a predetermined initial weight vectors of the 2-dimensional mesh, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward the opposite direction of input vector. According to simulation results one can conclude that the modified neural network is useful tool for the global path planning problem of a mobile robot.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2006년도 Proceedings of ISRS 2006 PORSEC Volume II
• /
• pp.695-697
• /
• 2006

Elshayal $Smart{\copyright}$ software is an almost First Arabian GIS $software{\copyright}$ which completely developed by Arabian developers team and independent of any commercial software package. The software current Features are View and Edit shape files, build new layers, add existing layers, remove layers, swap layers, save layers, set layer data sources, layer properties, zoom in & zoom out, pan, identify, selecting features, invert selection, show data table, data query builder, location query builder, build network, find shortest path, print map, save map image, copy map image to clipboard, save project map, edit move vertex, edit move features, snap vertexes, set vertex XY, move settings, converting coordinate system, applying VB script, copy selected features to another layer, move selected features to another layer, delete selected features, edit data table, modify table structure, edit map features, drawing new features, GPS tracking, 3D view, etc... The software expected Features are: Viewing raster image and image geo-referencing, read other map formats such as DXF Format and Tiger Line Format.

• 융합보안논문지
• /
• 제11권4호
• /
• pp.11-17
• /
• 2011

본 논문에서는 IDC를 기반으로 한 FLV 동영상 솔루션을 Mini IPTV에 적용한 시스템 설계 및 구현을 제안한다. IDC의 에너지를 최소화하고, 자원 활용을 극대화시키는 Green Data Center로 설계하며, Mini IPTV의 다양한 콘텐츠를 서비스 공급자 및 네트워크 공급자가 네트워크를 통해 Mini IPTV 가입자에게 제공한다. 이때 FLV 솔루션 파일 포맷과 압축 기술을 이용해 동영상의 화질과 압축률을 개선하도록 구현함으로써, 트래픽 비용의 절감 및 보안 문제를 해결하고, 특히 웹에서 급속히 팽창하고 있는 e-Learning 분야에 활용하고자 한다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2004년도 추계학술대회
• /
• pp.817-822
• /
• 2004

This paper provides a global path planning method using self-organizing feature map which is a method among a number of neural network. The self-organizing feature map uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified method in this research uses a predetermined initial weight vectors, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. According to simulation results one can conclude that the modified neural network is useful tool for the global path planning problem of a mobile robot.