text: this invention presents an improved system and method for user interaction and data exchange between a user equipped with an imaging device and some server / service . a communication imaging device ( wireless or wireline ), such as a camera phone , a webcam with a wifi interface , or a pda ( which may have a wifi or cellular card ). the device is capable of taking images , live video clips , or off - line video clips . client software on the device enabling the imaging and the sending of the multimedia files to a remote server . this software can be embedded software which is part of the device , such as an email client , or an mms client , or an h . 324 video telephony client . alternatively , the software can be downloaded software , either generic software such as blogging software ( e . g ., the picoblogger ™ product by picostation ™, or the cognima snap ™ product by cognima ™, inc . ), or special software designed specifically and optimized for the imaging and sending operations . a remote server with considerable computational resources or considerable memory . “ considerable computational resources ” in this context means that this remote server can perform calculations faster than the local cpu of the imaging device by at least one order of magnitude . thus the user &# 39 ; s wait time for completion of the computation is much smaller when such a remote server is employed . “ considerable memory ” in this context means that the server has a much larger internal memory ( the processor &# 39 ; s main memory or ram ) than the limited internal memory of the local cpu of the imaging device . the remote server &# 39 ; s considerable memory allows it to perform calculations that the local cpu of the imaging device cannot perform due to memory limitations of the local cpu . the remote server in this context will have considerable computational resources , or considerable memory , or both . a display device , such as a computer screen , cellular phone screen , tv screen , dvd player screen , advertisement board , or led display . alternatively , the display device can be just printed material , which may be printed on an advertisement board , a receipt , a newspaper , a book , a card , or other physical medium . the method of operation of the system may be summarized as follows : the display device shows an image or video clip ( such as a login screen , a voting menu , or an authenticated purchase screen ) that identifies the service , while also showing potentially other content ( such as an ongoing tv show , or preview of a video clip to be loaded ). the user images the display with his portable imaging device , and the image is processed to identify and decode the relevant information into a digital string . thus , a de - facto one way communication link is established between the display device and the user &# 39 ; s communication device , through which digital information is sent . the information decoded in the previous stage is used for various purposes and applications , such as for example two way authentication between the user and the remote service . fig1 illustrates a typical prior art authentication system for remote transactions . a server 100 which controls access to information or services , controls the display of a web browser 101 running in the vicinity of the user 102 . the user has some trusted security token 103 . in some embodiments , the token 103 is a wireless device that can communicate through a communication network 104 ( which may be wireless , wireline , optical , or any other network that connects two or more non - contiguous points ). the link 105 between the server the web browser is typically a tcp / ip link . the link 106 between the web browser and the user is the audio / visual human connectivity between the user and the browser &# 39 ; s display . the link 107 between the user and the token denotes the user - token interface , which might be a keypad , a biometric sensor , or a voice link . the link 108 between the token and the web browser denotes the token &# 39 ; s interaction channel based on infra red , wireless , physical electric connection , acoustic , or other methods to perform a data exchange between the token 103 and the web browsing device 101 . the link 109 between the token and the wireless network can be a cellular interface , a wifi interface , a usb connector , or some other communication interface . the link 110 between the communication network and the server 100 is typically a tcp / ip link . the user 102 reads the instructions appearing on the related web page on browser 101 , and utilizes some authentication token 103 in order to validate the user &# 39 ; s identity and / or the identity and validity of the remote server 100 . the token can be , for example , one of the devices mentioned in the description of the related art , such as a usb token , or a cellular phone . the interaction channel 107 of the user with the token can involve the user typing a password at the token , reading a numeric code from the token &# 39 ; s screen , or performing a biometric verification through the token . the interaction between the token 103 and the browser 101 is further transferred to the remote server 100 for authentication ( which may be performed by comparison of the biometric reading to an existing database , password verification , or cryptographic verification of a digital signature ). the transfer is typically done through the tcp / ip connection 105 and through the communication network 104 . the key factor enabling the trust creation process in the system is the token 103 . the user does not trust any information coming from the web terminal 101 or from the remote server 100 , since such information may have been compromised or corrupted . the token 103 , carried with the user and supposedly tamper proof , is the only device that can signal to the user that the other components of the system may be trusted . at the same time , the remote server 100 only trusts information coming from the token 103 , since such information conforms to a predefined and approved security protocol . the token &# 39 ; s existence and participation in the session is considered a proof of the user &# 39 ; s identity and eligibility for the service or information ( in which “ eligible ” means that the user is a registered and paying user for service , has the security clearance , and meets all other criteria required to qualify as a person entitled to receive the service ). in the embodiments where the token 103 is a mobile device with wireless data communication capabilities , the communication network 104 is a wireless network , and may be used to establish a faster or more secure channel of communication between the token 103 and the server 100 , in addition to or instead of the tcp / ip channel 105 . for example , the server 100 may receive a call or sms from the token 103 , where wireless communication network 104 reliably identifies for the server the cellular number of the token / phone . alternatively , the token 103 may send an inquiry to the wireless communication network 104 as to the identity and eligibility of the server 100 . a key element of the prior art are thus the communication links 106 , 107 , and 108 , between the web browser 101 , the user 102 , and the token 103 . these communication links require the user to manually read and type information , or alternatively require some form of communication hardware in the web browser device 101 and compatible communication hardware in the token 103 . fig2 illustrates a typical prior art method of locating an object in a two - dimensional image and comparing it to a reference in order to determine if the objects are indeed identical . a reference template 200 ( depicted in an enlarged view for clarity ) is used to search an image 201 using the well known and established technology of “ normalized cross correlation method ” ( also known as “ ncc ”). alternatively , other similarity measures such as the “ sum of absolute differences ” (“ sad ”) and its variants may be used . the common denominator of all of these methods ( ncc , sad , and their variants ) is that the methods get a fixed size template , compare that template to parts of the image 201 which are of identical size , and return a single number on some given scale where the magnitude of the number indicates whether or not there is a match between the template and the image . for example , a 1 . 0 would denote a perfect match and a 0 . 0 would indicate no match . thus , if a “ sliding window ” of a size identical to the size of the template 200 is moved horizontally and vertically over the image 201 , and the results of the comparison method — the “ match values ” ( e . g . ncc , sad ) are registered for each position of the sliding window , a new “ comparison results ” image is created in which for each pixel the value is the result of the comparison of the area centered around this pixel in the image 201 with the template 200 . typically , most pixel locations in the image 201 would yield low match values . the resulting matches , determined by the matching operation 202 are displayed in elements 203 , 204 , and 205 . in the example shown in fig2 , pixel location denoted in 203 ( the center of the black square ) has yielded a low match value ( since the template and the image compared are totally dissimilar ), pixel location denoted in 204 has yielded an intermediate match value ( because both images include the faces and figures of people , although there is not a perfect match ), and the pixel location denoted in 205 has yielded a high match value . therefore , application of a threshold criterion to the resulting “ match values ” image generates image 206 , where only in specific locations ( here 207 , 208 , 209 ) is there a non - zero value . thus , image 206 is not an image of a real object , but rather a two dimensional array of pixel values , where each pixel &# 39 ; s value is the match . finally , it should be noted that in the given example we would expect the value at pixel 209 to be the highest since the object at this point is identical to the template . the prior art methods are useful when the image scale corresponds to the template size , and when the object depicted in the template indeed appears in the image with very little change from the template . however , if there is any variation between the template and the image , then prior art methods are of limited usefulness . for example , if the image scale or orientation are changed , and / or if the original object in the image is different from the template due to effects such as geometry or different lighting conditions , or if there are imaging optical effects such as defocusing and smearing , then in any of these cases the value at the pixel of the “ best match ” 209 could be smaller than the threshold or smaller than the value at the pixel of the original “ fair match ” 208 . in such a case , there could be an incorrect detection , in which the algorithm has erroneously identified the area around location 208 as containing the object depicted in the template 200 . a further limitation of the prior art methods is that as the template 200 becomes larger ( that is to say , if the object to be searched is large ), the sensitivity of the match results to the effects described in the previous paragraph is increased . thus , application of prior art methods is impractical for large objects . similarly , since prior art methods lack sensitivity , they are less suitable for identification of graphically complicated images such as a complex graphical logo . in typical imaging conditions of a user with an imaging device performing imaging of a screen or of printed material , the prior art methods fail for one or more of the deficiencies mentioned above . thus , a new method and system are required to solve these practical issues , a method and system which are presented here as exemplary embodiments of the present invention . in fig3 , the main components of an exemplary embodiment of the present invention are described . as in the prior art described in fig1 , a remote server 300 is used . ( throughout this application , the term “ remote server ” 300 means any combination of servers or computers .) the remote server 300 is connected directly to a local node 301 . ( throughout this application , the term “ local node ” 301 means any device capable of receiving information from the remote server and displaying it on a display 302 .) examples of local nodes include a television set , a personal computer running a web browser , an led display , or an electronic bulletin board . the local node is connected to a display 302 , which may be any kind of physical or electronic medium that shows graphics or texts . in some embodiments , the local node 301 and display device 302 are a static printed object , in which case their only relation to the server 300 is off - line in the sense that the information displayed on 302 has been determined by or is known by the server 300 prior to the printing and distribution process . examples of such a local node include printed coupons , scratch cards , or newspaper advertisements . the display is viewed by an imaging device 303 which captures and transmits the information on the display . there is a communication module 304 which may be part of the imaging device 303 or which may be a separate transmitter , which sends the information ( which may or may not have been processed by a local cpu in the imaging device 303 or in the communication module 304 ) through a communication network 305 . in one embodiment , the communication network 305 is a wireless network , but the communication network may be also a wireline network , an optical network , a cable network , or any other network that creates a communication link between two or more nodes that are not contiguous . the communication network 305 transmits the information to a processing and authentication server 306 . the processing and authentication server 306 receives the transmission from the communication network 305 in whatever degree of information has been processed , and then completes the processing to identify the location of the display , the time the display was captured , and the identity of the imaging device ( hence , also the service being rendered to the user , the identity of the user , and the location of the user at the time the image or video clip was captured by the imaging device ). the processing and authentication server 306 may initiate additional services to be performed for the user , in which case there will be a communication link between that server 306 and server 300 or the local node 301 , or between 306 and the communication module 304 . the exact level of processing that takes place at 304 , 305 , and 306 can be adapted to the desired performance and the utilized equipment . the processing activities may be allocated in any combination among 304 , 305 , and 306 , depending on factors such as the processing requirements for the specific information , the processing capabilities of these three elements of the system , and the communication speeds between the various elements of the system . as an example , components 303 and 304 could be parts of a 3g phone making a video call through the a cellular network 305 to the server 306 . in this example , video frames reach 306 and must be completely analyzed and decoded there , at server 306 , to decode the symbols , alphanumerics and / or machine codes in the video frames . an alternative example would be a “ smartphone ” ( which is a phone that can execute local software ) running some decoding software , such that the communication module 304 ( which is a smartphone in this example ) performs symbol decoding and sends to server 306 a completely parsed digital string or even the results of some cryptographic decoding operation on that string . in fig3 , a communication message has been transmitted from server 300 to the processing and authentication server 306 through the chain of components 301 , 302 , 303 , 304 , and 305 . thus , one key aspect of the current invention , as compared to the prior art depicted in fig1 , is the establishment of a new communication channel between the server 300 and the user &# 39 ; s device , composed of elements 303 and 304 . this new channel replaces or augments ( depending on the application ) the prior art communication channels 106 , 107 , and 108 , depicted in fig1 . in fig4 , a method of operative flow of a user authentication sequence is shown . in stage 400 , the remote server 300 prepares a unique message to be displayed to a user who wishes to be authenticated , and sends that message to local node 301 . the message is unique in that at a given time only one such exact message is sent from the server to a single local node . this message may be a function of time , presumed user &# 39 ; s identity , the local node &# 39 ; s ip address , the local node &# 39 ; s location , or other factors that make this particular message singular , that is , unique . stage 400 could also be accomplished in some instances by the processing and authentication server 306 without affecting the process as described here . in stage 401 , the message is presented on the display 302 . then , in stage 402 , the user uses imaging device 303 to acquire an image of the display 302 . subsequently , in stage 403 , this image is processed to recover the unique message displayed . the result of this recovery is some digital data string . various examples of a digital data string could be an alphanumeric code which is displayed on the display 302 , a url , a text string containing the name of the symbol appearing on the display ( for example “ widgets inc . logo ”), or some combination thereof . this processing can take place within elements 304 , 305 , 306 , or in some combination thereof . in stage 404 , information specific to the user is added to the unique message recovered in stage 403 , so that the processing and authentication server 306 will know who is the user that wishes to be authenticated . this information can be specific to the user ( for example , the user &# 39 ; s phone number or msisdn as stored on the user &# 39 ; s sim card ), or specific to the device the user has used in the imaging and communication process ( such as , for example , the imei of a mobile phone ), or any combination thereof . this user - specific information may also include additional information about the user &# 39 ; s device or location supplied by the communication network 305 . in stage 405 , the combined information generated in stages 403 and 404 is used for authentication . in the authentication stage , the processing and authentication server 306 compares the recovered unique message to the internal repository of unique messages , and thus determines whether the user has imaged a display with a valid message ( for example , a message that is not older than two days , or a message which is not known to be fictitious ), and thus also knows which display and local node the user is currently facing ( since each local node receives a different message ). in stage 405 , the processing and authentication server 306 also determines from the user &# 39 ; s details whether the user should be granted access from this specific display and local node combination . for example , a certain customer of a bank may be listed for remote internet access on u . s . soil , but not outside the u . s . hence , if the user is in front of an access login display in britain , access will not be granted . upon completion of the authentication process in 405 , access is either granted or denied in stage 406 . typically a message will be sent from server 306 to the user &# 39 ; s display 302 , informing the user that access has been granted or denied . in order to clarify further the nature and application of the invention , it would be valuable to consider several examples of the manner in which this invention may be used . the following examples rely upon the structure and method as depicted in fig3 and 4 : example 1 of using the invention is user authentication . there is displayed 401 on the display 302 a unique , time dependent numeric code . the digits displayed are captured 403 , decoded ( 403 , 404 , 405 , and 406 ), and sent back to remote server 300 along with the user &# 39 ; s phone number or ip address ( where the ip address may be denoted by “ x ”). the server 300 compares the decoded digital string ( which may be denoted as “ m ”) to the original digits sent to local node 301 . if there is a match , the server 300 then knows for sure that the user holding the device with the phone number or ip address x is right now in front of display device 302 ( or more specifically , that the imaging device owned or controlled by the user is right now in front of display device 302 ). such a procedure can be implemented in prior art by having the user read the digits displayed by the web browser 101 and manually type them on the token 103 . alternatively in prior art , this information could be sent on the communication channel 108 . some of the advantages of the invention over prior art , is that the invention avoids the need for additional hardware and avoids also the need for the user to type the information . in the embodiment of the invention described herein , therefore , the transaction is faster , more convenient , and more reliable than the manner in which transaction is performed according to prior art . without limitation , the same purpose accomplished here with alphanumeric information could be accomplished by showing on the display 302 some form of machine readable code or any other two - dimensional and / or time changing figure which can be compared to a reference figure . using graphic information instead of alphanumerics has another important security advantage , in that another person ( not the user ) watching the same display from the side will not be able to write down , type , or memorize the information for subsequent malicious use . a similar advantage could be achieved by using a very long alphanumeric string . example 2 of using the invention is server authentication . the remote server 300 displays 401 on the display 302 a unique , time dependent numeric code . the digits displayed appear in the image captured 403 by imaging device 303 and are decoded by server 306 into a message m ( in which “ m ” continues to be a decoded digital string ). the server 306 also knows the user &# 39 ; s phone number or ip address ( which continues to be denoted by “ x ”). the server 306 , has a trusted connection 307 with the server 300 , and makes an inquiry to 300 , “ did you just display message m on a display device to authenticated user x ?” the server 300 sends transmits the answer through the communication network 305 to the processing and authentication server 306 . if the answer is yes , the server 306 returns , via communication network 305 , to the user on the trusted communication module 304 an acknowledgement that the remote server 300 is indeed the right one . a typical use of the procedure described here would be to prevent ip - address spoofing , or prevent pharming / phishing . “ spoofing ” works by confusing the local node about the ip address to which the local node is sending information . “ pharming ” and “ phishing ” attacks work by using a valid domain name which is not the domain name of the original service , for example , by using www . widgetstrick . com instead of the legitimate service www . widgetsinc . com . all of these different attack schemes strive in the end to cause the user who is in front of local node 301 to send information and make operations while believing that the user is communicating with legitimate server 300 while in fact all the information is sent to a different , malicious server . without limitation , the server identification accomplished here with alphanumeric information , could be accomplished by showing on the display 302 some form of machine readable code or any other two - dimensional and / or time changing figure which can be compared to a reference figure . example 3 of using the invention is coupon loading or scratch card activation . the application and mode of usage would be identical to example 1 above , with the difference that the code printed on the card or coupon is fixed at the time of printing ( and is therefore not , as in example 1 , a decoded digital string ). again , advantages of the present invention over prior art would be speed , convenience , avoidance of the potential user errors if the user had to type the code printed on the coupon / card , and the potential use of figures or graphics that are not easily copied . example 4 of using the invention is a generic accelerated access method , in which the code or graphics displayed are not unique to a particular user , but rather are shared among multiple displays or printed matter . the server 300 still receives a trusted message from 306 with the user identifier x and the decoded message m ( as is described above in examples 1 and 3 ), and can use the message as an indication that the user is front of a display of m . however , since m is shared by many displays or printed matters , the server 300 cannot know the exact location of the user . in this example , the exact location of the user is not of critical importance , but quick system access is of importance . various sample applications would be content or service access for a user from a tv advertisement , or from printed advertisements , or from a web page , or from a product &# 39 ; s packaging . one advantage of the invention is in making the process simple and convenient for the user , avoiding a need for the user to type long numeric codes , or read complex instructions , or wait for an acknowledgment from some interactive voice response system . instead , in the present invention the user just takes a picture of the object 403 , and sends the picture somewhere else unknown to the user , where the picture will be processed in a manner also unknown to the user , but with quick and effective system access . as can be understood from the discussion of fig3 and 4 , one aspect of the present invention is the ability of the processing software in 304 and / or 306 to accurately and reliably decode the information displayed 401 on the display device 302 . as has been mentioned in the discussion of fig2 , prior art methods for object detection and recognition are not necessarily suitable for this task , in particular in cases where the objects to be detected are extended in size and / or when the imaging conditions and resolutions are those typically found in portable or mobile imaging devices . fig5 illustrates some of the operating principles of one embodiment of the invention . a given template , which represents a small part of the complete object to be searched in the image , is used for scanning the complete target image acquired by the imaging device 303 . the search is performed on several resized versions of the original image , where the resizing may be different for the x , y scale . each combination of x , y scales is given a score value based on the best match found for the template in the resized image . the algorithm used for determining this match value is described in the description of fig6 below . the scaled images 500 , 501 , and 502 , depict three potential scale combinations for which the score function is , respectively , above the minimum threshold , maximal over the whole search range , and below the minimum threshold . element 500 is a graphic representation in which the image has been magnified by 20 % on the y - scale . hence , in element 500 the x - scale is 1 . 0 and y - scale is 1 . 2 . the same notation applies for element 501 ( in which the y - scale is 0 . 9 ) and element 502 ( in which each axis is 0 . 8 ). these are just sample scale combinations used to illustrate some of the operating principles of the embodiment of the invention . in any particular transaction , any number and range of scale combinations could be used , balancing total run time on the one hand ( since more scale combinations require more time to search ) and detection likelihood on the other hand ( since more scale combinations and a wider range of scales increase the detection probability ). accordingly , in stage 503 the optimal image scale ( which represents the image scale at which the image &# 39 ; s scale is closest to the template &# 39 ; s scale ) is determined by first searching among all scales where the score is above the threshold ( hence element 502 is discarded from the search , while elements 500 and 501 are included ), and then choosing 501 as the optimal image scale . alternatively , the optimal image scale may be determined by other score functions , by a weighting of the image scales of several scale sets yielding the highest scores , and / or by some parametric fit to the whole range of scale sets based on their relative scores . in addition to searching over a range of image scales for the x and y axes , the search itself could be extended to include image rotation , skewing , projective transformations , and other transformations of the template . in stage 504 , the same procedure performed for a specific template in stage 503 is repeated for other templates , which represent other parts of the full object . the scale range can be identical to that used in 503 or can be smaller , as the optimal image scale found in stage 503 already gives an initial estimate to the optimal image scale . for example , if at stage 503 the initial search was for x and y scale values between 0 . 5 to 1 . 5 , and the optimal scale was at x = 1 . 0 , y = 0 . 9 , then the search in stage 504 for other templates may be performed at a tighter scale range of between 0 . 9 and 1 . 1 for both the x and y scales . it is important to note that even at an “ optimal scale ” for a given template search , there may be more than one candidate location for that template in the image . a simple example can be fig2 . although the best match is in element 205 , there is an alternative match in element 204 . thus , in the general case , for every template there will be several potential locations in the image even in the selected “ optimal scale ”. this is because several parts of the image may be sufficiently similar to the template to yield a sufficiently high match value . in stage 505 , the different permutations of the various candidates are considered to determine whether the complete object is indeed in the image . ( this point is further explained in fig6 and fig7 .) hence , if the object is indeed in the image , all of these templates should appear in the image with similar relative positions between them . some score function , further explained in the discussion of fig6 and 7 , is used to rate the relative likelihood of each permutation , and a best match ( highest score ) is chosen in stage 506 . various score functions can be used , such as , for example , allowing for some template candidates to be missing completely ( e . g ., no candidate for template number 3 has been located in the image ). in stage 507 the existence of the object in the image is determined by whether best match found in stage 506 has met exceeded some threshold match . if the threshold match has been met or exceeded , the a match is found and the logo ( or other information ) is identified 509 . if the threshold is not met , then the match has not been found 508 , and the process must be repeated until a match is found . there are some important benefits gained by searching for various sub - parts of the complete object instead of directly searching for the complete object as is done in prior art . for example : parts of the object may be occluded , shadowed , or otherwise obscured , but nevertheless , as long as enough of the sub - templates are located in the image , the object &# 39 ; s existence can be determined and identified . by searching for small parts of the object rather than for the whole object , the sensitivity of the system to small scale variations , lighting non - uniformity , and other geometrical and optical effects , is greatly reduced . for example , consider an object with a size of 200 by 200 pixels . in such an image , even a 1 % scale error / difference between the original object and the object as it appears in the image could cause a great reduction in the match score , as it reflects a change in size of 2 pixels . at the same time , sub - templates of the full object , at a size of 20 by 20 pixels each , would be far less sensitive to a 1 % scale change . a graphic object may include many areas of low contrast , or of complex textures or repetitive patterns . such areas may yield large match values between themselves and shifted , rotated or rescaled versions of themselves . this will confuse most image search algorithms . at the same time , such an object may contain areas with distinct , high contrast patterns ( such as , for example , an edge , or a symbol ). these high contrast , distinct patterns would serve as good templates for the search algorithm , unlike the fuzzy , repetitive or low contrast areas . hence , the present invention allows the selection of specific areas of the object to be searched , which greatly increases the precision of the search . by searching for smaller templates instead of the complete object as a single template , the number of computations is significantly reduced . for example , a normalized cross correlation search for a 200 by 200 pixel object would be more than 100 times more computationally intensive than a similar normalized cross correlations search for a 20 by 20 sub template of that object . fig6 and 7 illustrate in further detail the internal process of element 505 . in stage 600 , all candidates for all templates are located and organized into a properly labeled list . as an example , in a certain image , there may be 3 candidates for template # 1 , which are depicted graphically in fig7 , within 700 . the candidates are , respectively , 701 ( candidate a for template # 1 , hence called 1 a ), 702 ( candidate b for template # 1 , hence called 1 b ), and 703 ( candidate c for template # 1 , hence called 1 c ). these candidates are labeled as 1 a , 1 b , and 1 c , since they are candidates of template # 1 only . similarly 704 and 705 denote candidate locations for template # 2 in the same image which are hence properly labeled as 2 a and 2 b . similarly for template # 3 , in this example only one candidate location 706 has been located and labeled as 3 a . the relative location of the candidates in the figure correspond to their relative locations in the original 2d image . in stage 601 , an iterative process takes place in which each permutation containing exactly one candidate for each template is used . the underlying logic here is the following : if the object being searched indeed appears in the image , then not only should the image include templates 1 , 2 , and 3 , but in addition it should also include them with a well defined , substantially rigid geometrical relation among them . hence , in the specific example , the potentially valid permutations used in the iteration of stage 601 are { 1 a , 2 a , 3 a }, { 1 a , 2 b , 3 a }, { 1 b , 2 a , 3 a }, { 1 b , 2 b , 3 a }, { 1 c , 2 a , 3 a }, { 1 bc , 2 a , 3 a }. in stage 602 , the exact location of each candidate on the original image is calculated using the precise image scale at which it was located . thus , although the different template candidates may be located at different image scales , for the purpose of the candidates &# 39 ; relative geometrical position assessment , they must be brought into the same geometric scale . in stage 603 , the angles and distance among the candidates in the current permutation are calculated for the purpose of later comparing them to the angles and distances among those templates in the searched object . as a specific example , fig7 illustrates the relative geometry of { 1 a , 2 b , 3 a }. between each of the two template candidates there exists a line segment with specific location , angle and length . in the example in fig7 , these are , respectively , element 707 for 1 a and 2 b , element 708 for 2 b and 3 a , and element 709 for 1 a and 2 a . in stage 604 , this comparison is performed by calculating a “ score value ” for each specific permutation in the example . continuing with the specific example , the lengths , positions and angles of line segments 707 , 708 , and 709 , are evaluated by some mathematical score function which returns a score value of how similar those segments are to the same segments in the searched object . a simple example of such a score function would be a threshold function . thus , if the values of the distance and angles of 707 , 708 , and 709 , deviate from the nominal values by a certain amount , the score function will return a 0 . if they do not so deviate , then the score function will return a 1 . it is clear to those experienced in the art of score function and optimization searches that many different score functions can be implemented , all serving the ultimate goal of identifying cases where the object indeed appears in the image and separating those cases from cases those where the object does not appear in the image . in stage 605 , the score values obtained in all the potential permutations are compared and the maximum score is used to determine if the object does indeed appear in the image . it is also possible , in some embodiments , to use other results and parameters in order to make this determination . for example , an occurrence of too many template candidates ( and hence many permutations ) might serve as a warning to the algorithm that the object does not indeed appear in the image , or that multiple copies of the object are in the same image . it should be understood that the reliance on specific templates implies that if those templates are not reliably located in the image , or if the parts of the object belonging to those templates are occluded or distorted in some way ( as for example by a light reflection ), then in the absence of any workaround , some embodiments invention may not work optimally . a potential workaround for this kind of problem is to use many more templates , thereby improving robustness while increasing the run time of the algorithm . it should also be understood that some embodiments of the invention are not completely immune to warping of the object . if , for example , the object has been printed on a piece of paper , and that piece of paper is imaged by the user in a significantly warped form , the relative locations and angles of the different template candidates will be also warped and the score function thus may not enable the detection of the object . this is a kind of problem that is likely to appear in physical / printed , as opposed to electronic , media . it should also be understood that some embodiments of the invention can be combined with other posterior criteria used to ascertain the existence of the object in the image . for example , once in stage 605 the maximum score value exceeds a certain threshold , it is possible to calculate other parameters of the image to further verify the object &# 39 ; s existence . one example would be criteria based on the color distribution or texture of the image at the points where presumably the object has been located . fig8 illustrates graphically some aspects of the multi - template matching algorithm , which is one important algorithm used in an exemplary embodiment of the present invention ( in processing stages 503 and 504 ). the multi - template matching algorithm is based on the well known template matching method for grayscale images called “ normalized cross correlation ” ( ncc ), described in fig2 and in the related prior art discussion . a main deficiency of ncc is that for images with non - uniform lighting , compression artifacts , and / or defocusing issues , the ncc method yields many “ false alarms ” ( that is , incorrect conclusions that a certain status or object appears ) and at the same time fails to detect valid objects . the multi - template algorithm described as part of this invention in fig5 , extends the traditional ncc by replacing a single template for the ncc operation with a set of n templates , which represent different parts of an object to be located in the image . the templates 805 and 806 represent two potential such templates , representing parts of the digit “ 1 ” in a specific font and of a specific size . for each template , the ncc operation is performed over the whole image 801 , yielding the normalized cross correlation images 802 and 803 . the pixels in these images have values between − 1 and 1 , where a value of 1 for pixel ( x , y ) indicates a perfect match between a given template and the area in image 801 centered around ( x , y ). at the right of 802 and 803 , respectively , sample one - dimensional cross sections of those images are shown , showing how a peak of 1 is reached exactly at a certain position for each template . one important point is that even if the image indeed has the object to be searched for centered at some point ( x , y ), the response peaks for the ncc images for various templates will not necessarily occur at the same point . for example , in the case displayed in fig8 , there is a certain difference 804 of several pixels in the horizontal direction between the peak for template 805 and the peak for template 806 . these differences can be different for different templates , and the differences are taken into account by the multi - template matching algorithm . thus , after the correction of these deltas , all the ncc images ( such as 802 and 803 ) will display a single ncc “ peak ” at the same ( x , y ) coordinates which are also the coordinates of the center of the object in the image . for a real life image , the values of those peaks will not reach the theoretical “ 1 . 0 ” value , since the object in the image will not be identical to the template . however , proper score functions and thresholds allow for efficient and reliable detection of the object by judicious lowering of the detection thresholds for the different ncc images . it should be stressed that the actual templates can be overlapping , partially overlapping or with no overlap . their size , relative position , and shape can be changed , as long as the templates continue to correspond to the same object that one wishes to locate in the image . furthermore , masked ncc , which are well known extension of ncc , can be used for these templates to allow for non - rectangular templates . as can be understood from the previous discussion , the results of the ncc operation for each sub - template out of n such sub - templates generates a single number per each pixel in the image ( x , y ). thus , for each pixel ( x , y ) there are n numbers which must be combined in some form to yield a score function indicating the match quality . let us denote by t a i ( x , y ) the value of the normalized cross correlation value of sub - template i of the object “ a ” at pixel x , y in the image i . a valid score function then could be f ( x , y )= prod i = 1 . . . n t a i ( x , y )— namely , the scalar product of these n values . hence for example , if there is a perfect match between the object “ a ” and the pixels centered at ( x 0 , y 0 ) in the image i , then t a i ( x 0 , y 0 )= 1 . 0 for any i and our score function f ( x , y )= 1 at { x = x 0 , y = y 0 }. it is clear to someone familiar with the art of score function design and classification that numerous other score functions could be used , e . g . a weighted average of the n values , or a neural network where the n values are the input , or many others which could be imagined . thus , after the application of the chosen score function , the result of the multi - template algorithm is an image identical in size to the input image i , where the value of each pixel ( x , y ) is the score function indicating the quality of the match between the area centered around this pixel and the searched template . it is also possible to define a score function for a complete image , indicating the likelihood that the image as a whole contains at least one occurrence of the searched template . such a score function is used in stages 503 and 504 to determine the optimal image scale . a simple yet effective example of such a score function is max ( x , y ) { prod i = 1 . . . n t a i ( x , y )} where ( x , y ) represents the set of all pixels in i . this function would be 1 . 0 if there is a perfect match between some part of the image i and the searched template . it is clear to someone familiar with the art of score function design , that numerous other score functions could be used , such as , for example , a weighted sum of the values of the local score function for all pixels . fig9 illustrates a sample graphic object 900 , and some selected templates on it 901 , 902 , 903 , 904 , and 905 . in one possible application of the present invention , to search for this object in a picture , the three templates 901 , 902 , and 903 , are searched in the image , where each template in itself is searched using the multi - template algorithm described in fig8 . after determination of the candidate locations for templates 901 , 902 , and 903 in fig7 ( template 901 candidates are 701 , 702 , and 703 , template 902 candidates are 704 and 705 , and template 903 candidate is 706 ), the relative distances and angles for each potential combination of candidates ( one for each template , e . g . { 701 , 705 , 706 }) are compared to the reference distances and angles denote by line segments 906 , 907 , and 908 . some score function is used to calculate the similarity between line segments 707 , 708 , and 709 on the one hand , and line segments 906 , 907 , and 908 on the other hand . upon testing all potential combinations ( or a subset thereof ), the best match with the highest score is used in stage 507 to determine whether indeed the object in the image is our reference object 900 . it is clear to someone familiar with the art of object recognition that the reliability , run time , and hit / miss ratios of the algorithm described in this invention can be modified based on the number of different templates used , their sizes , the actual choice of the templates , and the score functions . for example , by employing all five templates 901 , 902 , 903 , 904 , and 905 , instead of just three templates , the reliability of detection would increase , yet the run time would also increase . similarly , template 904 would not be an ideal template to use for image scale determination or for object search in general , since it can yield a good match with many other parts of the searched object as well as with many curved lines which can appear in any image . thus , the choice of optimal templates can be critical to reliable recognition using a minimum number of templates ( although adding a non - optimal template such as 904 to a list of templates does not inherently reduce the detection reliability ). it is also clear from the description of the object search algorithm , that with suitably designed score functions for stages 505 and 506 , it is possible to detect an object even if one or more of the searched templates are not located in the image . this possibility enables the recognition of objects even in images where the objects are partially occluded , weakly illuminated , or covered by some other non - relevant objects . some specific practical examples of such detection include the following : when imaging a crt display , the exposure time of the digital imaging device coupled to the refresh times of the screen can cause vertical banding to appear . such banding cannot be predicted in advance , and thus can cause part of the object to be absent or to be much darker than the rest of the object . hence , some of the templates belonging to such an object may not be located in the image . additionally , the banding effect can be reduced significantly by proper choices of the colors used in the object and in its background . during the encoding and communication transmission stages between components 304 and 305 , errors in the transmission or sub - optimal encoding and compression can cause parts of the image of the object to be degraded or even completely non - decodable . therefore , some of the templates belonging to such an object may not be located in the image . when imaging printed material in glossy magazines , product wrappings or other objects with shiny surfaces , some parts of the image may be saturated due to reflections from the surrounding light sources . thus in those areas of the image it may be impossible or very hard to detect object features and templates . therefore , some of the templates belonging to such an object may not be located in the image . hence , the recognition method and system outlined in the present invention , along with other advantages , enable increased robustness to such image degradation effects . another important note is that embodiments of the present invention as described here allows for any graphical object — be it alphanumeric , a drawing , a symbol , a picture , or other , to be recognized . in particular , even machine readable codes can be used as objects for the purpose of recognition . for example , a specific 2d barcode symbol defining any specific url , as for example the url http :// www . dspv . net , could be entered as an object to be searched . since different potential objects can be recognized using the present invention , it is also possible to use animations or movies where specific frames or stills from the animation or movie are used as the reference objects for the search . for example , the opening shot of a commercial could be used as a reference object , where the capturing of the opening shot of the image indicates the user &# 39 ; s request to receive information about the products in this commercial . the ability to recognize different objects also implies that a single logo with multiple graphical manifestations can be entered in the authentication and processing server &# 39 ; s 306 database as different objects all leading to a unified service or content . thus , for example , all the various graphical designs of the logo of a major corporation could be entered to point to that corporation &# 39 ; s web site . by establishing a communication link based on visual information between a display or printed matter 302 and a portable imaging device ( which is one embodiment of imaging device 303 ), embodiments of the present invention enable a host of different applications in addition to those previously mentioned in the prior discussion . some examples of such applications are : product identification for price comparison / information gathering : the user sees a product ( such as a book ) in a store , with specific graphics on it ( e . g ., book cover ). the user takes a picture / video of the identifying graphics on the product . based on code / name / graphics of the product , the user receives information on the price of this product , its features , its availability , information to order it , etc . url launching . the user snaps a photo of some graphic symbol ( e . g ., a company &# 39 ; s logo ) and later receives a wap push message for the relevant url . prepaid card loading or purchased content loading . the user takes a photo of the recently purchased pre - paid card , and the credit is charged to his / her account automatically . the operation is equivalent to currently inputting the prepaid digit sequence through an ivr session or via sms , but the user is spared from actually reading the digits and typing them one by one . status inquiry based on printed ticket : the user takes a photo of a lottery ticket , a travel ticket , etc ., and receives back the relevant information , such as winning status , flight delayed / on time , etc . the graphical and / or alphanumeric information on the ticket is decoded by the system , and hence triggers this operation . user authentication for internet shopping : when the user makes a purchase , a unique code is displayed on the screen and the user snaps a photo , thus verifying his identity via the phone . since this code is only displayed at this time on this specific screen , the photo taken by the user represents a proof of the user &# 39 ; s location , which , coupled to the user &# 39 ; s phone number , create reliable location - identity authentication . location based coupons : the user is in a real brick and mortar store . next to each counter , there is a small sign / label with a number / text on it . the user snaps a photo of the label and gets back information , coupons , or discounts relevant to the specific clothes items ( jeans , shoes , etc .) in which he is interested . the label in the store contains an id of the store and an id of the specific display the user is next to . this data is decoded by the server and sent to the store along with the user &# 39 ; s phone id . digital signatures for payments , documents , or identities . a printed document ( such as a ticket , contract , or receipt ) is printed together with a digital signature ( such as a number with 20 - 40 digits ) on it . the user snaps a photo of the document and the document is verified by a secure digital signature printed in it . a secure digital signature can be printed in any number of formats , such as , for example , a 40 - digit number , or a 20 - letter word . this number can be printed by any printer . this signature , once converted again to numerical form , can securely and precisely serve as a standard , legally binding digital signature for any document . catalog ordering / purchasing : the user is leafing through a catalogue . he snaps a photo of the relevant product with the product code printed next to it , and this action is equivalent to an “ add to cart operation ”. the server decodes the product code and the catalogue id from the photo , and then sends the information to the catalogue company &# 39 ; s server , along with the user &# 39 ; s phone number . business card exchange : the user snaps a photo of a business card . the details of the business card , possibly in vcf format , are sent back to the user &# 39 ; s phone . the server identifies the phone numbers on the card , and using the carrier database of phone numbers , identifies the contact details of the relevant cellular user . these details are wrapped in the proper “ business card ” format and sent to the user . coupon verification : a user receives to his phone , via sms , mms , or wap push , a coupon . at the pos terminal ( or at the entrance to the business using a pos terminal ) he shows the coupon to an authorized clerk with a camera phone , who takes a picture of the user &# 39 ; s phone screen to verify the coupon . the server decodes the number / string displayed on the phone screen and uses the decoded information to verify the coupon .