- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper presents CornerMCQ, a geometry-adaptive coding scheme for sewing-pattern boundaries. It explicitly preserves detected corners, represents straight segments using endpoints, and encodes curved segments with residual K-means codebooks in chord-normalized coordinates. Experiments on GarmentCodeData and a private industrial dataset demonstrate substantial rate–distortion improvements over fixed-support coding and PCA. Under matched partitions and bit budgets, CornerMCQ also consistently outperforms Bézier fitting, PCA with scalar quantization, and learned residual VQ-VAE. Additional experiments evaluate cross-domain transfer and CAD file round-trip compatibility.
Critical strengths
-
The paper provides extensive comparisons across two datasets, multiple bit budgets, and controlled coding alternatives. The matched-partition experiments, ablations, and statistical analyses convincingly demonstrate the benefits of geometry-adaptive bit allocation.
-
CornerMCQ achieves competitive reconstruction accuracy with compact codebooks and low computational overhead. The CAD round-trip validation and cross-domain transfer experiments strengthen its practical relevance.
Critical weaknesses
-
The approach primarily combines established corner detection, adaptive contour segmentation, and residual vector quantization. Although effective, the conceptual contribution is incremental. More importantly, direct comparisons with competitive classical rate–distortion-optimized contour coders are missing, making it difficult to assess the improvement over existing adaptive shape-coding methods.
-
Reconstruction errors are evaluated against cleaned, 512-sample boundaries rather than the original CAD geometry. The common rendering can also alter explicitly preserved corners, while native-geometry auditing is reported only on validation data. Furthermore, the representation excludes important manufacturing entities, and robustness to real digitization noise remains unverified. These limitations weaken the broader claims of manufacturing readiness.
Questions for authors
-
How does CornerMCQ compare with classical rate–distortion-optimized vertex-based or spline-based contour coders under matched bit budgets?
-
Can the authors quantify reconstruction errors relative to the original CAD boundaries and provide native-decoding CAD audits on the held-out test sets?
-
Can the authors clarify the exact bitstream cost when refined vertices exceed the nominal 12-bit coordinate range, and how traversal direction and boundary phase are handled in standalone decoding?
2 comments
Response to Reviewer uevt (2/2)
Held-out audit (Q2, second part). Following your request, we used each held-out test split for one additional audit, with the frozen encoders and released models. The plan was fixed before this access, and every outcome is reported. It measures the error against the original geometry and reruns the native-decode CAD readback. The same code first reproduced every validation number exactly. On the test splits, the reference's worst point lies within 1 mm of an original corner in 99.9% (GarmentCode) and 99.4% (industrial) of panels. CornerMCQ's mean corner error is below the reference's at all 20 operating points of each dataset, and in all 16 same-partition cells it has the lowest error against the original and the lowest corner error. At Coarse L=2 its curve distance to the original is 0.119 mm (GarmentCode) and 0.179 mm (industrial). At the four native-audit operating points, both parsers read every test panel back with 0.0 mm vertex discrepancy. Every statement that the plan fixed in advance keeps its direction, although some counts change; Appendix K lists all of them.
Bits outside the 12-bit range (Q3). All published rates charge 12 bits per vertex coordinate (Eq. 3). A refined corner can lie just outside the sample bounding box, and its index is sent unclipped. On validation this concerns 10.6% of the Coarse vertices on GarmentCode and 17.8% in the industrial archive, by at most 20 and 9 grid steps. A fixed-length field that holds every index needs 13 bits, which adds 2S bits per panel (Appendix B). At held-out Coarse L=2 the rate becomes 416 instead of 397 bits on GarmentCode and 334 instead of 322 in the industrial archive, still below 480. The same-partition controls reuse these vertices and receive the same 2S bits, so their comparisons with CornerMCQ do not change (unlike the classical comparison above).
A frame that contains every vertex. Taking the frame as the bounding box of the samples and all transmitted vertices keeps every index within 12 bits at no extra bit; we tested it on validation. The stream syntax and the decoder are unchanged, since the frame is read from the stream. On both validation sets every index then falls in [0, 4095], every bitstream has exactly the length of the 12-bit ledger, an independent decoder recovers every field (vertices within 7.4e-5 mm), and the grid step grows by at most 0.4%. The mean curve distance changes by −1.33% to +0.002% against the reference and falls against the original geometry. The held-out numbers in the paper use the released frame, so the 13-bit figures above apply to them.
Traversal direction and phase (Q3). The stream has no direction bit and no start index. Records follow the traversal of the input and start at its first corner, and the last segment closes on the first. A standalone decoder needs only the stream and the codebooks. It returns the closed polyline in the record order of the stream, starting at the first transmitted corner; the stream carries no canonical orientation. The decoder reads the frame as float32. The paper decoded with the encoder's float64 frame; on validation the difference moves vertices by at most 8.5e-5 mm (GarmentCode) and 6.0e-5 mm (industrial) and changes no comparison. On validation, a reversed input leaves the rate essentially unchanged but raises the Coarse L=3 curve distance by 6% (GarmentCode) and 20% (industrial). The chord frame is right-handed, and the codebooks were fitted on one handedness. A clockwise rule applied before encoding gives reversed and unreversed inputs the same curve distance, and changes the GarmentCode Coarse L=3 curve distance by a factor of 1.03; the released encoder does not apply it (Appendix K). With at least two detected corners, the partition does not depend on the start sample, except on two industrial panels with exactly tied turning angles. Panels with fewer than two corners use a fallback that does depend on it: none on GarmentCode and 14 of 1,623 industrial validation panels. Under a random cyclic shift, the vertex set and bit count stay the same for all 4,704 GarmentCode panel–partition pairs and for 6,428 of 6,492 industrial pairs. The 512-position rendering starts at the reference's first sample, which is not transmitted and is the same for every codec. The curve distance does not depend on this start.
Revisions. Appendix K adds the classical-coder comparison, the original-geometry analysis of both datasets, the multi-seed and correlated-noise results and the held-out audit. Appendices B and K describe the frame that contains every vertex. We removed the clause in Section 5.1 that attributed the high-rate error floor to the partition and the reference sampling. The revised description of the industrial archive states that about 37% of its validation boundaries are stored on the sew-line layer.
Thank you again; these questions made the evaluation more complete, and we are happy to clarify anything further.
Response to Reviewer uevt (1/2)
Thank you for the precise questions and for your positive assessment of the controlled comparisons. Unless stated otherwise, new analyses use the validation splits. Full tables are in Appendix K.
Contribution. Corner detection, adaptive segmentation and residual vector quantization exist individually, and we claim none of them as new. The contribution is a bit allocation designed for sewing-pattern boundaries and a controlled evaluation in which the same-partition controls change only the curve coder and the ablations only the partition. The seam-pairing test in our reply to Reviewer rnrp shows that the effect of this allocation carries over to a downstream task.
Classical rate–distortion coders (Q1). As you asked, we implemented two classical coders under the same ledger as CornerMCQ: a 96-bit frame, an 8-bit count and the 12-bit vertex grid, with real bitstreams written and decoded. The vertex-based coder follows Schuster and Katsaggelos (1998): it chooses polygon vertices by dynamic programming on distortion plus λ times rate, from three start vertices; trying every start vertex on 100 panels per dataset lowered its rate by only 0.1–0.6%. The spline-based coder keeps our refined corners as breakpoints. By the same Lagrangian criterion, it chooses further breakpoints, the number of control points per piece and, optionally, non-uniform knots. The only tuned setting, the distortion norm, was chosen on GarmentCode training panels.
We compare, on validation, the bits each coder needs to reach the curve distance of a CornerMCQ operating point. Up to about 410 bits per panel, the classical coders need about 4–12% more bits than CornerMCQ: 7.0% and 3.7% more on GarmentCode at Corner L=3 and Coarse L=2, and 5.6%, 12.2% and 9.2% more in the industrial archive at Corner L=3 and the two Coarse points. At the two points at 437 and 428 bits (GarmentCode Coarse L=3, industrial Mid L=3) the margin is below 1%, which we read as roughly on par. From about 500 bits on, the spline coder is better: it needs 6% fewer bits at GarmentCode Mid L=3 (516 bits) and 32–33% fewer at Fine on both datasets. These spline numbers come from a reduced search: 7 candidate breakpoints per corner-to-corner run, no knot refinement, and no joint optimization of control-point positions. The full search took about 17 minutes per panel and could favor the spline coder further.
These margins use the frame that contains every vertex (Q3), under which the 12-bit ledger is exact; the spline coder uses the same frame. With the released frame and the same 12-bit ledger, each margin differs by less than 0.4 points; charging that frame's 13-bit upper bound instead lowers each margin by 3–5 points (Appendix K).
Errors against the original geometry (Q2, first part). We measured errors against the original geometry on both validation sets; our reply to Reviewer Xe9K gives the details. On GarmentCode the original is the line, spline and arc edges of the specification files. In the industrial archive it is the stored vertex polyline without arc bulges, so this is not a comparison with the full CAD geometry. On validation, the 512-sample reference lies 0.004 and 0.002 mm from the original on average, and 0.59 and 0.40 mm from the original corners on average per panel. CornerMCQ's corner error is below the reference's at all 20 operating points of each dataset. The ranking of methods by mean error does not change, and CornerMCQ has the lowest error against the original in all 16 same-partition cells on both datasets.
The common rendering and corners. The common 512-position rendering does move away from the transmitted corners: on validation it lies 0.49 mm (GarmentCode) and 0.33 mm (industrial) from a vertex on average. This rendering serves only Chamfer, polygon validity and the main CAD audit, so that every codec is written the same way. The curve distance and the worst point are measured on each codec's own decode, which for CornerMCQ contains every transmitted vertex. The native-polyline audit writes that decode, and both parsers return every vertex exactly, at four operating points on all validation panels of both datasets.
Digitization noise. We added simulations of correlated digitization errors: a smooth displacement along the boundary plus corner offsets. There the released encoder's rate rises 8–32% (GarmentCode) and 3–15% (industrial) above clean, against 14–111% and 25–372% under i.i.d. jitter of the same σ. Both are simulations; our reply to Reviewer Xe9K has the details.
Manufacturing entities. CornerMCQ codes one closed boundary per panel; notches, drill holes, seam allowances, grain lines and inter-panel relations are outside its scope (Section 6). Notches lie on the boundary and could be added as positions along it. The revised Section 6 states that the code is a boundary representation, not a complete manufacturing file, and we do not claim manufacturing readiness.