{"id":"https://openalex.org/W2055831262","doi":"https://doi.org/10.1109/icecs.2005.4633527","title":"Lossless coding of hyperspectral images through components ordering by minimum bidirected spanning tree","display_name":"Lossless coding of hyperspectral images through components ordering by minimum bidirected spanning tree","publication_year":2005,"publication_date":"2005-12-01","ids":{"openalex":"https://openalex.org/W2055831262","doi":"https://doi.org/10.1109/icecs.2005.4633527","mag":"2055831262"},"language":"en","primary_location":{"id":"doi:10.1109/icecs.2005.4633527","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icecs.2005.4633527","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 12th IEEE International Conference on Electronics, Circuits and Systems","raw_type":"proceedings-article"},"type":"conference-paper","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/A5069661755","display_name":"Kais Siala","orcid":"https://orcid.org/0000-0002-9080-0014"},"institutions":[{"id":"https://openalex.org/I4210120884","display_name":"Institut Sup\u00e9rieur des \u00c9tudes Technologiques en Communications de Tunis","ror":"https://ror.org/02rfbsc53","country_code":"TN","type":"education","lineage":["https://openalex.org/I4210120884"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Kais Siala","raw_affiliation_strings":["Ecole Sup\u00e9rieure des Communications de Tunis, Cit\u00e9 Technologique des Communications, Unit\u00e0 de Recherche en Imagerie Satellitaire et ses Applications, Tunisia","Unit\u00e9 de Recherche en Imagerie Satellitaire et ses Applications (URISA), Cit\u00e9 Technologique des Communications, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ecole Sup\u00e9rieure des Communications de Tunis, Cit\u00e9 Technologique des Communications, Unit\u00e0 de Recherche en Imagerie Satellitaire et ses Applications, Tunisia","institution_ids":["https://openalex.org/I4210120884"]},{"raw_affiliation_string":"Unit\u00e9 de Recherche en Imagerie Satellitaire et ses Applications (URISA), Cit\u00e9 Technologique des Communications, Tunisia","institution_ids":["https://openalex.org/I4210120884"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090426136","display_name":"Amel Benazza\u2010Benyahia","orcid":"https://orcid.org/0000-0002-4562-2757"},"institutions":[{"id":"https://openalex.org/I4210120884","display_name":"Institut Sup\u00e9rieur des \u00c9tudes Technologiques en Communications de Tunis","ror":"https://ror.org/02rfbsc53","country_code":"TN","type":"education","lineage":["https://openalex.org/I4210120884"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Amel Benazza-Benyahia","raw_affiliation_strings":["Unit\u00e9 de Recherche en Imagerie Satellitaire et ses Applications (URISA), Ecole Sup\u00e9rieure des Communications de Tunis, Cit\u00e9 Technologique des Communications, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Unit\u00e9 de Recherche en Imagerie Satellitaire et ses Applications (URISA), Ecole Sup\u00e9rieure des Communications de Tunis, Cit\u00e9 Technologique des Communications, Tunisia","institution_ids":["https://openalex.org/I4210120884"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210120884"],"apc_list":null,"apc_paid":null,"fwci":0.2565,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47336732,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3304","issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":1.0,"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/T10901","display_name":"Advanced Data Compression Techniques","score":1.0,"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/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.9979000091552734,"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hyperspectral-imaging","display_name":"Hyperspectral imaging","score":0.8517031669616699},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5761085748672485},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.574638843536377},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5702780485153198},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5608404278755188},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5511502623558044},{"id":"https://openalex.org/keywords/lossy-compression","display_name":"Lossy compression","score":0.4882786273956299},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.45812615752220154},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39461642503738403},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38042914867401123},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.37707751989364624},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.2817862629890442},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13115385174751282}],"concepts":[{"id":"https://openalex.org/C159078339","wikidata":"https://www.wikidata.org/wiki/Q959005","display_name":"Hyperspectral imaging","level":2,"score":0.8517031669616699},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5761085748672485},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.574638843536377},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5702780485153198},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5608404278755188},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5511502623558044},{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.4882786273956299},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.45812615752220154},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39461642503738403},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38042914867401123},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37707751989364624},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.2817862629890442},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13115385174751282},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icecs.2005.4633527","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icecs.2005.4633527","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 12th IEEE International Conference on Electronics, Circuits and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.4300000071525574,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1511615158","https://openalex.org/W1514542643","https://openalex.org/W1610874655","https://openalex.org/W1982512167","https://openalex.org/W1995211032","https://openalex.org/W1995364496","https://openalex.org/W2053691921","https://openalex.org/W2068413687","https://openalex.org/W2096445898","https://openalex.org/W2106069920","https://openalex.org/W2120089534","https://openalex.org/W2134002810","https://openalex.org/W2138596445","https://openalex.org/W2138674095","https://openalex.org/W2153638435","https://openalex.org/W4246185962","https://openalex.org/W4302366751"],"related_works":["https://openalex.org/W2978432024","https://openalex.org/W2118338613","https://openalex.org/W1995805316","https://openalex.org/W3180760233","https://openalex.org/W2071387875","https://openalex.org/W1568381040","https://openalex.org/W2132019419","https://openalex.org/W4205915047","https://openalex.org/W2148203918","https://openalex.org/W2276828234"],"abstract_inverted_index":{"In":[0],"this":[1,24],"paper,":[2],"we":[3,26],"aim":[4],"at":[5,79],"improving":[6],"the":[7,37,50,54,65,75,80,83,103,106,110],"vector":[8,93],"lifting":[9,94],"scheme":[10],"dedicated":[11],"to":[12],"lossless":[13],"coding":[14,58],"of":[15,52,67,105],"hyperspectral":[16],"images":[17,101],"by":[18,91],"an":[19],"optimal":[20],"components":[21,39,55],"ordering.":[22],"For":[23],"purpose,":[25],"propose":[27],"a":[28,68,92],"three-stage":[29],"algorithm.":[30],"The":[31],"first":[32],"one":[33],"consists":[34],"in":[35],"classifying":[36],"spectral":[38,76,86],"into":[40],"separate":[41],"clusters":[42],"sharing":[43],"similar":[44],"characteristics.":[45],"Then,":[46],"within":[47],"each":[48],"cluster,":[49],"problem":[51],"ordering":[53],"for":[56],"inter-component":[57],"is":[59,62],"addressed.":[60],"It":[61],"formulated":[63],"as":[64],"design":[66],"minimum":[69],"spanning":[70],"tree":[71],"whose":[72],"vertices":[73],"are":[74,88],"components.":[77],"Finally,":[78],"last":[81],"stage,":[82],"spatial":[84],"and":[85],"redundancies":[87],"simultaneously":[89],"exploited":[90],"scheme.":[95],"Experiments":[96],"carried":[97],"out":[98],"on":[99],"AVIRIS":[100],"indicate":[102],"outperformance":[104],"proposed":[107],"method":[108],"w.r.t.":[109],"state-of-art":[111],"coders.":[112]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}