Guessing Shape of a Complete Line Drawing of a Polyhedron Using an Heuristic Tree Search.
Saved in:
| Title: | Guessing Shape of a Complete Line Drawing of a Polyhedron Using an Heuristic Tree Search. |
|---|---|
| Authors: | Ishikawa, Seiji1 |
| Source: | Systems & Computers in Japan. Jan1986, Vol. 17 Issue 1, p44-52. 9p. |
| Subjects: | LINDA (Computer system), Optical pattern recognition, Newton diagrams, Heuristic programming, Computer systems |
| Geographic Terms: | Japan |
| Abstract: | This paper describes a technique for guessing a complete line drawing of a polyhedron from an incomplete line drawing by an heuristic tree search. The heuristic tree search employs two indices which represent structural unity of shape: the ratio of the number of parallel sides to the number el all sides on a line drawing of a polyhedron; and the difference between the minimum `and the maximum inner angle on a loop (a closed link of sides). A line drawing obtained from preprocessing of a picture usually contains several polyhedra. It is segmented to each line drawing which corresponds to a single polyhedron, and it is generally an incomplete line drawing. The line drawing is expressed by a set of loops, and labelling on each side of the loops refers to the position and gradient of the side. An incomplete junction is searched on the line drawing by referring re the labels. Then a complete line drawing is guessed by adding sides to the incomplete junctions so that the values of the indices increase. One might expect that the present method gives aid to the recognition of an object given by an incomplete line drawing. An experimental result is given and some problems are discussed. [ABSTRACT FROM AUTHOR] |
| Copyright of Systems & Computers in Japan is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 14050393 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Guessing Shape of a Complete Line Drawing of a Polyhedron Using an Heuristic Tree Search. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Ishikawa%2C+Seiji%22">Ishikawa, Seiji</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Systems+%26+Computers+in+Japan%22">Systems & Computers in Japan</searchLink>. Jan1986, Vol. 17 Issue 1, p44-52. 9p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22LINDA+%28Computer+system%29%22">LINDA (Computer system)</searchLink><br /><searchLink fieldCode="DE" term="%22Optical+pattern+recognition%22">Optical pattern recognition</searchLink><br /><searchLink fieldCode="DE" term="%22Newton+diagrams%22">Newton diagrams</searchLink><br /><searchLink fieldCode="DE" term="%22Heuristic+programming%22">Heuristic programming</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink> – Name: SubjectGeographic Label: Geographic Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Japan%22">Japan</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This paper describes a technique for guessing a complete line drawing of a polyhedron from an incomplete line drawing by an heuristic tree search. The heuristic tree search employs two indices which represent structural unity of shape: the ratio of the number of parallel sides to the number el all sides on a line drawing of a polyhedron; and the difference between the minimum `and the maximum inner angle on a loop (a closed link of sides). A line drawing obtained from preprocessing of a picture usually contains several polyhedra. It is segmented to each line drawing which corresponds to a single polyhedron, and it is generally an incomplete line drawing. The line drawing is expressed by a set of loops, and labelling on each side of the loops refers to the position and gradient of the side. An incomplete junction is searched on the line drawing by referring re the labels. Then a complete line drawing is guessed by adding sides to the incomplete junctions so that the values of the indices increase. One might expect that the present method gives aid to the recognition of an object given by an incomplete line drawing. An experimental result is given and some problems are discussed. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Systems & Computers in Japan is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=14050393 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1002/scj.4690170106 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 9 StartPage: 44 Subjects: – SubjectFull: LINDA (Computer system) Type: general – SubjectFull: Optical pattern recognition Type: general – SubjectFull: Newton diagrams Type: general – SubjectFull: Heuristic programming Type: general – SubjectFull: Computer systems Type: general – SubjectFull: Japan Type: general Titles: – TitleFull: Guessing Shape of a Complete Line Drawing of a Polyhedron Using an Heuristic Tree Search. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Ishikawa, Seiji IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Text: Jan1986 Type: published Y: 1986 Identifiers: – Type: issn-print Value: 08821666 Numbering: – Type: volume Value: 17 – Type: issue Value: 1 Titles: – TitleFull: Systems & Computers in Japan Type: main |
| ResultId | 1 |
