Skip to content

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

29 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Combining Geometry and Deep Learning for Lane Detection

Open In Colab

Overview

This project demonstrates that combining geometry and deep learning for lane detection: improving both clean accuracy and adversarial robustness simultaneously, with benefits amplifying as scene complexity increases.

We benchmark three complementary approaches to lane segmentation on TuSimple (highway) and CULane (complex urban) datasets at 256×320 resolution with independent training runs per dataset:

  • Traditional CV (non-CNN): Classic geometry & color heuristics (HSV masking, Canny, ROI, Hough, vanishing point, bird's-eye warp, polynomial fit). Serves as a non-learned baseline to establish the necessity of deep learning.
  • Rule-Augmented CNN: Encoder–decoder fed by two off-graph priors (Hough accumulator + vanishing-point heatmap) and in-network CV cues (grayscale, Sobel magnitude, ROI, HSV/edge features) with Spectral Normalization and geometric attention to encourage smooth, lane-like predictions and improve stability.
  • Standard CNN: Plain encoder–decoder baseline (no priors/regularizers) for controlled comparison.

Why three approaches? They span the spectrum from pure geometrygeometry-aware learninglearning-only, letting us isolate the impact of priors and architectural constraints on clean accuracy and adversarial robustness.

Key Findings

🎯 Dual Benefits: Accuracy + Robustness

Geometric constraints improve BOTH dimensions simultaneously:

Benefit TuSimple (Highway) CULane (Complex Urban) Pattern
Accuracy Gain +13.7% IoU +119% IoU (2.2×) Scales with complexity
Robustness Gain 4.0× better 26.9× better Amplifies on complex scenes

Robustness measured using worst-case compound attack (FGSM+PGD)

📊 Scene Complexity Scaling

Benefits amplify from simple highway to complex urban scenarios:

Simple (TuSimple)  →  Complex (CULane)
   +14% IoU        →     +119% IoU
   4.0× robust     →     26.9× robust

Hypothesis: Complex scenes (curved roads, multiple lanes, occlusions) require stronger geometric reasoning. Explicit geometric constraints provide scaffolding that becomes increasingly valuable as task difficulty increases.

Dataset Evaluation Protocol

  • TuSimple: Highway-focused preprocessed frames with binary lane masks

    • Clean annotations, relatively simple geometry
    • Lane pixels: ~1-2% of image
    • Resolution: 1280×720 → 256×320
  • CULane: Diverse urban/rural scenarios with categorical PNG labels (0-4, converted to binary)

    • Multiple lanes (up to 4), curved roads, challenging conditions (night, shadows)
    • Lane pixels: ~2.5% of image, ~89% samples with valid annotations
    • Resolution: 1640×590 → 256×320
  • Training: Separate independent runs per dataset with dataset-specific weight files

    • tusimple_rule_aug.weights.h5 / tusimple_standard.weights.h5
    • culane_rule_aug.weights.h5 / culane_standard.weights.h5
  • Per-dataset samples: 250 (160 train / 40 val / 50 test)

  • Automatic fallback: Attempts TuSimple first, falls back to CULane if unavailable

Experimental Results

TuSimple Results (Highway Scenarios, n=50 test)

Model Acc F1 IoU FGSM+PGD FGSM+CW PGD+CW Notes
Traditional CV 0.972 0.056 0.029 N/A N/A N/A 20% success rate; establishes DL necessity
Rule-Aug CNN 0.985 0.630 0.459 0.898 0.987 0.988 Winner on both metrics ✓
Standard CNN 0.984 0.576 0.404 0.225 0.996 0.994 Collapses under FGSM+PGD
Improvement +0.1% +9.4% +13.7% 4.0× better similar similar FGSM+PGD most discriminating

Traditional CV Failure Analysis (TuSimple)

  • 20% success rate overall
  • 32% HSV filter failures
  • 6% no Hough lines detected
  • 16% polynomial fit failures
  • 26% geometric validation failures

Conclusion: Traditional CV inadequate for real-world deployment → deep learning necessary

CULane Results (Complex Urban Scenarios, n=50 test)

Model Acc F1 IoU FGSM+PGD FGSM+CW PGD+CW Notes
Traditional CV 0.975 0.172 0.094 N/A N/A N/A Better than TuSimple due to preserved edges
Rule-Aug CNN 0.987 0.436 0.279 0.995 0.999 1.000 Winner on both metrics ✓
Standard CNN 0.976 0.226 0.127 0.370 1.029* 1.000 Struggles on complex scenes
Improvement +1.1% +93% +119% 26.9× better similar similar Benefits AMPLIFY with complexity

*Values >1.0 mean attack improved accuracy (noise as augmentation)

Training Dynamics (CULane)

Rule-Augmented CNN:

  • Trained 30 epochs, restored to epoch 24
  • Validation loss: 0.60 → 0.54 (stable convergence)
  • Used gentle pos_weight (3-8) for extreme class imbalance (97.5% background)
  • Learning rate reduced at epoch 18

Standard CNN:

  • Early collapse at epoch 3
  • Validation loss: 1.14 → 0.78 → 1.09 (exploded)
  • Required aggressive pos_weight (15-40) to learn at all
  • Minimal learning despite simplicity

Key Insight: Complex Rule-Aug architecture requires GENTLER loss; simple Standard CNN needs AGGRESSIVE weighting. Architecture-loss co-design critical.

Cross-Dataset Performance Comparison

Clean Performance Scaling

Model TuSimple IoU CULane IoU TuSimple→CULane Pattern
Traditional CV 2.9% 9.4% 3.2× better (edge preservation)
Rule-Aug CNN 45.9% 27.9% 1.6× drop (both win)
Standard CNN 40.4% 12.5% 3.2× drop (struggles)

Observations:

  1. Traditional CV anomaly: Better on "harder" CULane (9.4% vs 2.9%)

    • CULane preserves raw edges and categorical labels (0-4)
    • TuSimple preprocessing removes high-frequency geometric cues
    • Illustrates task difficulty is method-dependent
  2. Rule-Aug CNN leadership: Wins on BOTH datasets

    • Maintains reasonable performance on complex CULane (27.9%)
    • Achieves strong performance on simple TuSimple (45.9%)
    • Geometric priors enable graceful degradation
  3. Standard CNN struggles: 3.2× performance drop

    • TuSimple: 40.4% IoU (strong)
    • CULane: 12.5% IoU (poor)
    • Pure learning struggles without geometric scaffolding

Adversarial Robustness Comparison

Robustness Scores (Higher = Better, 1.0 = Perfect)

Attack TuSimple Rule TuSimple Std CULane Rule CULane Std
FGSM 0.954 0.944 0.990 1.029*
PGD 0.902 0.295 0.996 0.380
CW 0.990 1.000 1.000 1.000
FGSM+PGD 0.898 0.225 0.995 0.370
FGSM+CW 0.987 0.996 0.999 1.029*
PGD+CW 0.988 0.994 1.000 1.000

*Values >1.0 indicate attack improved accuracy (noise as augmentation)

Key Robustness Patterns

1. Compound Attacks are Most Discriminating

  • FGSM+PGD reveals true vulnerabilities (worst case for both models)
  • TuSimple: 77.5% accuracy drop (Standard) vs 10.2% (Rule-Aug) = 4.0× advantage
  • CULane: 63.0% accuracy drop (Standard) vs 0.5% (Rule-Aug) = 26.9× advantage
  • Pattern: Compound gradient attacks expose architectural weaknesses Standard CNN cannot handle

2. Complexity Amplification

  • Simple TuSimple: 4.0× robustness advantage (worst-case FGSM+PGD)
  • Complex CULane: 26.9× robustness advantage (worst-case FGSM+PGD)
  • Same pattern as clean performance: Benefits scale with scene complexity

3. Single Attack Effectiveness

  • FGSM (fast, single-step): Both models relatively robust
  • PGD (iterative, optimized): Exposes vulnerabilities dramatically (TuSimple Standard: 70.5% drop)
  • CW (optimization-based): Less effective on segmentation tasks (0.990-1.000 robustness)

4. Why Compound Attacks Matter

  • FGSM+PGD: Worst for Standard CNN (combines fast gradient + iterative optimization)
  • FGSM+CW: Both models relatively robust (0.987 Rule-Aug, 0.996 Standard on TuSimple)
  • PGD+CW: Similar pattern to FGSM+CW (0.988 Rule-Aug, 0.994 Standard on TuSimple)
  • Rule-Aug maintains stability across all compound attacks (0.898-0.988 on TuSimple, 0.995-1.000 on CULane)
  • Standard vulnerable primarily to gradient-based combinations

Why Compound Attack Effectiveness Varies:

  • FGSM+PGD most damaging: Both gradient-based attacks exploit similar vulnerabilities
  • FGSM+CW and PGD+CW less effective: CW (optimization-based) appears less effective on segmentation tasks
  • Pattern: Gradient-based attacks (FGSM, PGD) more threatening than optimization-based (CW) for lane detection segmentation

Defense Mechanisms

Defense Recovery (Accuracy Improvement After Defense)

TuSimple Defense Effectiveness

Attack + Defense Rule-Aug CNN Standard CNN Pattern
PGD + JPEG +0.072 (+7.2%) +0.659 (+65.9%) Standard needs defense
PGD + TTA +0.074 (+7.4%) +0.638 (+63.8%) Similar pattern
FGSM + JPEG +0.021 (+2.1%) +0.033 (+3.3%) Both relatively robust
FGSM + TTA +0.024 (+2.4%) +0.036 (+3.6%) Minimal benefit

CULane Defense Effectiveness

Attack + Defense Rule-Aug CNN Standard CNN Pattern
PGD + JPEG -0.004 (-0.4%) +0.509 (+50.9%) Rule-Aug doesn't need defense
PGD + TTA +0.005 (+0.5%) +0.517 (+51.7%) Inherent robustness
FGSM + JPEG +0.008 (+0.8%) +0.025 (+2.5%) Both relatively robust
FGSM + TTA +0.009 (+0.9%) +0.028 (+2.8%) Minimal benefit

Key Defense Insights

  1. Diminishing Returns for Robust Models

    • Rule-Aug gains 0-7.4% from defenses
    • Already robust → external defenses add little value
  2. Standard CNN Requires Defenses

    • Gains 50-66% accuracy recovery under PGD
    • High defense dependency for safety-critical deployment
  3. Defense Necessity Inverse to Architectural Robustness

    • Spectral norm + geometric priors = built-in robustness
    • Standard CNN depends on external preprocessing
  4. JPEG+Bilateral vs TTA

    • Similar effectiveness on both models
    • TTA slightly better (63.8% vs 65.9% on TuSimple PGD)
    • Both defenses evaluated on PGD@ε=0.10

Certified Robustness & Gradient Stability

Randomized Smoothing Certification

Dataset Rule-Aug Radius Rule-Aug Agreement Interpretation
TuSimple 0.241 0.950 (95.0%) Provable L2 robustness
CULane 0.299 0.993 (99.3%) Stronger certification on complex scenes

Key Finding: CULane achieves HIGHER certified radius (0.299 vs 0.241) despite being more complex. Geometric priors particularly effective in challenging scenarios.

Gradient Stability Analysis

Dataset Rule-Aug L2 (mean) Standard L2 (mean) Sensitivity Ratio
TuSimple 0.000 0.012 ∞× smoother
CULane 0.000 0.006 ∞× smoother

Interpretation:

  • Rule-Aug CNN has near-zero input gradients (rounded from <1e-5)
  • Spectral normalization successfully enforces Lipschitz constraint
  • Fundamentally smoother decision boundaries → inherent robustness
  • Standard CNN 12× (TuSimple) and 6× (CULane) higher sensitivity

Why Do Geometric Priors Improve Robustness?

Three synergistic mechanisms:

1. Structured Inductive Bias

  • Hough/VP maps constrain hypothesis space to geometrically plausible lanes
  • Adversarial perturbations violating lane geometry (horizontal edges, scattered points) contradict prior knowledge
  • Model rejects geometrically implausible predictions

2. Spectral Normalization

  • Power iteration enforces Lipschitz constraint: ‖∇f‖ ≤ L
  • Bounds output sensitivity to input changes
  • Empirical gradient L2=0.000 confirms effective constraint

3. Multi-Modal Fusion

  • Attacking RGB image alone insufficient
  • Adversary must fool BOTH RGB branch AND geometric prior branch
  • Increases attack difficulty significantly

Architectural Details

Rule-Augmented CNN Loss Function

Dataset-Adaptive Configuration:

# TuSimple (moderate imbalance)
Loss = 0.6 * WeightedBCE(pos_weight=10-50) + 0.4 * Dice

# CULane (extreme 97.5% background)
Loss = 0.5 * WeightedBCE(pos_weight=3-8) + 0.5 * Dice

Key Innovation: Complex architecture requires GENTLE pos_weight to prevent gradient explosion, especially on highly imbalanced data.

Standard CNN Loss Function

# TuSimple
Loss = BinaryCrossEntropy()

# CULane (needs aggressive weighting)
Loss = WeightedBCE(pos_weight=15-40)

Rationale: Simple architecture can handle aggressive class balancing without instability.

Geometric Attention Mechanism

w(y) = sigmoid((y - 0.6H) / (0.1H))

Where:

  • w(y) = vertical position weighting
  • y = pixel row index
  • H = image height (256)
  • Focuses computation on road region (bottom 40% of image)

HSV Color Detection Parameters

Optimized thresholds for robust lane marking detection:

White Markings

  • Lower: [0, 0, 200]
  • Upper: [180, 40, 255]
  • Increased saturation tolerance (30→40) for varied lighting

Yellow Markings

  • Lower: [15, 80, 80]
  • Upper: [35, 255, 255]
  • Expanded hue range (20-30° → 15-35°) captures faded/shadowed lanes
  • Relaxed saturation/value for worn markings

Rationale: Doubled yellow hue range (10°→20°) and relaxed thresholds better capture real-world lane variability: faded markings, shadows, off-white/cream lines.

Practical Deployment Considerations

Performance vs. Robustness Trade-off

Criterion Traditional CV Rule-Aug CNN Standard CNN
TuSimple IoU 2.9% 45.9% 40.4%
CULane IoU 9.4% 27.9% 12.5%
Worst-Case Robustness (TuSimple) N/A 89.8% 22.5%
Worst-Case Robustness (CULane) N/A 99.5% 37.0%
Interpretability High Medium Low
Compute (FLOPs) Low Medium Medium
Defense Dependency N/A Low High
Certification No Yes No

*Worst-Case = FGSM+PGD compound attack (most discriminating)

Safety-Critical Requirements

Rule-Augmented CNN offers optimal balance for autonomous vehicles:

Performance: 46% IoU (highway), 28% IoU (urban) - sufficient for deployment
Robustness: 90-99% against strongest compound attacks without external defenses
Worst-Case Ready: Maintains 89.8% (TuSimple) and 99.5% (CULane) under FGSM+PGD
Certification: Provable guarantees (radii 0.24-0.30) for regulatory compliance
Interpretability: Geometric constraints enable debugging (inspect Hough/VP maps)
Efficiency: Spectral norm adds ~10-15% training time, <5% inference overhead

Computational Overhead

  • Training: +10-15% time for power iteration (spectral normalization)
  • Inference: <5% overhead (spectral norm becomes standard conv after training)
  • Preprocessing: Hough/VP maps computed offline, zero runtime cost
  • Real-time viability: Yes, with modern GPUs (NVIDIA Drive PX2, Jetson Xavier)

Limitations & Future Work

Current Limitations

  1. Sample Size: 250 per dataset

    • Limited statistical power
    • Consistent cross-dataset patterns strengthen conclusions
    • Future: Scale to 1000-2000 samples
  2. Absolute Performance: 28% IoU (CULane) vs SOTA 70-75%

    • Simple encoder-decoder vs ResNet-34 backbones
    • Small dataset (250 vs 88,880 training images)
    • Low resolution (256×320 vs 590×1640)
    • Focus: Relative comparisons and architectural principles
  3. Single Resolution: Fixed 256×320

    • May not generalize to other resolutions
    • Justification: Standard resolution for fair comparison
  4. Attack Scope: Gradient-based digital attacks only

    • Missing: Physical patches, sensor spoofing, environmental perturbations
    • Future: Real-world adversarial testing

Future Directions

Immediate Extensions:

  • Scale to full datasets (TuSimple 3,626, CULane 88,880 samples)
  • SOTA backbones (ResNet-18/34, EfficientNet)
  • Ablation studies (isolate Hough, VP, spectral norm, geometric attention)
  • Physical adversarial patches and lane marking modifications

Theoretical Analysis:

  • Lipschitz constant bounds with spectral normalization
  • Information-theoretic view of geometric priors
  • Certified radius scaling laws with dataset complexity

Real-World Validation:

  • Multi-sensor fusion (vision + LiDAR + radar)
  • Temporal consistency across video sequences
  • Cross-dataset generalization (train TuSimple, test CULane)
  • Embedded hardware deployment (NVIDIA Drive PX2, Jetson Xavier)
  • Field testing with instrumented vehicles

Visualization Outputs

Generated Visualizations (per sample)

1. clean_*.png - Clean performance comparison

  • 2×2 grid: [Original | Ground Truth] / [Rule-Aug pred | Standard pred]
  • IoU scores on each prediction
  • Color overlays: green=Rule-Aug, red=Standard

2. attack_*.png - Adversarial attack comparison

  • 4×3 grid: [Clean | FGSM | PGD] × [Image, Perturbation, Predictions]
  • Perturbation visualization (amplified 10×)
  • IoU scores with drop metrics
  • Shows Rule-Aug stability vs Standard collapse

3. defense_*.png - Defense effectiveness evaluation

  • 3×4 grid: [Clean | PGD Attack | PGD+JPEG | Ground Truth]
  • Rule-Aug and Standard predictions for each condition
  • Recovery metrics showing defense effectiveness
  • Visual confirmation: Standard benefits (+51%), Rule-Aug already robust (-0.4%)

Key Metrics

Segmentation Metrics

  • Accuracy (Acc): Percentage of correctly classified pixels

    • Misleading on imbalanced data (can be 97%+ predicting all background)
    • Less important than IoU/F1 for lane detection
  • F1 Score: Harmonic mean of Precision and Recall

    • Balances false positives and false negatives
    • High only if both Precision and Recall are high
    • More informative than Accuracy for imbalanced segmentation
  • IoU (Intersection over Union): Most stringent metric

    • IoU = (Predicted ∩ Ground Truth) / (Predicted ∪ Ground Truth)
    • Primary metric for lane segmentation quality
    • Scale: <10% poor, 10-30% moderate, 30-50% good, >50% excellent

Robustness Metrics

  • Robustness Score: 1 - (acc_clean - acc_attack)

    • Values near 1.0 indicate high robustness
    • <0.05: excellent, 0.05-0.20: good, 0.20-0.50: moderate, >0.50: poor
  • Average Drop: acc_clean - acc_attack

    • Lower is better
    • Negative values: attack improved accuracy (noise as augmentation)
  • Certified Radius: Provable L2 perturbation bound

    • From randomized smoothing (σ=0.25, n=30, z=3.0)
    • 0.2: good, >0.3: excellent

  • Gradient L2 Norm: Input gradient magnitude

    • Measures model sensitivity to input changes
    • <0.01: very smooth (robust), >0.10: high sensitivity (vulnerable)

Implementation Notes

  • Predictions thresholded at 0.5 for binary masks
  • Acc = mean pixel-wise equality
  • Precision/Recall/F1 computed on flattened pixel vectors (all test pixels)
  • IoU = intersection/union of predicted vs ground-truth lane pixels
  • All attacks use batched implementation (PRED_BATCH=16) to avoid OOM
  • Randomized smoothing: Gaussian noise σ=0.25, 30 samples per image

Motivating Research

Primary Reference: Sato, T., & Chen, Q. A. (2021). On robustness of lane detection models to physical-world adversarial attacks in autonomous driving. arXiv preprint arXiv:2107.02488. https://arxiv.org/abs/2107.02488

This Work's Novel Contributions:

  1. Demonstrates geometric priors provide dual benefits (accuracy + robustness)
  2. Shows benefits scale with scene complexity (simple → complex amplification)
  3. Provides first comprehensive evaluation of Traditional CV, hybrid, and standard approaches
  4. Includes certified robustness analysis for lane detection segmentation
  5. Evaluates on two datasets with different complexity profiles

About

TuSimple Lane Detection & Models & Attacks and Defenses

Topics

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages