3 D Curve Matching
3 D Curve Matching
The book 3 D Curve Matching was written by author Here you can read free online of 3 D Curve Matching book, rate and share your impressions in comments. If you don't know what to write, just answer the question: Why is 3 D Curve Matching a good or bad book?
Where can I read 3 D Curve Matching for free?
In our eReader you can find the full English version of the book. Read 3 D Curve Matching Online - link to read the book on full screen. Our eReader also allows you to upload and read Pdf, Txt, ePub and fb2 books. In the Mini eReder on the page below you can quickly view all pages of the book - Read Book 3 D Curve Matching
In our eReader you can find the full English version of the book. Read 3 D Curve Matching Online - link to read the book on full screen. Our eReader also allows you to upload and read Pdf, Txt, ePub and fb2 books. In the Mini eReder on the page below you can quickly view all pages of the book - Read Book 3 D Curve Matching
What reading level is 3 D Curve Matching book?
To quickly assess the difficulty of the text, read a short excerpt:
However, as will be seen from the description of the matching algorithm in the next section, we only use these signatures in the first stage of the algo- rithm to filter out unsuitable candidates for matching. The reduced number of candidates that survive this filtering procedure are then matched by the robust 3-D matching algorithm due to Schwartz and Sharir, which takes into account all 3-D information about given sample points.
3 The Matching Algorithm In this section we describe the matchin...g algorithm applied in our experi- ments and the geometric hashing used. This technique was introduced for the 2-D case in [KSSS 87], and later improved in [HW]. The approach of [HW] is well tailored for partial curve matching and is used in our 3-D experiments. This method can be applied to the problem of matching one curve against another {two-curve matching), as well as to the problem of matching an observed curve against a large data-base of model curves. Al- 10 though the purpose of our experiment was two-curve matching, we describe the algorithm in general terms to emphasize that it is suitable for use in the general object recognition problem (see discussion in the Introduction).
What to read after 3 D Curve Matching?
You can find similar books in the "Read Also" column, or choose other free books by Eyal Kishon to read onlineMoreLess
To quickly assess the difficulty of the text, read a short excerpt:
However, as will be seen from the description of the matching algorithm in the next section, we only use these signatures in the first stage of the algo- rithm to filter out unsuitable candidates for matching. The reduced number of candidates that survive this filtering procedure are then matched by the robust 3-D matching algorithm due to Schwartz and Sharir, which takes into account all 3-D information about given sample points.
3 The Matching Algorithm In this section we describe the matchin...g algorithm applied in our experi- ments and the geometric hashing used. This technique was introduced for the 2-D case in [KSSS 87], and later improved in [HW]. The approach of [HW] is well tailored for partial curve matching and is used in our 3-D experiments. This method can be applied to the problem of matching one curve against another {two-curve matching), as well as to the problem of matching an observed curve against a large data-base of model curves. Al- 10 though the purpose of our experiment was two-curve matching, we describe the algorithm in general terms to emphasize that it is suitable for use in the general object recognition problem (see discussion in the Introduction).
What to read after 3 D Curve Matching?
You can find similar books in the "Read Also" column, or choose other free books by Eyal Kishon to read onlineMoreLess
Write Review:
User Reviews: