Views provided by UsageCounts
doi: 10.1137/140956117
handle: 11511/32694
Summary: We present a novel perspective on shape characterization using the screened Poisson equation. We discuss that the effect of the screening parameter is a change of measure of the underlying metric space. Screening also indicates a conditioned random walker biased by the choice of measure. A continuum of shape fields is created by varying the screening parameter or, equivalently, the bias of the random walker. In addition to creating a regional encoding of the diffusion with a different bias, we further break down the influence of boundary interactions by considering a number of independent random walks, each emanating from a certain boundary point, whose superposition yields the screened Poisson field. Probing the screened Poisson equation from these two complementary perspectives leads to a high-dimensional hyperfield: a rich characterization of the shape that encodes global, local, interior, and boundary interactions. To extract particular shape information as needed in a compact way from the hyperfield, we apply various decompositions either to unveil parts of a shape or parts of a boundary or to create consistent mappings. The latter technique involves lower-dimensional embeddings, which we call screened Poisson encoding maps (SPEM). The expressive power of the SPEM is demonstrated via illustrative experiments as well as a quantitative shape retrieval experiment over a public benchmark database on which the SPEM method shows a high-ranking performance among the existing state-of-the-art shape retrieval methods.
Screened Poisson encoding maps (SPEM), level-set models, Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation, Nonnegative sparse coding, conditioned random walker, shape decomposition, Shapes (aspects of topological manifolds), 519, Information storage and retrieval of data, Shape decomposition, Conditioned random walker, elliptic models for distance transforms, Elliptic models for distance transforms, QA075 Electronic computers. Computer science, Level-set models, Q Science (General), screened Poisson equation, Computing methodologies for image processing, nonnegative sparse coding, Machine vision and scene understanding, nonrigid shape retrieval, screened Poisson encoding maps (SPEM), Screened Poisson equation, Image processing (compression, reconstruction, etc.) in information and communication theory, Nonrigid shape retrieval
Screened Poisson encoding maps (SPEM), level-set models, Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation, Nonnegative sparse coding, conditioned random walker, shape decomposition, Shapes (aspects of topological manifolds), 519, Information storage and retrieval of data, Shape decomposition, Conditioned random walker, elliptic models for distance transforms, Elliptic models for distance transforms, QA075 Electronic computers. Computer science, Level-set models, Q Science (General), screened Poisson equation, Computing methodologies for image processing, nonnegative sparse coding, Machine vision and scene understanding, nonrigid shape retrieval, screened Poisson encoding maps (SPEM), Screened Poisson equation, Image processing (compression, reconstruction, etc.) in information and communication theory, Nonrigid shape retrieval
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 6 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 2 |

Views provided by UsageCounts