About: Cut-region: A Compact Building Block For Hierarchical Metric Indexing

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Cut-region: A Compact Building Block For Hierarchical Metric Indexing Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	With the emerging applications dealing with complex multimedia retrieval, such as the multimedia exploration, appropriate indexing structures need to be designed. A formalism for compact metric region description can significantly simplify the design of algorithms for such indexes, thus more complex and efficient metric indexes can be developed. In this paper, we introduce the cut-regions that are suitable for compact metric region description and we discuss their basic operations. To demonstrate the power of cut-regions, we redefine the PM-Tree using the cut-region formalism and, moreover, we use the formalism to describe our new improvements of the PM-Tree construction techniques. We have experimentally evaluated that the improved construction techniques lead to query performance originally obtained just using expensive construction techniques. Also in comparison with other metric and spatial access methods, the revisited PM-Tree proved its benefits. With the emerging applications dealing with complex multimedia retrieval, such as the multimedia exploration, appropriate indexing structures need to be designed. A formalism for compact metric region description can significantly simplify the design of algorithms for such indexes, thus more complex and efficient metric indexes can be developed. In this paper, we introduce the cut-regions that are suitable for compact metric region description and we discuss their basic operations. To demonstrate the power of cut-regions, we redefine the PM-Tree using the cut-region formalism and, moreover, we use the formalism to describe our new improvements of the PM-Tree construction techniques. We have experimentally evaluated that the improved construction techniques lead to query performance originally obtained just using expensive construction techniques. Also in comparison with other metric and spatial access methods, the revisited PM-Tree proved its benefits. (en)
Title	Cut-region: A Compact Building Block For Hierarchical Metric Indexing Cut-region: A Compact Building Block For Hierarchical Metric Indexing (en)
skos:prefLabel	Cut-region: A Compact Building Block For Hierarchical Metric Indexing Cut-region: A Compact Building Block For Hierarchical Metric Indexing (en)
skos:notation	RIV/00216208:11320/12:10123410!RIV13-GA0-11320___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GAP202/11/0968), P(GPP202/12/P297)
http://linked.open...iv/cisloPeriodika	7404
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Lokoč, Jakub Skopal, Tomáš Novák, Jiří Čech, Přemysl
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	129315
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/12:10123410
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	MAM; Similarity Search; PM-Tree (en)
http://linked.open.../riv/klicoveSlovo	Similarity Search MAM PM-Tree
http://linked.open...odStatuVydavatele	DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV	[F676B8F28B6A]
http://linked.open...i/riv/nazevZdroje	Lecture Notes in Computer Science
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	4 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	Large-scale Nonmetric Similarity Search in Complex Domains Synergické modelování adaptivních podobnostních měr pro potřeby multimediálního vyhledávání
http://linked.open...UplatneniVysledku	2012
http://linked.open...v/svazekPeriodika	2012
http://linked.open...iv/tvurceVysledku	Lokoč, Jakub Novák, Jiří Skopal, Tomáš Čech, Přemysl
issn	0302-9743
number of pages	16 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-32153-5_7
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software