11.18 G. Matching, Stereo, and motion

Chapter Contents (Back)

11.18.1 G.1. Matching

Chapter Contents (Back)

Wolfson, H., Schonberg, E., Kalvin, A., Lamdan, Y.,
Solving Jigsaw Puzzles By Computer,
ANNALS OF OPERATIONS RESEARCH(12), 1988, pp. 51-64. BibRef

Berenstein, C.A., Kanal, L.N., Lavine, D., Olson, E.C.,
A Geometric Approach To Subpixel Registration Accuracy,
CVGIP(40), 1987, pp. 334-360. BibRef

Merickel, M.,
3d Reconstruction: The Registration Problem,
CVGIP(42), 1988, pp. 206-219. BibRef

McIntosh, J.H., Mutch, K.M.,
Matching Straight Lines,
CVGIP(43), 1988, pp. 386-408. BibRef

Sparmann, U.,
Design And Test Of A Pattern Matching Circuit,
EIK (24), 1988, pp. 329-338. BibRef

Kuner, P., Ueberreiter, B.,
Pattern Recognition By Graph Matching-Combinatorial Versus Continuous Optimization,
IJPRAI(2), 1988, pp. 527-542. BibRef

Ranganath, H.S.,
Analysis Of Bilevel Quantizers Used In Binary Image Correlators,
IVC(6), 1988, pp. 193-197. BibRef

Goshtasby, A.,
Image Registration By Local Approximation Methods,
IVC(6), 1988, pp. 255-261. BibRef

Luo, R.C., Lin, M.H., Scherp, R.S.,
Dynamic Multisensor Data Fusion System For Intelligent Robots,
J-RA(4), 1988, pp. 386-396. BibRef

Caelli, T.M., Liu, Z.Q.,
On The Minimum Number Of Templates Required For Shift, Rotation And Size Invariant Pattern Recognition,
PR(21), 1988, pp. 205-216. BibRef

Lee, S., Kim, J.H.,
A Fast Computational Method For Minimum Square Error Transform,
PRL(8), 1988, pp. 143-146. BibRef

Secilla, J.P., Garcia, N., Carrascosa, J.L.,
Template Location In Noisy Pictures,
SP(14), 1988, pp. 347-361. BibRef

Wu, Y.,
Application Of Dynamic Programming For Image Registration,
SP(14), 1988, pp. 387. BibRef

Davies, E.R.,
Tradeoffs Between Speed And Accuracy In Two-Stage Template Matching,
SP(15), 1988, pp. 351-363. BibRef

Goshtasby, A., Stockman, G.C., Page, C.V.,
A Region-Based Approach To Digital Image Registration With Subpixel Accuracy,
T-GRS(24), 1986, pp. 390-399. BibRef

Goshtasby, A.,
Registration Of Images With Geometric Distortions,
T-GRS(26), 1988, pp. 60-64. BibRef

Slud, E.V.,
Subpixel Translation-Registration Of Random Fields,
T-GRS(26), 1988, pp. 487-490. BibRef

Faber, T.L., Stokeley, E.M.,
Orientation Of 3-D Structures In Medical Images,
T-PAMI(10), 1988, pp. 626-633. BibRef

Borgefors, G.,
Hierarchical Chamfer Matching: A Parametric Edge Matching Algorithm,
T-PAMI(10), 1988, pp. 849-865. BibRef

Hummel, R., Wolfson, H.,
Affine Invariant Matching,
IUW(88), pp. 351-364. BibRef

Rosenfeld, A., Margalit, A., Sitaraman, R.,
Using Probabilistic Domain Knowledge To Reduce The Expected Computational Cost Of Matching,
IUW(88), pp. 678-689. BibRef

Lamdan, Y., Schwartz, J.T., Wolfson, H.J.,
Object Recognition By Affine Invariant Matching,
CVPR(88), pp. 335-344. BibRef

Goldgof, D.B., Huang, T.S., Lee, H.,
Feature Extraction And Terrain Matching,
CVPR(88), pp. 899-904. BibRef

Lee, C.H., Quek, G.P.,
Partial Matching Of Two Dimensional Shapes Using Random Coding,
ICPR(88), pp. 64-68. BibRef

Hong, J., Wolfson, H.J.,
An Improved Model-Based Matching Method Using Footprints,
ICPR(88), pp. 72-78. BibRef

Maitre, H., Wu, Y.,
Elastic Matching Versus Rigid Matching By Use Of Dynamic Programming,
ICPR(88), pp. 79-81. BibRef

Hong, J., Tan, X.,
A New Approach To Point Pattern Matching,
ICPR(88), pp. 82-84. BibRef

Lee, S., Kim, J.H., Groen, F.C.A.,
A Fast Computational Method For Minimum Square Error Transform,
ICPR(88), pp. 392-394. BibRef

Yamada, H., Yamamoto, K.,
Recognition Of Echocardiograms By Dynamic Programming Matching Method,
ICPR(88), pp. 685-688. BibRef

Xiang, Z.C., Hui, L.Z.,
A Heuristic Search Algorithm For Image Registration,
ICPR(88), pp. 733-735. BibRef

Hong, Z., Zhu, P.,
An Improved Ssda Applied In Target Tracking,
ICPR(88), pp. 767-769. BibRef

Feng, P.,
A Face Based Algorithm For Matching Two Line Drawings Of A Polyhedron,
ICPR(88), pp. 782-784. BibRef

Wang, J., Li, J.,
``Double'' Subgraph Isomorphism Method For Matching Lsi Chip Images,
ICPR(88), pp. 945-947. BibRef

Zhang, T., Peng, J., Lu, W.,
An Optimized Searching Algorithm For Image Matching,
ICPR(88), pp. 1265-1267. BibRef

Zhuang, C.,
Scale-Based Hierarchical Description And Matching Of Waveforms,
ICPR(88), pp. 1268-1270. BibRef

Milios, E.E.,
Recovering Shape Deformation By An Extended Circular Image Representation,
ICCV(88), pp. 20-29. BibRef

Weng, J., Ahuja, N., Huang, T.S.,
Two-View Matching,
ICCV(88), pp. 64-73. BibRef

Cox, I.J., Kruskal, J.B.,
On The Congruence Of Noisy Images To Line Segment Models,
ICCV(88), pp. 252-258. BibRef

Shoham, D., Ullman, S.,
Aligning A Model To An Image Using Minimal Information,
ICCV(88), pp. 259-263. BibRef

Thompson, W.B., Whillock, R.P.,
Occlusion-Sensitive Matching,
ICCV(88), pp. 285-289. BibRef

Quan, L., Mohr, R.,
Matching Perspective Images Using Geometric Constraints And Perceptual Grouping,
ICCV(88), pp. 679-684. BibRef

Maragos, P.,
Optimal Morphological Approaches To Image Matching And Object Detection,
ICCV(88), pp. 695-699. BibRef

Rosenfeld, A., Ornelas Jr., J., Hung, Y.,
Hough Transform Algorithms For Mesh-Connected Simd Parallel Processors,
CVGIP(41), 1988, pp. 293-305. BibRef

Conker, R.S.,
A Dual Plane Variation Of The Hough Transform For Detecting Non-Concentric Circles Of Different Radii,
CVGIP(43), 1988, pp. 115-132. BibRef

Hunt, D.J., Nolte, L.W., Ruedger, W.H.,
Performance Of The Hough Transform And Its Relationship To Statistical Signal Detection Theory,
CVGIP(43), 1988, pp. 221-238. BibRef

Illingworth, J., Kittler, J.,
A Survey Of The Hough Transform,
CVGIP(44), 1988, pp. 87-116. BibRef

Picton, P.D.,
Hough Transform References,
IJPRAI(1), 1987, pp. 413-425. BibRef

Davies, E.R.,
A Modified Hough Scheme For General Circle Location,
PRL(7), 1988, pp. 37-43. BibRef

Rhodes, F.M., Dituri, J.J., Chapman, G.H., Emerson, B.E., Soares, A.M., Raffel, J.I.,
A Monolithic Hough Transform Processor Based On Reconfigurable Vlsi,
T-PAMI(10), 1988, pp. 106-110. BibRef

Hanahara, K., Maruyama, T., Uchiyama, T.,
A Real-Time Processor For The Hough Transform,
T-PAMI(10), 1988, pp. 121-125. BibRef

Maresca, M., Lavin, M., Li, H.,
Parallel Hough Transform Algorithms On Polymorphic Torus Architecture,
MCV(88), pp. 9-21. BibRef

Bandopadhay, A., Fu, J.L.,
Searching Parameter Spaces With Noisy Linear Constraints,
CVPR(88), pp. 550-555. BibRef

Niblack, W., Petkovic, D.,
On Improving The Accuracy Of The Hough Transform: Theory, Simulations, And Experiments,
CVPR(88), pp. 574-579. BibRef

Wang, R., Hanson, A.R., Riseman, E.M.,
Fast Extraction Of Ellipses,
ICPR(88), pp. 508-510. BibRef

Ma, S.D., Chen, X.,
Hough Transform Using Slope And Curvature As Local Properties To Detect Arbitrary 2d Shapes,
ICPR(88), pp. 511-514. BibRef

Xu, L.,
A Method For Recognizing Configurations Consisting Of Line Sets And Its Application To Discrimination Of Seismic Face Structures,
ICPR(88), pp. 610-612. BibRef

Carrioli, L., Diani, M., Lombardi, L.,
Hierarchical Hough: Advantages And Automatic Construction Of The Models,
ICPR(88), pp. 791-794. BibRef

Lopez Krahe, J., Pousset, P.,
The Detection Of Parallel Straight Lines With The Application Of The Hough Transform,
ICPR(88), pp. 939-941. BibRef

Kamei, K., Nakamura, Y., Abe, S.,
Fast Shape Detection Using Hough Transform By Raster Operation,
ICPR(88), pp. 1109-1112. BibRef

Grimson, W.E.L., Huttenlocher, D.P.,
On The Sensitivity Of The Hough Transform For Object Recognition,
ICCV(88), pp. 700-706. BibRef

Tanaka, E., Tanaka, K.,
The Tree-To-Tree Editing Problem,
IJPRAI(2), 1988, pp. 221-240. BibRef

Sykora, O., Vrto, I.,
Tight Chip Area Lower Bounds For String Matching,
IPL(26), 1987, pp. 117-119. BibRef

Huang, X.,
A Lower Bound For The Edit-Distance Problem Under An Arbitrary Cost Function,
IPL(27), 1988, pp. 319-321. BibRef

Mittal, H.B.,
A Fast Backtrack Algorithm For Graph Isomorphism,
IPL(29), 1988, pp. 105-110. BibRef

Krithivasan, K., Sitalakshmi, R.,
Efficient Two-Dimensional Pattern Matching In The Presence Of Errors,
IS(43), 1987, pp. 169-184. BibRef

Galil, Z., Giancarlo, R.,
Data Structures And Algorithms For Approximate String Matching,
J. COMPLEXITY(4), 1988, pp. 33-72. BibRef

Landau, G.M., Vishkin, U.,
Fast String Matching With K Differences,
JCSS(37), 1988, pp. 63-78. BibRef

Schoning, V.,
Graph Isomorphism Is In The Low Hierarchy,
JCSS(37), 1988, pp. 312-323. BibRef

Schaback, R.,
On The Expected Sublinearity Of The Boyer-Moore Algorithm,
SIAM JC(17), 1988, pp. 648-658. BibRef

Tarhio, J., Ukkonen, E.,
A Greedy Approximation Algorithm For Constructing Shortest Common Superstrings,
TCS(57), 1988, pp. 131-145. BibRef

Umeyama, S.,
An Eigendecomposition Approach To Weighted Graph Matching Problems,
T-PAMI(10), 1988, pp. 695-703. BibRef

Cooper, P.,
Structure Recognition By Connectionist Relaxation: Formal Analysis,
IUW(88), pp. 981-993. BibRef

Csirik, J., Bunke, H.,
Longest K-Distance Substrings Of Two Strings,
ICPR(88), pp. 69-71. BibRef

Yang, H., Tai, J.W.,
On Isomorphisms Of Attributed Relational Graphs For Pattern Analysis And A New Branch And Bound Algorithm,
ICPR(88), pp. 957-959. BibRef

Lovasz, L., Plummer, M.D.,
Matching Theory, North-Holland,
AMSTERDAM(88), pp. 1986. BibRef

Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A.,
Graph-Grammars And Their Application To Computer Science, Springer,
BERLIN, 1987. BibRef

Chapter on Rosenfeld Bibliography for 1988 continues in
G.2. Stereo .

Last update:Jun 7, 2018 at 10:14:50