Biography:Woody Bledsoe

From HandWiki
Revision as of 05:49, 9 February 2024 by BotanyGa (talk | contribs) (update)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Short description: American mathematician and computer scientist
Woodrow Wilson Bledsoe
Bledsoe.gif
Born
Maysville, Oklahoma
DiedOctober 4, 1995(1995-10-04) (aged 73)
Alma materUniversity of California, Berkeley
Spouse(s)Virginia (née Norgaard)
Children4
Awards
  • Bronze Star ribbon.svg Bronze Star Medal 1945,
  • IJCAI Distinguished Service Award 1991,
  • AMS Milestone Award 1991,
  • Herbrand Award 1994
Scientific career
ThesisSeparative Measures for Topological Spaces (1953)
Doctoral advisorAnthony Perry Morse
Doctoral studentsRobert S. Boyer

Woodrow Wilson "Woody" Bledsoe (November 12, 1921 – October 4, 1995) was an American mathematician, computer scientist, and prominent educator. He is one of the founders of artificial intelligence (AI), making early contributions in pattern recognition,[1] facial recognition,[2] and automated theorem proving.[3][4][5][6] He continued to make significant contributions to AI throughout his long career. One of his influences was Frank Rosenblatt.[7]

Beginning in 1966, he worked at the department of mathematics and computer science of the University of Texas at Austin, holding the Peter O'Donnell Jr. Centennial Chair in Computing Science starting in 1987.[8]:723

Bledsoe joined the Church of Jesus Christ of Latter-day Saints as an adult, and served in the church as a bishop, counselor to the stake presidency, and stake patriarch. He also served as a leader in the Boy Scouts of America.[9][10] Bledsoe died on October 4, 1995, of amyotrophic lateral sclerosis, more commonly known as ALS or Lou Gehrig's disease.

Works

The n-tuple method (1959) was an early method for learning a pattern recognition program. The basic method is illustrated by the problem of recognizing 36 alphanumerical characters (0-9, a-z).[11]

Let the input be a 10x15 binary image. It is equivalent to a single string with 150 binary letters. Now, randomly partition the 150 binary pixels into 75 pairs. Each pair has 4 possibilities: 00, 01, 10, 11. Now we will define a 300x36 binary matrix as follows:

Let [math]\displaystyle{ 1_{00} }[/math] represent the 00-state of the first pair, and similarly for the others. We have 300 such states, each represented in a row. The 36 columns each correspond to one alphanumerical character. The entire binary matrix is arranged as follows:[math]\displaystyle{ \begin{bmatrix} & 0 & 1 & \cdots & 9 & a & b & \cdots & z \\ 1_{00} & & & & \\ 1_{01} & & & & \\ 1_{10} & & & & \\ 1_{11} & & & & \\ \vdots \\ 75_{11} & & & & \\ \end{bmatrix} }[/math]The pattern recognizer is defined by the binary matrix. It is trained by firstsetting all entries to zero, then it is presented with several binary images of each alphanumerical character. For each image, the corresponding entries in the matrix are set to one, and the other entries are unchanged. This is an example of machine learning.

After the training the recognizer, it can be used to recognize new images. First compute the new image's corresponding column vector, then take the dot-product with each column of the binary matrix. The column with the highest dot-product is outputted as the most likely character.

Further reading

Selected publications

References

  1. ↑ W.W. Bledsoe (1966). "Some Results on Multicategory Pattern Recognition". J. ACM 13 (2): 304–316. doi:10.1145/321328.321340. http://elartu.tntu.edu.ua/handle/lib/39646. 
  2. ↑ Raviv, Shaun. "The Secret History of Facial Recognition" (in en-US). Wired. ISSN 1059-1028. https://www.wired.com/story/secret-history-facial-recognition/. Retrieved 2023-08-31. 
  3. ↑ W.W. Bledsoe (1971). "Splitting and Reduction Heuristics in Automatic Theorem Proving". Artif. Intell. 2 (1): 55–77. doi:10.1016/0004-3702(71)90004-x. https://saltworks.stanford.edu/assets/yy382gv1477.pdf. 
  4. ↑ W.W. Bledsoe (Sep 1975). "A New Method for Proving Certain Presburger Formulas". Proc. IJCAI. pp. 15–21. http://www.ijcai.org/Proceedings/75/Papers/003.pdf. 
  5. ↑ W.W. Bledsoe (1977). "Non-Resolution Theorem Proving". Artificial Intelligence 9: 1–35. doi:10.1016/0004-3702(77)90012-1.  — Preceding technical report ATP29 (Sep.1975)
  6. ↑ W.W. Bledsoe and Kenneth Kunen and Robert E. Shostak (1985). "Completeness Results for Inequality Provers". Artif. Intell. 27 (3): 255–288. doi:10.1016/0004-3702(85)90015-3.  — Preceding technical report ATP65 (1983)
  7. ↑ McCorduck, Pamela (2018). Machines who think: a personal inquiry into the history and prospects of artificial intelligence. An A K Peters book. Boca Raton London New York: CRC Press. pp. 106. ISBN 978-1-56881-205-2. 
  8. ↑ Computational Logic — Essays in Honor of Alan Robinson. Cambridge/MA: MIT Press. 1991. ISBN 978-0-262-12156-9. 
  9. ↑ Memorial Resolution – Woodrow W. Bledsoe
  10. ↑ "UT science pioneer 'Woody' Bledsoe dies". Austin American-Statesman. October 6, 1995. http://nl.newsbank.com/nl-search/we/Archives?p_product=AASB&p_theme=aasb&p_action=search&p_maxdocs=200&p_topdoc=1&p_text_direct-0=0EAD97B2F7F19A6C&p_field_direct-0=document_id&p_perpage=10&p_sort=YMD_date:D&s_trackval=GooglePM. 
  11. ↑ Bledsoe, W. W.; Browning, I. (1959). "Pattern recognition and reading by machine" (in en). Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference on - IRE-AIEE-ACM '59 (Eastern). ACM Press. pp. 225–232. doi:10.1145/1460299.1460326. http://portal.acm.org/citation.cfm?doid=1460299.1460326. 

External links




Retrieved from "https://handwiki.org/wiki/index.php?title=Biography:Woody_Bledsoe&oldid=3443772"