5,541 Hits in 4.7 sec

Sorting by Swaps with Noisy Comparisons [article]

Tomáš Gavenčiak, Barbara Geissmann, Johannes Lengler
2018 arXiv   pre-print
We study sorting of permutations by random swaps if each comparison gives the wrong result with some fixed probability $p<1/2$.  ...  We use this process as prototype for the behaviour of randomized, comparison-based optimization heuristics in the presence of noisy comparisons.  ...  Conclusion We have studied sorting by random swaps with a noisy comparison operator.  ... 
arXiv:1803.04509v1 fatcat:mgsdjecrsnbznauru3l6f4k7ia

An Efficient VLSI Architecture for Adaptive Rank Order Filter for Image Noise Removal

M. Hanumantharaju
2011 International Journal of Information and Electronics Engineering  
AROF is a powerful technique for denoising an image corrupted by salt and pepper noise. The proposed method provides better filtering properties then it is possible with Adaptive Median Filter (AMF).  ...  The proposed method implements AROF in order to filter images with higher noise densities. The AROF uses median pixel or median computed from noise free pixels in order to replace noisy center pixel.  ...  The median computation unit operates after the sorting unit, therefore the noisy pixels or pixels with 0 values are ignored by this module and computes median from the noise free pixels. E.  ... 
doi:10.7763/ijiee.2011.v1.14 fatcat:2osxmsksynaqpobxevpvuqz3zi

Optimally Sorting Evolving Data [article]

Juan Jose Besa, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson
2018 arXiv   pre-print
data model where each comparison is followed by a swap between a random consecutive pair of items in the underlying total order.  ...  We show that a simple repeated insertion-sort algorithm can maintain an O(n) Kendall tau distance, with high probability, between a maintained list and an underlying total order of n items in an evolving  ...  With each comparison done by this repeated insertion-sort algorithm, we assume that a consecutive pair of elements in the underlying ordered list, l t , are chosen uniformly at random and swapped.  ... 
arXiv:1805.03350v1 fatcat:4e4hfsbadvfepapgykptszmt6i

Efficient implementation of Quantum circuits with limited qubit interactions [article]

Stephen Brierley
2016 arXiv   pre-print
We address this problem by providing an interaction graph together with an efficient method for compiling quantum circuits so that gates are applied only locally.  ...  The graph requires each qubit to interact with 4 other qubits and yet the time-overhead for implementing any n-qubit quantum circuit is 6 log n.  ...  The classical compiler then inputs the destinations into the sorting network and each time the comparison gate implements a SWAP, the compiler applies a SWAP gate to the corresponding qubits.  ... 
arXiv:1507.04263v2 fatcat:apemypmdefdbzmbh6jkcjz3eq4

Aggregating Incomplete and Noisy Rankings [article]

Dimitris Fotakis, Alkis Kalavasis, Konstantinos Stavropoulos
2021 arXiv   pre-print
We introduce a natural generalization of both the classical Mallows model of ranking distributions and the extensively studied model of noisy pairwise comparisons.  ...  We consider the problem of learning the true ordering of a set of alternatives from largely incomplete and noisy rankings.  ...  comparisons suffice for sorting, e.g.  ... 
arXiv:2011.00810v2 fatcat:5be7pl3pljhmjjgzdebh5f54cq

Novel Hardware Implementation of Adaptive Median Filters

Zdenek Vasicek, Lukas Sekanina
2008 2008 11th IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems  
The best performance/cost ratio exhibits the adaptive median filter which utilizes filtering window 7x7 pixels and can suppress shot noise with intensity up to 60%.  ...  For images corrupted by salt-and-pepper noise, the noisy pixels can take only the maximum or minimum values. In case of the randomvalued shot noise, the noisy pixels have an arbitrary value.  ...  The results corresponds with the costs given in Table I . The oddeven merge sort-based implementations require fewer slices in comparison with the bitonic sorter-based implementation.  ... 
doi:10.1109/ddecs.2008.4538766 dblp:conf/ddecs/VasicekS08 fatcat:2cbc6jb3gjg2lpxo774lro24dm


Vasanth K., Karthik S.
2010 ICTACT Journal on Image and Video Processing  
A novel algorithm is proposed for the restoration of images corrupted by impulse noise; this work aims at a novel filter whose window size is fixed (3X3) for all noise densities.  ...  Unlike the other filters, the proposed algorithm computes median if and only if there is a corrupted pixel and replaces it by the median value, if the median is corrupted then average of uncorrupted pixels  ...  Step 3: The pixel with maximum intensity is propagated to the final array position of the input data by the process of swapping as shown in figure 1. This gives P max .  ... 
doi:10.21917/ijivp.2010.0009 fatcat:7z647afd7bhdlbkqvfd3n4ulye

Preface to the Special Issue on Theory of Genetic and Evolutionary Computation

Carola Doerr, Dirk Sudholt
2019 Algorithmica  
To remedy this, theoretical computer scientists employ methods from the analysis of randomized algorithms to analyze the performance of EAs with mathematical rigor.  ...  It is known that EAs with large offspring populations can benefit from an increased mutation rate as λ offspring can amplify the chances of making good progress in one generation. But B Carola Doerr  ...  We hope that with this special issue we further increase the interest of the general algorithms research community into evolutionary computation methods.  ... 
doi:10.1007/s00453-018-00543-8 fatcat:m5zqhwy5uvh5dntwq2uhssenfy

Noise Invalidation Denoising

Soosan Beheshti, Masoud Hashemi, Xiao-Ping Zhang, Nima Nikvand
2010 IEEE Transactions on Signal Processing  
As it can be seen with probability 0.99997 there is no overlap between the sorted noise and sorted noisy data after a certain value of . A.  ...  This performance is illustrated in Fig. 5 which shows the area covered by the sorted noisy data for Blocks signal for when . The figure also shows the behavior of the sorted noise-only data.  ...  He is currently pursuing the M.S. degree with the Department of Electrical and Computer Engineering, Ryerson University, Toronto, Canada. His  ... 
doi:10.1109/tsp.2010.2074199 fatcat:64rvntsqqzhdzhzwyn4b4p5pqe

Approximation by Cubic Splines Leads to Highly Specific Discovery by Microarrays

Jerry L. Bona, Hassan M. Fathallah-Shaykh
2008 The Open Bioinformatics Journal  
Genome-scale microarray datasets are noisy. We have previously reported an algorithm that yields highly specific genome-scale discovery of states of genetic expression.  ...  obtained by global fitting.  ...  The same-to-same comparisons include 18 and 20 experiments that generate a total of 9 and 10 dye swapping data sets using the human 1.7K and 19K microarrays, respectively.  ... 
doi:10.2174/1875036200802010054 fatcat:hkedcwkulreybjmjr7ygdrb2rq

Quantum steering and quantum discord under noisy channels and entanglement swapping [article]

Pedro Rosario, Andrés F. Ducuara, Cristian E. Susa
2021 arXiv   pre-print
We quantify EPR-steering by means of an inequality with three-input two-output measurement settings, and address quantum discord as the interferometric power of quantum states.  ...  Second, we find that although noisy channels in general reduce the amount of correlations present in the system, the swapping protocol on the other hand displays scenarios where these quantum correlations  ...  For a direct comparison with Fig. 1, the behaviour of quantum properties is shown in Fig. 2 in terms of Almeida et. al. state parameters, for the particular noisy case of p = 0.4.  ... 
arXiv:2112.10027v1 fatcat:kzn33llbpnba7j7gpyqyngugxi

Multi-Label Noise Robust Collaborative Learning Model for Remote Sensing Image Classification [article]

Ahmet Kerem Aksoy, Mahdyar Ravanbakhsh, Begüm Demir
2021 arXiv   pre-print
RCML identifies, ranks and excludes noisy multi-labels in RS images based on three main modules: 1) discrepancy module; 2) group lasso module; and 3) swap module.  ...  To address this problem, the publicly available thematic products, which can include noisy labels, can be used to annotate RS images with zero-labeling cost.  ...  In detail, the swap module uses the ranking losses calculated by (6) and sorts them by the ascending order.  ... 
arXiv:2012.10715v4 fatcat:yadvadp5sbbnjo27rpkehshfpi

Sorting with bialgebras and distributive laws

Ralf Hinze, Daniel W.H. James, Thomas Harper, Nicolas Wu, José Pedro Magalhães
2012 Proceedings of the 8th ACM SIGPLAN workshop on Generic programming - WGP '12  
This has given rise to an informal notion of duality among sorting algorithms: insertion sorts are dual to selection sorts.  ...  Sorting algorithms are an intrinsic part of functional programming folklore as they exemplify algorithm design using folds and unfolds.  ...  Acknowledgments This work has been partially funded by EPSRC grant number EP/J010995/1, and an EPSRC DTA Studentship. Thanks are due to Jeremy Gibbons for insightful discussions.  ... 
doi:10.1145/2364394.2364405 dblp:conf/icfp/HinzeJHWM12 fatcat:rq5z4f6lhff2vhgn4em3zycfyq

How to select the largest k elements from evolving data? [article]

Qin Huang, Xingwu Liu, Xiaoming Sun, Jialin Zhang
2014 arXiv   pre-print
In each time step the algorithm can only probe the changes of data by comparing a pair of elements.  ...  This paper systematically deals with $k\in [n]$ and solves the problem almost completely.  ...  Fourth, with high probability, the error of the order computed by Local-sort is upper-bounded by the swaps during the run of Local-sort.  ... 
arXiv:1412.8164v1 fatcat:edh67cwezvahvbetmx4cabhugq

Nonlinear filtering by threshold decomposition

Jean-Hsang Lin, N. Ansari, Jinhui Li
1999 IEEE Transactions on Image Processing  
Performance comparison among several filters are then presented.  ...  It was found that TD is compatible with Ll, LOS, and linear filters in suppressing Gaussian noise, and is superior in suppressing salt-and-pepper noise.  ...  Substituting (23) into (6) (24) (25) (26) where denotes the sorted .  ... 
doi:10.1109/83.772235 pmid:18267505 fatcat:aitpjqbdvnga7nz67c6ci2u6xy
« Previous Showing results 1 — 15 out of 5,541 results