Road Signs Detection and Reconstruction using Gielis Curves

Similar documents
BoxPlot++ Zeina Azmeh, Fady Hamoui, Marianne Huchard. To cite this version: HAL Id: lirmm

HySCaS: Hybrid Stereoscopic Calibration Software

TRAFFIC SIGN RECOGNITION USING MSER AND RANDOM FORESTS. Jack Greenhalgh and Majid Mirmehdi

Extracting Road Signs using the Color Information

Detection and recognition of end-of-speed-limit and supplementary signs for improved european speed limit support

Selection of Scale-Invariant Parts for Object Class Recognition

Setup of epiphytic assistance systems with SEPIA

Comparison of spatial indexes

DSM GENERATION FROM STEREOSCOPIC IMAGERY FOR DAMAGE MAPPING, APPLICATION ON THE TOHOKU TSUNAMI

Real-time FEM based control of soft surgical robots

An FCA Framework for Knowledge Discovery in SPARQL Query Answers

NP versus PSPACE. Frank Vega. To cite this version: HAL Id: hal

DANCer: Dynamic Attributed Network with Community Structure Generator

Deformetrica: a software for statistical analysis of anatomical shapes

Traffic sign shape classification evaluation II: FFT applied to the signature of Blobs

Multimedia CTI Services for Telecommunication Systems

A Voronoi-Based Hybrid Meshing Method

lambda-min Decoding Algorithm of Regular and Irregular LDPC Codes

Fast Road Sign Detection Using Hough Transform for Assisted Driving of Road Vehicles

Tacked Link List - An Improved Linked List for Advance Resource Reservation

Lossless and Lossy Minimal Redundancy Pyramidal Decomposition for Scalable Image Compression Technique

Kinematic skeleton extraction based on motion boundaries for 3D dynamic meshes

YAM++ : A multi-strategy based approach for Ontology matching task

LaHC at CLEF 2015 SBS Lab

Prototype Selection Methods for On-line HWR

A Practical Approach for 3D Model Indexing by combining Local and Global Invariants

Branch-and-price algorithms for the Bi-Objective Vehicle Routing Problem with Time Windows

Taking Benefit from the User Density in Large Cities for Delivering SMS

The Proportional Colouring Problem: Optimizing Buffers in Radio Mesh Networks

Weed Leaf Recognition in Complex Natural Scenes by Model-Guided Edge Pairing

Fuzzy sensor for the perception of colour

Every 3-connected, essentially 11-connected line graph is hamiltonian

An Experimental Assessment of the 2D Visibility Complex

THE SPEED-LIMIT SIGN DETECTION AND RECOGNITION SYSTEM

Geometric Consistency Checking for Local-Descriptor Based Document Retrieval

Dense Hough transforms on gray level images using multi-scale derivatives

Fault-Tolerant Storage Servers for the Databases of Redundant Web Servers in a Computing Grid

An efficient alternative approach for home furniture detection and localization by an autonomous mobile robot

Regularization parameter estimation for non-negative hyperspectral image deconvolution:supplementary material

The optimal routing of augmented cubes.

C. Premsai 1, Prof. A. Kavya 2 School of Computer Science, School of Computer Science Engineering, Engineering VIT Chennai, VIT Chennai

THE COVERING OF ANCHORED RECTANGLES UP TO FIVE POINTS

How to simulate a volume-controlled flooding with mathematical morphology operators?

Syrtis: New Perspectives for Semantic Web Adoption

Fast and precise kinematic skeleton extraction of 3D dynamic meshes

Blind Browsing on Hand-Held Devices: Touching the Web... to Understand it Better

Mokka, main guidelines and future

Real-time tracking of multiple persons by Kalman filtering and face pursuit for multimedia applications

Robust IP and UDP-lite header recovery for packetized multimedia transmission

Motion-based obstacle detection and tracking for car driving assistance

Relabeling nodes according to the structure of the graph

Scale Invariant Detection and Tracking of Elongated Structures

Structuring the First Steps of Requirements Elicitation

QAKiS: an Open Domain QA System based on Relational Patterns

Continuous Control of Lagrangian Data

Graphe-Based Rules For XML Data Conversion to OWL Ontology

Teaching Encapsulation and Modularity in Object-Oriented Languages with Access Graphs

Zigbee Wireless Sensor Network Nodes Deployment Strategy for Digital Agricultural Data Acquisition

Service Reconfiguration in the DANAH Assistive System

ASAP.V2 and ASAP.V3: Sequential optimization of an Algorithm Selector and a Scheduler

A Resource Discovery Algorithm in Mobile Grid Computing based on IP-paging Scheme

Study on Feebly Open Set with Respect to an Ideal Topological Spaces

Real-Time Collision Detection for Dynamic Virtual Environments

Hand Gestures Recognition and Tracking

Multi-atlas labeling with population-specific template and non-local patch-based label fusion

Application of Artificial Neural Network to Predict Static Loads on an Aircraft Rib

Workspace and joint space analysis of the 3-RPS parallel robot

Two Algorithms for Detection of Mutually Occluding Traffic Signs

Change Detection System for the Maintenance of Automated Testing

Simulations of VANET Scenarios with OPNET and SUMO

Light field video dataset captured by a R8 Raytrix camera (with disparity maps)

An Efficient Numerical Inverse Scattering Algorithm for Generalized Zakharov-Shabat Equations with Two Potential Functions

Linux: Understanding Process-Level Power Consumption

A Practical Evaluation Method of Network Traffic Load for Capacity Planning

Road signs detection in color images by statistical approach

Scalewelis: a Scalable Query-based Faceted Search System on Top of SPARQL Endpoints

Paris-Lille-3D: A Point Cloud Dataset for Urban Scene Segmentation and Classification

The Connectivity Order of Links

From medical imaging to numerical simulations

Handwritten Digit Recognition using Edit Distance-Based KNN

QuickRanking: Fast Algorithm For Sorting And Ranking Data

A N-dimensional Stochastic Control Algorithm for Electricity Asset Management on PC cluster and Blue Gene Supercomputer

Moveability and Collision Analysis for Fully-Parallel Manipulators

Representation of Finite Games as Network Congestion Games

Hardware Acceleration for Measurements in 100 Gb/s Networks

Very Tight Coupling between LTE and WiFi: a Practical Analysis

Squaring the Circle with Weak Mobile Robots

KeyGlasses : Semi-transparent keys to optimize text input on virtual keyboard

Kernel perfect and critical kernel imperfect digraphs structure

Quality of Service Enhancement by Using an Integer Bloom Filter Based Data Deduplication Mechanism in the Cloud Storage Environment

Computing and maximizing the exact reliability of wireless backhaul networks

IMPLEMENTATION OF MOTION ESTIMATION BASED ON HETEROGENEOUS PARALLEL COMPUTING SYSTEM WITH OPENC

Decomposition of a curve into arcs and line segments based on dominant point detection

ROBUST MOTION SEGMENTATION FOR HIGH DEFINITION VIDEO SEQUENCES USING A FAST MULTI-RESOLUTION MOTION ESTIMATION BASED ON SPATIO-TEMPORAL TUBES

XML Document Classification using SVM

A 64-Kbytes ITTAGE indirect branch predictor

A case-based reasoning approach for unknown class invoice processing

Quasi-tilings. Dominique Rossin, Daniel Krob, Sebastien Desreux

Primitive roots of bi-periodic infinite pictures

A Fuzzy Approach for Background Subtraction

Transcription:

Road Signs Detection and Reconstruction using Gielis Curves Valentine Vega, Désiré Sidibé, Yohan Fougerolle To cite this version: Valentine Vega, Désiré Sidibé, Yohan Fougerolle. Road Signs Detection and Reconstruction using Gielis Curves. International Conference on Computer Vision Theory and Applications, Feb 2012, Rome, Italy. pp.393-396, 2012. <hal-00658085> HAL Id: hal-00658085 https://hal-univ-bourgogne.archives-ouvertes.fr/hal-00658085 Submitted on 9 Mar 2012 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

ROAD SIGN DETECTION AND SHAPE RECONSTRUCTION USING GIELIS CURVES Valentine Vega 1,2, Désiré Sidibé 2, and Yohan Fougerolle 2 1 Universitas Gunadarma, Jalan Margonda Raya 100, Depok, West Java, 162, Indonesia 2 Université de Bourgogne, Laboratoire Le2i, UMR CNRS 5158, 12 rue de la Fonderie, 71200, Le Creusot, France valentvga@gmail.com, {dro-desire.sidibe, yohan.fougerolle}@u-bourgogne.fr Keywords: Abstract: Road sign detection; Color segmentation; Contour fitting; Gielis curves. Road signs are among the most important navigation tools in transportation systems. The identification of road signs in images is usually based on first detecting road signs location using color and shape information. In this paper, we introduce such a two-stage detection method. Road signs are located in images based on color segmentation, and their corresponding shape is retrieved using a unified shape representation based on Gielis curves. The contribution of our approach is the shape reconstruction method which permits to detect any common road sign shape, i.e. circle, triangle, rectangle and octagon, by a single algorithm without any training phase. Experimental results with a dataset of 130 images containing 17 road signs of various shapes, show an accurate detection and a correct shape retrieval rate of 81.01% and 80.85% respectively. 1 INTRODUCTION Intelligent Transportation System (ITS) has been a rapidly growing topic of research over the last years. One important component of any ITS is the capability of automatic road sign recognition. The detection and identification of road sign is useful in highway maintenance, sign inventory or driver support systems. A road sign recognition system is composed of two main stages: the detection and the recognition (Bascon et al., 2007). Detection is performed to obtain an initial candidate of road sign, i.e. the possible region that represents road sign characteristics, using either color or shape information. Consequently, it requires a recognizer equipped with a set of features or patterns (Bascon et al., 2007; Escalera et al., 2003). Commonly used classifiers include neural network (Bascon et al., 2007), clustering (Escalera et al., 2003), nearest neighbor (Escalera et al., 200), Laplace kernel (Fang et al., 2003), and support vector machines (Nguwi and Kouzani, 2008). In this paper we focus on the detection stage of road signs in still images or videos. Several problems on detecting road signs in natural scene images include misdetection, occlusions, motions blur issues and scale variations. The two main features used to detect and recognize road signs are the color and the shape. Color is a powerful cue for object detection, but is sensitive to image acquisition conditions. On the other hand, the shape is invariant to illumination, but sensitive to occlusions and perspective distortions. Color based detection methods are based on color segmentation. For example, (Varun et al., 2007) use a simple threshold formula applied to the red color channel to detect red road signs. Several color spaces can be used, including HSV (Paclik et al., 2000), HSI (Escalera et al., 2003; Fang et al., 2003), CIECAM97 (Gao et al., 2006) and IHSI (Fleyeh, 200). Shape based methods have strong robustness to changing illumination as they detect shapes based on edges. The most recurrent method is certainly the generalized Hough transform (Ballard, 1981). Recently, (Loy and Zelinsky, 2002) propose the fast radial symmetry transform which is a technique similar to Hough transform. The method was extended and successfully used to detect regular polygons by (Loy and Barnes, 200). (Gavrila, 1999) uses a template matching approach for shape detection. First, edges in the original image are found. Then, a distance transform image is created and match against a reference template (for instance, a triangle). In this paper, we propose a robust road sign detection method which uses the color information to localize potential road signs and then, based on shape representation using Gielis curves (Gielis, 2003), identifies the shape of the detected signs. The major advantage of our approach is that it does not need

a multi-layer architecture as used in machine learning approaches (neural network or support vector machines). Furthermore, no initial training is needed. Hence, the method is simple, fast, and is able to identify any common road sign shape (triangle, rectangle, octagon and circle). Additionally, the proposed method is scale invariant and accurately detects road signs of different sizes. The paper is organized as follows: The color segmentation method adopted in our work is then described in Section 2. Section?? introduces Gielis curves and the road sign shape identification algorithm. Experimental results are shown in Section 3 before our conclusions in the last section. 2 ROAD SIGN DETECTION AND SHAPE RECONSTRUCTION The first step of the proposed method is the localization of potential road signs in the image through color segmentation. For robustness against lighting variations, the Improved Hue, Luminance and Saturation (IHLS) color space is selected. Once an image is converted to IHLS color space, potential road signs are detected using the segmentation method first introduced by (Escalera et al., 2003) and also used by (Fleyeh, 200). Figure 1 shows some segmentation results. As can be seen, road signs are correctly localized with the segmentation method in most cases. However, in some situations, because of lighting changes or occlusion, road signs are not entirely detected. Thus, some post-processing steps are necessary to help the shape reconstruction algorithm. Introduced by (Gielis, 2003), the superformula extends the superellipses by introducing variable rotational symmetry and asymmetric shape coefficients. The angle φ is replaced by mφ to obtain m rotational symmetries, and the unique shape coefficient n for superellipses is replaced by a triplet (n 1,n 2,n 3 ), leading to the following radial polar parameterization: r(φ) = 1 ) n 1 1 a cos( mφ n 2 ( ). (1) + 1 b sin mφ n 3 a,b, and n i are positive real numbers (a,b,n i R + ). a and b control the scale while n 1,n 2, and n 3 control the shape. m R + represents the number of rotational symmetries. By modifying the shape parameters, the set of the regular polygons can be generated. Three additional coefficients T x,t y and φ 0, corresponding to the position of the shape in the image Figure 1: Example of segmentation results. and its angular offset are added to represent Gielis curves in the general case. Consequently, the parameters set Λ of a Gielis curve is defined as Λ = {a,b,n 1,n 2,n 3,m,T x,t y,φ 0 }. The process of 2D data representation by Gielis curves starts by building a signed potential field (Fougerolle et al., 2005). A potential field is a signed function F which characterizes the inside and outside of a closed object, such that F(x) is positive if a point x lies within the object, F(x) is negative if x lies on the outside, and F(x) = 0 if x lies on the curve. The potential field is used to build a cost function to be minimized in the least-squared sense using Levenberg-Marquardt (LM) algorithm as illustrated in Figure 2. Figure 2: Levenberg-Marquardt: evolution of the curve. 3 EXPERIMENTS We evaluate the performance of the proposed approach on a dataset of 130 images containing 17 signs of various shapes and types. The dataset is a subset of the one used by (Bascon et al., 2007). Figures 3,, 5, and 6 show some detection results for circular, octogonal, rectangular and triangu-

Figure 3: Detection for circular road signs lar signs, respectively. As can be seen in these images, the shape reconstruction method can successfully identify different road sign types. It is important to note that the algorithm accurately detects road sign of different sizes in the image. This is a clear advantage over the method developped by (Loy and Barnes, 200) where different radii are tried in order to find the correct size of road signs. Detection results using the entire dataset are summarized in Table 1. From the 17 road signs, 11 are correctly detected and 11 road sign shapes are successfully reconstructed. Undesired detection occurs for 23 objects having similar color with road signs, while 27 road signs are incorrectly reconstructed. The percentage of road sign detection and shape reconstruction results are listed in Table 1. For each reference color, we calculate the percentage from the number of detected (reconstructed) road signs divided by the total number of road signs of that particular color. The total percentage is calculated from the number of detected (reconstructed) road signs in both colors divided by the total number of road signs in the images. Note that the performance of the shape reconstruction method (identification of road sign shape) is directly related to the performance of the detection step (color segmentation). Indeed, the shape of a road sign which is not detected in the segmentation step will obviously not be reconstructed. Several road signs in the dataset appear at a far distance from the camera, and can be eliminated in the post-processing stage, lowering detection rate. Incorrect reconstructions are due to different causes including incorrect segmentation, wrong initialization of the fitting algorithm and perspective distortion as illustrated in Figure 7. Figure : Detection for octogonal road signs Figure 5: Detection for rectangular road signs correct shape of the detected signs. Shape detection is based on shape representation using Gielis curves which provides an elegant way to handle all common road sign types, i.e. triangles, rectangles, octagons, and ellipses. Experimental results show the robustness of the approach in detecting traffic signs of various shapes. The method is invariant to in-plane rotation and to small perspective distortion due to the introduction of a rotational offset as a parameter in the fitting algorithm. It is also able to detect signs of different sizes in the image. The different causes of failure can be considered by improving the color segmentation method robustness to illumination effect. We could for example apply a color constancy algorithm prior to segmentation. Another improvement would be the introduction of a parameter in the fitting algorithm to account for strong perspective distortions. Eventually, the general least square formulation of the problem could be replaced by a more robust version, using M-estimators for instance, in or- CONCLUSION In this paper, a novel road sign detection method is proposed. The method first uses color information to localize potential road signs and then, identifies the Figure 6: Detection for triangular road signs

Table 1: Summary of detection and reconstruction results Detection (%) Reconstruction (%) detected not detected correct incorrect Red Signs 81.3 18.57 81.58 18.2 Blue Signs 79.1 20.59 77.78 22.22 TOTAL 81.03 18.97 80.85 19.15 (a) Multiple parts extraction (b) High perspective distorsions (c) Intense light varaitions (d) Occlusions Figure 7: Examples of wrong reconstruction. der to better handle outliers to improve the results in presence of degenerate contours due to occlusions or strong light variations. REFERENCES Ballard, D. H. (1981). Generalizing the hough transform to detect arbitrary shapes. Pattern Recognition, 13(2):111 122. Bascon, S. M., Arroyo, S. L., Jimenez, P. G., Moreno, H. G., and Ferreras, F. L. (2007). Road Sign Detection and Recognition Based on Support Vector Machines. In IEEE Transactions on Intelligent Transportation System, volume 8, pages 26 278. Escalera, A., Armingol, J. M., and Mata, M. (2003). Traffic Sign Recognition and Analysis for Intelligent Vehicles. Image and Vision Computing, 21:27 258. Escalera, A., Armingol, J. M., Pastor, J. M., and Rodriguez, F. J. (200). Visual Sign Information Extraction and Identification by Deformable Models for Intelligent Vehicles. In IEEE Transactions on Intelligent Transportation Systems, volume 5, pages 57 68. Fang, C. Y., Chen, S. W., and Fuh, C. S. (2003). Road Sign Detection and Tracking. In IEEE Transactions on Vehicular Technology, volume 52, pages 1329 131. Fleyeh, H. (200). Color Detection and Segmentation for Road and Traffic Signs. In Proceedings of the 200 IEEE Conference on Cybernetics and Intelligent Systems, pages 808 813, Singapore. Fougerolle, Y. D., Gribok, A., Foufou, S., Truchetet, F., and Abidi, M. A. (2005). Boolean Operations with Implicit and Parametric Representations of Primitives using R-functions. In IEEE Transactions on Visualisation and Computer Graphics, volume 11, pages 529 539. Gao, X., Podladchikova, L., Shaposhnikov, D., Hong, K., and Shevtsova, N. (2006). Recognition of traffic signs based on their colour and shape features extracted using human vision models. Journal of Visual Communication and Image Representation, 17():675 685. Gavrila, D. (1999). Traffic sign recognition revisited. In GAGM-Symposium, pages 86 93. Gielis, J. (2003). A Generic Geometric Transformation that Unifies a Wide Range of Natural and Abstract Shapes. American Journal Botany, 90:333 338. Loy, G. and Barnes, N. (200). Fast shape-based road sign detection for driver assistance system. In Proceedings of International Conference on Intelligent Robots and Systems (IROS 0), pages 70 75. Loy, G. and Zelinsky, A. (2002). A fast radial symmetry transform for detecting points of interest. In Proceedings of 7th European Conference on Computer Vision, pages 358 368. Nguwi, Y. Y. and Kouzani, A. Z. (2008). Detection and Classification of Road Signs in Natural Environment. In Neural Compututing and Application, pages 265 289. Springer-Verlag London Limited 2007. Paclik, P., Novovicova, J., Pudil, P., and Somol, P. (2000). Road sign classiffication using laplace kernel classifier. Pattern Recognition Letters, 21:1165 1173. Varun, S., Singh, S., Kunte, R. S., Samuel, R. D. S., and Philip, B. (2007). A road traffic signal recognition system based on template matching employing tree classifier. In Proceedings of International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 07), pages 360 365, Washington, DC, USA.