A High-Performance Filter for Image Denoising Based on Local Features

2012 ◽  
Vol 182-183 ◽  
pp. 496-500
Author(s):  
Xue Qing Zhao ◽  
Xiao Ming Wang ◽  
Qiang Liu
Keyword(s):  
Computational Complexity ◽  
Image Denoising ◽  
Radon Transform ◽  
High Performance ◽  
Local Features ◽  
The Other ◽  
Local Statistics ◽  
Local Structures ◽  
Fuzzy Mean ◽  
Evaluation Metric

A high-performance filter (HPF) is proposed for removing noises in corrupted images, where the local features are adopted to preserve the image local structures. Firstly, the Chebyshev’s theorem and fuzzy mean process are used to adaptively estimate the detection parameters. Secondly, the local statistics theory is used to estimate noisy pixels, which is based on Radon transform. Thirdly, the PSNR is used as the evaluation metric to show the advantage of the HPF, which is compared with latest filters, such as SBF, HPFSM and the classical filter SMF. Extensive experimental results show that the HPF achieves better performances in removing any kinds of noises (impulse, Gaussian, uniform and mixed), the computational complexity of the HPF is 5 to 11 times lower than the other filters.

Image Denoising Algorithm via Spatially Adaptive Bilateral Filtering

2013 ◽  
Vol 760-762 ◽  
pp. 1515-1518 ◽  
Author(s):  
Min Qi ◽  
Zuo Feng Zhou ◽  
Jing Liu ◽  
Jian Zhong Cao ◽  
Hao Wang ◽  
...  
Keyword(s):  
Computational Complexity ◽  
Image Denoising ◽  
Spatial Information ◽  
Bilateral Filtering ◽  
Denoising Method ◽  
Local Statistics ◽  
Filtering Algorithm ◽  
Spatially Adaptive ◽  
Intensity Information ◽  
Noise Experiment

The classical bilateral filtering algorithm is a non-linear and non-iterative image denoising method in spatial domain which utilizes the spatial information and the intensity information between a point and its neighbors to smooth the noisy images while preserving edges well. To further improve the image denoising performance, a spatially adaptive bilateral filtering image deonoising algorithm with low computational complexity is proposed. The proposed algorithm takes advantage of the local statistics characteristic of the image signal to better preserve the edges or textures while suppressing the noise. Experiment results show that the proposed image denoising algorithm achieves better performance than the classical bilateral filtering image denoising method.

On the Complexity of Deadlock Recovery

1986 ◽  
Vol 9 (3) ◽  
pp. 323-342
Author(s):  
Joseph Y.-T. Leung ◽  
Burkhard Monien
Keyword(s):  
Computational Complexity ◽  
Polynomial Time ◽  
Arbitrary Number ◽  
The Other ◽  
Np Hard ◽  
Total Cost ◽  
Other Hand ◽  
Input Parameters ◽  
Resource Type

We consider the computational complexity of finding an optimal deadlock recovery. It is known that for an arbitrary number of resource types the problem is NP-hard even when the total cost of deadlocked jobs and the total number of resource units are “small” relative to the number of deadlocked jobs. It is also known that for one resource type the problem is NP-hard when the total cost of deadlocked jobs and the total number of resource units are “large” relative to the number of deadlocked jobs. In this paper we show that for one resource type the problem is solvable in polynomial time when the total cost of deadlocked jobs or the total number of resource units is “small” relative to the number of deadlocked jobs. For fixed m ⩾ 2 resource types, we show that the problem is solvable in polynomial time when the total number of resource units is “small” relative to the number of deadlocked jobs. On the other hand, when the total number of resource units is “large”, the problem becomes NP-hard even when the total cost of deadlocked jobs is “small” relative to the number of deadlocked jobs. The results in the paper, together with previous known ones, give a complete delineation of the complexity of this problem under various assumptions of the input parameters.

scholarly journals Computational Complexity Reduction of Neural Networks of Brain Tumor Image Segmentation by Introducing Fermi–Dirac Correction Functions

Entropy ◽  
2021 ◽  
Vol 23 (2) ◽  
pp. 223
Author(s):  
Yen-Ling Tai ◽  
Shin-Jhe Huang ◽  
Chien-Chang Chen ◽  
Henry Horng-Shing Lu
Keyword(s):  
Neural Networks ◽  
Deep Learning ◽  
Computational Complexity ◽  
High Performance ◽  
Low Cost ◽  
Structural Complexity ◽  
Correction Function ◽  
Computational Time ◽  
Learning Methods ◽  
Band Theory

Nowadays, deep learning methods with high structural complexity and flexibility inevitably lean on the computational capability of the hardware. A platform with high-performance GPUs and large amounts of memory could support neural networks having large numbers of layers and kernels. However, naively pursuing high-cost hardware would probably drag the technical development of deep learning methods. In the article, we thus establish a new preprocessing method to reduce the computational complexity of the neural networks. Inspired by the band theory of solids in physics, we map the image space into a noninteraction physical system isomorphically and then treat image voxels as particle-like clusters. Then, we reconstruct the Fermi–Dirac distribution to be a correction function for the normalization of the voxel intensity and as a filter of insignificant cluster components. The filtered clusters at the circumstance can delineate the morphological heterogeneity of the image voxels. We used the BraTS 2019 datasets and the dimensional fusion U-net for the algorithmic validation, and the proposed Fermi–Dirac correction function exhibited comparable performance to other employed preprocessing methods. By comparing to the conventional z-score normalization function and the Gamma correction function, the proposed algorithm can save at least 38% of computational time cost under a low-cost hardware architecture. Even though the correction function of global histogram equalization has the lowest computational time among the employed correction functions, the proposed Fermi–Dirac correction function exhibits better capabilities of image augmentation and segmentation.

Closed Sets of Boolean Terms in Relational Databases

1991 ◽  
Vol 14 (3) ◽  
pp. 367-385
Author(s):  
Andrzej Jankowski ◽  
Zbigniew Michalewicz
Keyword(s):  
Computational Complexity ◽  
Incomplete Information ◽  
Relational Databases ◽  
The Other ◽  
New Approach ◽  
Closed Sets ◽  
Null Value ◽  
Algebraic Operations

A number of approaches have been taken to represent compound, structured values in relational databases. We review a few such approaches and discuss a new approach, in which every set is represented as a Boolean term. We show that this approach generalizes the other approaches, leading to more flexible representation. Boolean term representation seems to be appropriate in handling incomplete information: this approach generalizes some other approaches (e.g. null value mark, null variables, etc). We consider definitions of algebraic operations on such sets, like join, union, selection, etc. Moreover, we introduce a measure of computational complexity of these operations.

scholarly journals Biofoam of Spittlebug, Poophilus costalis (Walker): Preferential Sites, Temperature Regulation, Chemical Composition and Antimicrobial Activity

Insects ◽  
2021 ◽  
Vol 12 (4) ◽  
pp. 340
Author(s):  
Kitherian Sahayaraj ◽  
Balakrishnan Saranya ◽  
Samy Sayed ◽  
Loko Yêyinou Laura Estelle ◽  
Koilraj Madasamy
Keyword(s):  
Antimicrobial Activity ◽  
Chemical Composition ◽  
High Performance ◽  
Host Plants ◽  
Ground Level ◽  
College Campus ◽  
The Other ◽  
Mimosa Pudica ◽  
Ft Ir ◽  
Gas Chromatography Mass Spectroscopy

The foam produced by nymphs of Poophilus costalis on eleven different host plants belonging to eight families on St. Xavier’s College campus in India was studied over five months. The chemical composition and antimicrobial activity of these biofoams were investigated. The results revealed that P. costalis preferred Theporsia purpurea and Mimosa pudica for laying their eggs and producing foam, over the other tested plants. P. costalis produce their foam on either nodes or internodes on monocotyledons (30%) (p < 0.05), whereas on dicotyledons, they produce more foam on the stems (63.8%) than on the leaves (6.2%) (p < 0.01). The number of nymphs in each piece of foam from P. costalis varied from 1 to 3 (mean = 1.8 per plant). They produced their foam (5.7 to 45.2 cm) from the ground level on a plant. The length and breadth of a piece of foam ranged from 1.0 to 3.9 cm and 0.6 to 4.7 cm, respectively. The foam tended to be cooler than the environment. Qualitative profiling showed that the foam consists of carbohydrates, including maltose; trypsin; amino acids; protease. The foam was also analyzed using a spectrophotometer, Fourier transform infrared spectroscopy (FT-IR), gas chromatography–mass spectroscopy (GC-MS), and high-performance liquid chromatography (HPLC). The antimicrobial activity of the biofoam was the greatest against Staphylococcus aureus, the growth of which was reduced by 55.9 ± 3.9%, suggesting that the foam could be used as an antimicrobial product. However, no activities were observed against Fusarium oxysporum and Candida albicans.

Individual Differences in Attention and the Prediction of Flight Criteria

1971 ◽  
Vol 33 (3_suppl) ◽  
pp. 1335-1342 ◽  
Author(s):  
Daniel Gopher ◽  
Daniel Kahneman
Keyword(s):  
Individual Differences ◽  
Selective Attention ◽  
Dichotic Listening ◽  
High Performance ◽  
The Other ◽  
Listening Test ◽  
Transient Instability ◽  
High Performance Aircraft

A dichotic listening test was constructed which requires S to monitor a relevant message and to ignore a concurrent message presented to the other ear. The test has promising validity for predicting different criteria of proficiency in flying high-performance aircraft. An analysis of the most valid type of errors suggests that a change in an existing orientation is accompanied by a transient instability of selective attention. Most errors in continuous attention are omissions, which indicate a failure of the listening set. Intrusions, which indicate a failure of selectivity, are rare and their frequency is not correlated to flight criteria.

On the Chemistry of Tetrabenzyl Thiuram Disulfide and Tetramethyl Thiuram Disulfide with Bis (Triethoxysilylpropyl) Tetrasulfide in Silica Compounds

2003 ◽  
Vol 76 (4) ◽  
pp. 876-891 ◽  
Author(s):  
R. N. Datta ◽  
A. G. Talma ◽  
S. Datta ◽  
P. G. J. Nieuwenhuis ◽  
W. J. Nijenhuis ◽  
...  
Keyword(s):  
High Performance ◽  
Room Temperature ◽  
Succinic Anhydride ◽  
Dynamic Properties ◽  
The Other ◽  
Resonance Spectroscopy ◽  
Reaction Products ◽  
Negative Effect ◽  
Higher Temperature ◽  
Analytical Tools

Abstract The use of thiurams such as Tetramethyl thiuram disulfide (TMTD) or Tetrabenzyl thiuram disulfide (TBzTD) has been explored to achieve higher cure efficiency. The studies suggest that a clear difference exists between the effect of TMTD versus TBzTD. TMTD reacts with Bis (triethoxysilylpropyl) tetrasulfide (TESPT) and this reaction can take place even at room temperature. On the other hand, the reaction of TBzTD with TESPT is slow and takes place only at higher temperature. High Performance Liquid Chromatography (HPLC) with mass (MS) detection, Nuclear Magnetic Resonance Spectroscopy (NMR) and other analytical tools have been used to understand the differences between the reaction of TMTD and TESPT versus TBzTD and TESPT. The reaction products originating from these reactions are also identified. These studies indicate that unlike TMTD, TBzTD improves the cure efficiency allowing faster cure without significant effect on processing characteristics as well as dynamic properties. The loading of TESPT is reduced in a typical Green tire compound and the negative effect on viscosity is repaired by addition of anhydrides, such as succinic anhydride, maleic anhydride, etc.

scholarly journals Study of acrylamide level in food from vending machines

2016 ◽  
Vol 5 (4) ◽  
Author(s):  
Naceur Haouet ◽  
Simona Pistolese ◽  
Raffaella Branciari ◽  
David Ranucci ◽  
Maria Serena Altissimi
Keyword(s):  
Human Exposure ◽  
High Performance ◽  
High Variability ◽  
Potato Chips ◽  
The Other ◽  
Bakery Products ◽  
Vending Machines ◽  
Public Areas ◽  
Protein Rich ◽  
The City

Acrylamide is a byproduct of the Maillard reaction and is potentially carcinogenic to humans. It is found in a number of foods with higher concentrations in carbohydrate-rich foods and moderate levels of protein-rich foods such as meat, fish and seafood. Acrylamide levels in food distributed in vending machines placed in public areas of the city of Perugia were analyzed by high-performance liquid chromatography. Samples included five different categories, depending on the characteristics of the products: 1) potato chips; 2) salted bakery products; 3) biscuits and wafers; 4) sweet bakery products; 5) sandwiches. A high variability in acrylamide level among different foods and within the same category was detected. Potato chips showed the highest amount of acrylamide (1781±637 μg/kg) followed by salted bakery products (211±245 μg/kg), biscuits and wafers (184±254 μg/kg), sweet bakery products (100±72 μg/kg) and sandwiches (42±10 μg/kg). In the potato chips and sandwiches categories, all of the samples revealed the presence of acrylamide while different prevalence was registered in the other foods considered. The data of this study highlight the presence of acrylamide in different foods sold in vending machines and this data could be useful to understand the contribution of this type of consumption to human exposure to this compound.

scholarly journals Comparison of Multicast Algorithm Evaluation Results in Low and High Multicast Saturation Environments

2019 ◽  
Vol 3 ◽  
pp. 3-7
Author(s):  
Krzysztof Stachowiak ◽  
Piotr Zwierzykowski
Keyword(s):  
Quality Of Service ◽  
Computational Complexity ◽  
Optimization Methods ◽  
The Other ◽  
Ongoing Research ◽  
Mathematical Problems ◽  
Point To Point ◽  
Difficult Challenge ◽  
Entire Network

The multicast quality of service-enabled routing is a computationally challenging task. Despite ongoing research efforts, the associated mathematical problems are still considered to be NP-hard. In certain applications, computational complexity of finding the optimal connection between a set of network devices may be a particularly difficult challenge. For example, connecting a small group of participants of a teleconference is not much more complex than setting up a set of mutual point-to-point connections. On the other hand, satisfying the demand for such services as IPTV, with their receivers constituting the majority of the network, requires applying appropriate optimization methods in order to ensure real system execution. In this paper, algorithms solving this class of problems are considered. The notion of multicast saturation is introduced to measure the amount of multicast participants relative to the entire network, and the efficiency of the analyzed algorithms is evaluated for different saturation degrees.

Sign in / Sign up

Export Citation Format

Share Document