Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Why projection over convex sets works and how to make it better

View through CrossRef
Projection over convex sets (POCS) is one of the most widely used algorithms to interpolate seismic data sets. A formal understanding of the underlying objective function and the associated optimization process is, however, lacking to date in the literature. Here, POCS is shown to be equivalent to the application of the half-quadratic splitting (HQS) method to the [Formula: see text] norm of an orthonormal projection of the sought after data, constrained on the available traces. Similarly, the apparently heuristic strategy of using a decaying threshold in POCS is revealed to be the result of the continuation strategy that HQS must use to converge to a solution of the minimizer. In light of this theoretical understanding, another methods able to solve this convex optimization problem, namely the Chambolle-Pock primal-dual algorithm, is shown to lead to a new POCS-like method with superior interpolation capabilities at nearly the same computational cost of the industry-standard POCS method.
Society of Exploration Geophysicists
Title: Why projection over convex sets works and how to make it better
Description:
Projection over convex sets (POCS) is one of the most widely used algorithms to interpolate seismic data sets.
A formal understanding of the underlying objective function and the associated optimization process is, however, lacking to date in the literature.
Here, POCS is shown to be equivalent to the application of the half-quadratic splitting (HQS) method to the [Formula: see text] norm of an orthonormal projection of the sought after data, constrained on the available traces.
Similarly, the apparently heuristic strategy of using a decaying threshold in POCS is revealed to be the result of the continuation strategy that HQS must use to converge to a solution of the minimizer.
In light of this theoretical understanding, another methods able to solve this convex optimization problem, namely the Chambolle-Pock primal-dual algorithm, is shown to lead to a new POCS-like method with superior interpolation capabilities at nearly the same computational cost of the industry-standard POCS method.

Related Results

Ostrowski-Type Fractional Integral Inequalities: A Survey
Ostrowski-Type Fractional Integral Inequalities: A Survey
This paper presents an extensive review of some recent results on fractional Ostrowski-type inequalities associated with a variety of convexities and different kinds of fractional ...
Optimized global map projections for specific applications: the triptychial projection and the Spilhaus projection
Optimized global map projections for specific applications: the triptychial projection and the Spilhaus projection
<p>There is no perfect global map projection. A projection may be area preserving or conformal (shape preserving on small scales) in some regions, but it will inevita...
miR-409-3p represses Cited2 at the evolutionary emergence of the callosal and corticospinal projections
miR-409-3p represses Cited2 at the evolutionary emergence of the callosal and corticospinal projections
Abstract Callosal projection neurons are a broad population of interhemispheric projection neurons that extend an axon across the corpus callosum...
Convex hull peeling
Convex hull peeling
Enveloppes convexes pelées Cette thèse porte sur la construction du convex hull peeling (qu’on pourrait traduire littéralement par enveloppe convexe pelée). Le conv...
Decomposable Convexities in Graphs and Hypergraphs
Decomposable Convexities in Graphs and Hypergraphs
Given a connected hypergraph with vertex set V, a convexity space on is a subset of the powerset of V that contains ∅, V, and the singletons; furthermore, is closed under inter...
Characterization of the Propagation Route of Light Passing Through Convex Lens
Characterization of the Propagation Route of Light Passing Through Convex Lens
Abstract Existing optical theory states that the light directed to the optical center of the convex lens will travel in a straight line. Does the theory hold? If this is tr...
Asymptotic Farkas lemmas for convex systems
Asymptotic Farkas lemmas for convex systems
In this paper we establish characterizations of the containment of the set {xX: xC,g(x)K}{xX: f (x)0}, where C is a closed convex subset of a locally convex Hausdorff topolo...
A REVIEW OF TREE CONVEX SETS TEST
A REVIEW OF TREE CONVEX SETS TEST
A collection of sets may have some interesting properties which help identify efficient algorithms for constraint satisfaction problems and combinatorial auction problems. One of t...

Back to Top