We consider the application of the piecewise monotonic data approximation method to some problems that are derived from univariate signal restoration. We present numerical examples in order to show the efficacy of a software package that implements the method in data fitting and in denoising data from a medical image. The piecewise monotonic approximation method makes the smallest change to the...

In remote operation of offshore platforms, real time control systems must be well maintained for efficient and safe operations. Early detection of control and equipment performance degradation is critical and is the foundation for implementing higher level integrated optimization. Poor control performance is usually the result of undetected deterioration in control valves, inadequate performanc...

Multi-voxel pattern analyses (MVPA) are often performed on unsmoothed data, which is very different from the general practice of large smoothing extents in standard voxel-based analyses. In this report, we studied the effect of smoothing on MVPA results in a motor paradigm. Subjects pressed four buttons with two different fingers of the two hands in response to auditory commands. Overall, indep...

In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...

1. X-Z identity 2 1.1. Notation 2 1.2. XZ identities 3 1.3. Some estimates 4 2. Orthogonal Telescope Decomposition 6 2.1. Properties and Assumptions 6 2.2. Convergence 8 3. Approximation and Smoothing Property 8 3.1. High frequency 9 3.2. Approximation property 9 3.3. Smoothing property 9 3.4. Smoothing property of popular smoothers 10 3.5. Convergence 11 4. Stable Decomposition and Quasi-Ortho...

Whenever a new mesh smoothing algorithm is introduced in the literature, initial experimental analysis is often performed on relatively simple geometric domains where the meshes need little or no element size grading. Here, we present a comparative study of a large number of well-known smoothing algorithms on triangulations of complex geometric domains. Our study reveals the limitations of some...

In the language modeling approach to information retrieval, Dirichlet prior smoothing frequently outperforms Jelinek-Mercer smoothing. Both Dirichlet prior and Jelinek-Mercer are forms of linear interpolated smoothing. The only difference between them is that Dirichlet prior determines the amount of smoothing based on a document’s length. Our hypothesis was that Dirichlet prior’s performance ad...

In this paper we introduce a video smoothing algorithm for MPEG compressed live video. This algorithm, called Pattern Smoothing, transmits compressed video via both Constant Bit Rate (CBR) and Variable Bit Rate (VBR) channels. In order to take advantage of the gains achieved through statistical multiplexing of multiple sources over a single link, this algorithm utilizes a CBR channel to reduce ...

Figure 2: Simulated (left) and in vivo (right) ADC point estimates without adaptive smoothing (a and e) and with adaptive smoothing (b and f). ADC uncertainties with adaptive smoothing (c and g) and without adaptive smoothing (d and h). On all maps with adaptive smoothing, the borrowing strength is shown by a border around each pixel; bright lines indicate strong borrowing; dark lines indicate ...