Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In this paper, we comparative analysis the performance of DFT-based interpolation algorithm with different windows and Digital Lock-in amplifier(DLA) method. We recommend that DLA is a good choice for low signal to noise ratio (SNR). DFT-based interpolation can work with unknown frequency. In comparison with rectangle window, triangle window has better side-band affection with accuracy lose. Beside,...
Nonconvex nonsmooth regularization method has been shown to be effective for restoring images with neat edges. Fast alternating minimization schemes have also been proposed and developed to solve the nonconvex nonsmooth minimization problem. The main contribution of this paper is to show the convergence of these alternating minimization schemes, based on the Kurdyka–Łojasiewicz property. In particular,...
As a major component of volume rendering, the ray casting algorithm is memory-intensive. However, most existing texture-based volume rendering methods blindly map computational resources to texture memory and result in an incoherent access pattern, causing low cache hit rates in certain cases. The distance between samples taken by threads of the same scheduling unit (e.g. a warp of 32 threads in CUDA),...
With the increasing demand for high resolution, large scale images and fast downlink data rates of remote-sensing satellites, the higher decoding speed of BM(Berlekamp Massey) algorithm of the satellite receivers employing RS(Reed Solomon) codes as forward error correction codes is needed. A new improved BM algorithm is presented and its explicit proofs are given. Taking RS(255, 223) of CCSDS standard...
Most volume renderings in medical application today employ one-dimensional transfer functions, which assign color and opacity to samples solely on their intensity value. The method is not effective when it is used on volumes that contain different materials sharing some common value range. The current method using multi-dimensional transfer function based on the introduction of gradient magnitude...
Frequent closed sequential patterns mining is one of the hot topics in data mining. In this paper, a novel frequent closed sequential pattern mining algorithm, FCSM-PD (frequent closed sequential pattern mining algorithm based on positional data) is proposed, which is the improved BIDE algorithm based on the positional data. The positional data is used to reserve the position information of items...
The eyes are the most important facial landmarks on human face, for both human computer communication and face normalization. It is crucial to detect and locate the eyes accurately. This paper introduces a novel and simple method for eye localization. Based on the special gray lever distribution in the eye region, the spectral residual model is exploited to extract the rough eye region primarily....
The processing of a Continuous Reverse k-Nearest-Neighbor (CRkNN) query on moving objects can be divided into two sub tasks: continuous filter, and continuous refinement. The algorithms for the two tasks can be completely independent. Existing CRkNN solutions employ Continuous k-Nearest-Neighbor (CkNN) queries for both continuous filter and continuous refinement. We analyze the CkNN based solution...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.