Color-complexity enabled exhaustive color-dots identification and spatial patterns testing in images
Shuting Liao, Li-Yu Liu, Ting-An Chen, Kuang-Yu Chen, Fushing Hsieh

TL;DR
This paper introduces a novel color-identification algorithm based on physics principles, enabling exhaustive detection of targeted color-dots and testing their spatial uniformness in images, with applications in precision agriculture.
Contribution
The paper presents a new physics-based color-identification method and a hierarchical clustering approach for testing spatial uniformness of color-dots in images.
Findings
The algorithm is robust across different lighting conditions.
It outperforms popular methods like Contour and OpenCV.
Applications demonstrated in drone-based precision agriculture.
Abstract
Targeted color-dots with varying shapes and sizes in images are first exhaustively identified, and then their multiscale 2D geometric patterns are extracted for testing spatial uniformness in a progressive fashion. Based on color theory in physics, we develop a new color-identification algorithm relying on highly associative relations among the three color-coordinates: RGB or HSV. Such high associations critically imply low color-complexity of a color image, and renders potentials of exhaustive identification of targeted color-dots of all shapes and sizes. Via heterogeneous shaded regions and lighting conditions, our algorithm is shown being robust, practical and efficient comparing with the popular Contour and OpenCV approaches. Upon all identified color-pixels, we form color-dots as individually connected networks with shapes and sizes. We construct minimum spanning trees (MST) as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
