|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM211010839 |
| 003 |
DE-627 |
| 005 |
20231224012716.0 |
| 007 |
tu |
| 008 |
231224s1979 xx ||||| 00| ||eng c |
| 028 |
5 |
2 |
|a pubmed24n0703.xml
|
| 035 |
|
|
|a (DE-627)NLM211010839
|
| 035 |
|
|
|a (NLM)21868831
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Davis, L S
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Shape matching using relaxation techniques
|
| 264 |
|
1 |
|c 1979
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ohne Hilfsmittel zu benutzen
|b n
|2 rdamedia
|
| 338 |
|
|
|a Band
|b nc
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 02.10.2012
|
| 500 |
|
|
|a Date Revised 12.11.2019
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a The problem of finding approximate matches of pieces of shapes to parts of larger shapes is investigated. The shapes are represented by polygonal approximations. Initially, figures of merit are assigned to the matches between pairs of angles on the two shapes. Relaxation methods are then used to find acceptable combinations of these matches. This approach was tested on a data base consisting of digitized coastlines in various map projections. In nearly all cases, all matches except the correct one were eliminated by the relaxation processes
|
| 650 |
|
4 |
|a Journal Article
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 1(1979), 1 vom: 01. Jan., Seite 60-72
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:1
|g year:1979
|g number:1
|g day:01
|g month:01
|g pages:60-72
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 1
|j 1979
|e 1
|b 01
|c 01
|h 60-72
|