scispace - formally typeset
Search or ask a question
Topic

Piecewise

About: Piecewise is a research topic. Over the lifetime, 21064 publications have been published within this topic receiving 432096 citations. The topic is also known as: piecewise-defined function & hybrid function.


Papers
More filters
Journal ArticleDOI
01 Aug 2008
TL;DR: This paper advocates the use of an alternative edge-preserving smoothing operator, based on the weighted least squares optimization framework, which is particularly well suited for progressive coarsening of images and for multi-scale detail extraction.
Abstract: Many recent computational photography techniques decompose an image into a piecewise smooth base layer, containing large scale variations in intensity, and a residual detail layer capturing the smaller scale details in the image. In many of these applications, it is important to control the spatial scale of the extracted details, and it is often desirable to manipulate details at multiple scales, while avoiding visual artifacts.In this paper we introduce a new way to construct edge-preserving multi-scale image decompositions. We show that current basedetail decomposition techniques, based on the bilateral filter, are limited in their ability to extract detail at arbitrary scales. Instead, we advocate the use of an alternative edge-preserving smoothing operator, based on the weighted least squares optimization framework, which is particularly well suited for progressive coarsening of images and for multi-scale detail extraction. After describing this operator, we show how to use it to construct edge-preserving multi-scale decompositions, and compare it to the bilateral filter, as well as to other schemes. Finally, we demonstrate the effectiveness of our edge-preserving decompositions in the context of LDR and HDR tone mapping, detail enhancement, and other applications.

1,381 citations

Journal ArticleDOI
TL;DR: PLUTO as mentioned in this paper is a multiphysics, multialgorithm modular environment particularly oriented toward the treatment of astrophysical flows in presence of discontinuities, and it exploits a general framework for integrating a system of conservation laws, built on modern Godunov-type shockcapturing schemes.
Abstract: We present a new numerical code, PLUTO, for the solution of hypersonic flows in 1, 2, and 3 spatial dimensions and different systems of coordinates. The code provides a multiphysics, multialgorithm modular environment particularly oriented toward the treatment of astrophysical flows in presence of discontinuities. Different hydrodynamic modules and algorithms may be independently selected to properly describe Newtonian, relativistic, MHD, or relativistic MHD fluids. The modular structure exploits a general framework for integrating a system of conservation laws, built on modern Godunov-type shock-capturing schemes. Although a plethora of numerical methods has been successfully developed over the past two decades, the vast majority shares a common discretization recipe, involving three general steps: a piecewise polynomial reconstruction followed by the solution of Riemann problems at zone interfaces and a final evolution stage. We have checked and validated the code against several benchmarks available in literature. Test problems in 1, 2, and 3 dimensions are discussed.

1,376 citations

Journal ArticleDOI
TL;DR: This work proves sampling theorems for classes of signals and kernels that generalize the classic "bandlimited and sinc kernel" case and shows how to sample and reconstruct periodic and finite-length streams of Diracs, nonuniform splines, and piecewise polynomials using sinc and Gaussian kernels.
Abstract: The authors consider classes of signals that have a finite number of degrees of freedom per unit of time and call this number the rate of innovation. Examples of signals with a finite rate of innovation include streams of Diracs (e.g., the Poisson process), nonuniform splines, and piecewise polynomials. Even though these signals are not bandlimited, we show that they can be sampled uniformly at (or above) the rate of innovation using an appropriate kernel and then be perfectly reconstructed. Thus, we prove sampling theorems for classes of signals and kernels that generalize the classic "bandlimited and sinc kernel" case. In particular, we show how to sample and reconstruct periodic and finite-length streams of Diracs, nonuniform splines, and piecewise polynomials using sinc and Gaussian kernels. For infinite-length signals with finite local rate of innovation, we show local sampling and reconstruction based on spline kernels. The key in all constructions is to identify the innovative part of a signal (e.g., time instants and weights of Diracs) using an annihilating or locator filter: a device well known in spectral analysis and error-correction coding. This leads to standard computational procedures for solving the sampling problem, which we show through experimental results. Applications of these new sampling results can be found in signal processing, communications systems, and biological systems.

1,206 citations

Journal ArticleDOI
TL;DR: The search for a piecewise quadratic Lyapunov function is formulated as a convex optimization problem in terms of linear matrix inequalities and the relation to frequency domain methods such as the circle and Popov criteria is explained.
Abstract: This paper presents a computational approach to stability analysis of nonlinear and hybrid systems. The search for a piecewise quadratic Lyapunov function is formulated as a convex optimization problem in terms of linear matrix inequalities. The relation to frequency domain methods such as the circle and Popov criteria is explained. Several examples are included to demonstrate the flexibility and power of the approach.

1,186 citations

Journal ArticleDOI
TL;DR: This paper shows that while retaining the same simplicity, the convergence rate of I-ELM can be further improved by recalculating the output weights of the existing nodes based on a convex optimization method when a new hidden node is randomly added.

1,068 citations


Network Information
Related Topics (5)
Nonlinear system
208.1K papers, 4M citations
93% related
Partial differential equation
70.8K papers, 1.6M citations
92% related
Bounded function
77.2K papers, 1.3M citations
91% related
Differential equation
88K papers, 2M citations
91% related
Linear system
59.5K papers, 1.4M citations
91% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20251
2023917
20222,014
20211,089
20201,147
20191,106