• Title/Summary/Keyword: traffic conditions

Search Result 1,334, Processing Time 0.028 seconds

Deep Learning-Based Roundabout Traffic Analysis System Using Unmanned Aerial Vehicle Videos (드론 영상을 이용한 딥러닝 기반 회전 교차로 교통 분석 시스템)

  • Janghoon Lee;Yoonho Hwang;Heejeong Kwon;Ji-Won Choi;Jong Taek Lee
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.18 no.3
    • /
    • pp.125-132
    • /
    • 2023
  • Roundabouts have strengths in traffic flow and safety but can present difficulties for inexperienced drivers. Demand to acquire and analyze drone images has increased to enhance a traffic environment allowing drivers to deal with roundabouts easily. In this paper, we propose a roundabout traffic analysis system that detects, tracks, and analyzes vehicles using a deep learning-based object detection model (YOLOv7) in drone images. About 3600 images for object detection model learning and testing were extracted and labeled from 1 hour of drone video. Through training diverse conditions and evaluating the performance of object detection models, we achieved an average precision (AP) of up to 97.2%. In addition, we utilized SORT (Simple Online and Realtime Tracking) and OC-SORT (Observation-Centric SORT), a real-time object tracking algorithm, which resulted in an average MOTA (Multiple Object Tracking Accuracy) of up to 89.2%. By implementing a method for measuring roundabout entry speed, we achieved an accuracy of 94.5%.

Rate Proportional SCFQ Algorithm for High-Speed Packet-Switched Networks

  • Choi, Byung-Hwan;Park, Hong-Shik
    • ETRI Journal
    • /
    • v.22 no.3
    • /
    • pp.1-9
    • /
    • 2000
  • Self-Clocked Fair Queueing (SCFQ) algorithm has been considered as an attractive packet scheduling algorithm because of its implementation simplicity, but it has unbounded delay property in some input traffic conditions. In this paper, we propose a Rate Proportional SCFQ (RP-SCFQ) algorithm which is a rate proportional version of SCFQ. If any fair queueing algorithm can be categorized into the rate proportional class and input is constrained by a leaky bucket, its delay is bounded and the same as that of Weighted Fair Queueing (WFQ) which is known as an optimal fair queueing algorithm. RP-SCFQ calculates the timestamps of packets arriving during the transmission of a packet using the current value of system potential updated at every packet departing instant and uses a starting potential when it updates the system potential. By doing so, RP-SCFQ can have the rate proportional property. RP-SCFQ is appropriate for high-speed packet-switched networks since its implementation complexity is low while it guarantees the bounded delay even in the worst-case input traffic conditions.

  • PDF

Efficient Channel Assignment Scheme Based on Finite Projective Plane Theory

  • Chen, Chi-Chung;Su, Ing-Jiunn;Liao, Chien-Hsing;Woo, Tai-Kuo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.628-646
    • /
    • 2016
  • This paper proposes a novel channel assignment scheme that is based on finite projective plane (FPP) theory. The proposed scheme involves using a Markov chain model to allocate N channels to N users through intermixed channel group arrangements, particularly when channel resources are idle because of inefficient use. The intermixed FPP-based channel group arrangements successfully related Markov chain modeling to punch through ratio formulations proposed in this study, ensuring fair resource use among users. The simulation results for the proposed FPP scheme clearly revealed that the defined throughput increased, particularly under light traffic load conditions. Nevertheless, if the proposed scheme is combined with successive interference cancellation techniques, considerably higher throughput is predicted, even under heavy traffic load conditions.

A Study on the Dynamic Behavior of Computer Network using Adaptive Routing Algorithm (적응 경로 선정 알고리즘의 동적 성질에 관한 연구)

  • Ryoo, In-Tae;Kho, Woo-Gon;Park, Mi-Gnon;Lee, Sang-Bae
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.265-268
    • /
    • 1988
  • Several routing algorithms use the link lengths that reflect the traffic conditions on the links to route messages. The idea is to assign a large length to a congested link so that they will tend not to use it as part of a routing path. When these lengths depend on current traffic conditions, dynamic behavior such as stability, convergence and the speed of convergence are of interest. But it sometimes induces the possibility of violent oscillation. This paper is the one that analyze these issues systematically.

  • PDF

Modeling and Actual Investigation of Roadway Lighting in Jejusi (제주시 도로조명 실태조사 및 모델링)

  • Lee, Sang-Geun;Oh, Seong-Bo;Kim, Duck-Gu
    • Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
    • /
    • 2005.11a
    • /
    • pp.147-150
    • /
    • 2005
  • Fixed lighting of public ways for both vehicles and pedestrians can create a nighttime environment in which people see comfortably and can quickly and accurately identify objects on the roadway being travelled roadway lighting can improve traffic safety, achieve efficient traffic movement and promote the general use of the facility during darkness. The design of a roadway lighting system involves consideration of visibility, economics, esthetics, safety and environmental conditions. This paper describe estimation of horizontal illuminance by actual measurement at main streets in Jejusi. We try to evaluate Jejusi Roadway Lighting Conditions for modeling by computer simulation.

  • PDF

Performance Evaluation of Myopic Policy for Dynamic Spectrum Access (동적 스펙트럼 접속을 위한 myopic 방식의 성능 분석)

  • Lee, Yutae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.5
    • /
    • pp.1101-1105
    • /
    • 2013
  • Due to underutilization of spectrum under the current static spectrum management policy, various kinds of dynamic spectrum access strategies have appeared. Myopic policy is a simple policy with reduced complexity that maximizes the immediate throughput. In this paper, the distribution of its medium access delay is evaluated under saturation traffic conditions. Using the distribution of the medium access delay, we also evaluate its system delay under non-saturated traffic conditions.

A Study on Fine Dust Prediction Based on Internal Factors Using Machine Learning (머신러닝을 활용한 내부 발생 요인 기반의 미세먼지 예측에 관한 연구)

  • Yong-Joon KIM;Min-Soo KANG
    • Journal of Korea Artificial Intelligence Association
    • /
    • v.1 no.2
    • /
    • pp.15-20
    • /
    • 2023
  • This study aims to enhance the accuracy of fine dust predictions by analyzing various factors within the local environment, in addition to atmospheric conditions. In the atmospheric environment, meteorological and air pollution data were utilized, and additional factors contributing to fine dust generation within the region, such as traffic volume and electricity transaction data, were sequentially incorporated for analysis. XGBoost, Random Forest, and ANN (Artificial Neural Network) were employed for the analysis. As variables were added, all algorithms demonstrated improved performance. Particularly noteworthy was the Artificial Neural Network, which, when using atmospheric conditions as a variable, resulted in an MAE of 6.25. Upon the addition of traffic volume, the MAE decreased to 5.49, and further inclusion of power transaction data led to a notable improvement, resulting in an MAE of 4.61. This research provides valuable insights for proactive measures against air pollution by predicting future fine dust levels.

Analysis of Turbulence on a Merge Influence Section in Uninterrupted Facility (연속류도로 합류영향구간 교통류 난류현상 분석)

  • Kim, Hyun-Sang;Do, Tcheol-Woong
    • International Journal of Highway Engineering
    • /
    • v.11 no.2
    • /
    • pp.217-228
    • /
    • 2009
  • Sections under the influence of merging in an uninterrupted facility create irregular interaction between vehicles, such as lane change, speed acceleration and deceleration because of the merging of ramp traffic flows which have traffic characteristics different from those of the main line. This causes a confused traffic flow phenomenon(turbulence), which is considered an unstable traffic characteristic between various continuous points in consideration of v conditions. In this study, in merge influence sections, detectors by lane-point were installed to create time and space-series -traffic data. The least significant difference(LSD), as the criteria for discriminating a significant speed change between points, was calculated to examine the turbulence. As a result, turbulence in merge influence section was found to change the zones of such occurrence and the seriousness levels according to traffic condition. Thus, the maximum merge influence section due to the turbulence was created in the traffic condition before congestion when traffic increases. According to characteristics of changes in speed, merge influence section was divided into upstream 100m$\sim$downstream 100m(a section of speed reduction), and downstream 100m$\sim$downstream 400m(a section of reduced speed maintenance and acceleration).

  • PDF

Safety Evaluation of Traffic Merging Control Methods for Freeway Work Zone (고속도로 공사구간 차로 합류기법 안전성 평가 연구)

  • HWANG, Dong Hwan;OH, Cheol;PARK, Hyun Jin;JEONG, Bong Jo
    • Journal of Korean Society of Transportation
    • /
    • v.34 no.3
    • /
    • pp.263-277
    • /
    • 2016
  • Traffic safety in freeway work zones is of keen interest since both crash frequency and severity are much higher than those in general freeway sections. The lane closure in work zones results in greater work load of drivers due to compulsory lane changes and speed reduction. Therefore, traffic merging control is an effective countermeasure for enhancing work zone safety. This study proposed an integrated framework based on driving and traffic simulations to evaluate traffic merging control methods in terms of traffic safety. In addition to the conventional merging method using the taper, joint merge and chicane-type merge were evaluated by the proposed methodology. Chicane-type merge outperformed other methods under level of service (LOS) A and B. On the other hand, it was identified that joint merge showed the best safety performance under LOS C traffic conditions.

An SDN-based Bandwidth Control Scheme considering Traffic Variation in the Virtualized WLAN Environment (가상화된 WLAN 환경에서 트래픽 변화를 고려한 SDN 기반 대역폭 제어 기법)

  • Moon, Jaewon;Chung, Sanghwa
    • Journal of KIISE
    • /
    • v.43 no.11
    • /
    • pp.1223-1232
    • /
    • 2016
  • A virtual network technology can provide a network reflecting the requirements of various services. The virtual network can distribute resources of the physical network to each virtual slice. An efficient resource distribution technique is needed to reflect the requirements of various services. Existing bandwidth distribution techniques can only control downlink traffic without taking traffic conditions on the network into account. Downlink and uplink share the same resources in a wireless network. The existing bandwidth distribution techniques assumed that all stations generate saturated traffic. Therefore, the existing bandwidth distribution technique cannot make traffic isolation in a virtual wireless network. In this paper, we proposed a traffic-based bandwidth control techniques to solve these problems. We applied Software-Defined Networking(SDN) to the virtual wireless network, monitored the traffic at each station, and searched for stations that generated unsaturated traffic. We also controlled both uplink and downlink traffics dynamically based on monitoring information. Our system can be implemented with legasy 802.11 clients and SDN-enabled APs. After the actual test bed configuration, it was compared to existing techniques. As a result, the distribution performance of the proposed technique was improved by 14% in maximum.