• Title/Summary/Keyword: 미디어 쿼리

Search Result 19, Processing Time 0.02 seconds

A Marking Algorithm for QoS Provisioning in WMSN (WMSN에서 QoS 보장을 위한 마킹 알고리즘)

  • Kim, Jeonghue;Lee, Sungkeun;Koh, Jingwang;Jung, Changryul
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.2
    • /
    • pp.193-204
    • /
    • 2010
  • Since Wireless Multimedia Sensor Network(WMSN) needs to process various multimedia data such as audio, image and video data as well as scalar data, it requires a mechanism that can support Quality of Service(QoS) to handle efficiently. This paper classifies traffic in WMSN as periodic monitoring traffic, event traffic, multimedia traffic and query-based traffic, proposes marking algorithm and queue management mechanism that guarantee differentiated QoS in terms of delay, energy efficiency and credibility on each traffic and conduct performance analysis with simulation.

Retrieving of Compositionally Similar Images Using Straight Line Elements (직선 성분을 이용하는 구도가 유사한 사진 검색 방법)

  • Hwang, Joo-Yeon;Lim, Dong-Sup;Paik, Doo-Won
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.11
    • /
    • pp.1539-1546
    • /
    • 2009
  • According to photography, lines are important elements that make composition and mood of photo. In this paper, we proposed a measure for compositional dissimilarity between photos using lines which are basic elements of photography. To identify patterns of lines which classify composition of photos, we investigated both features of compositionally same photos and compositionally different photos. Then we developed effective measure for compositional dissimilarity between photos by applying the investigated features to the measure, and we implemented an image searching system which retrieves photo compositionally similar to given query to evaluate performance of proposed method. The searching system showed the precision of about 85% maximally for the highly matched 10 results and was capable of reliably retrieving compositionally similar to given query even if some objects were included in photos.

  • PDF

Structural Analysis and Performance Test of Graph Databases using Relational Data (관계형데이터를 이용한 그래프 데이터베이스의 모델별 구조 분석과 쿼리 성능 비교 연구)

  • Bae, Suk Min;Kim, Jin Hyung;Yoo, Jae Min;Yang, Seong Ryul;Jung, Jai Jin
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.9
    • /
    • pp.1036-1045
    • /
    • 2019
  • Relational databases have a notion of normalization, in which the model for storing data is standardized according to the organization's business processes or data operations. However, the graph database is relatively early in this standardization and has a high degree of freedom in modeling. Therefore various models can be created with the same data, depending on the database designers. The essences of the graph database are two aspects. First, the graph database allows accessing relationships between the objects semantically. Second, it makes relationships between entities as important as individual data. Thus increasing the degree of freedom in modeling and providing the modeling developers with a more creative system. This paper introduces different graph models with test data. It compares the query performances by the results of response speeds to the query executions per graph model to find out how the efficiency of each model can be maximized.

Learning Memory-Guided Normality with Only Normal Training Data for Novelty Detection in Network Data (네트워크 이상치 탐지를 위한 정상 데이터만을 활용한 메모리 기반 정상성 학습)

  • Lee, Geonsu;Lee, Hochang;Sim, Jaehoon;Koo, Hyung Il;Cho, Nam Ik
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2020.11a
    • /
    • pp.83-86
    • /
    • 2020
  • 본 논문에서는 네트워크 이상치 탐지를 위하여 정상 데이터만을 활용한 메모리 기반 정상성 학습 모델을 제안한다. 오토인코더를 기반으로 정상 데이터의 특징을 표현하는 프로토타입을 생성할 수 있도록 신경망을 구성하고, 네트워크 데이터의 특성을 반영하여 쿼리의 수를 한 개로 고정하며, 사용되는 프로토타입의 수를 지정한 값으로 고정하여 모든 프로토타입에 정상 데이터의 특징을 반영할 수 있는 학습 방법을 제안한다. 해당 모델을 네트워크 이상치 탐지 데이터 세트인 Kyoto Honeypot, UNSW-NB15, CICIDS-2018에 적용하여 본 결과 Kyoto Honeypot에서는 0.821, UNSW-NB15에서는 0.854, CICIDS-2018에서는 0.981의 AUROC를 달성했다.

  • PDF

Web-based 3D Object Retrieval from User-drawn Sketch Query (스케치를 이용한 웹 환경에서의 3차원 모델 검색)

  • Song, Jonghun;Ju, Jae Ho;Yoon, Sang Min
    • Journal of KIISE
    • /
    • v.41 no.10
    • /
    • pp.838-846
    • /
    • 2014
  • Three-dimensional (3D) object retrieval from user-drawn sketch queries is one of the important research issues in the areas of pattern recognition and computer graphics for simulation, visualization, and Computer Aided Design. The performance of content-based 3D object retrieval system depends on the availability of effective descriptors and similarity measures for this kind of data. In this paper, we present a sketch-based 3D object retrieval system by extracting a hybrid edge descriptor which is robust against rotation and translation. The experimental results which are based on HTML5 and WebGL show that proposed sketch-based 3D object retrieval method is very efficient to search and order the 3D objects according to user's intention.

CBIR-based Data Augmentation and Its Application to Deep Learning (CBIR 기반 데이터 확장을 이용한 딥 러닝 기술)

  • Kim, Sesong;Jung, Seung-Won
    • Journal of Broadcast Engineering
    • /
    • v.23 no.3
    • /
    • pp.403-408
    • /
    • 2018
  • Generally, a large data set is required for learning of deep learning. However, since it is not easy to create large data sets, there are a lot of techniques that make small data sets larger through data expansion such as rotation, flipping, and filtering. However, these simple techniques have limitation on extendibility because they are difficult to escape from the features already possessed. In order to solve this problem, we propose a method to acquire new image data by using existing data. This is done by retrieving and acquiring similar images using existing image data as a query of the content-based image retrieval (CBIR). Finally, we compare the performance of the base model with the model using CBIR.

Ontology Knowledge based Information Retrieval for User Query Interpretation (사용자 질의 의미 해석을 위한 온톨로지 지식 기반 검색)

  • Kim, Nanju;Pyo, Hyejin;Jeong, Hoon;Choi, Euiin
    • Journal of Digital Convergence
    • /
    • v.12 no.6
    • /
    • pp.245-252
    • /
    • 2014
  • Semantic search promises to provide more accurate result than present-day keyword matching-based search by using the knowledge base represented logically. But, the ordinary users don't know well the complex formal query language and schema of the knowledge base. So, the system should interpret the meaning of user's keywords. In this paper, we describe a user query interpretation system for the semantic retrieval of multimedia contents. Our system is ontological knowledge base-driven in the sense that the interpretation process is integrated into a unified structure around a knowledge base, which is built on domain ontologies.

Applicability of Responsive Web of Geo-Spatial Web Services (공간정보 웹 서비스의 반응형 웹 적용성)

  • PARK, Han-Saem;LEE, Ki-Won
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.18 no.3
    • /
    • pp.52-62
    • /
    • 2015
  • As a recent dominant web trend, mobile first strategy has been emphasized, and interests with respect to responsive web that provides effective methodology to various mobile devices and their display resolution are also increasing. However, it is an early adoption stage in web mapping for geo-spatial applications. This study is to present some practical examples of layouts using responsive web technologies linked to geo-spatial open platform. Suggestive consideration points for further application of responsive web to geo-spatial services are presented. On test implementing, HTML5, JavaScript, and CSS3 were used, and web mapping processing using OpenLayers was performed. It is expected that responsive web applications for contents derived from geo-spatial information or location data increase.

A Cluster-Organizing Routing Algorithm by Diffusing Bitmap in Wireless Sensor Networks (무선 센서 네트워크에서의 비트맵 확산에 의한 클러스터 형성 라우팅 알고리즘)

  • Jung, Sangjoon;Chung, Younky
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.2
    • /
    • pp.269-277
    • /
    • 2007
  • Network clustering has been proposed to provide that sensor nodes minimize energy and maximize a network lifetime by configuring clusters, Although dynamic clustering brings extra overhead like as head changing, head advertisement, it may diminish the gain in energy consumption to report attribute tasks by using cluster heads. Therefore, this paper proposes a new routing algorithm which configures cluster to reduce the number of messages when establishing paths and reports to the sink by way of cluster heads when responding sens ing tasks. All sensor nodes only broadcast bitmap once and maintain a bitmap table expressed by bits, allowing them to reduce node energy and to prolong the network lifetime. After broadcasting, each node only updates the bitmap without propagation when the adjacent nodes broad cast same query messages, This mechanism makes nodes to have abundant paths. By modifying the query which requests sensing tasks, the size of cluster is designed dynamically, We try to divide cluster by considering the number of nodes. Then, all nodes in a certain cluster must report to the sub- sink node, The proposed routing protocol finds easily an appropriate path to report tasks and reduces the number of required messages for the routing establishment, which sensor nodes minimize energy and maximize a network lifetime.

  • PDF