• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3858-3874
• /
• 2021

As an essential part of the urban transportation system, precise perception of the traffic flow parameters at the traffic signal intersection ensures traffic safety and fully improves the intersection's capacity. Traditional detection methods of road traffic flow parameter can be divided into the micro and the macro. The microscopic detection methods include geomagnetic induction coil technology, aerial detection technology based on the unmanned aerial vehicles (UAV) and camera video detection technology based on the fixed scene. The macroscopic detection methods include floating car data analysis technology. All the above methods have their advantages and disadvantages. Recently, indoor location methods based on wireless signals have attracted wide attention due to their applicability and low cost. This paper extends the wireless signal indoor location method to the outdoor intersection scene for traffic flow parameter estimation. In this paper, the detection scene is constructed at the intersection based on the received signal strength indication (RSSI) ranging technology extracted from the wireless signal. We extracted the RSSI data from the wireless signals sent to the road side unit (RSU) by the vehicle nodes, calibrated the RSSI ranging model, and finally obtained the traffic flow parameters of the intersection entrance road. We measured the average speed of traffic flow through multiple simulation experiments, the trajectory of traffic flow, and the spatiotemporal map at a single intersection inlet. Finally, we obtained the queue length of the inlet lane at the intersection. The simulation results of the experiment show that the RSSI ranging positioning method based on wireless signals can accurately estimate the traffic flow parameters at the intersection, which also provides a foundation for accurately estimating the traffic flow state in the future era of the Internet of Vehicles.

• Journal of the Korean Mathematical Society
• /
• v.43 no.3
• /
• pp.609-622
• /
• 2006

In this paper, we established the monotony properties of generalized projection bodies $II_{\imath}K$, intersection bodies $I_{\imath}K$ and centroid bodies ${\Gamma}_{\imath}K$.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.10a
• /
• pp.341-345
• /
• 2003

This study develops modeling processes for alignment optimization considering characteristics of intersections using genetic algorithms and GIS for road alignment optimization. Since existing highway alignment optimization models have neglected the characteristics of intersections, they have shown serious weaknesses for real applications. In this paper, intersection costs include earthwork, right-of-way, pavement, accident, delay and fuel consumption costs that are sensitive and dominating to alignments. Also, local optimization of intersections for saving good alignment alternatives is developed and embedded. A highway alignment is described by parametric representation in space and vector manipulation is used to find the coordinates of intersections and other interesting points. The developed intersection cost estimation model is sufficiently precise for estimating intersection costs and eventually enhancing the performance of highway alignment optimization models. Also, local optimization of intersections can be used for improving search flexibility, thus allowing more effective intersections. It also provides a basis for extending the alignment optimization from single highways to networks. The presented two artificial examples show that the total intersection costs are substantial and sensitive to highway alignments.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.4
• /
• pp.382-386
• /
• 2004

This paper presents an algorithm for the triangular mesh intersection problem. The key aspect of the proposed algorithm is to reduce the number of triangle pairs to be checked for intersection. To this end, it employs two different approaches, the Y-group approach and the space partitioning approach. Even though both approaches have the same objective of reducing the number of triangular-triangular intersection (TTI) pairs, their inherent characteristics are quite different. While the V-group approach works by topology (reduces TTI pairs by guaranteeing no intersection among adjacent triangles), the space partitioning approach works by geometry (reduces TTI pairs by guaranteeing no intersection among distant triangles). The complementary nature of the two approaches brings substantial improvement in reducing the number TTI pairs.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.749-752
• /
• 2005

In this paper, we introduce an Intersection Collision Avoidance (ICA) system as a convergence example of Telematics and USN technology and show several requirements for the ICA system. Also, we propose a system design that satisfies the requirements of reliable vehicular data acquisition, real-time data transmission, and effective intersection collision prediction. The ICA system consists of vehicles, sensor nodes and a base station that can provide drivers with a reliable ICA service. Then, we propose several technological solutions needed when implementing the ICA system. Those are about sensor nodes deployment, vehicular information transmission, vehicular location data acquisition, and intersection collision prediction methods. We expect this system will be a good case study applied to real Telematics application based on USN technology.

• Journal of the Korean Mathematical Society
• /
• v.52 no.1
• /
• pp.81-96
• /
• 2015

The intersection graph of a group G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of G, and there is an edge between two distinct vertices H and K if and only if $H{\cap}K{\neq}1$ where 1 denotes the trivial subgroup of G. In this paper we characterize all finite groups whose intersection graphs are planar. Our methods are elementary. Among the graphs similar to the intersection graphs, we may count the subgroup lattice and the subgroup graph of a group, each of whose planarity was already considered before in [2, 10, 11, 12].

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.437-439
• /
• 2006

Actually, The present traffic accident detection system is subsisting limitation of accurate distinction under the crowded condition at intersection because the system defend upon mainly the image information at intersection and digital image processing techniques nearly all. To complement this insufficiency, this article aims to estimate the level of present technology and a realistic possibility by analyzing the acoustic characteristic of crash sound that we have to investigate for improvement of traffic accident detection rate at intersection. The skid sound of traffic accident is showed the special pattern at 1[kHz])${\sim}$3[kHz] bandwidth when vehicles are almost never operated in and around intersection. Also, the frequency bandwidth of vehicle crash sound is showed sound pressure difference oyer 30[dB] higher than when there is no occurrence of traffic accident below 500[Hz].

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.113-120
• /
• 1998

Calculation of intersection points by two curves is fundamental to computer aided geometric design. Bezier clipping is one of the well-known curve intersection algorithms. However, this algorithm is only applicable to Bezier curve representation. Therefore, the NURBS curves that can represent free from curves and conics must be decomposed into constituent Bezier curves to find the intersections using Bezier clipping. And the respective pairs of decomposed Bezier curves are considered to find the intersection points so that the computational overhead increases very sharply. In this study, extended Bezier clipping which uses the linear precision of B-spline curve and Grevill's abscissa can find the intersection points of two NURBS curves without initial decomposition. Especially the extended algorithm is more efficient than Bezier clipping when the number of intersection points is small and the curves are composed of many Bezier curve segments.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2004.09a
• /
• pp.89-92
• /
• 2004

The influence of a single fracture intersection on density-driven immiscible flow is compared between wetting (water into air) and nonwetting (Trichloroethylene into water) flows. At low supply rates, the intersection acted as a hysteretic gate to pulsed flow of the wetting phase, but had minimal influence on nonwetting phase flow. For both cases, increasing the supply rate led to the formation of continuous fluid tendrils that crossed the intersection without interruption. The wetting experiment returned to pulsed flow as the supply rate was decreased, while the nonwetting experiment maintained a continuous flow structure. Results suggest a fundamental difference between wetting and nonwetting phase flows in fracture network.

• Journal of the Korean Society for Precision Engineering
• /
• v.9 no.4
• /
• pp.65-71
• /
• 1992

This paper develops an algorithm for efficiently computing the intersection points between rays and an object in a simulated radiograph. This algorithm allows interactive calculation of simulated radiographs for very complex parts. It needs a geometric model of a part which is approximated by a bounding surface made up of flat triangular polygons. Since rays have a point source, a perspective transformation is applied to convert the point source problem to one that has parallel rays. This permits to use a scan-line algorithm which utilizes the coherence of the grid of rays for the intersection calculations. The efficiency of the algorithm is shown by comparing compute time of the intersection calculations to a commercial software that computes each ray intersection independently.