{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:24:18Z","timestamp":1743020658346,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031366215"},{"type":"electronic","value":"9783031366222"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36622-2_8","type":"book-chapter","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T12:02:36Z","timestamp":1688731356000},"page":"92-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Ant Colony Optimization Based Binary Search for Point Pattern Matching for Efficient Image Matching"],"prefix":"10.1007","author":[{"given":"N. K.","family":"Sreeja","sequence":"first","affiliation":[]},{"given":"N. K.","family":"Sreelaja","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,8]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.patcog.2009.05.014","volume":"43","author":"D Aiger","year":"2010","unstructured":"Aiger, D., Kedem, K.: Approximate input sensitive algorithms for point pattern matching. Pattern Recogn. 43, 153\u2013159 (2010)","journal-title":"Pattern Recogn."},{"doi-asserted-by":"crossref","unstructured":"Li, B., Meng, Q., Holstein, H.: Point pattern matching and applications-a review. In: SMC 2003 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483), vol. 1, pp. 729\u2013736 (2003)","key":"8_CR2","DOI":"10.1109\/ICSMC.2003.1243901"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/S1077-3142(03)00009-2","volume":"89","author":"H Chui","year":"2003","unstructured":"Chui, H., Rangarajan, A.: A new point matching algorithm for non-rigid registration. Comput. Vis. Image Underst. 89, 114\u2013141 (2003)","journal-title":"Comput. Vis. Image Underst."},{"unstructured":"Dorigo, M., Stutzle, T.: Ant Colony Optimization, pp. 37\u201338. Prentice Hall of India Private Limited, New Delhi (2005)","key":"8_CR4"},{"unstructured":"Kang, H., Efros, A.A., Hebert, M., Kanade, T.: Image matching in large scale indoor environment. Carnegie Mellon University: School of Computer Science (2009)","key":"8_CR5"},{"doi-asserted-by":"crossref","unstructured":"Maniezzo, V., Gambardella, L.M., de Luigi, F.: Ant colony optimization (2004). http:\/\/www.idsia.ch\/~luca\/aco2004.pdf","key":"8_CR6","DOI":"10.1007\/978-3-540-39930-8_5"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.ejor.2015.04.012","volume":"246","author":"NK Sreeja","year":"2015","unstructured":"Sreeja, N.K., Sankar, A.: Ant colony optimization based binary search for efficient point pattern matching in images. Eur. J. Oper. Res. 246(1), 154\u2013169 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-030-78743-1_28","volume-title":"Advances in Swarm Intelligence","author":"NK Sreelaja","year":"2021","unstructured":"Sreelaja, N.K., Sreeja, N.K.: An ant colony optimization based approach for binary search. In: Tan, Y., Shi, Y. (eds.) ICSI 2021. LNCS, vol. 12689, pp. 311\u2013321. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78743-1_28"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1016\/j.patcog.2003.12.009","volume":"37","author":"PB Van Wamelen","year":"2004","unstructured":"Van Wamelen, P.B., Li, Z., Iyengar, S.S.: A fast expected time algorithm for the 2-D point pattern matching problem. Pattern Recogn. 37, 1699\u20131711 (2004)","journal-title":"Pattern Recogn."},{"doi-asserted-by":"publisher","unstructured":"Wayman, J.L., Jain, A.K., Maltoni, D., Maio, D.: Biometric Systems: Technology, Design and Performance Evaluation. Springer London (2005). https:\/\/doi.org\/10.1007\/b138151","key":"8_CR10","DOI":"10.1007\/b138151"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36622-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T20:18:36Z","timestamp":1729714716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36622-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031366215","9783031366222"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36622-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"170","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}