{"doi":"10.1109/cbmi.2013.6576581","title":"Parallel multi-tree indexing for evaluating large descriptor sets","abstract":null,"journal":"2013 11th International Workshop on Content-Based Multimedia Indexing (CBMI)","year":2013,"id":607403,"datarank":0.26876392038420827,"base_score":1.791759469228055,"endowment":1.791759469228055,"self_citation_contribution":0.26876392038420827,"citation_network_contribution":0.0,"self_endowment_contribution":0.26876392038420827,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":5,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":1559645,"name":"Levente Kovacs","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Parallel multi-tree indexing for evaluating large descriptor sets","abstract":"This paper presents a method towards easier evaluation of a large number of different image/video content descriptors, by using a multiple descriptor-tree based parallel indexing scheme instead of classical index structures with high dimensional multi-feature vectors. We will show that the proposed scheme is flexible and easily extensible, and it is not just faster to build, but provides good retrieval precision as well. The primary goal is to provide a flexible and modular indexing scheme for descriptor evaluation and feature selection purposes, but it can be used for generic content-based retrieval tasks as well.","is_dataset_classified":null,"base_score":1.791759469228055,"endowment":1.791759469228055,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21097893","pmcid":null,"openalex_id":"https://openalex.org/W2048379072","authors":[],"funders":[],"total_grants":0,"fwci":null,"citation_percentile":null,"influential_citations":0,"citation_trend":[{"year":2014,"count":1},{"year":2016,"count":1},{"year":2018,"count":2},{"year":2024,"count":1}],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://xplorestaging.ieee.org/ielx7/6573518/6576538/06576581.pdf?arnumber=6576581","host_type":"publisher"},{"url":"https://doi.org/10.1109/cbmi.2013.6576581","host_type":""},{"url":"http://eprints.sztaki.hu/7182/","host_type":"repository"}],"fields_of_study":["Advanced Image and Video Retrieval Techniques","Image Retrieval and Classification Techniques","Data Management and Algorithms"],"mesh_terms":[],"keywords":["Search engine indexing","Computer science","Scheme (mathematics)","Modular design","Database index","Feature (linguistics)","Tree (set theory)","Index (typography)","Data mining","Image retrieval","Feature extraction","Pattern recognition (psychology)","Extensibility","Artificial intelligence","Feature selection","Information retrieval","Image (mathematics)","Mathematics"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-07-30T06:19:35.068165Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}