spatial regularization
Recently Published Documents


TOTAL DOCUMENTS

121
(FIVE YEARS 36)

H-INDEX

18
(FIVE YEARS 3)

Displays ◽  
2021 ◽  
Vol 70 ◽  
pp. 102098
Author(s):  
Kai Lv ◽  
Liang Yuan ◽  
Li He ◽  
Ran Huang ◽  
Jie Mei

2021 ◽  
Vol 118 ◽  
pp. 103907
Author(s):  
Yueping Huang ◽  
Xiaofeng Li ◽  
Ruitao Lu ◽  
Yangguang Hu ◽  
Xiaogang Yang

Symmetry ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 1665
Author(s):  
Fei Chen ◽  
Xiaodong Wang

Recently, Discriminative Correlation Filters (DCF) have shown excellent performance in visual object tracking. The correlation for a computing response map can be conducted efficiently in Fourier domain by Discrete Fourier Transform (DFT) of inputs, where the DFT of an image has symmetry on the Fourier domain. To enhance the robustness and discriminative ability of the filters, many efforts have been devoted to optimizing the learning process. Regularization methods, such as spatial regularization or temporal regularization, used in existing DCF trackers aim to enhance the capacity of the filters. Most existing methods still fail to deal with severe appearance variations—in particular, the large scale and aspect ratio changes. In this paper, we propose a novel framework that employs adaptive spatial regularization and temporal regularization to learn reliable filters in both spatial and temporal domains for tracking. To alleviate the influence of the background and distractors to the non-rigid target objects, two sub-models are combined, and multiple features are utilized for learning of robust correlation filters. In addition, most DCF trackers that applied 1-dimensional scale space search method suffered from appearance changes, such as non-rigid deformation. We proposed a 2-dimensional scale space search method to find appropriate scales to adapt to large scale and aspect ratio changes. We perform comprehensive experiments on four benchmarks: OTB-100, VOT-2016, VOT-2018, and LaSOT. The experimental results illustrate the effectiveness of our tracker, which achieved a competitive tracking performance. On OTB-100, our tracker achieved a gain of 0.8% in success, compared to the best existing DCF trackers. On VOT2018, our tracker outperformed the top DCF trackers with a gain of 1.1% in Expected Average Overlap (EAO). On LaSOT, we obtained a gain of 5.2% in success, compared to the best DCF trackers.


Author(s):  
Jakeoung Koo ◽  
Elise Otterlei Brenne ◽  
Anders Bjorholm Dahl ◽  
Vedrana Andersen Dahl

Tomographic reconstruction is concerned with computing the cross-sections of an object from a finite number of projections. Many conventional methods represent the cross-sections as images on a regular grid. In this paper, we study a recent coordinate-based neural network for tomographic reconstruction, where the network inputs a spatial coordinate and outputs the attenuation coefficient on the coordinate. This coordinate-based network allows the continuous representation of an object. Based on this network, we propose a spatial regularization term, to obtain a high-quality reconstruction. Experimental results on synthetic data show that the regularization term improves the reconstruction quality significantly, compared to the baseline. We also provide an ablation study for different architecture configurations and hyper-parameters.


2021 ◽  
pp. 102067
Author(s):  
Oliver Maier ◽  
Stefan M. Spann ◽  
Daniela Pinter ◽  
Thomas Gattringer ◽  
Nicole Hinteregger ◽  
...  

2021 ◽  
Vol 13 (2) ◽  
pp. 190
Author(s):  
Bouthayna Msellmi ◽  
Daniele Picone ◽  
Zouhaier Ben Rabah ◽  
Mauro Dalla Mura ◽  
Imed Riadh Farah

In this research study, we deal with remote sensing data analysis over high dimensional space formed by hyperspectral images. This task is generally complex due to the large spectral, spatial richness, and mixed pixels. Thus, several spectral un-mixing methods have been proposed to discriminate mixing spectra by estimating the classes and their presence rates. However, information related to mixed pixel composition is very interesting for some applications, but it is insufficient for many others. Thus, it is necessary to have much more data about the spatial localization of the classes detected during the spectral un-mixing process. To solve the above-mentioned problem and specify the spatial location of the different land cover classes in the mixed pixel, sub-pixel mapping techniques were introduced. This manuscript presents a novel sub-pixel mapping process relying on K-SVD (K-singular value decomposition) learning and total variation as a spatial regularization parameter (SMKSVD-TV: Sub-pixel Mapping based on K-SVD dictionary learning and Total Variation). The proposed approach adopts total variation as a spatial regularization parameter, to make edges smooth, and a pre-constructed spatial dictionary with the K-SVD dictionary training algorithm to have more spatial configurations at the sub-pixel level. It was tested and validated with three real hyperspectral data. The experimental results reveal that the attributes obtained by utilizing a learned spatial dictionary with isotropic total variation allowed improving the classes sub-pixel spatial localization, while taking into account pre-learned spatial patterns. It is also clear that the K-SVD dictionary learning algorithm can be applied to construct a spatial dictionary, particularly for each data set.


Sign in / Sign up

Export Citation Format

Share Document