- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper formulates sparse-hint image colorization as an image-specific inverse problem. The proposed method, Colour-INR, represents the unknown CIELAB chrominance channels using a coordinate-based SIREN, while preserving the observed luminance for final image reconstruction. The network is optimized independently for each image using two losses: an MSE loss at sparse chrominance hint locations and an L1 spatial smoothness loss over eight-connected neighboring pixels. The smoothness term excludes pairs containing pixels identified as edges by a Canny detector applied to the luminance image.
Critical strengths
- Simple and clearly presented formulation: The paper presents a straightforward approach to sparse-hint colorization. Predicting only chrominance while preserving the observed luminance is a reasonable design choice, and the combination of sparse hint supervision and spatial regularization is easy to understand. The architecture and optimization procedure are described clearly.
Critical weaknesses
-
Performance: The most important limitation is that Colour-INR is consistently outperformed by the classical method of Levin et al. across all reported metrics. The paper also does not evaluate other possible advantages of the INR formulation, such as runtime, memory consumption, robustness to hint placement, or generalization across resolutions. In particular, Colour-INR requires image-specific optimization for 2,000 epochs, whereas Levin et al. solves an optimization problem directly. Without measured runtime and memory comparisons, the practical trade-off remains unclear.
-
Effects of the implicit neural representation: The proposed loss consists of sparse hint MSE and an edge-masked L1 smoothness penalty. When formulated directly over the unknown chrominance values at each pixel, this objective is convex, and it can be optimized without introducing a neural network. Does the SIREN provide a useful implicit prior, or are the reported results primarily explained by the sparse supervision and spatial regularization? It would be beneficial to include the most direct baseline: optimizing a dense pixel-wise chrominance grid using exactly the same objective and edge mask.
-
Effects of edge-guidance: The paper emphasizes grayscale-derived edge guidance as an important mechanism for preventing color propagation across object boundaries. However, the experiments only vary the smoothness coefficient while keeping the edge mask enabled. The method also depends on Canny edge detection, but no sensitivity analysis is provided for the edge thresholds, smoothing parameter, or missing and inaccurate boundaries. Comparisons with soft, intensity-dependent affinity weights, as used in classical color propagation, would be particularly informative.
-
Novelty: The proposed method combines established components: image-specific coordinate-based neural representations, sparse point supervision, and edge-aware spatial smoothness. Although applying this combination to hint-based colorization is a reasonable exploration, the paper does not clearly establish what new capability emerges from using an INR rather than directly optimizing a chrominance field. The paper would benefit from a more focused discussion of related image-specific colorization and neural-field methods, together with experiments identifying the distinctive benefits of the proposed representation.
Questions for authors
- What is the performance without edge masking? How sensitive is the method to Canny parameters, and how does hard edge exclusion compare with soft affinity-based smoothness?