Detection of Color Domination of Image Pieces as a Digital Puzzle Machine
Abstract
Puzzle is a game of rearranging pieces of picture objects, which can train creativity, order, and concentration levels. Problems in puzzle games will be more complicated when the size of the pieces gets smaller so that the number of pieces increases. The challenge is how to always make new puzzle arrangements and quickly reassemble recovery pieces. The focus of this research is to arrange puzzle pieces randomly and try to reposition the puzzle using the proposed method, namely DCD (Dominant Color Detection). The DCD method works by using the color histogram method to track the image based on the dominant color information. The Eucledian Distance method is then used to measure the level of image similarity . The similarity indication of the puzzle image is used to reposition the puzzle. Based on the test results, it is known that the accuracy of the repositioning results on the sample logo image, totaling 30 test images, is 100% successful in getting the whole image back according to the logo input image. This method has the opportunity to be used as an alternative to access security and also as a simple engine model for image search based on image fragments.
References
T. S. Weng, “Enhancing Problem-Solving Ability through a Puzzle-Type Logical Thinking Game,” Sci. Program., vol. 2022, 2022.
M. Akcaoglu, L. J. Jensen, and D. Gonzalez, “Understanding Children’s Problem-solving Strategies in Solving Game-based Logic Problems,” Int. J. Technol. Educ. Sci., vol. 5, no. 2, pp. 245–257, 2021.
E. Junianto and M. Z. Zuhdi, “Penerapan Metode Palette untuk Menentukan Warna Dominan dari Sebuah Gambar Berbasis Android,” J. Inform., vol. 5, no. 1, pp. 61–72, 2018.
B. H. Halimsah and E. Margiso, “Problem Solving Permainan Puzzle 8 Menggunakan Algoritma a *,” J. Ilm. SISFOTENIKA, vol. 4, no. 1, pp. 64–73, 2014.
R. Wijayanti, W. Nugraha, and K. Kusrini, “Optimalisasi Penyelesaian Permainan pada Game Puzzle 8 dengan Perbandingan Algoritma A* dan Greedy,” Creat. Inf. Technol. J., vol. 7, no. 1, p. 10, 2021.
M. J. Budiman, “Penyelesaian N-Puzzle Menggunakan A * dan Iterative Deepening A *,” no. 13515076. 2017.
R. Rahim, R. Dijaya, M. T. Multazam, A. D. Gs, and D. Sudrajat, “Puzzle game solving with breadth first search algorithm,” J. Phys. Conf. Ser., vol. 1402, no. 6, pp. 2–6, 2019.
A. A. Septiandri, I. T. Bandung, and J. G. Bandung, “Implementasi Algoritma BFS dan DFS dalam Penyelesaian Token Flip Puzzle.” pp. 1–5, 2012.
S. Silvilestari, “Steepest Ascent Hill Climbing Algorithm To Solve Cases In Puzzle Game 8,” IJISTECH (International J. Inf. Syst. Technol., vol. 5, no. 4, p. 366, 2021.
D. Abraham and I. W. Permana, “Penyelesaian Masalah 8-Puzzle dengan Algoritma Steepest-Ascent Hill Climbing,” Setrum Sist. Kendali-Tenaga-elektronika-telekomunikasi-komputer, vol. 4, no. 1, p. 40, 2016.
H. Anam, F. S. Hanafi, A. F. Adifia, A. F. Ababil, and S. Bukhori, “Penerapan Metode Steepest Ascent Hill Climb pada Permainan Puzzle,” INFORMAL Informatics J., vol. 3, no. 2, p. 36, 2018.
V. I. Kurniadi, “Perbandingan Algoritma Brute Force dan Backtracking dalam Permainan Word Search Puzzle.” 2017.
M. . Fakhrusy, “Penggunaan Strategi Algoritma Backtracking pada Pencarian Solusi Puzzle Pentomino.pdf.” Makalah IF2211 Strategi Algoritma, Sem. II 2015/2016, Bandung, 2016.
R. Effendi, I. Gunawan, and Y. Efendi, “Software Design Completion of Sudoku Game with Branch and Bound Algorithm,” vol. 410, no. Imcete 2019, pp. 126–130, 2020.
H. Fauzia, “Memecahkan Puzzle Hidato dengan Algoritma Branch and Bound.pdf.” 2012.
B. Yoga Budi Putranto, W. Hapsari, K. Wijana, and U. Kristen Duta Wacana Yogyakarta, “Segmentasi Warna Citra Dengan Deteksi Warna Hsv Untuk Mendeteksi Objek,” J. Inform., vol. 6, no. 2, pp. 1–14, 2010.
C. P. Beauty and Y. A. Sari, “Temu Kembali Citra Makanan Menggunakan Color Histogram Dan Local Binary Pattern,” J. Pengemb. Teknol. Inf. dan Ilmu Komput., vol. 3, no. 6, pp. 5514–5520, 2019.
H. Mustafidah and B. Nurdiyansah, “Rancang Bangun Aplikasi Penyelesaian Puzzle 8 Angka Menggunakan Metode Hill Climbing,” Sainteks, vol. 16, no. 1, pp. 55–69, 2020.
D. Nugraheny, “Metode Nilai Jarak Guna Kesamaan Atau Kemiripan Ciri Suatu Citra (Kasus Deteksi Awan Cumulonimbus Menggunakan Principal Component Analysis),” Angkasa J. Ilm. Bid. Teknol., vol. 7, no. 2, p. 21, 2017.
V. C. Epifania and E. Sediyono, “Pencarian File Gambar Berdasarkan Dominasi Warna,” J. Buana Inform., vol. 2, no. 1, pp. 1–10, 2011.
Copyright (c) 2022 Agustinus Rudatyo Himamunanto
This work is licensed under a Creative Commons Attribution 4.0 International License.
