LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A Hybrid Color Quantization Algorithm That Combines the Greedy Orthogonal Bi-Partitioning Method With Artificial Ants

Photo from wikipedia

A color quantization technique that combines the operations of two existing methods is proposed. The first method considered is the Greedy orthogonal bi-partitioning method. This is a very popular technique… Click to show full abstract

A color quantization technique that combines the operations of two existing methods is proposed. The first method considered is the Greedy orthogonal bi-partitioning method. This is a very popular technique in the color quantization field that can obtain a solution quickly. The second method, called Ant-tree for color quantization, was recently proposed and can obtain better images than some other color quantization techniques. The solution described in this article combines both methods to obtain images with good quality at a low computational cost. The resulting images are always better than those generated by each method applied separately. In addition, the results also improve those obtained by other well-known color quantization methods, such as Octree, Median-cut, Neuquant, Binary splitting or Variance-based methods. The features of the proposed method make it suitable for real-time image processing applications, which are related to many practical problems in diverse disciplines, such as medicine and engineering.

Keywords: quantization; method; orthogonal partitioning; greedy orthogonal; color quantization

Journal Title: IEEE Access
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.