|
|
|
|
|
Xuesong Jin, Huiyuan Sun and Yuhang Zhang
This research is based on an intra-frame rate control algorithm based on the Versatile Video Coding (VVC) standard, considering that there is the phenomenon of over-allocating the bitrate of the end coding tree units (CTUs) in the bit allocation process,...
ver más
|
|
|
|
|
|
|
|
|
|
|
José-Luis Molina, Santiago Zazo, Fernando Espejo, Carmen Patino-Alonso, Irene Blanco-Gutiérrez and Domingo Zarzo
Floods are probably the most hazardous global natural event as well as the main cause of human losses and economic damage. They are often hard to predict, but their consequences may be reduced by taking the right precautions. In this sense, hydraulic inf...
ver más
|
|
|
|
|
|
|
|
|
|
|
Barbara Cardone, Ferdinando Di Martino and Salvatore Sessa
This research proposes a new image compression method based on the F1-transform which improves the quality of the reconstructed image without increasing the coding/decoding CPU time. The advantage of compressing color images in the YUV space is due to th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Max Bannach and Sebastian Berndt
Research on the similarity of a graph to being a tree?called the treewidth of the graph?has seen an enormous rise within the last decade, but a practically fast algorithm for this task has been discovered only recently by Tamaki (ESA 2017). It is based o...
ver más
|
|
|
|
|
|
|
|
|
|
|
Viktor Uglev and Oleg Sychev
The article discusses the problem of visualization of complex multiparameter systems, defined by datasets on their structure, functional structure, and activity in the form of complex graphs and transition of traditional representation of the data acquir...
ver más
|
|
|
|
|
|
|
|
|
|
|
Max Bannach and Till Tantau
Color coding is an algorithmic technique used in parameterized complexity theory to detect ?small? structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color pat...
ver más
|
|
|
|
|
|
|
|
|
|
|
Michele Giusfredi and Franco Bagnoli
We study the problem of color-avoiding and color-favored percolation in a network, i.e., the problem of finding a path that avoids a certain number of colors, associated with vulnerabilities of nodes or links, or is attracted by them. We investigate here...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jongsu Yoon and Yoonsik Choe
Retinex theory represents the human visual system by showing the relative reflectance of an object under various illumination conditions. A feature of this human visual system is color constancy, and the Retinex theory is designed in consideration of thi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Gang Yan, Rongjia Bi, Yingchun Guo and Weifeng Peng
Image aesthetic evaluation refers to the subjective aesthetic evaluation of images. Computational aesthetics has been widely concerned due to the limitations of subjective evaluation. Aiming at the problem that the existing evaluation methods of image ae...
ver más
|
|
|
|
|
|
|
|
|
|
|
Faisal N. Abu-Khzam and Karam Al Kontar
This paper provides an overview of the field of parameterized parallel complexity by surveying previous work in addition to presenting a few new observations and exploring potential new directions. In particular, we present a general view of how known ??...
ver más
|
|
|
|
|
|