?
Tree-Serial Parametric Dynamic Programming With Flexible Prior Model For Image Denoising
Computer Optics. 2018. P. 1–8.
Pham Cong T., Копылов А. В.
We consider here image denoising procedures, based on computationally effective tree-serial parametric dynamic programming procedures, different representations of an image lattice by the set of acyclic graphs and non-convex regularization of a new type which allows to flexibly set a priori preferences. Experimental results in image denoising, as well as comparison with related methods, are provided. A new extended version of multi quadratic dynamic programming procedures for image denoising, proposed here, shows an improved accuracy for images of a different type.
Priority areas:
IT and mathematics
Language:
English
Publication based on the results of:
Shipilov F., Barnyakov A., Ivanov A. et al., / Series Physics "arxiv.org". 2026.
A fast simulation of the detector response is a vital task in high-energy physics (HEP). Traditional Monte-Carlo methods form the backbone of modern particle physics simulation software but are computationally expensive. We present a machine-learning-based approach to fast simulation of the Focusing Aerogel Ring Imaging Cherenkov (FARICH) detector response. Given a particle track and momentum, ...
Added: May 19, 2026
Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.
Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...
Added: April 28, 2026
Qin X., Deng Y., Shchur L. et al., / Series arXiv "math". 2026. No. 2603.02962.
We perform a Monte Carlo analysis of the Ising model on many three-dimensional lattices. By means of finite-size scaling we obtain the critical points and determine the scaling dimensions. As expected, the critical exponents agree with the three-dimensional Ising universality class for all models. The irrelevant field, as revealed by the correction-to-scaling amplitudes, appears to ...
Added: April 20, 2026
Pilé I., Deng Y., Shchur L., / Series arXiv "math". 2026. No. 2604.10254.
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Svendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for two models in different universality classes: the Ising model and the Potts model with three components. The overlap of two ...
Added: April 20, 2026
Gabdullin N., Androsov I., / Series Computer Science "arxiv.org". 2026.
Label prediction in neural networks (NNs) has O(n) complexity proportional to the number of classes. This holds true for classification using fully connected layers and cosine similarity with some set of class prototypes. In this paper we show that if NN latent space (LS) geometry is known and possesses specific properties, label prediction complexity can ...
Added: April 2, 2026
Sorokin K., Beketov M., Онучин А. et al., / arxiv.org. Серия cs.SI "Social and Information Networks ". 2025.
Community detection in complex networks is a fundamental problem, open to new approaches in various scientific settings. We introduce a novel community detection method, based on Ricci flow on graphs. Our technique iteratively updates edge weights (their metric lengths) according to their (combinatorial) Foster version of Ricci curvature computed from effective resistance distance between the ...
Added: January 15, 2026
Petrovanov I., Sergeev A., / Series Computer Science "arxiv.org". 2025. No. 2512.18332.
Transport coding reduces message delay in packet-switched networks by introducing controlled redundancy at the transport layer: original packets are encoded into coded packets, and the message is reconstructed after the first successful deliveries, effectively shifting latency from the maximum packet delay to the -th order statistic. We present a concise, reproducible discrete-event implementation of transport coding in OMNeT++, including ...
Added: December 24, 2025
Hessian-based lightweight neural network for brain vessel segmentation on a minimal training dataset
Меньшиков И. А., Бернадотт А. К., Elvimov N. S., / Series arXie "Statistical mechanics". 2025.
Accurate segmentation of blood vessels in brain magnetic resonance angiography (MRA) is essential for successful surgical procedures, such as aneurysm repair or bypass surgery. Currently, annotation is primarily performed through manual segmentation or classical methods, such as the Frangi filter, which often lack sufficient accuracy. Neural networks have emerged as powerful tools for medical image ...
Added: December 1, 2025
Chernyshov D., Satanin A., Shchur L., / Series arXiv "math". 2025.
We investigate the boundary separating regular and chaotic dynamics in the generalized Chirikov map, an extension of the standard map with phase-shifted secondary kicks. Lyapunov maps were computed across the parameter space (K,K(α, τ)) and used to train a convolutional neural network (ResNet18) for binary classification of dynamical regimes. The model reproduces the known critical ...
Added: November 21, 2025
Rubchinskiy A., Chubarova D., / Series WP7 "Математические методы анализа решений в экономике, бизнесе и политике". 2025. No. WP7/2025/01.
The article examines one of the most famous examples of socio-economic systems, characterized by significant uncertainty – the S&P-500 stock market, where shares of 500 largest US companies are traded. No assumptions are made about the probabilistic characteristics of the stock market. A flexible algorithm for daily trading has been developed, based on both known fixed data ...
Added: November 9, 2025
Meshchaninov V., Strashnov, P., Shevtsov A. et al., / Cornell University. Серия CoRR, arXiv:2403.03726 "Computing Research Repository,". 2025.
Protein design requires a deep understanding of the inherent complexities of the protein universe. While many efforts lean towards conditional generation or focus on specific families of proteins, the foundational task of unconditional generation remains underexplored and undervalued. Here, we explore this pivotal domain, introducing DiMA, a model that leverages continuous diffusion on embeddings derived ...
Added: October 5, 2025
Shabalin A., Meshchaninov V., Vetrov D., / Series cs.CL, arXiv:2505.18853 "Computation and Language". 2025.
Diffusion models have achieved state-of-the-art performance in generating images, audio, and video, but their adaptation to text remains challenging due to its discrete nature. Prior approaches either apply Gaussian diffusion in continuous latent spaces, which inherits semantic structure but struggles with token decoding, or operate in categorical simplex space, which respect discreteness but disregard semantic ...
Added: October 5, 2025
Абрамов А. С., Chernyshev V. L., Mikhaylets E. et al., / Series Social Science Research Network "Social Science Research Network". 2025.
Computer vision is one of the most relevant modern research areas with broad practical applications. However, traditional solutions based on deep learning have signicant limitations and can be misleading. Topological data analysis, on the other hand, is a modern approach to solving similar problems using mathematically deterministic methods of algebraic topology that reduce the risk ...
Added: September 23, 2025
Kochetkov Y., / Series arXiv.org e-print archive "arXiv.math". 2025. No. 07600.
We demonstrate in an elementary way how to construct a frieze pattern of width m-3 from a partition of a convex m-gon
by not intersecting diagonals. ...
Added: September 17, 2025
Kochetkov Y., / Series arXiv.org e-print archive "arXiv.math". 2025. No. 20584.
We give a new proof of the following statement: the Catalan number C_n is divisible
by n+2, if n is odd and n<> 3k+1. ...
Added: September 9, 2025
Burashnikov E., Operations Research Forum 2024
Added: September 21, 2024
Yerevan: Springer, 2024.
This book constitutes revised selected papers from the thoroughly refereed proceedings of the 11th International Conference on Analysis of Images, Social Networks and Texts, AIST 2023, held in Yerevan, Armenia, during September 28-30, 2023.
The 24 full papers included in this book were carefully reviewed and selected from 93 submissions. They were organized in topical ...
Added: March 6, 2024
D. V. Gribanov, Shumilov I. A., D. S. Malyshev, Optimization Letters 2024 Vol. 18 P. 73–103
In this work we consider the problem of computing the (min,+)-convolution of two sequences a and b of lengths n and m, respectively, where n≥m. We assume that a is arbitrary, but b_i=f(i), where f(x):[0,m)→R is a function with one of the following properties: f is linear, f is monotone, f is convex, f is concave, f is piece-wise linear, f is a polynomial function of a fixed degree. To the best of our knowledge, the concave, piece-wise linear and polynomial ...
Added: May 28, 2023
Springer, 2022.
This book constitutes the refereed proceedings of the 13th International Conference on Optimization and Applications, OPTIMA 2022, held in Petrovac, Montenegro, during September 26–30, 2022.
The 17 full papers and presented were carefully reviewed and selected from 43 submissions. They were organized into the following as follows: mathematical programming; global optimization; discrete and combinatorial optimization; optimal control; optimization ...
Added: January 17, 2023
Maron A., Maron M., Вестник Московского авиационного института 2022 Т. 29 № 2 С. 158–165
The relevance of this work is due to the fact, that reducing the time of searching and the time for eliminating defects in civil aviation passenger aircraft can significantly reduce departure delays and the associated losses of airlines. The analysis of statistical data shows that the searching and eliminating defects are the dominant causes of ...
Added: September 30, 2022
Afanasiev V., М.: Красанд/URSS, 2020.
This book has been prepared on the basis of lectures on control theory given by the author for a number of years to students of the Department of Applied Mathematics of the National Research University Higher School of Economics and the Faculty of Physics Moscow State University named after M. V. Lomonosov. The content of the ...
Added: August 27, 2022
Andreev N. A., Smirnov S. N., Computational Mathematics and Modeling 2021 Vol. 32 P. 22–44
We consider a guaranteed deterministic approach to discrete-time super-replication for guaranteed coverage of contingent claims on options for all possible asset-price scenarios. Price increases during a period are assumed to be contained in a priori specified compacta dependent on price history. A game problem is stated and reduced to the solution of the corresponding Bellman–Isaacs ...
Added: September 30, 2021
Lebedeva O., Poltavskaya J., Gozbenko V. et al., Journal of Physics: Conference Series 2020 Vol. 1614 Article 012101
Optimizing the configuration of the freight transport network is a challenge. The search for the optimal route solution in a dynamic urban multimodal transport network is aimed at minimizing the cost based on accurate forecasting of traffic flows and cost estimation. The purpose of the study is to review a methodology that can be applied ...
Added: July 15, 2021
Pospelov I. G., Zhukova A., , in: 2020 European Control Conference (ECC).: Institute of Electrical and Electronics Engineers Inc., 2020. P. 1129–1134.
This paper presents the approach to solving optimal control problems that appear in economic models using the Lagrange's multipliers method. This method is not as widely used as it might be, taking into accounts its benefits and convenience. The power of this method for intertemporal general equilibrium allows building complex structural models of the whole ...
Added: December 8, 2020