An idea which strikes to mind is, 1.Initially to form a map based on the text and all related text to it.[text,images]map 2.Also make a bitwise manipulation of every image and relate the texts to it.[imagebitwise,texts] map
3.If a image is put forth for search, check the texts from [imagebitwise,texts] map based on its bitwise calculation 4.Render all the images from the [text,images]map matching to the texts from step-3 What do you feel about this? On Sat, Jun 18, 2011 at 9:29 PM, DIPANKAR DUTTA <dutta.dipanka...@gmail.com>wrote: > I think all of us use Google Search by > Image<http://www.youtube.com/watch?v=t99BfDnBZcI> > . > > If you donot know plz ref the following link: > http://www.youtube.com/watch?v=t99BfDnBZcI > > can you give the efficient algorithm to design this? > > * > *-- > Thanks and Regards, > ------------------------------ > *DIPANKAR DUTTA* > Visiting Research Scholar > Dept of Computing, > Macquarie University, Sydney, Australia > ph.no-+61 2 98509079 ( Mon-Fri 10:15-7:00) Sydney time > email: dipankar.du...@mq.edu.au > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Thanks and regards, Raghavan.K.L <http://in.linkedin.com/in/raghavankl> -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
