• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.4
• /
• pp.325-331
• /
• 2015

This paper suggests an intersection method to improve the accuracy of three-dimensional position from heterogeneous satellite stereo images, and addresses validation of the suggested method following the experimental results. The three-dimensional position is achieved by determining an intersection point of two rays that have been precisely adjusted through the sensor orientation. In case of conventional homogeneous satellite stereo images, the intersection point is generally determined as a mid-point of the shortest line that links two rays in at least square fashion. In this paper, a refined method, which determines the intersection point upon the ray adjusted at the higher resolution image, was used to improve the positioning accuracy of heterogeneous satellite images. Those heterogeneous satellite stereo pairs were constituted using two KOMPSAT-2 and QuickBird images of covering the same area. Also, the positioning results were visually compared in between the conventional intersection and the refined intersection, while the quantitative analysis was performed. The results demonstrated that the potential of refined intersection improved the positioning accuracy of heterogeneous satellite stereo pairs; especially, with a weak geometry of the heterogeneous satellite stereo, the greater effects on the accuracy improvement.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.2
• /
• pp.75-80
• /
• 2002

This paper details a robust and efficient algorithm for point classification with respect to a polygon in 2D real number domain. The concept of tolerance makes this algorithm robust and consistent. It enables to define‘on-boundary’ , which can be interpreted as either‘in-’or‘out-’side region, and to manage rounding errors in floating point computation. Also the tolerance is used as a measure of reliability of point classifications. The proposed algorithm is based on a ray-intersection technique known as the most efficient, in which intersections between a ray originating from a given test point and the boundary of a region are counted. An odd number of intersections indicates that the point is inside region. For practical examples the algorithm is most efficient because most edges of the polygon region are processed by simple bit operations.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.404-410
• /
• 2016

Automated road map generation poses significant research challenges since GPS-based navigation systems prevail in most general vehicles. This paper proposes an automated detecting method for intersection points using GPS vehicle trajectory data without any background digital map information. The proposed method exploits the fact that the trajectories are generally split into several branches at an intersection point. One problem in previous work on this intersection detecting is that those approaches require stopping points and direction changes for every testing vehicle. However our approach does not require such complex auxiliary information for intersection detecting. Our method is based on partial trajectory matching among trajectories since a set of incoming trajectories split other trajectory cluster branches at the intersection point. We tested our method on a real GPS data set with 1266 vehicles in Gangnam District, Seoul. Our experiment showed that the proposed method works well at some bigger intersection points in Gangnam. Our system scored 75% sensitivity and 78% specificity according to the test data. We believe that more GPS trajectory data would make our system more reliable and applicable in a practice.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.4
• /
• pp.205-212
• /
• 2013

In recent, the demand of Unmanned Aerial Vehicles (UAVs) that can autonomous navigation and remote control has been increased in military, civil and commercial field. Particularly, existing researches focused on autonomous navigation method based on vanish point and remote control method based on event processing in indoor environments. However, the existing methods have some problems. For instance, a detected vanish point in intersection point has too much detection errors. In addition, the delay is increased in existing remote control system for processing images in real time. Thus, we propose improved vanish point algorithm by removing detection errors in intersection point. We also develop a remote control system with android platform by separating flying control and image process. Finally, we compare the proposed methods with existing methods to show the improvement of our approaches.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.9
• /
• pp.53-62
• /
• 2013

This paper proposes a method of automatically predicting the vanishing point for the purpose of detecting the road region from natural images. The proposed method stably detects the vanishing point in the road environment by analyzing the dominant orientation of the image and predicting the vanishing point to be at the position where the feature components of the image are concentrated. For this purpose, in the first stage, the image is partitioned into sub-blocks, an edge sample is selected randomly from within the sub-block, and RANSAC is applied for line fitting in order to analyze the dominant orientation of each sub-block. Once the dominant orientation has been detected for all blocks, we proceed to the second stage and randomly select line samples and apply RANSAC to perform the fitting of the intersection point, then measure the cost of the intersection model arising from each line and we predict the vanishing point to be located at the average point, based on the intersection point model with the highest cost. Lastly, quantitative and qualitative analyses are performed to verify the performance in various situations and prove the efficiency of the proposed algorithm for detecting the vanishing point.

• Journal of Korean Society of Transportation
• /
• v.14 no.2
• /
• pp.45-58
• /
• 1996

In a large signal intersection, it is the most important to set phase sequences and phase intervals of traffic signal in order to improve the efficiency of the capacity as well as safety. These setting allows to select the best sequence of signal phase among several alternatives, and thus to rearrange the starting and ending points of the individual phase using an effective interphase periods (EIP). The EIP is a gap between previous and current traffic movements at a potential collision point in an intersection. Each of traffic movements has an equality for safety and efficiency at the balanced condition of EIP. This paper presents how to set optimally the phase sequences and intervals of traffic signal in an intersection using phase based approach. And in the second part, we applied the theory developed in the first part. In particular, a numerical example of phase base signal setting is presented using a matrix computation method in order to select the best sequence among several alternatives, and thus to rearrange the starting and ending points of the individual phase using the EIP. This method also allows to apply to optimum signal setting even in five-lag or staggered-type intersection.

• Journal of the Chungcheong Mathematical Society
• /
• v.32 no.2
• /
• pp.251-260
• /
• 2019

It has been little known when an Artinian (point) quotient has the strong Lefschetz property. In this paper, we find the Artinian complete intersection quotient having the SLP. More precisely, we prove that if ${\mathbb{X}}$ is a complete intersection in ${\mathbb{P}}^2$ of type (2, 2) and ${\mathbb{Y}}$ is a finite set of points in ${\mathbb{P}}^2$ such that ${\mathbb{X}}{\cup}{\mathbb{Y}}$ is a basic configuration of type (2, a) with $a{\geq}3$ or (3, a) with a = 3, 4, 5, 6, then $R/(I_{\mathbb{X}}+I_{\mathbb{Y}})$ has the SLP. We also show that if ${\mathbb{X}}$ is a complete intersection in ${\mathbb{P}}^2$ of type (3, 2) and ${\mathbb{Y}}$ is a finite set of points in ${\mathbb{P}}^2$ such that ${\mathbb{X}}{\cup}{\mathbb{Y}}$ is a basic configuration of type (3, 3) or (3, 4), then $R/(I_{\mathbb{X}}+I_{\mathbb{Y}})$ has the SLP.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.9
• /
• pp.1814-1821
• /
• 2002

NC cutting simulation is an important factor in the development of products. The geometric modelling of cutter swept surface should be done in NC cutting simulation. A part of cutter swept surface is a ruled surface blended with silhouette curve and cutter path. Finding an intersection point between cutter swept surface and a line is one of major problems in Z-map based cutting simulation. In this paper, cutter swept surface is defined parametrically and it's intersection point with Z-map is found in an exact form. Triangular grid Z-map based 3-axis NC cutting simulation is performed.

• Journal of the Society of Naval Architects of Korea
• /
• v.28 no.2
• /
• pp.104-117
• /
• 1991

When a body starts to move, the flow near the intersection point between a body and a free surface changes violently and rapidly in a very short initial time interval. This flow phenomena must be investigated whenever one treats the interaction between a body and a fluid, such as the motion of a floating body, sloshing in a tank, wave maker problem, entry of a body into a fluid etc.. Until Roberts(1987), it was widely accepted that a singularity exists at the intersection point. However, he showed that the singularity does not exist if a body moves non-impulsively. In this paper, an analytical solution cosistent for the case of impulsive motion of a body is obtained by including the effect of surface tension. From the characteristics of the newly obtained solution, a critical value associated with an oscillating phenomenon is found, and further more, it is shown that the oscillating phenomenon does not appear in the region where the distance form the intersection point is less than this critical value.

• International Journal of Contents
• /
• v.11 no.2
• /
• pp.9-14
• /
• 2015

We propose a new distance measure between 2-dimensional points to provide a total order for an entire point set and to reflect the correct geometric meaning of the naturalness of the point ordering. In general, there is no total order for 2-dimensional point sets, so curve reconstruction algorithms do not solve the self-intersection problem because the distance used in the previous methods is the Euclidean distance. A natural distance based on Brownian motion was previously proposed to solve the self-intersection problem. However, the distance reflects the wrong geometric meaning of the naturalness. In this paper, we correct the disadvantage of the natural distance by introducing a polar-natural distance, and we also propose a new curve reconstruction algorithm that is based on the polar-natural distance. Our experiments show that the new distance adequately reflects the correct geometric meaning, so non-simple curve reconstruction can be solved.