• Title/Summary/Keyword: closest distance

Search Result 187, Processing Time 0.024 seconds

Road network data matching using the network division technique (네트워크 분할 기법을 이용한 도로 네트워크 데이터 정합)

  • Huh, Yong;Son, Whamin;Lee, Jeabin
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.31 no.4
    • /
    • pp.285-292
    • /
    • 2013
  • This study proposes a network matching method based on a network division technique. The proposed method generates polygons surrounded by links of the original network dataset, and detects corresponding polygon group pairs using a intersection-based graph clustering. Then corresponding sub-network pairs are obtained from the polygon group pairs. To perform the geometric correction between them, the Iterative Closest Points algorithm is applied to the nodes of each corresponding sub-networks pair. Finally, Hausdorff distance analysis is applied to find link pairs of networks. To assess the feasibility of the algorithm, we apply it to the networks from the KTDB center and commercial CNS company. In the experiments, several Hausdorff distance thresholds from 3m to 18m with 3m intervals are tested and, finally, we can get the F-measure of 0.99 when using the threshold of 15m.

Analysis Of Spatial Impact With Seoul Subway Line 7 Construction (지하철 건설에 따른 공간적 영향 분석 - 서울 지하철 7호선의 아파트가격에 미친 영향을 중심으로 -)

  • 여홍구;최창식
    • Journal of the Korean Society for Railway
    • /
    • v.7 no.2
    • /
    • pp.155-162
    • /
    • 2004
  • In order to account for a price variation of apartment that places near a newly constructed subway station, a spatial hedonic model was developed to examine spacial characteristics that affect a purchasing price of an apartment using a White Estimator. In particular, the paper aims to examine various effects of subway 7 construction on an apartment price in Seoul Metropolitan Area. As explanatory variables, an apartment size, distance to a closest subway station, distance to the Central Business District (CBD) of Seoul, the number of years after building, and a lagged variable of the apartment purchasing price were used. The lagged variable plays a role of representing a spatial weighted average of previous prices of other apartments that locate within 3 km from the apartment. For a precise study, an entire sample was divided into two sets, southern area and southwestern area of Seoul, and two different spatial hedonic models were estimated. Not only before and after analysis, but also with and without analysis were conducted to compare with different effects of the spatial characteristics of two areas. The results show that before the construction of the subway 7, the prices of the apartments in the southern area were more sensitive to the apartment size, the distance to a closest subway station, the distance to the CBD, and the prices of the other apartments locating within 3km rather than those in the southwestern area. After the construction, on contrast, it is found that the apartment purchasing prices in the southwestern area are more sensitive than those in the southern area due to people's expectation regarding a new development around the subway station. In addition, the prices of the apartments locating closely with a transfer station are more likely to go up by increase in the apartment size, the distance to the station, and the prices of the other apartments within 3 km. Compared with the negative effects of the distance to the station on the prices in the other models, the positive effect of the distance to the transfer station might be caused by the characteristics of commercial area in which people are not likely to live.

Personal Identification Based on Radio Signal Strength for Ubiquitous Healthcare Systems

  • Lee, Jong-Shill;Park, Sang-Hae;Chee, Young-Joon;Kim, In-Young;Kim, Sun-I.
    • Journal of Biomedical Engineering Research
    • /
    • v.28 no.3
    • /
    • pp.325-331
    • /
    • 2007
  • Personal identification is essential for the automatic measurement of biosignal information in home healthcare systems. Personal identification is usually achieved with passive radio frequency identification (RFID), which does little more than store a unique identification number. However, passive RFID is not ideal for automatic identification. We present a user identification system based on radio signal strength indication (RSSI) using ZigBee for active RFID tags. Personal identification is achieved by finding the largest RSSI value from aggregated beacon messages that are periodically transmitted by active RFID tags carried by users. Obtaining reliable person!'.! identification without restricting the orientation requires a certain distance between the closest active RFID tag from the ZED and the second closest tag. The results show that the closest active RFID tag from the ZED and the second closest tag must be at least 70 cm apart to achieve reliable personal identification.

Application of ICP(Iterative Closest Point) Algorithm for Optimized Registration of Object Surface and Unfolding Surface in Ship-Hull Plate Forming (선박 외판 성형에서 목적 형상과 전개 평판의 최적 정합을 위한 ICP(Iterative Closest Point) 알고리즘 적용)

  • Lee, Jang-Hyun;Yoon, Jong-Sung;Ryu, Cheol-Ho;Lee, Hwang-Beom
    • Korean Journal of Computational Design and Engineering
    • /
    • v.14 no.2
    • /
    • pp.129-136
    • /
    • 2009
  • Generally, curved surfaces of ship hull are deformed by flame bending (line heating), multi-press forming, and die-less forming method. The forming methods generate the required in-plane/bending strain or displacement on the flat plate to make the curved surface. Multi-press forming imposes the forced displacements on the flat plate by controlling the position of each pressing points based upon the shape difference between the unfolded flat plate and the curved object shape. The flat plate has been obtained from the unfolding system that is independent of the ship CAD. Apparently, the curved surface and the unfolded-flat surface are expressed by different coordinate systems. Therefore, one of the issues is to find a registration of the unfolded surface and the curved shape for the purpose of minimum amount of forming works by comparing the two surfaces. This paper presents an efficient algorithm to get an optimized registration of two different surfaces in the multi-press forming of ship hull plate forming. The algorithm is based upon the ICP (Iterative Closest Point) algorithm. The algorithm consists of two iterative procedures including a transformation matrix and the closest points to minimize the distance between the unfolded surface and curved surfaces. Thereby the algorithm allows the minimized forming works in ship-hull forming.

Genetic Distance Methods for the Identification of Cervus Species

  • Seo Jung-Chul;Kim Min-Jung;Lee Chan;Lee Jeong-Soo;Choi Kang-Duk;Leem Kang-Hyun
    • The Journal of Korean Medicine
    • /
    • v.27 no.2 s.66
    • /
    • pp.225-231
    • /
    • 2006
  • Objectives : This study was performed to determine if unknown species of antler samples could be identified by genetic distance methods. Methods : The DNAs of 4 antler samples were extracted, amplified by PCR, and sequenced. The DNAs of antlers were identified by genetic distance. Genetic distance method was made using MEGA software (Molecular Evolutionary Genetics Analysis, 3.1). Results : By genetic distance methods, all 4 antler samples were closest to Cervus elaphus nelsoni among Cervus species. Conclusion : These results suggest that genetic distance methods might be used as a tool for the identification of Cervus species.

  • PDF

Study on the Evaluation of Ship Collision Risk based on the Dempster-Shafer Theory (Dempster-Shafer 이론 기반의 선박충돌위험성 평가에 관한 연구)

  • Jinwan Park;Jung Sik Jeong
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.29 no.5
    • /
    • pp.462-469
    • /
    • 2023
  • In this study, we propose a method for evaluating the risk of collision between ships to support determination on the risk of collision in a situation in which ships encounter each other and to prevent collision accidents. Because several uncertainties are involved in the navigation of a ship, must be considered when evaluating the risk of collision. We apply the Dempster-Shafer theory to manage this uncertainty and evaluate the collision risk of each target vessel in real time. The distance at the closest point approach (DCPA), time to the closest point approach (TCPA), distance from another vessel, relative bearing, and velocity ratio are used as evaluation factors for ship collision risk. The basic probability assignments (BPAs) calculated by membership functions for each evaluation factor are fused through the combination rule of the Dempster-Shafer theory. As a result of the experiment using automatic identification system (AIS) data collected in situations where ships actually encounter each other, the suitability of evaluation was verified. By evaluating the risk of collision in real time in encounter situations between ships, collision accidents caused by human errora can be prevented. This is expected to be used for vessel traffic service systems and collision avoidance systems for autonomous ships.

Comparative Performance Study of Various Algorithms Computing the Closest Voltage Collapse Point (최단 전압붕괴 임계점을 계산하는 알고리즘의 특성 비교)

  • Song, Chung-Gi;Nam, Hae-Kon
    • Proceedings of the KIEE Conference
    • /
    • 1997.07c
    • /
    • pp.1078-1082
    • /
    • 1997
  • The distance in load parameter space to the closest voltage collapse point provides the worst case power margin and the left eigenvector identifies the most effective direction to steer the system to maximize voltage stability under contingency. This paper presents the results of the comparative performance study of the algorithms, which are applicable to a large scale power system, for computing the closest saddle node bifurcation (CSNB) point. Dobson's iterative method converges with robustness. However the slow process of updating the load increasing direction makes the algorithm less efficient. The direct method converges very quickly. But it diverges if the initial guess is not very close to CSNB. Zeng's method of estimating the approximate critical point in the pre-determined direction is attractive in the sense that it uses only using load flow equations. However, the method is found to be less efficient than Dobson's iterative method. It may be concluded from the above observation that the direct method with the initial values obtained by carrying out the iterative method twice is most efficient at this time and more efficient algorithms are needed for on-line application.

  • PDF

UAV Conflict Detection and Resolution Based on Geometric Approach

  • Park, Jung-Woo;Oh, Hyon-Dong;Tahk, Min-Jea
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.10 no.1
    • /
    • pp.37-45
    • /
    • 2009
  • A method of conflict detection and resolution is described by using simple geometric approach. Two VAVs are dealt with and considered as point masses with constant velocity. This paper discusses en route aircraft which are assumed to be linked by real time data bases like ADS-B. With this data base, all DAVs share the information each other. Calculating PCA (Point of Closest Approach), we can evaluate the worst conflict condition between two VAVs. This paper proposes one resolution maneuvering logic, which can be called 'Vector Sharing Resolution'. In case of conflict, using miss distance vector in PCA, we can decide the directions for two VAVs to share the conflict region. With these directions, VAVs are going to maneuver cooperatively. First of all, this paper describes some '2-D' conflict scenarios and then extends to '3-D' conflict scenarios.

A Wireless Location-Based Routing Algorithm in Multi-User Game Environments

  • Lee, Jong-Min;Kim, Seong-Woo;Lee, Jung-Hwa
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.12
    • /
    • pp.1733-1740
    • /
    • 2007
  • In this paper, we propose a wireless location-based routing algorithm which uses the location information of its neighbor nodes and a destination node. At first, the proposed routing algorithm forwards a packet to the X direction by selecting a closest node to its destination as a next hop in terms of the X coordinate until the packet reaches closely to the packet's destination. Then the packet is forwarded to the Y direction by selecting a closest node to its destination in terms of the Y coordinate. We use a back off mechanism in case that a next hop cannot be found using the proposed routing algorithm, which resolves loops while forwarding. The experimental results show that the proposed routing algorithm performs well like the existing routing algorithms Ad hoc On-demand Distance Vector and Greedy Perimeter Stateless Routing. It is expected to use the proposed routing algorithm in the digital battlefield of military environments and survival games of commercial environments.

  • PDF

실시간 위치기반 선박 충돌 위험도 알고리즘 개발에 관한 연구

  • Lee, Jin-Seok;Song, Jae-Uk;Jeong, Min;Kim, Jong-Cheol
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2014.06a
    • /
    • pp.343-345
    • /
    • 2014
  • 실시간 위치 기반 선박 충돌 위험도는 자선의 관점에서 선박충돌의 위험을 판단하는 것이 아니라 VTS(Vessel Traffic Service)의 관점에서 충돌 위험이 있는 선박을 식별하고 충돌 위험 지역을 전자 해도에서 실시간으로 확인하여 해당 해역 전체의 선박 교통흐름과 통항하는 선박간의 위험도를 평가하는 것이 목적이다. 항해사로써의 승선 경험과 관제사로써의 근무 경험, 그리고 다 년간 VTS 관제 업무를 수행하고 있는 관제사들로부터 충돌의 위험이 있는 선박을 식별하는 방법으로 주로 선박간의 벡터(코스와 속력)를 실시간으로 모니터링하여 충돌 위험이 있는 선박에게 피항 조치를 취하도록 정보를 제공하는 것으로 확인되었다. 따라서 DCPA(Distance to Closest Point of Approach)와 TCPA(Time to Closest Point of Approach), 그리고 최근접시간을 변수로 하는 충돌 위험 함수식(최대값=100)을 연구하여 각 지점의 위험도를 실시간으로 표시하는 기초 모델을 연구하였다.

  • PDF