BITPNet: Unsupervised Bio-Inspired Two-Path Network for Nighttime Traffic Image Enhancement
Bibliographic record
Abstract
Due to the low luminance in nighttime traffic images, image features are not salient, making tasks in intelligent transportation systems such as nighttime vehicle detection challenging. Recently, convolutional neural network based methods have been developed for low-light image enhancement. Most of these methods are supervised and require high-light reference images at the same scenes. However, reference images are difficult to be obtained in nighttime traffic scenes because vehicles always move. In the early visual system the input signals are processed by two parallel visual paths in the retina: one path has small receptive fields (RFs) to process the high frequency information and another path has large RFs to deal with the low frequency information. Inspired by this, we design a novel bio-inspired two-path convolutional neural network (BITPNet) for nighttime traffic image enhancement. The high-frequency path with small convolution kernel size is designed to suppress noises and preserve the details. The low-frequency path with large convolution kernel size is used to enhance the luminance of images. Each path includes an encoder-to-decoder network followed by a new multi-level attention module to combine features of levels with different RFs. The outputs of the two paths are summed by learnt weights for generating the final image enhancement result. Several no-reference image quality metrics are utilized to design a new loss function, resulting in an unsupervised approach. The proposed BITPNet is trained on one nighttime traffic image dataset and evaluated on another nighttime dataset. Experimental results demonstrate that the proposed BITPNet outperforms several state-of-the-art low-light image enhancement methods in terms of visual quality and three no-reference image quality metrics. In addition, when the proposed BITPNet is used as pre-processing for the nighttime multi-class vehicle detection task, it achieves higher detection rate (97.18%) than other methods.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".