{"id":"https://openalex.org/W2047396532","doi":"https://doi.org/10.1016/s0031-3203(97)00049-6","title":"A solution to histogram-equalization and other related problems by shortest path methods","display_name":"A solution to histogram-equalization and other related problems by shortest path methods","publication_year":1998,"publication_date":"1998-03-01","ids":{"openalex":"https://openalex.org/W2047396532","doi":"https://doi.org/10.1016/s0031-3203(97)00049-6","mag":"2047396532"},"language":"en","primary_location":{"id":"doi:10.1016/s0031-3203(97)00049-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0031-3203(97)00049-6","pdf_url":null,"source":{"id":"https://openalex.org/S414566","display_name":"Pattern Recognition","issn_l":"0031-3203","issn":["0031-3203","1873-5142"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pattern Recognition","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110097889","display_name":"Sukhamay Kundu","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sukhamay Kundu","raw_affiliation_strings":["Computer Science Department, Louisiana State University, Baton Rouge, LA 70803, U.S.A","Computer Science Department , Louisiana State University , Baton Rouge, LA, 70803, U.S.A"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Louisiana State University, Baton Rouge, LA 70803, U.S.A","institution_ids":[]},{"raw_affiliation_string":"Computer Science Department , Louisiana State University , Baton Rouge, LA, 70803, U.S.A","institution_ids":["https://openalex.org/I121820613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110097889"],"corresponding_institution_ids":["https://openalex.org/I121820613"],"apc_list":{"value":2710,"currency":"USD","value_usd":2710},"apc_paid":null,"fwci":1.0084,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.77941049,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"31","issue":"3","first_page":"231","last_page":"234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9822999835014343,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7664474844932556},{"id":"https://openalex.org/keywords/histogram","display_name":"Histogram","score":0.6671248078346252},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6064583659172058},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5932314395904541},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5801659822463989},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5441951751708984},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5323137640953064},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4905514121055603},{"id":"https://openalex.org/keywords/histogram-equalization","display_name":"Histogram equalization","score":0.4758427143096924},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4562649726867676},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.4540295898914337},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44171133637428284},{"id":"https://openalex.org/keywords/equalization","display_name":"Equalization (audio)","score":0.4184947609901428},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.31094425916671753},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28017956018447876},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.27443927526474},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1657998263835907},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13951414823532104},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.10284557938575745}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7664474844932556},{"id":"https://openalex.org/C53533937","wikidata":"https://www.wikidata.org/wiki/Q185020","display_name":"Histogram","level":3,"score":0.6671248078346252},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6064583659172058},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5932314395904541},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5801659822463989},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5441951751708984},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5323137640953064},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4905514121055603},{"id":"https://openalex.org/C136943445","wikidata":"https://www.wikidata.org/wiki/Q1970240","display_name":"Histogram equalization","level":4,"score":0.4758427143096924},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4562649726867676},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.4540295898914337},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44171133637428284},{"id":"https://openalex.org/C75755367","wikidata":"https://www.wikidata.org/wiki/Q104531076","display_name":"Equalization (audio)","level":3,"score":0.4184947609901428},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.31094425916671753},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28017956018447876},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.27443927526474},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1657998263835907},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13951414823532104},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.10284557938575745},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0031-3203(97)00049-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0031-3203(97)00049-6","pdf_url":null,"source":{"id":"https://openalex.org/S414566","display_name":"Pattern Recognition","issn_l":"0031-3203","issn":["0031-3203","1873-5142"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pattern Recognition","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W2069119780"],"related_works":["https://openalex.org/W3183360588","https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W2352589493","https://openalex.org/W2391048224","https://openalex.org/W2375280931","https://openalex.org/W3200343262","https://openalex.org/W2387829241","https://openalex.org/W2395868876","https://openalex.org/W2385402343"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}