# total variationRecently Published Documents

## TOTAL DOCUMENTS

3532
(FIVE YEARS 1411)

## H-INDEX

90
(FIVE YEARS 23)

2022 ◽
Vol 151 ◽
pp. 106939
Author(s):
Wei Feng ◽
Xiuhua Li ◽
Xionghao Cheng ◽
Henghui Wang ◽
Zhi Xiong ◽
...
Keyword(s):

2022 ◽
Vol 421 ◽
pp. 126925
Author(s):
Baoli Shi ◽
Fang Gu ◽
Zhi-Feng Pang ◽
Yuhua Zeng
Keyword(s):

2022 ◽
Vol 419 ◽
pp. 126862
Author(s):
Rong Li ◽
Bing Zheng
Keyword(s):

2022 ◽
Vol 73 ◽
pp. 103478
Author(s):
Vijay Singh ◽
Devesh Pratap Singh ◽
Manoj Diwakar ◽
Keyword(s):

2022 ◽
Vol 61 (1) ◽
Author(s):
Juha Kinnunen ◽
Christoph Scheven
Keyword(s):

AbstractWe show that the notions of weak solution to the total variation flow based on the Anzellotti pairing and the variational inequality coincide under some restrictions on the boundary data. The key ingredient in the argument is a duality result for the total variation functional, which is based on an approximation of the total variation by area-type functionals.

Author(s):
K. Praveen Kumar ◽
C. Venkata Narasimhulu ◽
Keyword(s):

The degraded image during the process of image analysis needs more number of iterations to restore it. These iterations take long waiting time and slow scanning, resulting in inefficient image restoration. A few numbers of measurements are enough to recuperate an image with good condition. Due to tree sparsity, a 2D wavelet tree reduces the number of coefficients and iterations to restore the degraded image. All the wavelet coefficients are extracted with overlaps as low and high sub-band space and ordered them such that they are decomposed in the tree ordering structured path. Some articles have addressed the problems with tree sparsity and total variation (TV), but few authors endorsed the benefits of tree sparsity. In this paper, a spatial variation regularization algorithm based on tree order is implemented to change the window size and variation estimators to reduce the loss of image information and to solve the problem of image smoothing operation. The acceptance rate of the tree-structured path relies on local variation estimators to regularize the performance parameters and update them to restore the image. For this, the Localized Total Variation (LTV) method is proposed and implemented on a 2D wavelet tree ordering structured path based on the proposed image smooth adjustment scheme. In the end, a reliable reordering algorithm proposed to reorder the set of pixels and to increase the reliability of the restored image. Simulation results clearly show that the proposed method improved the performance compared to existing methods of image restoration.

2022 ◽
Vol 11 (2) ◽
pp. 258
Author(s):
Ge Ma ◽
Ziwei Yan ◽
Zhifu Li ◽
Zhijia Zhao
Keyword(s):

Total variation (TV) regularization has received much attention in image restoration applications because of its advantages in denoising and preserving details. A common approach to address TV-based image restoration is to design a specific algorithm for solving typical cost function, which consists of conventional ℓ2 fidelity term and TV regularization. In this work, a novel objective function and an efficient algorithm are proposed. Firstly, a pseudoinverse transform-based fidelity term is imposed on TV regularization, and a closely-related optimization problem is established. Then, the split Bregman framework is used to decouple the complex inverse problem into subproblems to reduce computational complexity. Finally, numerical experiments show that the proposed method can obtain satisfactory restoration results with fewer iterations. Combined with the restoration effect and efficiency, this method is superior to the competitive algorithm. Significantly, the proposed method has the advantage of a simple solving structure, which can be easily extended to other image processing applications.

Author(s):
Alexey Bufetov ◽
Peter Nejjar
Keyword(s):

AbstractThis paper studies the mixing behavior of the Asymmetric Simple Exclusion Process (ASEP) on a segment of length N. Our main result is that for particle densities in (0, 1),  the total-variation cutoff window of ASEP is $$N^{1/3}$$ N 1 / 3 and the cutoff profile is $$1-F_{\mathrm {GUE}},$$ 1 - F GUE , where $$F_{\mathrm {GUE}}$$ F GUE is the Tracy-Widom distribution function. This also gives a new proof of the cutoff itself, shown earlier by Labbé and Lacoin. Our proof combines coupling arguments, the result of Tracy–Widom about fluctuations of ASEP started from the step initial condition, and exact algebraic identities coming from interpreting the multi-species ASEP as a random walk on a Hecke algebra.

2022 ◽
Vol 14 (2) ◽
pp. 302
Author(s):
Chunchao Li ◽
Xuebin Tang ◽
Lulu Shi ◽
Yuanxi Peng ◽
Yuhua Tang
Keyword(s):

Effective feature extraction (FE) has always been the focus of hyperspectral images (HSIs). For aerial remote-sensing HSIs processing and its land cover classification, in this article, an efficient two-staged hyperspectral FE method based on total variation (TV) is proposed. In the first stage, the average fusion method was used to reduce the spectral dimension. Then, the anisotropic TV model with different regularization parameters was utilized to obtain featured blocks of different smoothness, each containing multi-scale structure information, and we stacked them as the next stage’s input. In the second stage, equipped with singular value transformation to reduce the dimension again, we followed an isotropic TV model based on split Bregman algorithm for further detail smoothing. Finally, the feature-extracted block was fed to the support vector machine for classification experiments. The results, with three hyperspectral datasets, demonstrate that our proposed method can competitively outperform state-of-the-art methods in terms of its classification accuracy and computing time. Also, our proposed method delivers robustness and stability by comprehensive parameter analysis.

Author(s):
Y. Behroozi ◽
M. Yazdi ◽