Search results for "algorithm"
showing 10 items of 4887 documents
Theoretical investigations of the IR spectroscopy of Ni(C(2)S(2)H(2))(2). A case study of the P_VMWCI(2) algorithm including anharmonic effects.
2010
The near infrared (NIR) spectra of bis(ethylene-1,2-dithiolato)nickel, Ni(C(2)S(2)H(2))(2) are fully interpreted here by applying a method developed for efficient automatic computation of both the infrared wave numbers and the intensities. The employed procedure uses parallel variational multiple window configuration interaction wave functions, the so-named P_VMWCI(2) algorithm, which incorporates both the mechanical and the electric anharmonic effects. It is shown that inclusion of anharmonicities is crucial for correctly assigning the fundamental, combination, and overtone vibrational frequencies in the infrared spectrum of the target system, for which conflicting assignments are found in…
Reducing complexity in H.264/AVC motion estimation by using a GPU
2011
H.264/AVC applies a complex mode decision technique that has high computational complexity in order to reduce the temporal redundancies of video sequences. Several algorithms have been proposed in the literature in recent years with the aim of accelerating this part of the encoding process. Recently, with the emergence of many-core processors or accelerators, a new approach can be adopted for reducing the complexity of the H.264/AVC encoding algorithm. This paper focuses on reducing the inter prediction complexity adopted in H.264/AVC and proposes a GPU-based implementation using CUDA. Experimental results show that the proposed approach reduces the complexity by as much as 99% (100x of spe…
Improved SOM Learning using Simulated Annealing
2007
Self-Organizing Map (SOM) algorithm has been extensively used for analysis and classification problems. For this kind of problems, datasets become more and more large and it is necessary to speed up the SOM learning. In this paper we present an application of the Simulated Annealing (SA) procedure to the SOM learning algorithm. The goal of the algorithm is to obtain fast learning and better performance in terms of matching of input data and regularity of the obtained map. An advantage of the proposed technique is that it preserves the simplicity of the basic algorithm. Several tests, carried out on different large datasets, demonstrate the effectiveness of the proposed algorithm in comparis…
Versatile optimization-based speed-up method for autofocusing in digital holographic microscopy
2021
We propose a speed-up method for the in-focus plane detection in digital holographic microscopy that can be applied to a broad class of autofocusing algorithms that involve repetitive propagation of an object wave to various axial locations to decide the in-focus position. The classical autofocusing algorithms apply a uniform search strategy, i.e., they probe multiple, uniformly distributed axial locations, which leads to heavy computational overhead. Our method substantially reduces the computational load, without sacrificing the accuracy, by skillfully selecting the next location to investigate, which results in a decreased total number of probed propagation distances. This is achieved by…
Quantum Machine Learning: A tutorial
2021
This tutorial provides an overview of Quantum Machine Learning (QML), a relatively novel discipline that brings together concepts from Machine Learning (ML), Quantum Computing (QC) and Quantum Information (QI). The great development experienced by QC, partly due to the involvement of giant technological companies as well as the popularity and success of ML have been responsible of making QML one of the main streams for researchers working on fuzzy borders between Physics, Mathematics and Computer Science. A possible, although arguably coarse, classification of QML methods may be based on those approaches that make use of ML in a quantum experimentation environment and those others that take…
Combining split-and-merge and multi-seed region growing algorithms for uterine fibroid segmentation in MRgFUS treatments
2016
Uterine fibroids are benign tumors that can affect female patients during reproductive years. Magnetic resonance-guided focused ultrasound (MRgFUS) represents a noninvasive approach that uses thermal ablation principles to treat symptomatic fibroids. During traditional treatment planning, uterus, fibroids, and surrounding organs at risk must be manually marked on MR images by an operator. After treatment, an operator must segment, again manually, treated areas to evaluate the non-perfused volume (NPV) inside the fibroids. Both pre- and post-treatment procedures are time-consuming and operator-dependent. This paper presents a novel method, based on an advanced direct region detection model, …
Grover’s Search with Faults on Some Marked Elements
2016
Grover's algorithm is a quantum query algorithm solving the unstructured search problem of size N using $$O\sqrt{N}$$ queries. It provides a significant speed-up over any classical algorithm [2]. The running time of the algorithm, however, is very sensitive to errors in queries. Multiple authors have analysed the algorithm using different models of query errors and showed the loss of quantum speed-up [1, 4]. We study the behavior of Grover's algorithm in the model where the search space contains both faulty and non-faulty marked elements. We show that in this setting it is indeed possible to find one of marked elements in $$O\sqrt{N}$$ queries.
Spline-Based Wavelet Transforms
2018
The Lifting Scheme introduced in (Sweldens, Appl. Comput. Harmon. Anal. 3(2), 186–200 (1996) and Sweldens, SIAM J. Math. Anal. 29(2), 511–546 (1997).) [3, 4] is a method that constructs bi-orthogonal wavelet transforms of signals and provides their efficient implementation. The main feature of the lifting scheme is that all the constructions are derived directly in the spatial domain and therefore can be custom designed to more general and irregular settings such as non-uniformly spaced data samples and bounded intervals. In this chapter, we outline the lifting scheme and describe how to use the local quasi-interpolating splines, introduced in Chap. 6, for the construction of wavelet transf…
Wavelet Frames Generated by Spline Based p-Filter Banks
2014
This chapter presents a design scheme to generate tight and so-called semi-tight frames in the space of discrete-time periodic signals. The frames originate from oversampled perfect reconstruction periodic filter banks. The filter banks are derived from discrete-time and discrete periodic splines. Each filter bank comprises one linear phase low-pass filter (in most cases interpolating) and one high-pass filter, whose magnitude response mirrors that of a low-pass filter. In addition, these filter banks comprise a number of band-pass filters. In this chapter, frames generated by four-channel filter banks are briefly outlined (see Chap. 17 in [2] for details) and tight frames generated by six-…
Biorthogonal Wavelet Transforms Originating from Splines
2015
This chapter describes how to design families of biorthogonal wavelet transforms of signals and respective biorthogonal Wavelet bases in the signal space using spline-based prediction filters. Although the designed Wavelets originate from splines, they are not splines themselves. The design and implementation of the biorthogonal Wavelet transforms is done using the Lifting scheme. Most of the filters participating in the expansion of signals over the presented bases have infinite impulse responses and are implemented by recursive filtering whose computational cost is competitive with the FIR filtering cost. Properties of the designed Wavelets, such as symmetry, flat spectra, good time domai…