• Title/Summary/Keyword: intersection test

Search Result 179, Processing Time 0.023 seconds

MBO-Tree: A Hierarchical Representation Scheme for Shapes with Natural Approximation and Effective Localization (MBO-Tree: 형상의 자연스러운 근사화와 효과적인 지역화를 지원하는 계층적 표현 방법)

  • 허봉식;김동규;김민환
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.1
    • /
    • pp.18-27
    • /
    • 2002
  • A hierarchical representation scheme for planar curves, MBO-tree, is proposed in this paper, which provides natural approximation and efficient localization. MBO-tree is based on the Douglas-Peucker algorithm (iterative end-point fit algorithm), but approximation errors that are stored with corresponding points in MBO-tree nodes and are used for abstraction measures are adjusted by force to eliminate unnatural approximation. The error adjusting is just making the approximation error of a node in a MBO-tree to be less than or equal to that of its parent. In point of localization, the bounding area of a curve is represented with a minimum bounding octangle (MBO), which can enclose the curve more compactly compared with those of other hierarchical schemes, such as the strip tree, the arc tree and the HAL tree. The MBO satisfies the hierarchical inclusion property that is useful for hierarchical geometrical operations, such as the point-inclusion test and the polygon intersection test. Through several experiments, we found that the proposed scheme was able to approximate more naturally and to localize more effectively.

  • PDF

The Water Deer on a Road: Road-Kill Characteristics of a Nationally Abundant but Internationally Threatened Species

  • Kim, Kyungmin;Seo, Hyunjin;Woo, Donggul;Park, Taejin;Song, Euigeun
    • Journal of Forest and Environmental Science
    • /
    • v.37 no.1
    • /
    • pp.62-68
    • /
    • 2021
  • Despite numerous efforts on reducing road-kill worldwide, the collisions have been occurring continuously. Many factors are affecting road-kill occurrences and the effect is various by species. We investigated Hydropotes inermis argyropus road-kill characteristics on the national highway. We examined 9,099 H. i. argyropus road-kill points with distance to the gaps on road (interchange and intersection) and distance to six natural land-cover types as explanatory variables. We also examined the number of road-kill occurrences according to temporal variation using chi-square test with 9,658 events. In general, H. i. argyropus road-kill location tended to occur close to the gaps on road, agricultural lands and forests. The average distance from road-kill to the gap was 694.7 m and 78.6% of the collisions were occurred within 1 km from the gaps. In addition, Kruskal-Wallis test showed the distance between road-kill points and each land cover and the gaps was significantly different. The temporal analyses showed that the differences of the H. i. argyropus road-kill frequency are significant in both month and season. Our results implies H. i. argyropus road-kill location tended to occur close to the gaps on road, agricultural lands and forests in general, especially during May and June, according to their seasonal behavior. Thus, we suggest there is a need of concentrated management on the roads with specific characteristics for both wildlife and human safety.

Deep learning-based apical lesion segmentation from panoramic radiographs

  • Il-Seok, Song;Hak-Kyun, Shin;Ju-Hee, Kang;Jo-Eun, Kim;Kyung-Hoe, Huh;Won-Jin, Yi;Sam-Sun, Lee;Min-Suk, Heo
    • Imaging Science in Dentistry
    • /
    • v.52 no.4
    • /
    • pp.351-357
    • /
    • 2022
  • Purpose: Convolutional neural networks (CNNs) have rapidly emerged as one of the most promising artificial intelligence methods in the field of medical and dental research. CNNs can provide an effective diagnostic methodology allowing for the detection of early-staged diseases. Therefore, this study aimed to evaluate the performance of a deep CNN algorithm for apical lesion segmentation from panoramic radiographs. Materials and Methods: A total of 1000 panoramic images showing apical lesions were separated into training (n=800, 80%), validation (n=100, 10%), and test (n=100, 10%) datasets. The performance of identifying apical lesions was evaluated by calculating the precision, recall, and F1-score. Results: In the test group of 180 apical lesions, 147 lesions were segmented from panoramic radiographs with an intersection over union (IoU) threshold of 0.3. The F1-score values, as a measure of performance, were 0.828, 0.815, and 0.742, respectively, with IoU thresholds of 0.3, 0.4, and 0.5. Conclusion: This study showed the potential utility of a deep learning-guided approach for the segmentation of apical lesions. The deep CNN algorithm using U-Net demonstrated considerably high performance in detecting apical lesions.

Indoor Path Recognition Based on Wi-Fi Fingerprints

  • Donggyu Lee;Jaehyun Yoo
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.12 no.2
    • /
    • pp.91-100
    • /
    • 2023
  • The existing indoor localization method using Wi-Fi fingerprinting has a high collection cost and relatively low accuracy, thus requiring integrated correction of convergence with other technologies. This paper proposes a new method that significantly reduces collection costs compared to existing methods using Wi-Fi fingerprinting. Furthermore, it does not require labeling of data at collection and can estimate pedestrian travel paths even in large indoor spaces. The proposed pedestrian movement path estimation process is as follows. Data collection is accomplished by setting up a feature area near an indoor space intersection, moving through the set feature areas, and then collecting data without labels. The collected data are processed using Kernel Linear Discriminant Analysis (KLDA) and the valley point of the Euclidean distance value between two data is obtained within the feature space of the data. We build learning data by labeling data corresponding to valley points and some nearby data by feature area numbers, and labeling data between valley points and other valley points as path data between each corresponding feature area. Finally, for testing, data are collected randomly through indoor space, KLDA is applied as previous data to build test data, the K-Nearest Neighbor (K-NN) algorithm is applied, and the path of movement of test data is estimated by applying a correction algorithm to estimate only routes that can be reached from the most recently estimated location. The estimation results verified the accuracy by comparing the true paths in indoor space with those estimated by the proposed method and achieved approximately 90.8% and 81.4% accuracy in two experimental spaces, respectively.

Characteristic and Analysis of Fatigue Crack for Curved Girder Bridge based on the Stress Range Histerisis (실동이력에 기초한 곡선거더교의 피로균열 특성 및 분석)

  • Kwon, Soon Cheol;Kyung, Kab Soo;Kim, Da Young;Lee, Ha Sung
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.28 no.1A
    • /
    • pp.1-13
    • /
    • 2008
  • The web of a horizontally curved plate girder bridge is, in general, subject to not only longitudinal flexural in-plane stress but also out-of-plane bending stress. Therefore, the induced stresses in the fillet welded joints at the intersection of the web and flange plates in the curved plate girder bridge can be considerably high, and the welded joints of gusset plates connecting the main girder to the floor beams or sway bracings can be subject to much more severe situation than those in the ordinary straight plate girder bridge. In order to investigate the cause of fatigue crack occurred in a curved girder bridge that has been served in about 23 years, in this study, field load tests have been performed to obtain the stress characteristics at the welded joint under the real traffic flow. Using the test results, we have investigated the causes of the occurrence of various fatigue cracks and have estimated the fatigue lives for the cracks. In addition, the characteristics of structural behavior at welded joint of the curved girder bridge have been examined by comparing the FE analysis and the field test result.

Multicriteria shape design of a sheet contour in stamping

  • Oujebbour, Fatima-Zahra;Habbal, Abderrahmane;Ellaia, Rachid;Zhao, Ziheng
    • Journal of Computational Design and Engineering
    • /
    • v.1 no.3
    • /
    • pp.187-193
    • /
    • 2014
  • One of the hottest challenges in automotive industry is related to weight reduction in sheet metal forming processes, in order to produce a high quality metal part with minimal material cost. Stamping is the most widely used sheet metal forming process; but its implementation comes with several fabrication flaws such as springback and failure. A global and simple approach to circumvent these unwanted process drawbacks consists in optimizing the initial blank shape with innovative methods. The aim of this paper is to introduce an efficient methodology to deal with complex, computationally expensive multicriteria optimization problems. Our approach is based on the combination of methods to capture the Pareto Front, approximate criteria (to save computational costs) and global optimizers. To illustrate the efficiency, we consider the stamping of an industrial workpiece as test-case. Our approach is applied to the springback and failure criteria. To optimize these two criteria, a global optimization algorithm was chosen. It is the Simulated Annealing algorithm hybridized with the Simultaneous Perturbation Stochastic Approximation in order to gain in time and in precision. The multicriteria problems amounts to the capture of the Pareto Front associated to the two criteria. Normal Boundary Intersection and Normalized Normal Constraint Method are considered for generating a set of Pareto-optimal solutions with the characteristic of uniform distribution of front points. The computational results are compared to those obtained with the well-known Non-dominated Sorting Genetic Algorithm II. The results show that our proposed approach is efficient to deal with the multicriteria shape optimization of highly non-linear mechanical systems.

Assessment of Residual Life for In-Service Fossil Power Plant Components Using Grain Boundary Etching Method (입계부식법에 의한 사용중인 화력발전소 요소의 잔여수명평가)

  • Han, Sang-In;Yoon, Kee-Bong;Chung, Se-Hi
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.21 no.1
    • /
    • pp.22-31
    • /
    • 1997
  • The grain boundary etching method as a method for assessing degradation of structural materials has received much attention because it is simple, inexpensive and easy to apply to real components. In this study, the effectiveness of the method is verified by successfully applying the technique to in-service components of aged fossil power plants such as main steam pipes, boiler headers an turbine rotors. A new degradation parameter, intersecting number ratio (N$_{1}$/N$_{0}$), is employed. The intersecting number ratio (N$_{1}$/N$_{0}$) is defined as the ratio of intersection number (N$_{1}$) obtained from 5-minute picric acid etched surface to the number (N$_{0}$) obtained from nital etched surface. Two kinds of test materials, 2.25Cr-1Mo steel and 1Cr-1Mo-0.25V steel, were artificially thermal-aged at 630.deg. C in different levels of degradation., (N$_{1}$/N$_{0}$) were measured. And, correlations between the measured values and LMP values calculated from aging temperature and aging time were sought. To check the validity of the correlations obtained in laboratory, similar data were measured from service components in four old Korean fossil power plants. These on-site measurement data were in good correlation with those obtained in the laboratory.oratory.

Optimization of Drag-sail Storage Inspired from Blossom Method (개화형상을 모사한 가항력 돛 수납최적화)

  • Kim, Heekyung;Jung, Jinwon;Lee, Gunhee;Lee, Dongyun;Choi, Junwoo;Kim, Byungkyu
    • Journal of Aerospace System Engineering
    • /
    • v.11 no.3
    • /
    • pp.16-21
    • /
    • 2017
  • In this paper, we propose a new folding method (the blossom method) to increase storage efficiency of drag-sail. To resolve the issue caused by increase in the thickness of the sail, we allowed margin space (offset) along the folding line and made holes at the intersection of offset lines to prevent distortion of film. In addition, to verify applicability of the blossom method, we fabricated quarter of the sail by using Mylar film and conducted a deployment experiment. If the blossom method is applied, storage ratio (storage volume: deployed area) is 1: 68.64, that is approximately 1.88 times more than the z-fold method of folding sailing.

Study of Feasibility Analysis for the Protected-Permissive Left-Turn Signal Control in Three-Leg Signalized Intersections Using a Microscopic Traffic Simulation Model (미시교통시뮬레이션을 이용한 3지 교차로 보호-비보호 좌회전 도입 타당성 분석에 관한 연구)

  • Yun, Ilsoo;Park, Sangmin;Heo, Nak Won;Yoon, Jung Eun;Kim, Young Sun;Lee, Sang Soo
    • International Journal of Highway Engineering
    • /
    • v.17 no.4
    • /
    • pp.89-98
    • /
    • 2015
  • PURPOSES : This study evaluated the feasibility of implementing protected-permissive left-turn (PPLT) signals at three-leg signalized intersections. METHODS: A three-leg signalized intersection with permissive left-turn was first selected. A VISSIM simulation model was constructed using data collected from the test site. The VISSIM network was calibrated by adjusting related parameter values in order to minimize the difference between the simulated and surveyed critical gap. The calibrated network was validated by the number of waiting left-turning vehicles per cycle. Finally, the mobility and safety measures were extracted from simulation runs in which permissive, protected left turns as well as PPLTs were realized based on diverse traffic volume scenarios. RESULTS : The mobility-related measures of effectiveness (MOEs) of the case with PPLT outperformed the other two left-turn treatment scenarios. In particular, the average waiting time per cycle for the left-turn vehicles in the case with PPLT was reduced by 30 s. The safety-related MOEs of the case with PPLT were somewhat higher than those in the case with protected left-turns and much higher than those in the case with permissive left-turns. CONCLUSIONS : Based on the mobility- and safety-related MOEs generated from the VISSIM simulation runs, the use of PPLT seems to be feasible at three-leg signalized intersections where the left-turn is permissive and a pedestrian signal exists at the conflicting approach. However, in order to use the PPLT in earnest, it is necessary to revise the road traffic act, traffic signs, and related manuals.

A study on the ZF-buffer algorithm for Ray-tracing Acceleration (광선추적법의 속도개선을 위한 ZF-버퍼 알고리즘 연구)

  • Kim, Sehyun;Yoon, Kyung-hyun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.6 no.1
    • /
    • pp.29-36
    • /
    • 2000
  • In this work, we propose ZF-buffer algorithm in order to accelerate the intersection test of ray-tracing algorithm. ZF-buffer is used in the preprocessing of ray-tracing and records the pointer that points to a parent face of a depth value(z value) of an object determined in Z-buffer. As a result, the face which intersects with the first ray can be determined easily by using the pointer stored in F-buffer. Though ZF-buffer and vista-buffer resemble each other, the difference between the two methods is that what ZF-buffer records is not bounding volume but the pointer of a displayable face. We applied the ZF-buffer algorithm for the first ray to Utah teapot which consists of 9216 polygons. By comparing the elapse time of our method with vista-buffer algorithm, we can acquire improvement in speed that it is 3 times faster than vista-buffer algorithm. We expanded our algorithm to the second ray.

  • PDF