Approximating the problem, not the solution: an alternative view of point set matching (Q2369583): Difference between revisions

@@ Property / author @@
-T. M. Caelli
@@ Property / author: T. M. Caelli / rank @@
-Normal rank
@@ Property / author @@
+T. M. Caelli
@@ Property / author: T. M. Caelli / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.patcog.2005.10.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2041577117
@@ Property / OpenAlex ID: W2041577117 / rank @@
+Normal rank
@@ Property / cites work @@
+Structural, Syntactic, and Statistical Pattern Recognition
+Normal rank
@@ Property / cites work @@
+Structural, Syntactic, and Statistical Pattern Recognition
+Normal rank
@@ Property / cites work @@
+Point matching under non-uniform distortions.
@@ Property / cites work: Point matching under non-uniform distortions. / rank @@
+Normal rank
@@ Property / cites work @@
+Spectral correspondence for point pattern matching
+Normal rank
@@ Property / cites work @@
+Q3679095
@@ Property / cites work: Q3679095 / rank @@
+Normal rank
@@ Property / cites work @@
+Scene Labeling by Relaxation Operations
@@ Property / cites work: Scene Labeling by Relaxation Operations / rank @@
+Normal rank
@@ Property / cites work @@
+Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
+Normal rank
@@ Property / cites work @@
+Q4382293
@@ Property / cites work: Q4382293 / rank @@
+Normal rank