Jump to content

Talk:Robert Haralick

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Small disclaimer

[edit]

If I might set an example of full disclosure in the scholarly tradition: ironically enough, I have a past connection with R. M. Haralick, but nonetheless I believe my additions satisfy WP:NPOV. At any rate I think I have provided sufficient verification for the connection with bible codes.---CH 10:53, 1 June 2006 (UTC)[reply]

Writing style

[edit]

The prescribed style for biographies is to not use titles like "Dr." or "Professor" except maybe at the very start. See Wikipedia:Manual of Style (biographies). --McKay 05:56, 16 March 2007 (UTC)[reply]

Constraint satisfaction/"Forward checking" algorithm

[edit]

One aspect not mentioned on the Haralick page is the "Forward Checking" algorithm that Dr. Haralick and I created. (J.J. McGregor simultaneously created and published a very similar algorithm, we are often given co-credit.)

This algorithm is now mentioned in computer science books in the topic of "constraint satisfaction". A Google Scholar search Will show the article introducing the algorithm as just about the most often cited single article in the subject. J.J. McGregor's work was very similar, but ours was much more accessible and prominently published. (This article was also for some time Haralick's most cited single article. OH--forward checking has its own redirect, which is certainly significant enough for mention here!)

The actual history (documented nowhere I know of) is that Dr. Haralick invented a version we called (I believe) "partial lookahead", and I made another improvement to strip out additional consistency checks by realizing that another set of checks could be removed. I coded the algorithm, and Dr. Haralick was very excited in some testing late the next night. We published a comparison of algorithms named "Increasing Tree Search efficiency for Constraint Satisfaction Problems" in 1979, and longer version in 1980 which introduced the algorithm.

It is now available as a part of suite in 9.1 version of SAS/OR (CLP manual). It is widely taught because of its simplicity, and for 10 years as the most efficient known algorithm. Research that came after produced methods that allow constraint satisfaction to be used in puzzle solving applications like genome sequencing--I do not know the degree to which our earlier work provided any foundation, but it is certainly cited. Here is a tutorial to understand the basic area: http://4c.ucc.ie/web/outreach/tutorial.html .

Also I can confirm the involvement of Dr. Haralick in "bible codes". A friend has been a vocal and well respected opponent, noting these codes can occur strictly as statistical anomaly, e.g. could be found anywhere if looked for. I personally have had my hands on decks of cards (many drawers full), back in the days one used those, containing coded copy of the bible, in mid-late 70's, while we were researching various pattern recognition topics. I personally take exception to the language "..deceptively depicted as encodings in books like Moby Dick and War and Peace from those real encodings that occur in the Torah text" which appears in a sentence along with normal pattern recognition results. This is a cliam made by Dr. Harallck and others, widely disputed by others. The author of this biography should not take upon him/her self to analyze the accuracy of such a claim. I believe it should appear in a separate paragraph, and should be accompanied with disclaimer language since it is so controversial, and should in no case be presented as though the WIKI authors are representing Torah codes as "real".

Sorry don't know how to log in at the moment, and don't want to promote myself so won't attempt to add to this article myself, will leave decisions on the issue to others. Thanks 64.136.209.228 20:40, 30 June 2007 (UTC)Gordon Elliott[reply]

Notability issues

[edit]

The concern isn't whether Haralick is involved in Bible Codes. It's whether that's the source of his notability, and whether someone, once they are notable in one field, can simply have whatever else they do inserted into a Wiki-biography. I think this is against the general policies of the Biography project. If a person is notable for computer vision (which is not well-established here, as it is - as there are no secondary sources), then the article should stick to computer vision. If the person is notable for Bible/Torah work, then second secondary sources and ways of establishing notability in that area need to appear. For example, while Haralick clearly has academic appointments in fields related to computer vision, he has no academic appointments in religious studies. This is a problem. Indeed, there are so many problems with this article, as the tags reflect. However, copyediting is no longer one of them, this is no longer a copyediting problem. I have asked for help in what to do next about the other unaddressed issues and begun adding much-needed fact tags. Levalley (talk) 22:09, 21 April 2009 (UTC)[reply]

Microdetails

[edit]

Is it appropriate to have Who's who listings and so forth in this article? And what about mentioning how many articles the person has published? What's the point of that? To establish notability, one must not merely publish, but be cited by others - a few of those kinds of citations would really be helpful here.Levalley (talk) 22:12, 21 April 2009 (UTC)[reply]

And if the person in question gives talks at crackpot conferences (the sort where perpetual-motion and antigravity machines are presented) should those be mentioned if that person brings to that conference only his own professional (but deceptively exploited) expertise? For example: http://energyscienceconference.com/2016-speakers/ — Preceding unsigned comment added by 86.168.196.227 (talk) 11:37, 16 November 2016 (UTC)[reply]

[edit]

Hello fellow Wikipedians,

I have just modified one external link on Robert Haralick. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).

  • If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
  • If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 06:24, 31 December 2017 (UTC)[reply]