The Mueller-Lyer Illusion Produced by Features in Maps

1996 ◽  
Vol 40 (23) ◽  
pp. 1242-1246
Author(s):  
William Schmidt ◽  
Douglas J. Gillan
Keyword(s):  
Present Experiment ◽  
Road Segment ◽  
Place Names ◽  
Line Segments ◽  
The Road ◽  
Lyer Illusion ◽  
Road Segments

Maps consist of lines converging onto line segments. These converging lines resemble elements of the Mueller-Lyer illusion (MLEs) which cause map readers to overestimate the length of a road segment (if the lines go outward from the end of the segment) or underestimate the length (if the lines go inward from the end of the segment) (Gillan, Schmidt, & Hanowski, 1996). The present experiment investigates whether a similar effect occurs when place names converge on a road segment. Subjects estimated road segments framed by outward-going MLEs made up of place names to be significantly longer than road segments framed by inward-going MLEs. The type of characters in the place names (English characters vs. symbols) and requiring subjects to locate the road segment by the names in the MLE had no effect on the degree of misestimation induced. The implications of these findings for a variety of displays are discussed.

scholarly journals A High-Definition Road-Network Model for Self-Driving Vehicles

2018 ◽  
Vol 7 (11) ◽  
pp. 417 ◽  
Author(s):  
Ling Zheng ◽  
Bijun Li ◽  
Hongjuan Zhang ◽  
Yunxiao Shan ◽  
Jian Zhou
Keyword(s):  
Road Network ◽  
Principal Component ◽  
Automatic Generation ◽  
Road Segment ◽  
Automated Driving ◽  
High Definition ◽  
Topological Relations ◽  
Network Layer ◽  
The Road ◽  
Road Segments

High-definition (HD) maps have gained increasing attention in highly automated driving technology and show great significance for self-driving cars. An HD road network (HDRN) is one of the most important parts of an HD map. To date, there have been few studies focusing on road and road-segment extraction in the automatic generation of an HDRN. To improve the precision of an HDRN further and represent the topological relations between road segments and lanes better, in this paper, we propose an HDRN model (HDRNM) for a self-driving car. The HDRNM divides the HDRN into a road-segment network layer and a road-network layer. It includes road segments, attributes and geometric topological relations between lanes, as well as relations between road segments and lanes. We define the place in a road segment where the attribute changes as a linear event point. The road segment serves as a linear benchmark, and the linear event point from the road segment is mapped to its lanes via their relative positions to segment the lanes. Then, the HDRN is automatically generated from road centerlines collected by a mobile mapping vehicle through a multi-directional constraint principal component analysis method. Finally, an experiment proves the effectiveness of this HDRNM.

Travel Time Estimation on a Link without Real-Time Data by Correlated Links

2014 ◽  
Vol 931-932 ◽  
pp. 531-535
Author(s):  
Narong Intiruk ◽  
Sukree Sinthupinyo ◽  
Wasan Pattara-Atikom
Keyword(s):  
Travel Time ◽  
Real Time ◽  
Nearest Neighbor ◽  
Time Estimation ◽  
Road Segment ◽  
K Nearest Neighbor ◽  
Time Data ◽  
Current Time ◽  
The Road ◽  
Road Segments

This paper presents a novel method to estimate travel time on a road segment using information from other road segments. This method is useful especially in the case that real-time traffic on such road segment is not available. The proposed method is based on the correlation between the road segment itself and the most related road segment. We measure the relation between road segments by dynamic time warping algorithm and apply the K-Nearest-Neighbor algorithm to select the best neighbor segment to estimate the travel time on the target road segment. We found that the best attributes set that can measure the correlation between road sections consists of location of the road segments, day of the week, and current time. The link correlation results can be used as reference data to determine the travel time on the roads that are related.

scholarly journals Road network partitioning method based on Canopy-Kmeans clustering algorithm

2020 ◽  
Vol 54 (2) ◽  
pp. 95-106 ◽  
Author(s):  
Xiaohui Lin ◽  
Jianmin Xu
Keyword(s):  
Real Time ◽  
Road Network ◽  
Clustering Algorithm ◽  
Average Density ◽  
Road Segment ◽  
Network Partitioning ◽  
Network Partition ◽  
Average Speed ◽  
The Road ◽  
Road Segments

With the increasing scope of traffic signal control, in order to improve the stability and flexibility of the traffic control system, it is necessary to rationally divide the road network according to the structure of the road network and the characteristics of traffic flow. However, road network partition can be regarded as a clustering process of the division of road segments with similar attributes, and thus, the clustering algorithm can be used to divide the sub-areas of road network, but when Kmeans clustering algorithm is used in road network partitioning, it is easy to fall into the local optimal solution. Therefore, we proposed a road network partitioning method based on the Canopy-Kmeans clustering algorithm based on the real-time data collected from the central longitude and latitude of a road segment, average speed of a road segment, and average density of a road segment. Moreover, a vehicle network simulation platform based on Vissim simulation software is constructed by taking the real-time collected data of central longitude and latitude, average speed and average density of road segments as sample data. Kmeans and Canopy-Kmeans algorithms are used to partition the platform road network. Finally, the quantitative evaluation method of road network partition based on macroscopic fundamental diagram is used to evaluate the results of road network partition, so as to determine the optimal road network partition algorithm. Results show that these two algorithms have divided the road network into four sub-areas, but the sections contained in each sub-area are slightly different. Determining the optimal algorithm on the surface is impossible. However, Canopy-Kmeans clustering algorithm is superior to Kmeans clustering algorithm based on the quantitative evaluation index (e.g. the sum of squares for error and the R-Square) of the results of the subareas. Canopy-Kmeans clustering algorithm can effectively partition the road network, thereby laying a foundation for the subsequent road network boundary control.

scholarly journals Capacity in municipalities: Infrastructures, maintenance debts and ways of overcoming a run-to-failure mentality

2021 ◽  
pp. 026909422110304
Author(s):  
Jens Alm ◽  
Alexander Paulsson ◽  
Robert Jonsson
Keyword(s):  
Economies Of Scale ◽  
Heavy Traffic ◽  
Road Networks ◽  
Large Degree ◽  
Welfare States ◽  
The Road ◽  
Technical Capacity ◽  
Multidimensional Concept ◽  
Sewage Systems ◽  
Road Segments

There is a growing maintenance debt of ageing and critical infrastructures in many municipalities in European welfare states. In this article, we use the multidimensional concept of local capacity as a point of departure to analyse how and in what ways Swedish municipalities work with the routine maintenance of infrastructures, including municipal road networks as well as water and sewage systems. For the road networks, maintenance is generally outsourced to contractors and there is also a large degree of tolerance for various standards on different road segments within and between the municipalities. Less used road segments are not as prioritised as those with heavy traffic. For the water and sewage systems, in-house technical capacity is needed as differences in water quality are not tolerated. Economies of scale mean that in-house capacity is translated into the creation of inter-municipal bodies. As different forms of capacities tend to reinforce each other, municipal capacity builds up over time in circular movements. These results add knowledge to current research by pointing to the ways municipalities are overcoming a run-to-failure mentality by building capacity to pay off the infrastructural maintenance debt.

scholarly journals Towards a Rule-driven Approach for Updating Dynamic Road Segments

2012 ◽  
Vol 22 (6) ◽  
pp. 405-411
Author(s):  
Mohammad Reza Jelokhani-Niaraki ◽  
Ali Asghar Alesheikh ◽  
Abbas Alimohammadi ◽  
Abolghasem Sadeghi-Niaraki
Keyword(s):  
Data Model ◽  
Road Network ◽  
Road Maintenance ◽  
The Road ◽  
Dynamic Segmentation ◽  
Transportation Organization ◽  
Manual Tasks ◽  
The City ◽  
Transportation Applications ◽  
Road Segments

In recent years, the development of the GIS-T (Geographic Information System for Transportation) applications has gained much attention, providing the transportation planners and managers with in-depth knowledge to achieve better decisions. Needless to say, developing a successful GIS for transportation applications is highly dependent on the design of a well-structured data model. Dynamic segmentation (DS) data model is a popular one being used more and more for different GIS-T analyses, serving as a data model that splits linear features into new set of segments wherever its attributes change. In most cases, the sets of segments presenting a particular attribute change frequently. Transportation managers place great importance on having regular update and revision of segmented data to ensure correct and precise decisions are made. However, updating the segmented data manually is a difficult task and a time-consuming process to do, demanding an automatic approach. To alleviate this, the present study describes a rule-based method using topological concept to simply update road segments and replace the manual tasks that users are to carry out. The proposed approach was employed and implemented on real road network data of the City of Tehran provided by the Road Maintenance and Transportation Organization (RMTO) of Iran. The practical results demonstrated that the time, cost, human-type errors, and complexity involved in update tasks are all reduced. KEYWORDS: GIS-T, dynamic segmentation, segment, automatic update, change type, rule

Perception of Eye Scans with the Müller-Lyer Stimuli: Evidence for Filter Theory

1982 ◽  
Vol 54 (3) ◽  
pp. 683-692 ◽  
Author(s):  
J. Timothy Petersik
Keyword(s):  
Horizontal Line ◽  
Modulation Transfer ◽  
Physical Stimulus ◽  
Line Segments ◽  
Filter Theory ◽  
Lyer Illusion ◽  
Wide Range ◽  
Scan Path ◽  
Low Pass ◽  
Perceptual Distortions

Ginsburg's filter theory successfully accounts for the perceptual distortions perceived in a wide range of illusions and bistable phenomena. Essentially, the theory proposes that illusory distortions are the natural consequence of low-pass spatial filtering (based upon the human modulation transfer function) of the physical stimulus. With regard to the Müller-Lyer illusion, predictions based upon filter theory and human scan-path data are in accord. However, data linking filter theory's predictions regarding perceptual experiences associated with the illusion to the eye-scan results have been missing. In the present experiment subjects provided subjective estimations of their own eye scans while viewing each of the following stimuli: the fins-out member of the Müller-Lyer illusion, the fins-in member of the Müller-Lyer illusion, and a finless horizontal line (variations of each stimulus consisted of one, two, and three line segments). The analysis of these data supported three predictions that were derived from filter theory. Potential problems facing filter theory are also addressed.

Taxi Global Positioning System Data in Urban Road Network: A Methodology to Identify Key Road Clusters Based on Travel Speed–Traffic Volume Correlation

2021 ◽  
pp. 036119812110366
Author(s):  
Yi Li ◽  
Weifeng Li ◽  
Qing Yu ◽  
Han Yang
Keyword(s):  
Traffic Congestion ◽  
Road Network ◽  
Travel Speed ◽  
Detection Algorithm ◽  
Traffic Volume ◽  
Urban Traffic ◽  
Mitigation Strategies ◽  
Operating Characteristics ◽  
The Road ◽  
Road Segments

Urban traffic congestion is one of the urban diseases that needs to be solved urgently. Research has already found that a few road segments can significantly influence the overall operation of the road network. Traditional congestion mitigation strategies mainly focus on the topological structure and the transport performance of each single key road segment. However, the propagation characteristics of congestion indicate that the interaction between road segments and the correlation between travel speed and traffic volume should also be considered. The definition is proposed for “key road cluster” as a group of road segments with strong correlation and spatial compactness. A methodology is proposed to identify key road clusters in the network and understand the operating characteristics of key road clusters. Considering the correlation between travel speed and traffic volume, a unidirectional-weighted correlation network is constructed. The community detection algorithm is applied to partition road segments into key road clusters. Three indexes are used to evaluate and describe the characteristic of these road clusters, including sensitivity, importance, and IS. A case study is carried out using taxi GPS data of Shanghai, China, from May 1 to 17, 2019. A total of 44 key road clusters are identified in the road network. According to their spatial distribution patterns, these key road clusters can be classified into three types—along with network skeletons, around transportation hubs, and near bridges. The methodology unveils the mechanism of congestion formation and propagation, which can offer significant support for traffic management.

Investigation of Motorcycle Trajectories in 2-lane Horizontal Curves

2021 ◽  
Vol 16 ◽  
pp. 610-625
Author(s):  
Panagiotis Lemonakis
Keyword(s):  
Linear Equations ◽  
Great Accuracy ◽  
Design Guidelines ◽  
Road Segment ◽  
Small Radius ◽  
Horizontal Curve ◽  
Horizontal Alignment ◽  
The Road ◽  
Horizontal Curves ◽  
Traffic Lane

Most of the road design guidelines assume that the vehicles traverse a trajectory that coincides with the midline of the traffic lane. Based on this assumption the thresholds of various features are determined such as the maximum permissible side friction factor. It is therefore important to investigate the extent to which the trajectory of the vehicles is similar to the horizontal alignment of the road or substantial differences exist. To this end, a naturalistic riding study was designed and executed with the use of an instrumented motorcycle which measured the position of the motorcycle with great accuracy in a rural 2-lane road segment. The derived trajectories were then plotted against the horizontal alignment of the road and compared with the 3 consecutive elements which form a typical horizontal curve i.e., the entering spiral curve, the circular curve, and the exiting spiral curve. Linear equations were developed which correlate the traveled curvatures with the distance of each horizontal curve along the road segment under investigation. The process of the data revealed that the riders differ their trajectory compared to the alignment of the road. However, in small radius horizontal curves is more likely to observe curvatures that are similar to the geometric one. Moreover, the riders perform more abrupt maneuvres in the first part of the horizontal curves while they straighten the handlebars of the motorcycle before the end of the curve. The present paper aims to shed light on the behavior of motorcycle riders on horizontal curves and hence to contribute to the reduction of motorcycle accidents, particularly the single-vehicle ones.

Bikeability Audit in Urban Road Environment

2014 ◽  
Vol 5 (2) ◽  
pp. 21-39 ◽  
Author(s):  
Athanasios Galanis ◽  
Anestis Papanikolaou ◽  
Nikolaos Eliou
Keyword(s):  
Urban Area ◽  
Audit Tool ◽  
Urban Road ◽  
The Road ◽  
The City ◽  
Road Segments

Promotion of cycling can improve the sustainability level of a city or an urban area. This study presents a methodology that audits the bikeability level of the urban road environment across three selected routes in the city of Volos, Greece. This methodology is a useful toolkit in order to evaluate and improve the bikeability level of the urban road environment and also evaluate existing bikeways. Four suitably trained auditors rode their bikes and evaluated the bikeability level using an audit tool in order to audit specific features that influence bicycling suitability across the road segments and intersections of the selected routes. Furthermore, the auditors graded specific features of the road environment in order to set a bikeability score for each tested route. Finally, this study concludes that the bikeability level of the selected routes was moderate and certain actions are necessary in order to be improved.

scholarly journals Effect of type of road humps on vehicular speeds on residential roads

2018 ◽  
Vol 181 ◽  
pp. 04002
Author(s):  
Leksmono Suryo Putranto ◽  
Kevin Kurniawan
Keyword(s):  
Data Collection ◽  
Mean Difference ◽  
Statistical Analyses ◽  
Maximum Speed ◽  
Speed Reduction ◽  
The Road ◽  
Road Segments ◽  
Made In

To reduce potential pedestrian fatalities, in residential road maximum speed is 30km/hour. Apart from installing maximum speed signs, installing road humps may ensure speed reduction. This paper is intended to compare light vehicles and motorcycles speeds and speeds reductions due to road humps. Data collection was done in Modernland, Tanggerang City. Two road segments were observed, i.e. segments with standard and non-standard road humps. Observation was made in morning, noon and afternoon periods. A portable speed gun was used to measure the speed at about 50m and 25m before the road humps. Some mean difference statistical analyses were conducted for both speeds and speeds differences between different type of road humps and between pairs of observation periods. The 0.05 significant level was used. Surprisingly, mean of speeds differences (50m vs 25m) in standard road hump is significantly higher than in non-standard road hump.

Sign in / Sign up

Export Citation Format

Share Document