---
title: 'Parametric Cataloging: Principles & Applications'
url: https://www.emergentmind.com/topics/parametric-cataloging
type: topic
---

# Parametric Cataloging: Principles & Applications

Searching arXiv for recent and foundational papers on parametric cataloging across domains.
Across the cited works, parametric cataloging denotes the construction, maintenance, or querying of catalogs through explicit parameter spaces, generative models, or formally specified schemas rather than through ad hoc records or purely heuristic pipelines. In astronomy, it is defined as building catalogs by fitting a generative, parameterized model of image data and inferring posterior distributions over catalog parameters, including the number of sources [1907.04929]. In product, engineering, exoplanet, and AI-system settings, it denotes representing entries through structured fields, schema-aligned attributes, provenance, and interoperable metadata [1105.4251]; [1106.0586]; [2501.04014]. In CAD and catalog image generation, it further refers to constraint-aware modeling sequences and parameter-driven workflows for geometry, placement, and occlusion handling [2602.19171]; [2604.08836].

## 1. Scope and core idea

A unifying feature across these literatures is that the catalog is treated as an explicit object of inference or specification. In astronomical probabilistic cataloging, the catalog is the latent set of sources together with positions, fluxes, colors, morphologies, and sometimes source count itself [1907.04929]; [1801.10277]. In product synthesis and engineering document processing, the catalog is a schema-conformant collection of product specifications assembled from heterogeneous offers or PDF catalogs [1105.4251]; [2408.08238]. In exoplanet and AI-system registries, the catalog is a curated parameter space with explicit inclusion criteria, field definitions, update policies, and query semantics [1106.0586]; [2501.04014].

| Domain | Catalog unit | Parameterization mode |
|---|---|---|
| Astronomy | Source catalog | Generative image model, priors, posterior inference |
| Product search | Product record | Schema reconciliation, clustering, data fusion |
| Exoplanet databases | Planet/system entry | Fixed field schema, derived quantities, status flags |
| AI registries | AI system/model/dataset | RDF/DCAT-aligned metadata profile |
| CAD | Editable part | History-based sequence, parameters, geometric constraints |
| Catalog image generation | Composite layout | Anchor, scale policy, aspect-ratio tolerance, occlusion parameters |

This diversity also shows that “parametric” is not restricted to numeric knobs. Depending on the domain, parameters may be latent source populations, schema correspondences, controlled-vocabulary fields, CAD constraints, or workflow settings such as anchor choice and occlusion thresholds. A plausible implication is that parametric cataloging is best understood as a design pattern: the catalog is generated or constrained by a formal parameterization that is explicit enough to support inference, validation, interoperability, or editability.

## 2. Generative and probabilistic cataloging in astronomy

The astronomical literature gives the most explicit formalization. Multiband probabilistic cataloging defines catalog construction as fitting a single generative model to all pixels across bands, with source positions shared across bands and fluxes linked by color priors [1907.04929]. The per-band image model is
$$
I_b(\mathbf{x}) = \sum_{n=1}^{N} f_{n,b}\, [\mathrm{PSF}_b \star \delta(\mathbf{x}-\mathbf{x}_n)] + B_b(\mathbf{x}),
$$
with Gaussian or Poisson pixel likelihoods and a joint likelihood across bands. The framework places explicit priors on $N$, positions, reference-band fluxes, and colors, and samples the posterior over catalogs using transdimensional MCMC. In crowded and low-S/N regimes, this differs sharply from pipelines that detect peaks in a single band or coadd, fit PSF photometry per band, and output a single catalog with point estimates and limited covariances [1907.04929].

The multiband extension shows concrete performance gains. On SDSS observations of M2, a joint $r+i$ fit goes $\sim 0.4$ mag deeper than single-band probabilistic cataloging and has false discovery rate less than $20\%$ for F606W$\leq 20$; relative to DAOPHOT, the two-band fit goes nearly $1.5$ magnitudes deeper using the same data and maintains lower false discovery rate down to F606W$\sim 20.5$ [1907.04929]. On mocks, adding bands improves completeness consistent with S/N scaling, with $\Delta m \approx 0.37$ for 2 bands and $0.60$ for 3 bands. The same work reports an approximately $500\times$ speedup over the prior single-band implementation through PSF caching, matrix evaluation, and fast astrometric transforms.

Celeste extends the same paradigm to survey scale by treating the catalog as the set of unknown parameters in a Bayesian generative model of wide-field images [1801.10277]. Pixels are modeled as Poisson random variables with means determined by PSF-convolved stars and galaxies plus background, with PSFs and galaxy profiles represented as mixtures of Gaussians to obtain analytic convolutions. Instead of RJMCMC, Celeste uses variational inference with block coordinate ascent and second-order trust-region updates. The implementation jointly optimized parameters for $188{,}107{,}671$ stars and galaxies, loaded and processed $178$ TB across $8192$ nodes in $14.6$ minutes, and achieved a peak rate of $1.54$ double-precision PFLOP/s on Cori Phase II [1801.10277]. Validation on SDSS Stripe 82 showed improved astrometry, photometry, colors, and morphology relative to the SDSS Photo pipeline, although star–galaxy separation remained ambiguous in some cases.

Two later lines of work modify the inference engine while preserving the parametric premise. Neural posterior estimation with spatially varying backgrounds and PSFs trains a YOLOv5-inspired fully convolutional network to output amortized posteriors over variable-length catalogs conditioned on an image, a background representation, and PSF parameters [2503.00156]. The underlying generative model still specifies Poisson or Gaussian-approximated pixel counts from stars and galaxies convolved with a spatially varying PSF, but inference is amortized rather than performed separately per field. On SDSS, detection precision exceeds $0.95$ for $r$-band magnitudes brighter than $21.5$, recall exceeds $0.9$ for $r<21.2$, overall star/galaxy accuracy surpasses $0.96$ for $r<22$, and for faint sources $95\%$ credible intervals achieve $\approx 96\%$ empirical coverage [2503.00156].

A different reformulation replaces transdimensional inference with a fixed-dimensional spike-and-slab parameterization of source fluxes [2507.23472]. There, the prior over counts is taken as a binomial prior with maximum source count $M$, and each flux is reparameterized from an auxiliary $\sigma_i \in [0,1]$ so that zero-flux and nonzero-flux cases are handled in a fixed-dimensional space:
$$
p(F_i) = \frac{N}{M} \,\pi(F_i | \theta) + \left(1 - \frac{N}{M}\right) \delta(F_i).
$$
This makes gradient-based samplers usable at scales of tens of thousands of latent sources. In the demonstrated setup, $M=40{,}000$ fits on a $24$ GB RTX 4090, chains contain $10^6$ samples with $5\times 10^5$ warm-up, runtime is about $2$ GPU-hours per chain, and posterior estimates recover $N = 2779^{+318}_{-279}$ in one scenario and $N = 2771^{+339}_{-259}$ in an approximate Poisson regime [2507.23472]. This does not eliminate classical failure modes—prior regularity near zero flux, multimodality, PSF mismatch, and memory pressure remain material—but it removes the need for bespoke reversible-jump proposal design.

## 3. Structured parameter spaces in product, scientific, and AI-system catalogs

Outside astronomy, parametric cataloging often means that catalog entries are represented as schema-aligned parameter vectors with explicit provenance and operational policies. In large-scale product synthesis, offers from merchants are reconciled into category-specific catalog schemas $S_c$ by learning merchant/category-specific mappings $\mu_{m,c}: A_{m,c} \rightarrow A_c$ [1105.4251]. Candidate correspondences are scored by logistic regression on six features—JS-MC, JS-C, JS-M, Jaccard-MC, Jaccard-C, and Jaccard-M—computed from value distributions restricted by historical offer-to-product associations. Reconciled offers are then clustered by keys such as UPC/EAN/GTIN or MPN and fused into consolidated product specifications using a centroid-based choice over textual values. On Bing Shopping data, this system processed $856{,}781$ offers from $1{,}143$ merchants across $498$ categories, produced $287{,}135$ synthesized products and $1{,}126{,}926$ attribute–value pairs, and achieved attribute precision $0.92$ with product precision $0.85$ [1105.4251]. The crucial point is that the catalog is not merely extracted text; it is a typed, reconciled, fused parameterization of products relative to a taxonomy.

The exoplanet.eu database shows a related but curator-driven version of the same idea [1106.0586]. Its main tables define a fixed field schema for planets and host stars, including PLANET, M[.sin i], RADIUS, PERIOD, SEM-MAJ. AXIS, ECC., INCL., STATUS, DISCOV., and UPDATE, with additional parameters on Notes pages. Derived quantities such as $a$ may be computed from Kepler’s third law when absent from discovery papers. The database is updated daily, records per-datum provenance through “ref” links, and exposes VO services including ConeSearch and TAP. A central controversy is explicit in the source: there is a conflict between the sharpness required for catalog membership and the fuzziness of confidence levels for planet candidates [1106.0586]. The catalog therefore separates ontological inclusion criteria from qualitative status flags R, S, C, and W rather than pretending that a universal probabilistic threshold exists.

AICat applies the same parametric logic to AI-system registries mandated by the EU AI Act [2501.04014]. It extends DCAT v3 with aicat:Catalog and reuses AIRO, DPV/TECH, and AIUP/ODRL to represent AI systems, models, and datasets as machine-readable metadata. For AI systems, the profile includes fields such as dct:identifier, dct:title, dct:description, airo:isProvidedBy, airo:isDeployedBy, odrl:hasPolicy, tech:hasMarketAvailabilityStatus, dpv:hasCountry, airo:hasModel, airo:hasInput, and dcat:contactPoint. The design is intentionally minimal and aligned with Annex VIII and XII of the AI Act, while SHACL examples show how to constrain identifier cardinality, provider presence, market status, country values, and model release dates [2501.04014]. This is parametric cataloging in a strongly semantic-web sense: the catalog is a typed graph whose parameters are interoperable IRIs and literals rather than latent random variables.

A recurring misconception is that structured cataloging is equivalent to mere metadata accumulation. The cited systems reject that view. Product synthesis couples schema reconciliation with clustering and fusion [1105.4251]; exoplanet.eu couples field definitions with inclusion rules, uncertainty policy, and derived-quantity conventions [1106.0586]; AICat couples an application profile with validation, federation, and SPARQL retrieval [2501.04014]. This suggests that in non-astronomical settings, “parametric” principally names a governance and representation regime rather than an inference algorithm.

## 4. Constraint-aware design, engineering documents, and catalog image generation

In CAD, parametric cataloging is explicitly tied to editability under geometric constraints. HistCAD organizes parts as history-based parametric programs comprising sketch planes, primitives, feature operations, parameters, and 10 explicit geometric constraint types: coincident, parallel, perpendicular, horizontal, vertical, tangent, equal, concentric, fix, and normal [2602.19171]. Each sample aligns five modalities: constraint-aware modeling sequences, textual annotations, STEP-format B-reps, native parametric files, and multi-view renderings. The dataset contains $160{,}501$ total sequences, with $152{,}360$ in HistCAD-Academic and $8{,}141$ in HistCAD-Industrial; the industrial subset contains substantially longer, more complex Siemens NX histories [2602.19171]. Constraint coverage is quantified, with coincident at $27.33\%$, horizontal at $21.72\%$, perpendicular at $16.97\%$, parallel at $16.24\%$, and rarer types such as normal at $0.02\%$.

The representation is flat rather than hierarchically face-declared: sketch planes are given by translations and Euler angles, primitives are lines/circles/arcs, loops are inferred automatically, and operations include standard extrude, rotated extrusion, and Boolean new/join/subtract/intersect [2602.19171]. Explicit constraints materially change behavior under edits. The paper states that removing constraints breaks semantic relations during edits, while preserving them maintains design intent. Quantitatively, HistCAD with constraints has average token length $476.11$ under the Qwen3-0.6B tokenizer, remains more compact than Text2CAD at $560.24$, and improves Chamfer Distance on the shared subset to $7.59 \times 10^3$ versus $10.02$ for Text2CAD [2602.19171]. In text-driven CAD generation, the invalidity ratio falls from $2.35\%$ for Text2CAD\_T to $1.40\%$ for HistCAD\_T with constraint prediction.

CatalogBank addresses a different bottleneck: converting PDF product catalogs into structured engineering records [2408.08238]. The dataset spans $11{,}984$ pages from Misumi, Newark, Thorlabs, McMaster-Carr, 8020, and Grainger, and DocumentLabeler provides semi-automatic annotation of Tables, TableTitle, Title, SubTitle, SubsubTitle, Categories, SubCategories, SubsubCategories, Description, List, Image, and PageNumber. The paper reports that UI improvements reduce manual annotation from roughly $30$ minutes to a few minutes per page, and that model-assisted labeling further reduces effort because users correct rather than draw most boxes [2408.08238]. On CatalogBank, PICK achieves overall mEP, mER, mEF, and mEA of $0.99$, with especially strong per-element scores for Table and Description. The paper does not prescribe a normative product schema, but it explicitly frames parametric cataloging as transforming vendor catalogs into structured records with attribute name, value, unit, tolerances or conditions, identifiers, and source-region evidence.

CatalogStitch extends the notion again, this time to catalog image generation [2604.08836]. It treats placement and occlusion handling as parameters rather than manual edits. The dimension-aware mask computation uses target and product aspect ratios, anchor choice, scale policy, and tolerance $\tau = 0.06$ to adapt target masks; the occlusion-aware hybrid restoration uses EntitySeg, an IoU threshold $\tau_{\mathrm{occ}} = 0.01$, inpainting, and exact pixel pasteback to preserve foreground occluders. Evaluated on the 58-example CatalogStitch-Eval benchmark, the wrappers consistently improve ObjectStitch, OmniPaint, and InsertAnything. For example, ObjectStitch plus the wrappers reduces AR Error from $30.97$ to $5.05$, improves FID from $101.55$ to $91.52$, and raises occluder PSNR from $11.60$ to $26.84$ dB; InsertAnything plus the wrappers reduces AR Error from $29.98$ to $3.92$ and increases occluder PSNR from $13.33$ to $27.54$ dB [2604.08836]. The authors explicitly describe this as turning generative compositing into a parameter-driven, production-ready catalog workflow.

Across these engineering cases, parametric cataloging is less about posterior uncertainty than about editability, normalization, and repeatable control. The relevant parameters are geometric constraints, history operations, document regions, unit-bearing fields, aspect-ratio tolerances, and anchor semantics. That is a materially different emphasis from astronomy, but it retains the same architectural principle: catalog artifacts are generated or maintained through explicit, manipulable parameterizations.

## 5. Catalogs as formal interfaces in verification and process-data systems

A further extension appears in formal methods, where a catalog is a persistent structure that parameterizes behavior or verification artifacts. Catalog-nets, or CLog-nets, extend colored Petri nets with guards that query a read-only, persistent database and with output inscriptions that can inject data from the database or generate fresh values [2006.06630]. Formally, a CLog-net is a tuple
$$
N = (D, DB, P, T, in, out, color, guard),
$$
where guards lie in a typed FO fragment based on unions of conjunctive queries with inequalities and atomic negation. The operational semantics permits transitions to inspect tokens and catalog facts simultaneously, enabling multiple cases to co-evolve while remaining parameterized by an external catalog instance. For verification, the model is encoded into MCMT using arrays for places and functional encodings of read-only relations. The paper distinguishes conservative CLog-nets, which avoid fresh-value generation and admit sound and complete backward reachability, from the general case, where local freshness requires universal quantification over indices and may induce spurious UNSAFE results [2006.06630].

The UPPAAL property specification pattern catalog uses “catalog” in a different but related sense: a parameterized library of requirement patterns and scopes that generates observer automata and TCTL queries [2211.03817]. Patterns include Absence, Universality, Existence, Bounded Existence, Recurrence, Minimum/Maximum Duration, Precedence, Response, Constrained Response/Precedence, Response Invariance, and Until; scopes include Globally, Before $R$, After $S$, Between $S$ and $R$, and After $S$ until $R$. Parameters such as propositions $P,Q,S,R,A$, time bounds $d,\delta,[a,b]$, and counters $n$ determine the generated artifact. For example, Bounded Response Globally is formalized as
$$
\forall \pi\,\forall t\,\big(P(\pi,t)\ \Rightarrow\ \exists t' \in [t,\,t+d]\ \text{s.t.}\ Q(\pi,t')\big),
$$
and is realized by an observer with locations such as idle, wait, satisfied, and violation plus a local clock $x$ [2211.03817]. The work is motivated by UPPAAL’s restricted TCTL fragment, which lacks the nesting and past-time expressiveness required by many qualitative and real-time requirements. The catalog therefore acts as a parametric frontend whose outputs are formula templates, model instrumentation, and observer templates.

These papers show that parametric cataloging can be operational rather than archival. In CLog-nets, the catalog constrains transition enablement and data injection [2006.06630]. In the UPPAAL setting, the catalog is a typed repertoire of parameterized requirements whose instances are executable verification objects [2211.03817]. A plausible implication is that once a domain adopts explicit parameter spaces and validity rules, the distinction between “catalog” and “program” becomes thinner.

## 6. Recurring principles, limitations, and points of contention

Several design principles recur across the literature. First, explicit model or schema specification is central. Astronomical works write down image formation, priors, and posteriors [1907.04929]; [1801.10277]; [2507.23472]. Product and AI-system works define schemas, mappings, cardinalities, and controlled vocabularies [1105.4251]; [2501.04014]. CAD and document systems define constraints, history operators, and labeled region types [2602.19171]; [2408.08238]. Second, parameterization is used to preserve information that conventional pipelines often discard: posterior covariances and model uncertainty in astronomy, source references and evidence regions in engineering catalogs, provenance and status flags in exoplanet databases, and formal validation constraints in AI registries.

Third, scalability is a persistent driver of architectural choice. Multiband PCAT relies on RJMCMC but adds PSF caching, matrix evaluation, and fast astrometric transforms to cut runtime by approximately $500\times$ [1907.04929]. Celeste moves to variational inference and petascale scheduling [1801.10277]. NPE amortizes inference into a single forward pass [2503.00156]. Fixed-dimensional Parametric Cataloging uses spike-and-slab reparameterization so that off-the-shelf gradient-based samplers can scale to tens of thousands of sources [2507.23472]. Product synthesis blocks by merchant and category and uses automatically created training sets [1105.4251]. DocumentLabeler reduces annotation effort through semi-automatic workflows [2408.08238]. CatalogStitch keeps overhead negligible relative to the compositor and inpainting model [2604.08836].

The limitations are equally consistent. Model misspecification remains difficult: poor PSFs, spatially varying backgrounds, and astrometric errors degrade astronomical fits [1907.04929]; [2503.00156]. Fixed PSFs and absence of galaxy models limit some PCAT deployments [1907.04929]. Variational or amortized approximations impose tile independence or restricted posterior families [2503.00156]. In CAD, constraint coverage is finite and parameter quantization induces slight geometric approximation [2602.19171]. CatalogBank’s reported baseline focuses on layout analysis rather than complete cross-page table parsing [2408.08238]. AICat is intentionally minimal and leaves mandatory/recommended/optional classification and richer evaluative metadata to future profiles [2501.04014]. In formal verification, fresh-value injection complicates soundness, and UPPAAL’s native logic remains too weak for many real-time patterns without observer synthesis [2006.06630]; [2211.03817].

A common misconception is that parameterization automatically settles ambiguity. The sources do not support that claim. Exoplanet.eu explicitly foregrounds the conflict between crisp catalog membership and fuzzy confidence [1106.0586]. Product synthesis still depends on thresholding and may suffer from sparse merchant/category blocks [1105.4251]. Astronomical posterior inference still faces multimodality and prior sensitivity [2507.23472]. Constraint-aware CAD datasets still depend on LLM-generated annotations whose noise is acknowledged [2602.19171]. Parametric cataloging therefore does not remove epistemic or operational uncertainty; it makes that uncertainty, and the assumptions behind it, structurally explicit.

Taken together, these works show that parametric cataloging is not a single algorithm but a cross-domain methodology for representing catalogs as explicit parameterized objects. In one regime it is Bayesian inference over latent source populations; in another it is schema reconciliation and metadata interoperability; in another it is constraint-preserving procedural geometry; and in another it is a formal catalog of parameterized verification artifacts. What remains invariant is the replacement of opaque or purely heuristic catalog construction with a representation in which the relevant variables, constraints, priors, and update rules are made first-class.

Source: https://www.emergentmind.com/topics/parametric-cataloging