On the public citation graph

A rotation invariant filter for two-dimensional string matching

https://doi.org/10.1007/bfb0030785
0 signed · 52 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/3-540-58094-8_11openalex-snapshot
An alphabet-independent optimal parallel search for three dimensional pattern
inferredcites →https://doi.org/10.1007/bf01185433openalex-snapshot
Pattern matching in a digitized image
inferredcites →https://doi.org/10.1016/0020-0190(93)90250-dopenalex-snapshot
Fast two-dimensional pattern matching
inferredcites →https://doi.org/10.1016/0031-3203(88)90055-6openalex-snapshot
On the minimum number of templates required for shift, rotation and size invariant pattern recognition
inferredcites →https://doi.org/10.1016/0031-3203(91)90114-kopenalex-snapshot
Two-dimensional pattern matching with k mismatches
inferredcites →https://doi.org/10.1016/0167-8655(96)00055-4openalex-snapshot
A sublinear algorithm for two-dimensional string matching
inferredcites →https://doi.org/10.1016/s0304-3975(97)00252-1openalex-snapshot
Alphabet-independent optimal parallel search for three-dimensional patterns
inferredcites →https://doi.org/10.1109/ccv.1988.589995openalex-snapshot
Geometric Hashing: A General And Efficient Model-based Recognition Scheme
inferredcites →https://doi.org/10.1109/sfcs.1992.267767openalex-snapshot
Truly alphabet-independent two-dimensional pattern matching
inferredcites →https://doi.org/10.1137/s0097539794275872openalex-snapshot
Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time
inferredcites →https://doi.org/10.1145/129712.129719openalex-snapshot
Alphabet independent two dimensional matching
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
inferredcites →https://doi.org/10.1145/360825.360855openalex-snapshot
Efficient string matching
inferredcites →https://doi.org/10.1145/66451.66459openalex-snapshot
A technique for two-dimensional pattern matching
inferredcites →https://doi.org/10.5555/314464.314680openalex-snapshot
Two and higher dimensional pattern matching in optimal expected time

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11780441_19openalex-snapshot
Faster Two Dimensional Scaled Matching
inferred← citeshttps://doi.org/10.1007/3-540-44888-8_2openalex-snapshot
Two-Dimensional Pattern Matching with Rotations
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_5openalex-snapshot
An Index for Two Dimensional String Matching Allowing Rotations
inferred← citeshttps://doi.org/10.1007/3-540-45452-7_20openalex-snapshot
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations
inferred← citeshttps://doi.org/10.1007/3-540-48452-3_18openalex-snapshot
Fast Multi-dimensional Approximate Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_444openalex-snapshot
Two-Dimensional Scaled Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_444openalex-snapshot
Two-Dimensional Scaled Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_8openalex-snapshot
Rotation and Lighting Invariant Template Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_31openalex-snapshot
Faster Two Dimensional Pattern Matching with Rotations
inferred← citeshttps://doi.org/10.1007/978-3-540-30213-1_1openalex-snapshot
Efficient One Dimensional Real Scaled Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_31openalex-snapshot
Real Two Dimensional Scaled Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-69068-9_4openalex-snapshot
Two-Dimensional Pattern Matching with Combined Scaling and Rotation
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_25openalex-snapshot
On the Complexity of Affine Image Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_32openalex-snapshot
Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
inferred← citeshttps://doi.org/10.1007/978-3-642-02441-2_12openalex-snapshot
New Complexity Bounds for Image Matching under Rotation and Scaling
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_2openalex-snapshot
Affine Image Matching Is Uniform ${\text{\rm TC}^0}$ -Complete
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_10openalex-snapshot
Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation
inferred← citeshttps://doi.org/10.1007/bfb0054334openalex-snapshot
Fast two-dimensional approximate pattern matching
inferred← citeshttps://doi.org/10.1007/s00453-007-9021-xopenalex-snapshot
Real Two Dimensional Scaled Matching
inferred← citeshttps://doi.org/10.1007/s00453-008-9173-3openalex-snapshot
Faster Two Dimensional Scaled Matching
inferred← citeshttps://doi.org/10.1016/j.ic.2007.03.002openalex-snapshot
Rotation and lighting invariant template matching
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104550openalex-snapshot
The generic combinatorial algorithm for image matching with classes of projective transformations
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.09.002openalex-snapshot
Scaled and permuted string matching
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.03.006openalex-snapshot
Efficient algorithms for the scaled indexing problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.06.002openalex-snapshot
The exact complexity of projective image matching
inferred← citeshttps://doi.org/10.1016/j.jda.2006.03.017openalex-snapshot
Efficient one-dimensional real scaled matching
inferred← citeshttps://doi.org/10.1016/j.jda.2010.06.002openalex-snapshot
New complexity bounds for image matching under rotation and scaling
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.039openalex-snapshot
Two-dimensional pattern matching with rotations
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.06.029openalex-snapshot
Sequential and indexed two-dimensional combinatorial template matching allowing rotations
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.09.012openalex-snapshot
Faster two-dimensional pattern matching with rotations
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.09.009openalex-snapshot
A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
inferred← citeshttps://doi.org/10.1016/s0167-8655(99)00092-6openalex-snapshot
Combinatorial methods for approximate image matching under translations and rotations
inferred← citeshttps://doi.org/10.1109/icip.2001.959136openalex-snapshot
Faster template matching without FFT
inferred← citeshttps://doi.org/10.1109/spire.2000.878184openalex-snapshot
Combinatorial methods for approximate pattern matching under rotations and translations in 3D arrays
inferred← citeshttps://doi.org/10.1109/spire.2000.878185openalex-snapshot
Rotation invariant histogram filters for similarity and distance measures between digital images
inferred← citeshttps://doi.org/10.1142/s0129054105003662openalex-snapshot
THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW
inferred← citeshttps://doi.org/10.5555/338219.338643openalex-snapshot
Real scaled matching
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.