Y. Lamdan and H. Wolfson. Geometric hashing: a general and efficient model-based recognition scheme. Intl. Conf. on Computer Vision (ICCV), pages 238--249, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Finding Patterns in Three Dimensional Graphs.. - Wang, Wang.. (2002) (6 citations) (Correct)
....of three graphs; b) the pattern exactly occurring in two graphs in S; c) the pattern approximately occurring, within one mutation, in all the three graphs. Our strategy to find the patterns in a set of 3D graphs is to decompose the graphs into rigid substructures and then use geometric hashing [14] to organize the substructures and then to find the frequently occurring ones. In [35] we applied the approach to the discovery of patterns in chemical compounds under a restricted set of edit operations including node insert and node delete, and tested the quality of the patterns by using them ....
....hashing technique to find approximately common patterns in a set of 3D graphs without prior knowledge of their structures, positions, or occurrence frequency. The geometric hashing technique used here originated from the work of Lamdan and Wolfson for model based recognition in computer vision [14]. Several researchers attempted to parallelize the technique based on various architectures, such as the Hypercube and the Connection Machine [3, 19, 20] It was observed that the distribution of the hash table entries might be skewed. To balance the distribution of the hash function values, ....
Y. Lamdan and H. Wolfson, "Geometric Hashing: A General and Efficient Model-Based Recognition Scheme," Proc. Int'l Conf. Computer Vision, 1988, pp. 237--249.
Field Programmable Technology Implementation of - Target Recognition Using (2002) (Correct)
....points are typically corners or mid points of edges extracted from the input image. Thus the number of feature points is smaller than the number of pixels in a region of interest and they contain more useful information per point. For more information on GH we refer you to the original paper [1] or more recent survey article [2] 3. Field Programmable Gate Arrays Reconfigurable computing is becoming a mainstream technology, competing with general purpose processors in a growing marketplace for high performance and low power solutions for mobile and embedded solutions. Modern FPGAs ....
Y. Lamdan and H. Wolfson, "Geometric Hashing: A general and Efficient Modelbased Recognition Scheme", 2nd International Conference on Computer Vision, 1988.
A Parallel Voting Scheme for Aspect Recovery - Chen, al. (1995) (Correct)
....we can conquer this problem by using some physical features of aspects. In the current example, we may use the location relation of contours shared by two faces, viz. parallel vs intersection, to determine further whether an AIN of Aspect ## or Aspect ## is generated when the score is high enough[7]. In fact, the enforced representation has been used in the previous experiment. 10 Conclusions We have proposed a parallel voting scheme for aspect recovery in the context of the hybrid object recognition . Unlike the previous approach, the parallel voting network simply uses local ....
Y. Lamdan and H.J. Wolfson, "Geometric Hashing: A General And Efficient Model-Based Recognition Scheme," Proc. ICCV'88, 1988, 238-249.
The S²-Tree: An Index Structure for Subsequence Matching.. - Wang, Perng (Correct)
....sequence, search a set of spatial sequences to locate subsequences that are similar to the query sequence. However, traditional database indexing techniques are inadequate for this purpose. There is currently much excellent work in indexing multidimensional data, including geometric hashing[25], grid based index structures[15] and the R tree family[9, 8] index structures. These spatial access methods, are designed to index unsequenced spatial objects. The order among the entities in the database is not taken into consideration when the index structures are created and hence no ....
Y. Lamdan, H. Wolfson, "Geometric Hashing: A General and Efficient Model Based Recognition Scheme." In International Conference on Computer Vision, 213-29, 1988.
PSIST: Indexing Protein Structures using Suffix Trees - Feng Gao And (Correct)
No context found.
Y. Lamdan and H. Wolfson. Geometric hashing: a general and efficient model-based recognition scheme. Intl. Conf. on Computer Vision (ICCV), pages 238--249, 1988.
Recognizing Volumetric Objects in the Presence of Uncertainty - Arbel (1995) (1 citation) (Correct)
No context found.
Lamdan, Y. & Wolfson, H. (1990), Geometric hashing: A general and efficient model-based recognition scheme, in `Proceedings, 3RD International Conference on Computer Vision', Osaka, Japan, pp. 238--249.
Local approximate 3D matching of proteins in viral .. - Burkhardt.. (Correct)
No context found.
Y. Lamdan and H. Wolfson, "Geometric hashing: A general and efficient model-based recognition scheme," in Proceedings of the International Conference of Computer Vision, 1988, pp. 238-- 249.
Shape Representations and Algorithms for 3D Model Retrieval - Kazhdan (2004) (Correct)
No context found.
Y. Lamdan and H. Wolfson. Geometric hashing: A general and efficient modelbased recognition scheme. Proceedings of the 2nd International Conference on Computer Vision, pages 238--249, 1988.
Image-Based Wafer Navigation - Lifshits, Goldenberg, Rivlin.. (2004) (Correct)
No context found.
Y. Lamdan and H. J. Wolfson, "Geometric hashing: A general and efficient model-based recognition scheme," in Proce. 2nd Int. Conf. Computer Vision, Tampa, FL, June 1988, pp. 238--249.
SoftPOSIT: Simultaneous Pose and Correspondence.. - David, DeMenthon.. (2002) (2 citations) (Correct)
No context found.
Y. Lamdan & H.J. Wolfson. "Geometric Hashing: A General and Efficient Model-Based Recognition Scheme," Proc. 1998 IEEE ICCV, pp. 238-249.
Linear Model Hashing and Batch RANSAC for Rapid.. - Shan, Matei.. (2004) (Correct)
No context found.
Y. Lamdan and H. Wolfson. Geometric hashing: A general and efficient model-based recognition scheme. In International Conference on Computer Vision (ICCV88), pages 238--249, 1988.
Discriminative Techniques for the Recognition of Complex-Shaped .. - Carmichael (2003) (Correct)
No context found.
Y. Lambdan and H. Wolfson. Geometric hashing: A general and efficient modelbased recognition scheme. In Proceedings International Conference On Computer Vision, pages 238--249, 1988.
Unknown - (Correct)
No context found.
Y. Lamden and H. Wolfson. "Geometric hashing: A general and efficient model-based recognition scheme." In Proc. Int. Conference on Computer Vision, pp. 238-249, December 1988.
Computer Vision and Image Understanding 84, 5--24 (2001) - Doi Cviu Available (Correct)
No context found.
Y. Lamdan and H. Wolfson, Geometric hashing: A general and efficient model-based recognition scheme, in Proc. 2nd Inter. Conf. Computer Vision, 1988, pp. 238--249.
Shape-Based Recognition of Wiry Objects - Carmichael, Hebert (2003) (Correct)
No context found.
Y. Lambdan and H. Wolfson. Geometric hashing: A general and efficient model-based recognition scheme. In Proceedings International Conference On Computer Vision, pages 238--249, 1988.
Substructure Clustering on Sequential 3d Object Datasets - Tan, Tung (2004) (Correct)
No context found.
Y. Lamdan and H. Wolfson. Geometric hashing: A general and efficient model based recognition scheme. In International Conference on Computer Vision, pages 213--29, 1998.
SoftPOSIT: Simultaneous Pose and Correspondence.. - David, DeMenthon.. (2002) (2 citations) (Correct)
No context found.
Lamdan, Y. and Wolfson, H.J. 1988. Geometric Hashing: A General and Efficient Model-Based Recognition Scheme. In Proc. IEEE Int. Conf. on Computer Vision, Tampa, FL, pp. 238--249.
Dressed Human Modeling, Detection, and Parts Localization - Zhao (2001) (Correct)
No context found.
Y. Lamdan and H.J. Wolfson, "Geometric Hashing: A General and Efficient ModelBased Recognition Scheme," Proc. of the 2'nd Int. Conf. on Computer Vision, pp. 238-249, 1988.
Unsupervised Thresholds For Shape Matching - Pablo Mus Fr (2003) (Correct)
No context found.
Y. Lamdan and H. Wolfson, "Geometric hashing: A general and efficient model-based recognition scheme," in Proc. of the IEEE Int. Conf. on Computer Vision, 1988.
Object Recognition using Local Affine Frames on Distinguished .. - Obdrzalek, Matas (2002) (5 citations) (Correct)
No context found.
Y. Lambdan and H. Wolfson. Geometric hashing: A general and efficient model based recognition scheme. In Proceedings of International Conference on Computer Vision, pages 238-- 249, 1988.
Evaluation of the SoftPOSIT Model-to-Image.. - David, DeMenthon.. (2002) (Correct)
No context found.
Y. Lamdan and H.J. Wolfson, "Geometric Hashing: A General and Efficient Model-Based Recognition Scheme," Proc. IEEE Int. Conf. on Computer Vision, pp. 238-249, 1998.
Shape-based Recognition of Wiry Objects - Carmichael, Hebert (2003) (Correct)
No context found.
Y. Lambdan and H. Wolfson. Geometric hashing: A general and efficient model-based recognition scheme. In Proc. ICCV, pages 238--249, 1988.
Dressed Human Modeling, Detection, and Parts Localization - Zhao (2001) (Correct)
No context found.
Y. Lamdan and H.J. Wolfson, "Geometric Hashing: A General and Efficient ModelBased Recognition Scheme," Proc. of the 2'nd Int. Conf. on Computer Vision, pp. 238-249, 1988.
Rotation Invariant Spherical Harmonic Representation .. - Kazhdan.. (2003) (8 citations) (Correct)
No context found.
Lamdan, Y., Wolfson, H.: Geometric hashing: A general and efficient model-based recognition scheme. Proceedings of the 2nd International Conference on Computer Vision (1988) 238--249
Unknown - Pattern Recognition Vol (1995) (Correct)
No context found.
Y. Laindan and H. Wolfson, Geometric hashing: A general and efficient model-based recognition scheme, Second Int. Conf. Cornput. Vis. pp. 238-249. Tampa, Florida, U.S.A. (December 1988).
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC