• Title/Summary/Keyword: 노드정보

Search Result 5,899, Processing Time 0.033 seconds

PCA 알고리즘과 개선된 퍼지 신경망을 이용한 여권 인식 및 얼굴 인증

  • Jung Byung-Hee;Park Choong-Shik;Kim Kwang-Baek
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2006.06a
    • /
    • pp.336-343
    • /
    • 2006
  • 본 논문에서는 여권 영 상에서 PCA 알고리즘을 이용한 얼굴 인증과 개선된 퍼지 신경망을 이용한 여권 코드 인식 방법을 제안한다. 본 논문에서는 여권영상에 대해 소벨 연산자를 이용하여 에지를 추출하고 에지가 추출된 영상을 수평 스미어링하여 여권코드 영역을 추출한다. 추출된 여권 코드 영역의 기울기를 검사하여 기울기 보정을 하고, 여권 코드 영역을 이진화 한다. 이진화된 여권 코드 영역에 대하여 8방향윤곽선 추적 알고리즘을 적용하여 여권 코드를 추출한다. 추출된 여권 코드는 퍼지 신경망을 개선하여 여권 코드 인식에 적용한다. 개선된 퍼지 신경 망은 입력층과 중간층 사이의 학습 구조로는 FCM 클러스터링 알고리즘을 적용하고 중간층과 출력층 사이의 학습은 일반화된 델타학습 방법을 적용한다. 그리고 학습 성능을 개선하기 위하여 중간층과 출력층의 가중치 조정에 적용되는 학습률을 동적으로 조정하기 위해 퍼지 제어 시스템을 적용한다. 제안된 퍼지 신경망은 목표값과 출력값의 차이에 대한 절대값이 ${\epsilon}$ 보다 적거나 같으면 정확으로 분류하고 크면 부정확으로 분류하여 정확의 총 개수를 퍼지 제어 시스템에 적용하여 학습률과 모멘텀을 동적으로 조정한다. 여권의 주어진 규격에 근거하여 사진 영역을 추출하고 추출된 사진 영역에 대하여 YCbCr와 RGB 정보를 이용하여 얼굴영역을 추출한다. 추출된 얼굴 영역을 PCA 알고리즘과 스냅샷(Snap-Shot) 방법을 적용하여 얼굴 영역의 위조를 판별한다. 제안된 방법의 여권 코드 인식과 얼굴 인증의 성능을 평가하기 위하여 실제 여권 영상에 적용한 결과, 기존의 방법보다 여권 코드 인식과 얼굴 인증에 있어서 효율적인 것을 확인하였다.s, whereas AVs provide much better security.크는 기준년도부터 2031년까지 5년 단위로 계획된 장래도로를 반영하여 구축된다. 교통주제도 및 교통분석용 네트워크는 국가교통DB구축사업을 통해 구축된 자료로서 교통체계효율화법 제9조의4에 따라 공공기관이 교통정책 및 계획수립 등에 활용할 수 있도록 제공하고 있다. 건설교통부의 승인절차를 거쳐 제공하며 활용 후에는 갱신자료 및 활용결과를 통보하는 과정을 거치도록 되어있다. 교통주제도는 국가의 교통정책결정과 관련분야의 기초자료로서 다양하게 활용되고 있으며, 특히 ITS 노드/링크 기본지도로 활용되는 등 교통 분야의 중요한 지리정보로서 구축되고 있다..20{\pm}0.37L$, 72시간에 $1.33{\pm}0.33L$로 유의한 차이를 보였으므로(F=6.153, P=0.004), 술 후 폐환기능 회복에 효과가 있다. 4) 실험군과 대조군의 수술 후 노력성 폐활량은 수술 후 72시간에서 실험군이 $1.90{\pm}0.61L$, 대조군이 $1.51{\pm}0.38L$로 유의한 차이를 보였다(t=2.620, P=0.013). 5) 실험군과 대조군의 수술 후 일초 노력성 호기량은 수술 후 24시간에서 $1.33{\pm}0.56L,\;1.00{\ge}0.28L$로 유의한 차이를 보였고(t=2.530, P=0.017), 술 후 72시간에서 $1.72{\pm}0.65L,\;1.33{\pm}0.3L$로 유의한 차이를 보였다(t=2.540, P=0.016). 6) 대상자의 술 후 폐환기능에 영향을 미치는 요인은 성별로 나타났다. 이에 따

  • PDF

Geometrically and Topographically Consistent Map Conflation for Federal and Local Governments (Geometry 및 Topology측면에서 일관성을 유지한 방법을 이용한 연방과 지방정부의 공간데이터 융합)

  • Kang, Ho-Seok
    • Journal of the Korean Geographical Society
    • /
    • v.39 no.5 s.104
    • /
    • pp.804-818
    • /
    • 2004
  • As spatial data resources become more abundant, the potential for conflict among them increases. Those conflicts can exist between two or many spatial datasets covering the same area and categories. Therefore, it becomes increasingly important to be able to effectively relate these spatial data sources with others then create new spatial datasets with matching geometry and topology. One extensive spatial dataset is US Census Bureau's TIGER file, which includes census tracts, block groups, and blocks. At present, however, census maps often carry information that conflicts with municipally-maintained detailed spatial information. Therefore, in order to fully utilize census maps and their valuable demographic and economic information, the locational information of the census maps must be reconciled with the more accurate municipally-maintained reference maps and imagery. This paper formulates a conceptual framework and two map models of map conflation to make geometrically and topologically consistent source maps according to the reference maps. The first model is based on the cell model of map in which a map is a cell complex consisting of 0-cells, 1-cells, and 2-cells. The second map model is based on a different set of primitive objects that remain homeomorphic even after map generalization. A new hierarchical based map conflation is also presented to be incorporated with physical, logical, and mathematical boundary and to reduce the complexity and computational load. Map conflation principles with iteration are formulated and census maps are used as a conflation example. They consist of attribute embedding, find meaning node, cartographic 0-cell match, cartographic 1-cell match, and map transformation.

Design and Evaluation of an Edge-Fog Cloud-based Hierarchical Data Delivery Scheme for IoT Applications (사물인터넷 응용을 위한 에지-포그 클라우드 기반 계층적 데이터 전달 방법의 설계 및 평가)

  • Bae, Ihn-Han
    • Journal of Internet Computing and Services
    • /
    • v.19 no.1
    • /
    • pp.37-47
    • /
    • 2018
  • The number of capabilities of Internet of Things (IoT) devices will exponentially grow over the next years. These devices may generate a vast amount of time-constrained data. In the context of IoT, data management should act as a layer between the objects and devices generating the data and the applications accessing the data for analysis purposes and services. In addition, most of IoT services will be content-centric rather than host centric to increase the data availability and the efficiency of data delivery. IoT will enable all the communication devices to be interconnected and make the data generated by or associated with devices or objects globally accessible. Also, fog computing keeps data and computation close to end users at the edge of network, and thus provides a new breed of applications and services to end users with low latency, high bandwidth, and geographically distributed. In this paper, we propose Edge-Fog cloud-based Hierarchical Data Delivery ($EFcHD^2$) method that effectively and reliably delivers IoT data to associated with IoT applications with ensuring time sensitivity. The proposed $EFcHD^2$ method stands on basis of fully decentralized hybrid of Edge and Fog compute cloud model, Edge-Fog cloud, and uses information-centric networking and bloom filters. In addition, it stores the replica of IoT data or the pre-processed feature data by edge node in the appropriate locations of Edge-Fog cloud considering the characteristic of IoT data: locality, size, time sensitivity and popularity. Then, the performance of $EFcHD^2$ method is evaluated through an analytical model, and is compared to fog server-based and Content-Centric Networking (CCN)-based data delivery methods.

Design and Implementation of the Extended SLDS for Real-time Location Based Services (실시간 위치 기반 서비스를 위한 확장 SLDS 설계 및 구현)

  • Lee, Seung-Won;Kang, Hong-Koo;Hong, Dong-Suk;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.7 no.2 s.14
    • /
    • pp.47-56
    • /
    • 2005
  • Recently, with the rapid development of mobile computing, wireless positioning technologies, and the generalization of wireless internet, LBS (Location Based Service) which utilizes location information of moving objects is serving in many fields. In order to serve LBS efficiently, the location data server that periodically stores location data of moving objects is required. Formerly, GIS servers have been used to store location data of moving objects. However, GIS servers are not suitable to store location data of moving objects because it was designed to store static data. Therefore, in this paper, we designed and implemented an extended SLDS(Short-term Location Data Subsystem) for real-time Location Based Services. The extended SLDS is extended from the SLDS which is a subsystem of the GALIS(Gracefully Aging Location Information System) architecture that was proposed as a cluster-based distributed computing system architecture for managing location data of moving objects. The extended SLDS guarantees real-time service capabilities using the TMO(Time-triggered Message-triggered Object) programming scheme and efficiently manages large volume of location data through distributing moving object data over multiple nodes. The extended SLDS also has a little search and update overhead because of managing location data in main memory. In addition, we proved that the extended SLDS stores location data and performs load distribution more efficiently than the original SLDS through the performance evaluation.

  • PDF

A Study on building the KMS for development of the Leadership - Based on the Power Process Methord - (리더십 향상을 위한 지식경영시스템 구축방안 -POWER PROCESS를 중심으로)

  • Lee Byung-Ku;Lee Kyung-Hwan
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2006.05a
    • /
    • pp.351-367
    • /
    • 2006
  • 리더십에 관한 연구는 리더십 특성요인연구, 리더십 contingency 연구, 특성이론적 접근, 행동적 접근, 상황이론적 접근 등이 있으나, 이러한 접근방법이 언제나 긍정적인 리더십을 유발하는 것은 아닌 것으로 나타나고 있다. 따라서, 긍정적이고 일관된 리더십을 만들어 내기 위해서는 리더십에 대한 새로운 접근이 요청된다. 리더십에 대한 연구는 매우 다양하게 나타나고 있으나, 문헌연구에서 볼 때 리더십은 파워라는 공통 요소를 가지고 있다. 파워는 사람으로 하여금 목적지향적인 행동을 유발하는 능력이며, 문헌에 나타난 리더십의 개념은 조직구성원으로 하여금 목적지향적인 행동을 하게하는 능력이다. 따라서, 리더십은 권력의 한 유형으로 볼 수 있다. 그러므로, 본 연구에서는 리더십을 power process에 기초한 권력순환적 관점에서 연구하고자 한다. Power process는 권력요소, 가치, 욕구, 환경, 관계의 다섯 가지 권력결정요소들의 상호작용 과정이다. 이러한 상호작용을 통해서 power process는 권력의 원천을 창출하는데 이 원천에 의한 권력행사는 긍정적인 결과를 유발한다(이경환, 2001). 앞에서 지적한 바와 같이 리더십은 권력의 한 유형이므로, power process에 의한 리더십 행사를 실증연구를 함으로서 지식경영시스템 구축을 위한 요인을 제시하고자 한다. 본 실증적 연구에서 리더는 자신의 권력요소(타고난 능력, 소질, 경험 등=경영자특성)와 욕구, 가치(경영철학) 관계성 및 환경과 같은 파워결정요소(리더십 결정요소)의 상호작용을 통해 자신의 리더십 원천을 창출할 때 즉, power process를 통해 리더십을 행사할 때 이러한 리더십은 경영성과에 긍정적인 결과를 유발하는 것으로 나타났다. 그러므로, 리더십 성과 향상을 위한 지식경영정보시스템은 파워결정요소적 측면에서 고려되어야 할 것이다. 모델과 독립성 모델에서는 시스템 등급에 영향을 준다. 향후에는 더욱 더 다양한 상호의존 모델들이 정량화될 필요성이 있다고 본다. 진행하였다. 줄여서 보다 더 정확하고, 지능적인 규칙구성요소 추출 방법론을 제시하고 구현하여 지식관리자의 규칙습득에 대한 부담을 줄여 주고자 한다. 도움을 받을 수 있게 되었다.을 거치도록 되어있다. 교통주제도는 국가의 교통정책결정과 관련분야의 기초자료로서 다양하게 활용되고 있으며, 특히 ITS 노드/링크 기본지도로 활용되는 등 교통 분야의 중요한 지리정보로서 구축되고 있다..20{\pm}0.37L$, 72시간에 $1.33{\pm}0.33L$로 유의한 차이를 보였으므로(F=6.153, P=0.004), 술 후 폐환기능 회복에 효과가 있다. 4) 실험군과 대조군의 수술 후 노력성 폐활량은 수술 후 72시간에서 실험군이 $1.90{\pm}0.61L$, 대조군이 $1.51{\pm}0.38L$로 유의한 차이를 보였다(t=2.620, P=0.013). 5) 실험군과 대조군의 수술 후 일초 노력성 호기량은 수술 후 24시간에서 $1.33{\pm}0.56L,\;1.00{\ge}0.28L$로 유의한 차이를 보였고(t=2.530, P=0.017), 술 후 72시간에서 $1.72{\pm}0.65L,\;1.33{\pm}0.3L$로 유의한 차이를 보였다(t=2.540, P=0.016). 6) 대상자의 술 후 폐환기능에 영향을 미치는 요인은 성별로 나타났다. 이에 따른 폐환기능의 차이를 보면, 실험군의 술 후 노력성 폐활량이 48시간에 남자($1.78{\pm}0.61L$)가 여자($1.27{\pm}0.45L$)보다 더 높게 나타났으며 (t=2.170, P=0.042),

  • PDF

Continuous Moving Object Tracking Using Query Relaying in Tree-Based Sensor Network (트리 기반의 센서 네트워크에서 질의 중계를 통한 이동 객체의 연속적인 위치 획득 방안)

  • Kim, Sangdae;Kim, Cheonyong;Cho, Hyunchong;Yim, Yongbin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.5
    • /
    • pp.271-280
    • /
    • 2014
  • In wireless sensor networks, there have been two methods for sensing continuously moving object tracking: user-query based method and periodic report based method. Although the former method requires overhead for user query rather than the latter method, the former one is known as an energy-efficient method without transferring unnecessary information. In the former method, a virtual tree, consisting of sensor nodes, is exploited for the user querying and sensor reporting. The tree stores the information about mobile objects; the stored information is triggered to report by the user query. However, in case of fast moving object, the tracking accuracy reduces due to the time delay of end-to-end repeated query. To solve the problem, we propose a query relaying method reducing the time delay for mobile object tracking. In the proposed method, the nodes in the tree relay the query to the adjacent node according to the movement of mobile object tracking. Relaying the query message reduces the end-to-end querying time delay. Simulation results show that our method is superior to the existing ones in terms of tracking accuracy.

Design of WSN based Field Server for Local Weather Monitoring (국지기상 모니터링을 위한 WSN 기반 필드서버 제작)

  • An, Seong-Mo;Kim, Jae-Gyeong;Yoo, Jae-Ho;Jung, Sang-Joong;Chung, Wan-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.2
    • /
    • pp.493-500
    • /
    • 2011
  • Recently, there has been an increase in the number of disaster victims locally due to climate change and a variety of frequently occurring natural disasters. The damage caused by abrupt weather change in local area by typical weather forecasting techniques is very limited and difficult. Recently local area weather monitoring system using wireless sensor network technology has been very actively studied. Thus an IEEE 802.15.4-based weather field server to measure and monitor the local weather changes was designed and developed in this study. The proposed weather field server utilizes a wireless sensor node and weather sensors to collect weather information such as temperature, humidity, illumination, dew point, barometric pressure, and water level. The integrated weather sensor board was designed to respond quickly to weather changes, and provide feedback to the server PC. Each weather information is analyzed in the server PC to establish a program to monitor and analyze the local area or the area of abrupt climate change in order to provide warning signals in case of disaster events in local.

An Improvement in K-NN Graph Construction using re-grouping with Locality Sensitive Hashing on MapReduce (MapReduce 환경에서 재그룹핑을 이용한 Locality Sensitive Hashing 기반의 K-Nearest Neighbor 그래프 생성 알고리즘의 개선)

  • Lee, Inhoe;Oh, Hyesung;Kim, Hyoung-Joo
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.11
    • /
    • pp.681-688
    • /
    • 2015
  • The k nearest neighbor (k-NN) graph construction is an important operation with many web-related applications, including collaborative filtering, similarity search, and many others in data mining and machine learning. Despite its many elegant properties, the brute force k-NN graph construction method has a computational complexity of $O(n^2)$, which is prohibitive for large scale data sets. Thus, (Key, Value)-based distributed framework, MapReduce, is gaining increasingly widespread use in Locality Sensitive Hashing which is efficient for high-dimension and sparse data. Based on the two-stage strategy, we engage the locality sensitive hashing technique to divide users into small subsets, and then calculate similarity between pairs in the small subsets using a brute force method on MapReduce. Specifically, generating a candidate group stage is important since brute-force calculation is performed in the following step. However, existing methods do not prevent large candidate groups. In this paper, we proposed an efficient algorithm for approximate k-NN graph construction by regrouping candidate groups. Experimental results show that our approach is more effective than existing methods in terms of graph accuracy and scan rate.

An Enhanced WLAN MAC Protocol for Directional Broadcast (지향성 브로드캐스트를 위한 무선 LAN MAC 프로토콜)

  • Cha, Woo-Suk;Cho, Gi-Hwan
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.1
    • /
    • pp.16-27
    • /
    • 2006
  • The wireless transmission medium inherently broadcasts a signal to all neighbor nodes in the transmission range. Existing asynchronous MAC protocols do not provide a concrete solution for reliable broadcast in link layer. This mainly comes from that an omni-directional broadcasting causes to reduce the network performance due to the explosive collisions and contentions. This paper proposes a reliable broadcast protocol in link taller based on directional antennas, named MDB(MAC protocol for Directional Broadcasting). This protocol makes use of DAST(Directional Antennas Statement Table) information and D-MACA(Directional Multiple Access and Collision Avoidance) scheme through 4-way handshake to resolve the many collision problem wit]1 omni-directional antenna. To analyze its performance, MDB protocol is compared with IEEE 802.11 DCF protocol [9] and the protocol 2 of reference [3], in terms of the success rate of broadcast and the collision rate. As a result of performance analysis through simulation, it was confirmed that the collision rate of the MDB protocol is lower than those of IEEE 802.11 and the protocol 2 of reference [3], and that the completion rate of broadcast of MDB protocol is higher than those of IEEE 802.11 and the protocol 2 of reference [3].

Privacy-Preserving Parallel Range Query Processing Algorithm Based on Data Filtering in Cloud Computing (클라우드 컴퓨팅에서 프라이버시 보호를 지원하는 데이터 필터링 기반 병렬 영역 질의 처리 알고리즘)

  • Kim, Hyeong Jin;Chang, Jae-Woo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.9
    • /
    • pp.243-250
    • /
    • 2021
  • Recently, with the development of cloud computing, interest in database outsourcing is increasing. However, when the database is outsourced, there is a problem in that the information of the data owner is exposed to internal and external attackers. Therefore, in this paper, we propose a parallel range query processing algorithm that supports privacy protection. The proposed algorithm uses the Paillier encryption system to support data protection, query protection, and access pattern protection. To reduce the operation cost of a checking protocol (SRO) for overlapping regions in the existing algorithm, the efficiency of the SRO protocol is improved through a garbled circuit. The proposed parallel range query processing algorithm is largely composed of two steps. It consists of a parallel kd-tree search step that searches the kd-tree in parallel and safely extracts the data of the leaf node including the query, and a parallel data search step through multiple threads for retrieving the data included in the query area. On the other hand, the proposed algorithm provides high query processing performance through parallelization of secure protocols and index search. We show that the performance of the proposed parallel range query processing algorithm increases in proportion to the number of threads and the proposed algorithm shows performance improvement by about 5 times compared with the existing algorithm.