okmain 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: b1c82cf5cfc87c588329a84ccb9b8118f7f27d7818a45150b021310dc28e2049
+  data.tar.gz: bef38f1590b89386ec4c8c9287edb55b5bb08255c787ec7b75d3ac45a6a81580
+SHA512:
+  metadata.gz: dba390c347ccd57cd71ee46b03ae5699614c6754802e8c465cf700025d078eeca8982374a575705f810469801190310e14c11c379df2808b6cce6a8eff13e0d3
+  data.tar.gz: b740152ded762d8bea52e83d81ee6eab78aab7ccc3a41ecbdf1be6e253051315dbd3f92fe553dc8df609adf0dcf7027ad7842c97cc54d7993dcbf7161b72d33e

data/LICENSE-APACHE

@@ -0,0 +1,176 @@
+                              Apache License
+                        Version 2.0, January 2004
+                     http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+   "License" shall mean the terms and conditions for use, reproduction,
+   and distribution as defined by Sections 1 through 9 of this document.
+
+   "Licensor" shall mean the copyright owner or entity authorized by
+   the copyright owner that is granting the License.
+
+   "Legal Entity" shall mean the union of the acting entity and all
+   other entities that control, are controlled by, or are under common
+   control with that entity. For the purposes of this definition,
+   "control" means (i) the power, direct or indirect, to cause the
+   direction or management of such entity, whether by contract or
+   otherwise, or (ii) ownership of fifty percent (50%) or more of the
+   outstanding shares, or (iii) beneficial ownership of such entity.
+
+   "You" (or "Your") shall mean an individual or Legal Entity
+   exercising permissions granted by this License.
+
+   "Source" form shall mean the preferred form for making modifications,
+   including but not limited to software source code, documentation
+   source, and configuration files.
+
+   "Object" form shall mean any form resulting from mechanical
+   transformation or translation of a Source form, including but
+   not limited to compiled object code, generated documentation,
+   and conversions to other media types.
+
+   "Work" shall mean the work of authorship, whether in Source or
+   Object form, made available under the License, as indicated by a
+   copyright notice that is included in or attached to the work
+   (an example is provided in the Appendix below).
+
+   "Derivative Works" shall mean any work, whether in Source or Object
+   form, that is based on (or derived from) the Work and for which the
+   editorial revisions, annotations, elaborations, or other modifications
+   represent, as a whole, an original work of authorship. For the purposes
+   of this License, Derivative Works shall not include works that remain
+   separable from, or merely link (or bind by name) to the interfaces of,
+   the Work and Derivative Works thereof.
+
+   "Contribution" shall mean any work of authorship, including
+   the original version of the Work and any modifications or additions
+   to that Work or Derivative Works thereof, that is intentionally
+   submitted to the Licensor for inclusion in the Work by the copyright owner
+   or by an individual or Legal Entity authorized to submit on behalf of
+   the copyright owner. For the purposes of this definition, "submitted"
+   means any form of electronic, verbal, or written communication sent
+   to the Licensor or its representatives, including but not limited to
+   communication on electronic mailing lists, source code control systems,
+   and issue tracking systems that are managed by, or on behalf of, the
+   Licensor for the purpose of discussing and improving the Work, but
+   excluding communication that is conspicuously marked or otherwise
+   designated in writing by the copyright owner as "Not a Contribution."
+
+   "Contributor" shall mean Licensor and any individual or Legal Entity
+   on behalf of whom a Contribution has been received by the Licensor and
+   subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   copyright license to reproduce, prepare Derivative Works of,
+   publicly display, publicly perform, sublicense, and distribute the
+   Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   (except as stated in this section) patent license to make, have made,
+   use, offer to sell, sell, import, and otherwise transfer the Work,
+   where such license applies only to those patent claims licensable
+   by such Contributor that are necessarily infringed by their
+   Contribution(s) alone or by combination of their Contribution(s)
+   with the Work to which such Contribution(s) was submitted. If You
+   institute patent litigation against any entity (including a
+   cross-claim or counterclaim in a lawsuit) alleging that the Work
+   or a Contribution incorporated within the Work constitutes direct
+   or contributory patent infringement, then any patent licenses
+   granted to You under this License for that Work shall terminate
+   as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the
+   Work or Derivative Works thereof in any medium, with or without
+   modifications, and in Source or Object form, provided that You
+   meet the following conditions:
+
+   (a) You must give any other recipients of the Work or
+       Derivative Works a copy of this License; and
+
+   (b) You must cause any modified files to carry prominent notices
+       stating that You changed the files; and
+
+   (c) You must retain, in the Source form of any Derivative Works
+       that You distribute, all copyright, patent, trademark, and
+       attribution notices from the Source form of the Work,
+       excluding those notices that do not pertain to any part of
+       the Derivative Works; and
+
+   (d) If the Work includes a "NOTICE" text file as part of its
+       distribution, then any Derivative Works that You distribute must
+       include a readable copy of the attribution notices contained
+       within such NOTICE file, excluding any notices that do not
+       pertain to any part of the Derivative Works, in at least one
+       of the following places: within a NOTICE text file distributed
+       as part of the Derivative Works; within the Source form or
+       documentation, if provided along with the Derivative Works; or,
+       within a display generated by the Derivative Works, if and
+       wherever such third-party notices normally appear. The contents
+       of the NOTICE file are for informational purposes only and
+       do not modify the License. You may add Your own attribution
+       notices within Derivative Works that You distribute, alongside
+       or as an addendum to the NOTICE text from the Work, provided
+       that such additional attribution notices cannot be construed
+       as modifying the License.
+
+   You may add Your own copyright statement to Your modifications and
+   may provide additional or different license terms and conditions
+   for use, reproduction, or distribution of Your modifications, or
+   for any such Derivative Works as a whole, provided Your use,
+   reproduction, and distribution of the Work otherwise complies with
+   the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise,
+   any Contribution intentionally submitted for inclusion in the Work
+   by You to the Licensor shall be under the terms and conditions of
+   this License, without any additional terms or conditions.
+   Notwithstanding the above, nothing herein shall supersede or modify
+   the terms of any separate license agreement you may have executed
+   with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade
+   names, trademarks, service marks, or product names of the Licensor,
+   except as required for reasonable and customary use in describing the
+   origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or
+   agreed to in writing, Licensor provides the Work (and each
+   Contributor provides its Contributions) on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+   implied, including, without limitation, any warranties or conditions
+   of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+   PARTICULAR PURPOSE. You are solely responsible for determining the
+   appropriateness of using or redistributing the Work and assume any
+   risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory,
+   whether in tort (including negligence), contract, or otherwise,
+   unless required by applicable law (such as deliberate and grossly
+   negligent acts) or agreed to in writing, shall any Contributor be
+   liable to You for damages, including any direct, indirect, special,
+   incidental, or consequential damages of any character arising as a
+   result of this License or out of the use or inability to use the
+   Work (including but not limited to damages for loss of goodwill,
+   work stoppage, computer failure or malfunction, or any and all
+   other commercial damages or losses), even if such Contributor
+   has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing
+   the Work or Derivative Works thereof, You may choose to offer,
+   and charge a fee for, acceptance of support, warranty, indemnity,
+   or other liability obligations and/or rights consistent with this
+   License. However, in accepting such obligations, You may act only
+   on Your own behalf and on Your sole responsibility, not on behalf
+   of any other Contributor, and only if You agree to indemnify,
+   defend, and hold each Contributor harmless for any liability
+   incurred by, or claims asserted against, such Contributor by reason
+   of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS

data/LICENSE-MIT

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 okmain-ruby contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

data/README.md

@@ -0,0 +1,76 @@
+# okmain
+
+A Ruby gem that extracts dominant colors from images using adaptive K-means clustering in the [Oklab](https://bottosson.github.io/posts/oklab/) perceptual color space.
+
+This is a port of the Rust [okmain](https://github.com/si14/okmain) crate by [Dan Groshev](https://github.com/si14). See also his [blog post](https://dgroshev.com/blog/okmain/) about the project.
+
+## Installation
+
+Add to your Gemfile:
+
+```ruby
+gem "okmain"
+```
+
+Or install directly:
+
+```
+gem install okmain
+```
+
+Requires [libvips](https://www.libvips.org/) to be installed on your system:
+
+```
+# macOS
+brew install vips
+
+# Debian/Ubuntu
+apt install libvips-dev
+
+# Fedora
+dnf install vips-devel
+```
+
+## Usage
+
+```ruby
+require "okmain"
+
+# Extract up to 4 dominant colors from an image file
+colors = Okmain.colors("photo.jpg")
+# => [[r, g, b], [r, g, b], ...]
+
+# Also accepts a Vips::Image
+require "vips"
+image = Vips::Image.new_from_file("photo.jpg")
+colors = Okmain.colors(image)
+
+# Customize scoring weights
+config = Okmain::Config.new(
+  chroma_weight: 0.5,              # weight for color vividness (default: 0.7)
+  mask_weighted_counts_weight: 0.5  # weight for pixel count/position (default: 0.3)
+)
+colors = Okmain.colors("photo.jpg", config: config)
+```
+
+Colors are returned as `[r, g, b]` arrays (0-255), sorted by score descending. The number of colors returned (up to 4) is determined adaptively — similar clusters are merged.
+
+## How it works
+
+1. **Sample** — Large images are block-averaged down to ~250k pixels using libvips, then converted from sRGB to Oklab
+2. **Cluster** — Adaptive K-means in Oklab space (K-means++ initialization, Lloyd's iterations, merging similar centroids)
+3. **Score** — Centroids ranked by a weighted combination of pixel count (with center-priority mask) and chroma
+4. **Return** — Up to 4 `[r, g, b]` arrays sorted by score
+
+## Credits
+
+Based on the Rust [okmain](https://github.com/si14/okmain) crate (v0.2.0) by Dan Groshev and okmain contributors.
+
+## License
+
+Licensed under either of
+
+- Apache License, Version 2.0 ([LICENSE-APACHE](LICENSE-APACHE) or http://www.apache.org/licenses/LICENSE-2.0)
+- MIT License ([LICENSE-MIT](LICENSE-MIT) or http://opensource.org/licenses/MIT)
+
+at your option.

data/lib/okmain/config.rb

@@ -0,0 +1,15 @@
+# frozen_string_literal: true
+
+module Okmain
+  class Config
+    attr_reader :chroma_weight, :mask_weighted_counts_weight
+
+    def initialize(chroma_weight: 0.7, mask_weighted_counts_weight: 0.3)
+      raise ArgumentError, "chroma_weight must be between 0 and 1" unless (0.0..1.0).cover?(chroma_weight)
+      raise ArgumentError, "mask_weighted_counts_weight must be between 0 and 1" unless (0.0..1.0).cover?(mask_weighted_counts_weight)
+
+      @chroma_weight = chroma_weight.to_f
+      @mask_weighted_counts_weight = mask_weighted_counts_weight.to_f
+    end
+  end
+end

data/lib/okmain/distance_mask.rb

@@ -0,0 +1,50 @@
+# frozen_string_literal: true
+
+module Okmain
+  module DistanceMask
+    SATURATED_THRESHOLD = 0.75
+
+    module_function
+
+    # Returns a flat Array of mask values (0.1..1.0) for each pixel, matching Rust's rectangular mask.
+    # Center pixels get 1.0, corner pixels get 0.1, with a linear ramp.
+    def compute(width, height)
+      half_w = width * 0.5
+      half_h = height * 0.5
+      x_threshold = half_w * SATURATED_THRESHOLD
+      y_threshold = half_h * SATURATED_THRESHOLD
+
+      mask = Array.new(width * height)
+      y = 0
+      while y < height
+        # Distance from nearest y-edge (0 at edge, half_h at center)
+        my = y < half_h ? y.to_f : (height - 1 - y).to_f
+        y_contrib = if y_threshold > 0.0
+                      v = 0.1 + 0.9 * (my / y_threshold)
+                      v < 1.0 ? v : 1.0
+                    else
+                      1.0
+                    end
+
+        row_offset = y * width
+        x = 0
+        while x < width
+          # Distance from nearest x-edge (0 at edge, half_w at center)
+          mx = x < half_w ? x.to_f : (width - 1 - x).to_f
+          x_contrib = if x_threshold > 0.0
+                        v = 0.1 + 0.9 * (mx / x_threshold)
+                        v < 1.0 ? v : 1.0
+                      else
+                        1.0
+                      end
+
+          mask[row_offset + x] = x_contrib < y_contrib ? x_contrib : y_contrib
+          x += 1
+        end
+        y += 1
+      end
+
+      mask
+    end
+  end
+end

data/lib/okmain/kmeans.rb

@@ -0,0 +1,176 @@
+# frozen_string_literal: true
+
+module Okmain
+  module KMeans
+    MAX_CENTROIDS = 4
+    LLOYDS_MAX_ITERATIONS = 300
+    LLOYDS_CONVERGENCE_TOL = 1e-3
+    SIMILAR_CLUSTER_DISTANCE_SQ = 0.005
+    KMEANSPP_CANDIDATES = 3
+
+    module_function
+
+    # Returns [centroids, assignments] where centroids is Array of [L, a, b]
+    # and assignments is Array of centroid indices per pixel.
+    def cluster(pixels, k: MAX_CENTROIDS)
+      rng = Random.new(42)
+      n = pixels.size
+      return [pixels.dup, Array.new(n) { |i| i }] if n <= k
+
+      loop do
+        centroids = init_plusplus(pixels, k, rng)
+        assignments = Array.new(n, 0)
+
+        centroids, assignments = lloyds(pixels, centroids, assignments, k, rng)
+
+        # Adaptive reduction: merge similar centroids
+        merged = false
+        i = 0
+        while i < k - 1 && !merged
+          j = i + 1
+          while j < k && !merged
+            if distance_sq(centroids[i], centroids[j]) < SIMILAR_CLUSTER_DISTANCE_SQ
+              k -= 1
+              merged = true
+            end
+            j += 1
+          end
+          i += 1
+        end
+
+        return [centroids, assignments] unless merged
+      end
+    end
+
+    # K-means++ initialization with 3 candidates per step
+    def init_plusplus(pixels, k, rng)
+      n = pixels.size
+      centroids = [pixels[rng.rand(n)].dup]
+
+      dist_sq = Array.new(n, Float::INFINITY)
+
+      (1...k).each do
+        # Update distances to nearest centroid
+        last = centroids.last
+        i = 0
+        while i < n
+          d = distance_sq(pixels[i], last)
+          dist_sq[i] = d if d < dist_sq[i]
+          i += 1
+        end
+
+        total = dist_sq.sum
+        best_candidate = nil
+        best_potential = Float::INFINITY
+
+        KMEANSPP_CANDIDATES.times do
+          # Weighted random selection
+          r = rng.rand * total
+          cumulative = 0.0
+          idx = 0
+          while idx < n
+            cumulative += dist_sq[idx]
+            if cumulative >= r
+              break
+            end
+            idx += 1
+          end
+          idx = n - 1 if idx >= n
+
+          # Compute potential for this candidate
+          candidate = pixels[idx]
+          potential = 0.0
+          i = 0
+          while i < n
+            d = distance_sq(pixels[i], candidate)
+            potential += d < dist_sq[i] ? d : dist_sq[i]
+            i += 1
+          end
+
+          if potential < best_potential
+            best_potential = potential
+            best_candidate = candidate
+          end
+        end
+
+        centroids << best_candidate.dup
+      end
+
+      centroids
+    end
+
+    def lloyds(pixels, centroids, assignments, k, rng)
+      n = pixels.size
+
+      LLOYDS_MAX_ITERATIONS.times do
+        # Assignment step
+        i = 0
+        while i < n
+          px = pixels[i]
+          best = 0
+          best_d = distance_sq(px, centroids[0])
+          c = 1
+          while c < k
+            d = distance_sq(px, centroids[c])
+            if d < best_d
+              best_d = d
+              best = c
+            end
+            c += 1
+          end
+          assignments[i] = best
+          i += 1
+        end
+
+        # Update step
+        new_centroids = Array.new(k) { [0.0, 0.0, 0.0] }
+        counts = Array.new(k, 0)
+
+        i = 0
+        while i < n
+          c = assignments[i]
+          px = pixels[i]
+          nc = new_centroids[c]
+          nc[0] += px[0]
+          nc[1] += px[1]
+          nc[2] += px[2]
+          counts[c] += 1
+          i += 1
+        end
+
+        shift_sq = 0.0
+        c = 0
+        while c < k
+          if counts[c] == 0
+            # Reassign empty cluster to random data point
+            ri = rng.rand(n)
+            new_centroids[c] = pixels[ri].dup
+          else
+            inv = 1.0 / counts[c]
+            nc = new_centroids[c]
+            nc[0] *= inv
+            nc[1] *= inv
+            nc[2] *= inv
+          end
+          dl = new_centroids[c][0] - centroids[c][0]
+          da = new_centroids[c][1] - centroids[c][1]
+          db = new_centroids[c][2] - centroids[c][2]
+          shift_sq += dl * dl + da * da + db * db
+          c += 1
+        end
+
+        centroids = new_centroids
+        break if shift_sq < LLOYDS_CONVERGENCE_TOL
+      end
+
+      [centroids, assignments]
+    end
+
+    def distance_sq(a, b)
+      dl = a[0] - b[0]
+      da = a[1] - b[1]
+      db = a[2] - b[2]
+      dl * dl + da * da + db * db
+    end
+  end
+end

data/lib/okmain/oklab.rb

@@ -0,0 +1,68 @@
+# frozen_string_literal: true
+
+module Okmain
+  module Oklab
+    module_function
+
+    # Linear RGB (0..1) → Oklab [L, a, b]
+    def linear_rgb_to_oklab(r, g, b)
+      l_ = 0.4122214708 * r + 0.5363325363 * g + 0.0514459929 * b
+      m_ = 0.2119034982 * r + 0.6806995451 * g + 0.1073969566 * b
+      s_ = 0.0883024619 * r + 0.2817188376 * g + 0.6299787005 * b
+
+      l_cbrt = Math.cbrt(l_)
+      m_cbrt = Math.cbrt(m_)
+      s_cbrt = Math.cbrt(s_)
+
+      l = 0.2104542553 * l_cbrt + 0.7936177850 * m_cbrt - 0.0040720468 * s_cbrt
+      a = 1.9779984951 * l_cbrt - 2.4285922050 * m_cbrt + 0.4505937099 * s_cbrt
+      b_ = 0.0259040371 * l_cbrt + 0.7827717662 * m_cbrt - 0.8086757660 * s_cbrt
+
+      [l, a, b_]
+    end
+
+    # Oklab [L, a, b] → linear RGB (0..1)
+    def oklab_to_linear_rgb(l, a, b)
+      l_ = l + 0.3963377774 * a + 0.2158037573 * b
+      m_ = l - 0.1055613458 * a - 0.0638541728 * b
+      s_ = l - 0.0894841775 * a - 1.2914855480 * b
+
+      l_cubed = l_ * l_ * l_
+      m_cubed = m_ * m_ * m_
+      s_cubed = s_ * s_ * s_
+
+      r =  4.0767416621 * l_cubed - 3.3077115913 * m_cubed + 0.2309699292 * s_cubed
+      g = -1.2684380046 * l_cubed + 2.6097574011 * m_cubed - 0.3413193965 * s_cubed
+      b_ = -0.0041960863 * l_cubed - 0.7034186147 * m_cubed + 1.7076147010 * s_cubed
+
+      [r, g, b_]
+    end
+
+    # sRGB component (0..255) → linear (0..1)
+    def srgb_to_linear(c)
+      c = c / 255.0
+      if c <= 0.04045
+        c / 12.92
+      else
+        ((c + 0.055) / 1.055)**2.4
+      end
+    end
+
+    # Linear (0..1) → sRGB component (0..255), clamped
+    def linear_to_srgb(c)
+      c = c.clamp(0.0, 1.0)
+      c = if c <= 0.0031308
+            12.92 * c
+          else
+            1.055 * (c**(1.0 / 2.4)) - 0.055
+          end
+      (c * 255.0).round.clamp(0, 255)
+    end
+
+    # Oklab → sRGB [r, g, b] (0..255)
+    def oklab_to_srgb8(l, a, b)
+      r, g, b_ = oklab_to_linear_rgb(l, a, b)
+      [linear_to_srgb(r), linear_to_srgb(g), linear_to_srgb(b_)]
+    end
+  end
+end

data/lib/okmain/sampler.rb

@@ -0,0 +1,64 @@
+# frozen_string_literal: true
+
+require "vips"
+
+module Okmain
+  module Sampler
+    MAX_SAMPLE_SIZE = 250_000
+
+    module_function
+
+    # Returns [pixels, width, height] where pixels is an Array of [L, a, b] triples.
+    def sample(input)
+      image = if input.is_a?(Vips::Image)
+                input
+              else
+                Vips::Image.new_from_file(input.to_s, access: :sequential)
+              end
+
+      # Flatten alpha to white background
+      image = image.flatten(background: [255, 255, 255]) if image.has_alpha?
+
+      # Convert to scRGB (linear float) for accurate block averaging
+      image = image.colourspace(:scrgb)
+
+      total = image.width * image.height
+      block_size = compute_block_size(total)
+
+      if block_size > 1
+        image = image.shrink(block_size, block_size)
+      end
+
+      width = image.width
+      height = image.height
+
+      # Extract float pixel data [r, g, b] in linear space
+      floats = image.write_to_memory.unpack("f*")
+      bands = image.bands
+      pixel_count = width * height
+
+      pixels = Array.new(pixel_count)
+      i = 0
+      while i < pixel_count
+        offset = i * bands
+        r = floats[offset]
+        g = floats[offset + 1]
+        b = floats[offset + 2]
+        pixels[i] = Oklab.linear_rgb_to_oklab(r, g, b)
+        i += 1
+      end
+
+      [pixels, width, height]
+    end
+
+    def compute_block_size(total)
+      return 1 if total <= MAX_SAMPLE_SIZE
+
+      bs = Math.sqrt(total.to_f / MAX_SAMPLE_SIZE).ceil
+      # Round up to multiple of 4
+      remainder = bs % 4
+      bs += (4 - remainder) if remainder != 0
+      bs
+    end
+  end
+end

data/lib/okmain/scorer.rb

@@ -0,0 +1,48 @@
+# frozen_string_literal: true
+
+module Okmain
+  module Scorer
+    MAX_SRGB_OKLAB_CHROMA = 0.32
+
+    module_function
+
+    # Returns Array of [r, g, b] (0..255) sorted by score descending.
+    def score(centroids, assignments, mask, config)
+      k = centroids.size
+      n = assignments.size
+      mask_w = config.mask_weighted_counts_weight
+      chroma_w = config.chroma_weight
+
+      # Weighted counts per centroid
+      weighted_counts = Array.new(k, 0.0)
+      i = 0
+      while i < n
+        c = assignments[i]
+        w = 1.0 - mask_w * (1.0 - mask[i])
+        weighted_counts[c] += w
+        i += 1
+      end
+
+      # Normalize to sum to 1.0
+      total = weighted_counts.sum
+      if total > 0
+        inv = 1.0 / total
+        j = 0
+        while j < k
+          weighted_counts[j] *= inv
+          j += 1
+        end
+      end
+
+      # Score each centroid
+      scored = centroids.each_with_index.map do |centroid, idx|
+        chroma = Math.sqrt(centroid[1] * centroid[1] + centroid[2] * centroid[2]) / MAX_SRGB_OKLAB_CHROMA
+        score = (1.0 - chroma_w) * weighted_counts[idx] + chroma_w * chroma
+        [score, centroid]
+      end
+
+      scored.sort_by! { |s, _| -s }
+      scored.map { |_, centroid| Oklab.oklab_to_srgb8(centroid[0], centroid[1], centroid[2]) }
+    end
+  end
+end

data/lib/okmain/version.rb

@@ -0,0 +1,5 @@
+# frozen_string_literal: true
+
+module Okmain
+  VERSION = "0.1.0"
+end

data/lib/okmain.rb

@@ -0,0 +1,25 @@
+# frozen_string_literal: true
+
+require_relative "okmain/version"
+require_relative "okmain/config"
+require_relative "okmain/oklab"
+require_relative "okmain/sampler"
+require_relative "okmain/distance_mask"
+require_relative "okmain/kmeans"
+require_relative "okmain/scorer"
+
+module Okmain
+  module_function
+
+  # Extract up to 4 dominant colors from an image.
+  #
+  # @param input [String, Vips::Image] file path or preloaded vips image
+  # @param config [Okmain::Config] optional scoring config
+  # @return [Array<Array<Integer>>] up to 4 [r, g, b] arrays sorted by score
+  def colors(input, config: Config.new)
+    pixels, width, height = Sampler.sample(input)
+    mask = DistanceMask.compute(width, height)
+    centroids, assignments = KMeans.cluster(pixels)
+    Scorer.score(centroids, assignments, mask, config)
+  end
+end

data/okmain.gemspec

@@ -0,0 +1,21 @@
+# frozen_string_literal: true
+
+require_relative "lib/okmain/version"
+
+Gem::Specification.new do |spec|
+  spec.name = "okmain"
+  spec.version = Okmain::VERSION
+  spec.authors = ["Joshua Paine"]
+  spec.summary = "Extract dominant colors from images using adaptive K-means in Oklab space"
+  spec.homepage = "https://github.com/midnightmonster/okmain-ruby"
+  spec.licenses = ["MIT", "Apache-2.0"]
+  spec.required_ruby_version = ">= 3.0"
+
+  spec.metadata["homepage_uri"] = spec.homepage
+  spec.metadata["source_code_uri"] = spec.homepage
+
+  spec.files = Dir["lib/**/*.rb"] + ["okmain.gemspec", "README.md", "LICENSE-MIT", "LICENSE-APACHE"]
+  spec.require_paths = ["lib"]
+
+  spec.add_dependency "ruby-vips", "~> 2.1"
+end

metadata

@@ -0,0 +1,66 @@
+--- !ruby/object:Gem::Specification
+name: okmain
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Joshua Paine
+bindir: bin
+cert_chain: []
+date: 1980-01-02 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: ruby-vips
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.1'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.1'
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- LICENSE-APACHE
+- LICENSE-MIT
+- README.md
+- lib/okmain.rb
+- lib/okmain/config.rb
+- lib/okmain/distance_mask.rb
+- lib/okmain/kmeans.rb
+- lib/okmain/oklab.rb
+- lib/okmain/sampler.rb
+- lib/okmain/scorer.rb
+- lib/okmain/version.rb
+- okmain.gemspec
+homepage: https://github.com/midnightmonster/okmain-ruby
+licenses:
+- MIT
+- Apache-2.0
+metadata:
+  homepage_uri: https://github.com/midnightmonster/okmain-ruby
+  source_code_uri: https://github.com/midnightmonster/okmain-ruby
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '3.0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.6.9
+specification_version: 4
+summary: Extract dominant colors from images using adaptive K-means in Oklab space
+test_files: []