On the public citation graph

On the existence and design of the best stack filter based associative memory

0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0057598openalex-snapshot
Median Filtering: Deterministic Properties
inferredcites →https://doi.org/10.1109/29.45552openalex-snapshot
Optimal stack filtering and the estimation and structural approaches to image processing
inferredcites →https://doi.org/10.1109/29.60073openalex-snapshot
Convergence behavior and N-roots of stack filters
inferredcites →https://doi.org/10.1109/78.157291openalex-snapshot
The classification and associative memory capability of stack filters
inferredcites →https://doi.org/10.1109/tassp.1974.1162578openalex-snapshot
[Back cover]
inferredcites →https://doi.org/10.1109/tassp.1981.1163708openalex-snapshot
A theoretical analysis of the properties of median filters
inferredcites →https://doi.org/10.1109/tassp.1982.1163951openalex-snapshot
Median filters: Some modifications and their properties
inferredcites →https://doi.org/10.1109/tassp.1984.1164468openalex-snapshot
Median filtering by threshold decomposition
inferredcites →https://doi.org/10.1109/tassp.1986.1164871openalex-snapshot
Stack filters
inferredcites →https://doi.org/10.1109/tcs.1985.1085740openalex-snapshot
Threshold decomposition of multidimensional ranked order operations
inferredcites →https://doi.org/10.1364/ao.25.003759openalex-snapshot
Evaluation of the use of the Hopfield neural network model as a nearest-neighbor algorithm

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4615-3148-7_5openalex-snapshot
Root-Signal Sets of Morphological Filters and their Use in Variable-Length BTC Image Coding
inferred← citeshttps://doi.org/10.1007/978-3-319-23036-8_29openalex-snapshot
An $$L_1$$-Method: Application to Digital Symmetric Type-II FIR Filter Design
inferred← citeshttps://doi.org/10.1007/bf00118587openalex-snapshot
Root-signal sets of morphological filters and their use in variable-length BTC image coding
inferred← citeshttps://doi.org/10.1007/bf01183776openalex-snapshot
Breakdown points, breakdown probabilities, midpoint sensitivity curves, and optimization of stack filters
inferred← citeshttps://doi.org/10.1007/bf01250287openalex-snapshot
Shape preservation criteria and optimal soft morphological filtering
inferred← citeshttps://doi.org/10.1016/0165-1684(93)90158-7openalex-snapshot
Root properties of morphological filters
inferred← citeshttps://doi.org/10.1016/0165-1684(93)90159-8openalex-snapshot
Weighted medians — positive Boolean functions conversion algorithms
inferred← citeshttps://doi.org/10.1016/0165-1684(94)00096-iopenalex-snapshot
Fast algorithms for analyzing and designing weighted median filters
inferred← citeshttps://doi.org/10.1016/0165-1684(94)00106-aopenalex-snapshot
Optimal stack filters under rank selection and structural constraints
inferred← citeshttps://doi.org/10.1109/78.285642openalex-snapshot
Fast algorithms for training stack filters
inferred← citeshttps://doi.org/10.1109/78.370615openalex-snapshot
Optimal weighted median filtering under structural constraints
inferred← citeshttps://doi.org/10.1109/iscas.1993.393878openalex-snapshot
Optimal weighted median filters under structural constraints
inferred← citeshttps://doi.org/10.1109/iscas.1993.692801openalex-snapshot
Optimal weighted median filters under structural constraints
inferred← citeshttps://doi.org/10.1109/iscas.1994.408941openalex-snapshot
Parametric analysis of weighted order statistic filters
inferred← citeshttps://doi.org/10.1109/iscas.1994.408979openalex-snapshot
Associative positive Boolean functions and their maximum stacking vector representations
inferred← citeshttps://doi.org/10.1109/jproc.2002.804686openalex-snapshot
From Boolean to probabilistic Boolean networks as models of genetic regulatory networks
inferred← citeshttps://doi.org/10.1109/lsp.2003.821725openalex-snapshot
Spectral Methods for Testing Membership in Certain Post Classes and the Class of Forcing Functions
inferred← citeshttps://doi.org/10.1109/ndsp.1993.767681openalex-snapshot
The classification of threshold logic based stack filters
inferred← citeshttps://doi.org/10.1109/ndsp.1993.767723openalex-snapshot
The convergence behavior of symmetric weighted median filters
inferred← citeshttps://doi.org/10.1109/ndsp.1993.767770openalex-snapshot
The graph representation of stack filters
inferred← citeshttps://doi.org/10.1109/tsp.2007.896088openalex-snapshot
An $L_1$-Method for the Design of Linear-Phase FIR Digital Filters
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.