• Title/Summary/Keyword: Key point cluster

Search Result 27, Processing Time 0.029 seconds

Image Scale Prediction Using Key-point Clusters on Multi-scale Image Space (다중 스케일 영상 공간에서 특징점 클러스터를 이용한 영상스케일 예측)

  • Ryu, kwon-Yeal
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.19 no.1
    • /
    • pp.1-6
    • /
    • 2018
  • In this paper, we propose the method to eliminate repetitive processes for key-point detection on multi-scale image space. The proposed method detects key-points from the original image, and select a good key-points using the cluster filters, and create the key-point clusters. And it select reference objects by using direction angles of the key-point clusters, predict the scale of the original image by using the distributed distance ratio. It transform the scale of the reference image, and apply the detection of key-points to the transformed reference image. In the results of the experiment, the proposed method can be found to improve the key-points detection time by 75 % and 71 % compared to SIFT method and scaled ORB method using the multi-scale images.

Molecular dynamics simulation of primary irradiation damage in Ti-6Al-4V alloys

  • Tengwu He;Xipeng Li;Yuming Qi;Min Zhao;Miaolin Feng
    • Nuclear Engineering and Technology
    • /
    • v.56 no.4
    • /
    • pp.1480-1489
    • /
    • 2024
  • Displacement cascade behaviors of Ti-6Al-4V alloys are investigated using molecular dynamics (MD) simulation. The embedded atom method (EAM) potential including Ti, Al and V elements is modified by adding Ziegler-Biersack-Littmark (ZBL) potential to describe the short-range interaction among different atoms. The time evolution of displacement cascades at the atomic scale is quantitatively evaluated with the energy of primary knock-on atom (PKA) ranging from 0.5 keV to 15 keV, and that for pure Ti is also computed as a comparison. The effects of temperature and incident direction of PKA are studied in detail. The results show that the temperature reduces the number of surviving Frenkel pairs (FPs), and the incident direction of PKA shows little correlation with them. Furthermore, the increasing temperature promotes the point defects to form clusters but reduces the number of defects due to the accelerated recombination of vacancies and interstitial atoms at relatively high temperature. The cluster fractions of interstitials and vacancies both increase with the PKA energy, whereas the increase of interstitial cluster is slightly larger due to their higher mobility. Compared to pure Ti, the presence of Al and V is beneficial to the formation of interstitial clusters and indirectly hinders the production of vacancy clusters.

An Energy Efficient Group-Based Cluster Key Management for Large Scale Sensor Networks (대규모 센서 네트워크에서 그룹을 기반으로 한 에너지 효율적인 클러스터키 관리 방안)

  • Kim, Jin-Su
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.11
    • /
    • pp.5487-5495
    • /
    • 2012
  • The important issue that applies security key are secure rekeying, processing time and cost reduction. Because of sensor node's limited energy, energy consumption for rekeying affects lifetime of network. Thus it is necessary a secure and efficient security key management method. In this paper, I propose an energy efficient group-based cluster key management (EEGCK) in the large scale sensor networks. EEGCK uses five security key for efficient key management and different polynomial degree using security fitness function of sector, cluster and group is applied for rekeying and security processing. Through both analysis and simulation, I also show that proposed EEGCK is better than previous security management method at point of network energy efficiency.

CONVERGENCE OF PREFILTER BASE ON THE FUZZY SET

  • Kim, Young-Key;Byun, Hee-Young
    • Korean Journal of Mathematics
    • /
    • v.10 no.1
    • /
    • pp.5-10
    • /
    • 2002
  • In this paper, we investigate the prefilter base on a fuzzy set and fuzzy net ${\varphi}$ on the fuzzy topological space (X,${\delta}$). And we show that the prefilter base $\mathcal{B}({\varphi})$ determines by the fuzzy net ${\varphi}$ converge to a fuzzy point $p$ iff the fuzzy net ${\varphi}$ converge to a fuzzy point $p$. Also we prove that if the prefilter base $\mathcal{B}$ converge to a fuzzy point $p$, then the $\mathcal{B}$ has the cluster point $p$.

  • PDF

Multiscale Modeling of Radiation Damage: Radiation Hardening of Pressure Vessel Steel

  • Kwon Junhyun;Kwon Sang Chul;Hong Jun-Hwa
    • Nuclear Engineering and Technology
    • /
    • v.36 no.3
    • /
    • pp.229-236
    • /
    • 2004
  • Radiation hardening is a multiscale phenomenon involving various processes over a wide range of time and length. We present a multiscale model for estimating the amount of radiation hardening in pressure vessel steel in the environment of a light water reactor. The model comprises two main parts: molecular dynamics (MD) simulation and a point defect cluster (PDC) model. The MD simulation was used to investigate the primary damage caused by displacement cascades. The PDC model mathematically formulates interactions between point defects and their clusters, which explains the evolution of microstructures. We then used a dislocation barrier model to calculate the hardening due to the PDCs. The key input for this multiscale model is a neutron spectrum at the inner surface of reactor pressure vessel steel of the Younggwang Nuclear Power Plant No.5. A combined calculation from the MD simulation and the PDC model provides a convenient tool for estimating the amount of radiation hardening.

Examining the Potentialities for Building Fisheries Cluster in Regional Level (지역별 수산업 클러스터 형성가능성 검토)

  • Choe, Sung-Ae;Chae, Dong-Ryul
    • The Journal of Fisheries Business Administration
    • /
    • v.40 no.3
    • /
    • pp.1-28
    • /
    • 2009
  • In recent, the Korean fisheries industry face an overall crisis. Annual fish catch is continuously decreasing for last two decades even though various programs to improve fish population. Moreover, domestic fish market is more and more occupied by imported cheap fish products from abroad due to the consequence of open economic policy, FTA and WTO/DDA entente. Under the circumstances, this study aims to examine the potential for building fisheries cluster as a policy tool to promote fisheries and fisheries-associated industries in Korea. To achieve this goal, the authors firstly reviewed the theoretical concept of Industrial Cluster in the evolutionary economics point of view, secondly, analyzed the main components of Porterian Cluster(or innovation cluster), thirdly, derived the key reasons to induce the improvement of productivity within the cluster network system and lastly evaluated fisheries capability and industrial infrastructures of each province as a basic condition to build a fisheries cluster. The result of the study demonstrates the voluntary accumulation of fish products and processing techniques in Korea, however, it is not enough to make up a Porterian innovation. Therefore, the present is most opportune for applying fisheries cluster as a strategic policy tool. Government supports to establish innovation cluster for fisheries may contribute both fisheries industry and local economy by developing the latent capacity of fisheries and helping concentrate innovation capabilities.

  • PDF

Sensor network key establishment mechanism depending on depending information (배치정보를 이용한 클러스터 기반 센서 네트워크 키 설정 메커니즘)

  • Doh In-Shil;Chae Ki-Joon;Kim Ho-Won
    • The KIPS Transactions:PartC
    • /
    • v.13C no.2 s.105
    • /
    • pp.195-202
    • /
    • 2006
  • For applying sensor networking technology for our daily life, security service is essential, and pairwise key establishment is the key point for security. In this paper, we propose fairwise key establishment mechanism for secure coumunication in sensor networks. In the mechanism, we cluster the network field before deployment and predistribute key materials to normal sensor nodes and clusterheads. For clusterheads, more key materials are predistributed, and after deployment, sensor nodes which need to establish pairwise keys with other sensor nodes in different clusters make request for related key materials to their own clusterheads. Our proposal reduces the memory requirements for normal sensor nodes by distributing more information to clusterheads, and it raises the security level and resilience against node captures. In addition, it guarantees perfect pairwise key establishments for every pair of neighboring nodes and provides efficient and secure sensor communications.

A Group Key Management Scheme for WSN Based on Lagrange Interpolation Polynomial Characteristic

  • Wang, Xiaogang;Shi, Weiren;Liu, Dan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3690-3713
    • /
    • 2019
  • According to the main group key management schemes logical key hierarchy (LKH), exclusion basis systems (EBS) and other group key schemes are limited in network structure, collusion attack, high energy consumption, and the single point of failure, this paper presents a group key management scheme for wireless sensor networks based on Lagrange interpolation polynomial characteristic (AGKMS). That Chinese remainder theorem is turned into a Lagrange interpolation polynomial based on the function property of Chinese remainder theorem firstly. And then the base station (BS) generates a Lagrange interpolation polynomial function f(x) and turns it to be a mix-function f(x)' based on the key information m(i) of node i. In the end, node i can obtain the group key K by receiving the message f(m(i))' from the cluster head node j. The analysis results of safety performance show that AGKMS has good network security, key independence, anti-capture, low storage cost, low computation cost, and good scalability.

Road points Extracting from LiDAR data with Clustering Method (자료 군집화에 의한 LiDAR 자료의 도로포인트 추출기법 연구)

  • Jang, Young-Woon;Choi, Nea-In;Im, Seung-Hyeon;Cho, Gi-Sung
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2007.04a
    • /
    • pp.121-125
    • /
    • 2007
  • Recently, constructing and complementing the road network database are a main key in all social operation in our life. However it needs high expenses for constructing and complementing the data, and relies on many people for finishing the tasks. This study propose a novel method to extract urban road networks from 3-D LiDAR data automatically. This method integrates height, reflectance, and clustered road point information. Geometric information of general roads is also applied to cluster road points group correctly. The proposed method has been tested on various urban areas which contain complicated road networks. The results conclude that the integration of height, reflectance, and geometric information worked reliably to cluster road points.

  • PDF

An Efficient Cluster Routing Protocol Based on 2-level Tree for Wireless Ad Hoc Networks (무선 애드 혹 네트워크에서 에너지 효율적인 2-level 트리 기반의 클러스터 라우팅 프로토콜)

  • Lee, Young Joon;Kim, Sung Chun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.5
    • /
    • pp.155-162
    • /
    • 2014
  • We proposed a 2 level tree based cluster based routing protocol for mobile ad hoc networks. it is our crucial goal to establish improved clustering's structure in order to extend average node life-time and elevate the average packet delivery ratio. Because of insufficient wireless resources and energy, the method to form and manage clusters is useful for increasing network stability. but cluster-head fulfills roles as a host and a router in clustering protocol of Ad hoc networks environment. Therefore energy exhaustion of cluster-head causes communication interruption phenomenon. Effective management of cluster-head is key-point which determines the entire network performance. The scheme focuses on improving the performance the life time of the network and throughput through the management of cluster-heads and its neighbor nodes. In simulation, we demonstrated that it would obtain averagely better 17% performance than LS2RP.