A theoretical comparison of texture algorithms (Record no. 50180)

MARC details
000 -LEADER
fixed length control field 02466nam a2200193Ia 4500
003 - CONTROL NUMBER IDENTIFIER
control field MX-MdCICY
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20250625160143.0
040 ## - CATALOGING SOURCE
Transcribing agency CICY
090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN)
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) B-16004
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 250602s9999 xx |||||s2 |||| ||und|d
245 10 - TITLE STATEMENT
Title A theoretical comparison of texture algorithms
490 0# - SERIES STATEMENT
Volume/sequential designation IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-2(3), p.204-222, 1980
520 3# - SUMMARY, ETC.
Summary, etc. An evaluation of the ability of four texture analysis algorithms to perform automatic texture discrimination will be described. The algorithms which will be examined are the spatial gray level dependence method (SGLDM), the gray level run length method (GLRLM), the gray level difference method (GLDM), and the power spectral method (PSM). The evaluation procedure employed does not depend on the set of features used with each algorithm or the pattern recognition scheme. Rather, what is examined is the amount of texture-context information contained in the spatial gray level dependence matrices, the gray level run length matrices, the gray level difference density functions, and the power spectrum. The comparison will be performed in two steps. First, only Markov generated textures will be considered. The Markov textures employed are similar to the ones used by perceptual psychologist B. Julesz in his investigations of human texture perception. These Markov textures provide a convenient mechanism for generating certain example texture pairs which are important in the analysis process. In the second part of the analysis the results obtained by considering only Markov textures will be extended to all textures which can be represented by translation stationary random fields of order two. This generalization clearly indudes a much broader class of textures than Markovian ones. The results obtained indicate that the SGLDM is the most powerful algorithm of the four considered, and that the GLDM is more powerful than the PSM. These theoretically derived results agree very well with an experimentally performed comparison done by Weszka, Dyer, and Rosenfeld on real world textures. Copyright © 1980 by The Institute of Electrical and Electronics Engineers. Inc.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element PATTERN RECOGNITION SYSTEMS
700 12 - ADDED ENTRY--PERSONAL NAME
Personal name Conners, R.W.
700 12 - ADDED ENTRY--PERSONAL NAME
Personal name Harlow, C.A.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://drive.google.com/file/d/12fFTaCa_nMTK-24q5UANpMktaZexF45W/view?usp=drivesdk">https://drive.google.com/file/d/12fFTaCa_nMTK-24q5UANpMktaZexF45W/view?usp=drivesdk</a>
Public note Para ver el documento ingresa a Google con tu cuenta: @cicy.edu.mx
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Clasificación local
Koha item type Documentos solicitados
Holdings
Lost status Source of classification or shelving scheme Damaged status Not for loan Collection Home library Current library Shelving location Date acquired Total checkouts Full call number Date last seen Price effective from Koha item type
  Clasificación local     Ref1 CICY CICY Documento préstamo interbibliotecario 25.06.2025   B-16004 25.06.2025 25.06.2025 Documentos solicitados