Trudy SPIIRAN
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Informatics and Automation:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Trudy SPIIRAN, 2018, Issue 60, Pages 156–188
DOI: https://doi.org/10.15622/sp.60.6
(Mi trspy1026)
 

This article is cited in 1 scientific paper (total in 1 paper)

Artificial Intelligence, Knowledge and Data Engineering

Dual optimization of monochrome images tone approximation using parallel evolutionarily genetic search

R. A. Neydorf, A. G. Aghajanyan

Don State Technical University
Abstract: The paper considers the optimization problem of tone approximation for monochrome (for example: in grayscale palette) images. The procedure of tone approximation implies the reduction of approximated image’s number of tones, which are used in image displaying, compared to number of tones in the original image. The point of the procedure optimization consists of minimization of visual quality loses that estimated according to total or mean deviation between the same pixels of original image and approximated one. As a tool of the optimization the hybrid algorithm is used. It was developed and investigated by authors. The hybrid algorithm combines heuristic and deterministic algorithms of searching the best structure of approximating palette according to criterion of deviations minimization. The heuristic algorithm is based on evolutionarily-genetic paradigm. The main goal of heuristic stage is the reduction of search area of approximating palette’s structures that are the closest to optimum. Such role for heuristic stage was defined according to its fast computational time. The goal of deterministic algorithm of directed exhaustive search is to find the nearest extreme for the result that was obtained by previous algorithm. The developed hybrid algorithm allows to provide dual optimization of tone approximation. It means that the algorithm provides a result, in which two different criteria become optimal relative to each other. The current investigation is devoted to consideration of possibility to increase the effectiveness of hybrid algorithm on the level of heuristic stage. The possibility of implementation the parallel model of evolutionarily-genetic algorithm with different settings is considered. The results of initial experiments are discussed and compared with known algorithm of tone approximation.
Keywords: tone approximation, hybridization, parallel model, optimization, adaptive scheme, evolutionarily-genetic algorithm, approximating palette.
Received: 16.04.2018
Bibliographic databases:
Document Type: Article
UDC: 004.932
Language: Russian
Citation: R. A. Neydorf, A. G. Aghajanyan, “Dual optimization of monochrome images tone approximation using parallel evolutionarily genetic search”, Tr. SPIIRAN, 60 (2018), 156–188
Citation in format AMSBIB
\Bibitem{NeiAgh18}
\by R.~A.~Neydorf, A.~G.~Aghajanyan
\paper Dual optimization of monochrome images tone approximation using parallel evolutionarily genetic search
\jour Tr. SPIIRAN
\yr 2018
\vol 60
\pages 156--188
\mathnet{http://mi.mathnet.ru/trspy1026}
\crossref{https://doi.org/10.15622/sp.60.6}
\elib{https://elibrary.ru/item.asp?id=36266199}
Linking options:
  • https://www.mathnet.ru/eng/trspy1026
  • https://www.mathnet.ru/eng/trspy/v60/p156
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Informatics and Automation
    Statistics & downloads:
    Abstract page:112
    Full-text PDF :39
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024