• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 4
  • 4
  • 4
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Efficient Index Structures For Video Databases

Acar, Esra 01 February 2008 (has links) (PDF)
Content-based retrieval of multimedia data has been still an active research area. The efficient retrieval of video data is proven a difficult task for content-based video retrieval systems. In this thesis study, a Content-Based Video Retrieval (CBVR) system that adapts two different index structures, namely Slim-Tree and BitMatrix, for efficiently retrieving videos based on low-level features such as color, texture, shape and motion is presented. The system represents low-level features of video data with MPEG-7 Descriptors extracted from video shots by using MPEG-7 reference software and stored in a native XML database. The low-level descriptors used in the study are Color Layout (CL), Dominant Color (DC), Edge Histogram (EH), Region Shape (RS) and Motion Activity (MA). Ordered Weighted Averaging (OWA) operator in Slim-Tree and BitMatrix aggregates these features to find final similarity between any two objects. The system supports three different types of queries: exact match queries, k-NN queries and range queries. The experiments included in this study are in terms of index construction, index update, query response time and retrieval efficiency using ANMRR performance metric and precision/recall scores. The experimental results show that using BitMatrix along with Ordered Weighted Averaging method is superior in content-based video retrieval systems.
2

Efficient index structures for video databases

Acar, Esra 01 February 2008 (has links) (PDF)
Content-based retrieval of multimedia data has been still an active research area. The efficient retrieval of video data is proven a difficult task for content-based video retrieval systems. In this thesis study, a Content-Based Video Retrieval (CBVR) system that adapts two different index structures, namely Slim-Tree and BitMatrix, for efficiently retrieving videos based on low-level features such as color, texture, shape and motion is presented. The system represents low-level features of video data with MPEG-7 Descriptors extracted from video shots by using MPEG-7 reference software and stored in a native XML database. The low-level descriptors used in the study are Color Layout (CL), Dominant Color (DC), Edge Histogram (EH), Region Shape (RS) and Motion Activity (MA). Ordered Weighted Averaging (OWA) operator in Slim-Tree and BitMatrix aggregates these features to find final similarity between any two objects. The system supports three different types of queries: exact match queries, k-NN queries and range queries. The experiments included in this study are in terms of index construction, index update, query response time and retrieval efficiency using ANMRR performance metric and precision/recall scores. The experimental results show that using BitMatrix along with Ordered Weighted Averaging method is superior in content-based video retrieval systems.
3

Avaliação multicriterial na definição de áreas protegidas, no município de Piedade - SP / Multicriteria evaluation in the definition of protected areas in the municipality of Piedade, SP

Sumida, Simone Sayuri 08 November 2013 (has links)
Made available in DSpace on 2016-06-02T19:26:22Z (GMT). No. of bitstreams: 1 SUMIDA_Simone_Sayuri_2013.pdf: 1095632 bytes, checksum: 44723f2f9f3d3c463660010f25ea0e0d (MD5) Previous issue date: 2013-11-08 / Fragmentation, degradation of habitats, overexploitaton of species and introduction of exotic species are some of the main threats to biodiversity, as a consequence of the human consumption and expansion needs. The local preservation or preservation in situ , through the establishment of legally protected areas is one way to mitigate the expansion of these activities. Piedade municipality presents a set of favorable conditions to establish protected areas: the urbanization is relatively low, native forest remnants occupy approximately 25% of the municipal area, and there are two relevant protected areas with portions within its boundaries: the Environmental Protection Area of Itupararanga, in the northeastern part, and, the State Park of Jurupará, in the southeastern portion. The protected areas in general occupy extensive areas, with different patches, forming a landscape mosaic, and can be studied by Geospatial Technologies, specially through one of its main techniques, the Geographic Information System (GIS), which allows the aggregation of factors through different approaches. Multicriteria evaluation (MCE) is one of those approaches, which transforms and combines different factors, considering their relevance and their respective levels of influence on the production of solutions / alternatives for decision making. In this context, the purpose of this study was to define priority areas for protection, in the Piedade municipality, through the Multicriteria evaluation (MCE). The specific objective was to identify the importance and influence of the selected factors on the decision support process and to evaluate which methods of MCE is appropriated to this study: Weighted Linear Combination (WLC) or Ordered Weighted Averaging (OWA). We defined the criteria and theirs weights using the Participatory Technique. The result was one map of priority areas through WLC and two maps through OWA, with similar degrees of tradeoffs and different degrees of risk to the decision support. The methods (WLC and OWA) enable the definition of priority areas for protection, although the WLC proposes a less detailed solution, which can result in uncertainties in landscape planning. The OWA offers different solutions, considering the risk-taking and factors tradeoffs, providing a greater number of possible answers to the question of interest. The map with low risk-taking was the more appropriated to define priority areas for protection in the Piedade municipality, SP. / Fragmentação, degradação de habitats, superexploração de espécies, introdução de espécies exóticas são algumas das principais ameaças à biodiversidade, devido às necessidades de consumo e expansão humana. Uma das formas de mitigar a expansão dessas atividades e proteger a diversidade biológica, em longo prazo, é a preservação local, ou in situ, por meio do estabelecimento de áreas legalmente protegidas. O município de Piedade apresenta um conjunto de condições favoráveis à consolidação de áreas protegidas, como a urbanização relativamente baixa, a presença de valiosos remanescentes florestais que ocupam aproximadamente 25% da área do município e a existência de duas relevantes Unidades de Conservação com porções dentro de seus limites: a Área de Proteção Ambiental (APA) de Itupararanga na região nordeste do município e o Parque Estadual (PE) do Jurupará, na região sudeste. As áreas protegidas são, em geral, extensas e compostas por diferentes elementos na paisagem e podem ser estudadas por meio do Geoprocessamento, em especial, por uma de suas principais técnicas, o Sistema de Informação Geográfica (SIG), o qual permite a agregação de fatores por meio de diferentes abordagens. A Avaliação Multicriterial (AMC) é uma dessas abordagens, a qual transforma e combina diferentes fatores considerando a relevância dos mesmos e os seus respectivos níveis de influência, produzindo soluções/alternativas para a tomada de decisão. Nesse contexto, o presente trabalho teve por objetivo geral identificar áreas prioritárias à proteção, no município de Piedade, por meio da Avaliação Multicriterial (AMC). Os objetivos específicos foram identificar os fatores, e seus pesos, importantes à definição dessas áreas prioritárias, para as condições da área de estudo e avaliar qual método de AMC, se a Combinação Linear Ponderada (CLP) ou se a Média Ponderada Ordenada (MPO), é o mais apropriado ao objetivo do presente estudo. Por meio da Técnica Participatória, definiu-se os critérios e seus respectivos pesos. Obteve-se um mapa de áreas prioritárias por meio de CLP e outros dois mapas, com valores de compensação semelhantes e diferentes graus de risco para a tomada de decisão. Tanto a CLP quanto a MPO possibilitam a identificação de áreas propensas a se tornarem protegidas, porém a CLP forneceu soluções mais gerais e menos detalhadas que, se não forem bem avaliadas, podem acarretar em incertezas no planejamento da paisagem. A MPO permitiu obter distintas soluções para o processo decisório, por considerar os riscos e as compensações entre os fatores, fornecendo uma maior quantidade de possíveis respostas à questão de interesse. O mapa obtido por meio da MPO, com risco baixo de tomada de decisão, foi considerado o mais adequado para a definição de áreas prioritárias à proteção no município de Piedade, SP.
4

數位網路上多重目標規劃的數學模式 / Mathematical Models of Pareto Optimal Path Selection on All-IP Networks

王嘉宏, Wang, Chia-Hung Unknown Date (has links)
面對通訊與資訊科技的大幅進步,通訊網路正在進行一個巨大的變革,要將電信網路與數據網路整合成一個單一的All-IP網路以支援所有網路應用服務。欲達到整合型網路的理想,仍有許多困難尚待克服,而服務品質問題是其中最關鍵的問題之一。因為受限於封包交換網路之原有的特性,All-IP網路有影響服務品質的三項因素:過長的延遲時間、抖動以及封包遺失。首先,我們利用了達成度函數(achievement function)來處理單位的轉換,使得能夠同時考量此三項不同單位的因素。接著,本文中提出一套方法來解決All-IP網路上端對端(end-to-end)的資源配置及路徑規劃問題。在分配資源時,我們企圖提供一種成比例的公平性給各個不同等級。此公平性的精神是要使得所有網路使用者的滿足程度相當,而非各個不同等級的使用者分配到相同的資源。我們將以預算方式控制端對端品質管理以追求使用者之整體最大滿意程度。 本論文的規劃概念是將網路規劃分成兩個階段。第一階段是在一筆給定的總預算底下,以成比例的方式去分配資源給各個不同等級,並建置網路上的頻寬,使各等級能依其需求拿到適當的頻寬,確保滿足程度相當。 接下來第二階段則是在第一部份已完成的規劃基礎下,做路徑規劃,指派新進入的使用者到一條較好的路徑,在滿足此使用者的延遲時間要求下,使此系統的壅塞程度越小越好。路徑規劃的概念為如何挑選最佳網路路徑,以規劃具服務品質之端對端路徑,並可達到資源之最有效利用。網路營運者將可運用此套方法來調校自身所營運的網路以追求使用者最高滿意度。 / We present an approach for the fair resource allocation problem and QoS routing in All-IP networks that offer multiple services to users. The objective of the optimization problem is to determine the amount of required bandwidth for each link and each class to maximize the sum of the users' utility. In this work, we focus on approaches that, while allocating bandwidth, attempt to provide a proportionally fair treatment of all the competing classes. First, we will show that an achievement function can map different criteria subject to various utility onto a normalized scale. It may be interpreted as a measure of QoS (Quality of Service) on All-IP networks. Using the bandwidth allocation model, we can find a Pareto optimal allocation of bandwidth on the network under a limited available budget. This allocation can provide the so-called proportional fairness to every class, that is, this allocation can provide the similar satisfaction to each user. Next, we present a routing scheme under consideration of the delay. Such an optimal path provides the end-to-end QoS guarantees to each user. Finally, a numerical example is given to illustrate how to solve the fair resource allocation problem and how to modify the nonlinear parts.

Page generated in 0.0796 seconds