• Title/Summary/Keyword: Service Retrieval Algorithm

Search Result 52, Processing Time 0.025 seconds

Towards a Pedestrian Emotion Model for Navigation Support (내비게이션 지원을 목적으로 한 보행자 감성모델의 구축)

  • Kim, Don-Han
    • Science of Emotion and Sensibility
    • /
    • v.13 no.1
    • /
    • pp.197-206
    • /
    • 2010
  • For an emotion retrieval system implementation to support pedestrian navigation, coordinating the pedestrian emotion model with the system user's emotion is considered a key component. This study proposes a new method for capturing the user's model that corresponds to the pedestrian emotion model and examines the validity of the method. In the first phase, a database comprising a set of interior images that represent hypothetical destinations was developed. In the second phase, 10 subjects were recruited and asked to evaluate on navigation and satisfaction toward each interior image in five rounds of navigation experiments. In the last phase, the subjects' feedback data was used for of the pedestrian emotion model, which is called ‘learning' in this study. After evaluations by the subjects, the learning effect was analyzed by the following aspects: recall ratio, precision ratio, retrieval ranking, and satisfaction. Findings of the analysis verify that all four aspects significantly were improved after the learning. This study demonstrates the effectiveness of the learning algorithm for the proposed pedestrian emotion model. Furthermore, this study demonstrates the potential of such pedestrian emotion model to be well applicable in the development of various mobile contents service systems dealing with visual images such as commercial interiors in the future.

  • PDF

Study on Adopting EDR Report for Traffic Accident Analysis (교통사고분석에서 EDR 기록정보의 채택에 관한 고찰)

  • Park, Jongjin;Park, Jeongman;Lee, Yeonsub
    • Journal of Auto-vehicle Safety Association
    • /
    • v.12 no.3
    • /
    • pp.52-60
    • /
    • 2020
  • Usage of EDR(Event Data Recorder) report for traffic accident analysis is currently increasing due to government regulation of EDR data release. Nevertheless, a lot of investigators simply adopt by comparing the number of ignition cycles(crash) at event to the number of ignition cycles(download) without an exact judgment whether event data occurred by this accident or not. In the EDR report, besides ignition cycles, there are many factors such as event record type, algorithm active(rear/rollover/side/frontal), time between events, event severity status(rollover/rear/right side/reft side/frontal), belt switch circuit status, driver/passenger pretensioner/air-bag deployment, PDOF(Principal Direction of Force) by ΔV to be able to decide whether or not to adopt. also the event data is considered enough to vehicle damaged state, accident situation at the scene of the accident. and there is described in "all data should be examined in conjunction with other available physical evidence from the vehicle and scene" in the CDR(Crash Data Retrieval) report. Therefore many investigators have to decide whether or not to adopt after they consider sufficiently to above factors when they are the traffic accident analysis and investigate the causes of a accident on the adopted event data. In this paper, we report to traffic accident investigators notable points and analysis methods on the basis of thousands of cases and the results of one's own experiment in NFS(National Forensic Service).

A scene search method based on principal character identification using convolutional neural network (컨볼루셔널 뉴럴 네트워크를 이용한 주인공 식별 기반의 영상장면 탐색 기법)

  • Kwon, Myung-Kyu;Yang, Hyeong-Sik
    • Journal of Convergence for Information Technology
    • /
    • v.7 no.2
    • /
    • pp.31-36
    • /
    • 2017
  • In this paper, we try to search and reproduce the image part of a specific cast from a large number of images. The conventional method must manually set the offset value when searching for a scene or viewing a corner. However, in this paper, the proposed method learns the main character 's face, then finds the main character in the image recognition and moves to the scene where the main character appears to reproduce the image. Data for specific performers is extracted and collected using crawl techniques. Based on the collected data, we learn using convolutional neural network algorithm and perform performance evaluation using it. The performance evaluation measures the accuracy by extracting and judging a specific performer learned in the extracted key frame while playing the drama. The performance confirmation of how quickly and accurately the learned scene is searched has obtained about 93% accuracy. Based on the derived performance, it is applied to the image service such as viewing, searching for person and detailed information retrieval per corner

An Efficient Split Algorithm to Minimize the Overlap between Node Index Spaces in a Multi-dimensional Indexing Scheme M-tree (다차원 색인구조 M-트리에서 노드 색인 공간의 중첩을 최소화하기 위한 효율적인 분할 알고리즘)

  • Im Sang-hyuk;Ku Kyong-I;Kim Ki-chang;Kim Yoo-Sung
    • The KIPS Transactions:PartD
    • /
    • v.12D no.2 s.98
    • /
    • pp.233-246
    • /
    • 2005
  • To enhance the user response time of content-based retrieval service for multimedia information, several multi-dimensional index schemes have been proposed. M-tree, a well-known multidimensional index scheme is of metric space access method, and is based on the distance between objects in the metric space. However, since the overlap between index spaces of nodes might enlarge the number of nodes of M-tree accessed for query processing, the user response time for content-based multimedia information retrieval grows longer. In this paper, we propose a node split algorithm which is able to reduce the sire of overlap between index spaces of nodes in M-tree. In the proposed scheme, we choose a virtual center point as the routing object and entry redistribution as the postprocessing after node split in order to reduce the radius of index space of a node, and finally in order to reduce the overlap between the index spaces of routing nodes. From the experimental results, we can see the proposed split algorithm reduce the overlap between index space of nodes and finally enhance the user response time for similarity-based query processing.

Method of Improving Personal Name Search in Academic Information Service

  • Han, Heejun;Lee, Seok-Hyoung
    • International Journal of Knowledge Content Development & Technology
    • /
    • v.2 no.2
    • /
    • pp.17-29
    • /
    • 2012
  • All academic information on the web or elsewhere has its creator, that is, a subject who has created the information. The subject can be an individual, a group, or an institution, and can be a nation depending on the nature of the relevant information. Most information is composed of a title, an author, and contents. An essay which is under the academic information category has metadata including a title, an author, keyword, abstract, data about publication, place of publication, ISSN, and the like. A patent has metadata including the title, an applicant, an inventor, an attorney, IPC, number of application, and claims of the invention. Most web-based academic information services enable users to search the information by processing the meta-information. An important element is to search information by using the author field which corresponds to a personal name. This study suggests a method of efficient indexing and using the adjacent operation result ranking algorithm to which phrase search-based boosting elements are applied, and thus improving the accuracy of the search results of personal names. It also describes a method for providing the results of searching co-authors and related researchers in searching personal names. This method can be effectively applied to providing accurate and additional search results in the academic information services.

An Ultrasonic Wave Encoder and Decoder for Indoor Positioning of Mobile Marketing System

  • Kim, Young-Mo;Jang, Se-Young;Park, Byeong-Chan;Bang, Kyung-Sik;Kim, Seok-Yoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.7
    • /
    • pp.93-100
    • /
    • 2019
  • In this paper, we propose an intelligent marketing service system that can provide custom advertisements and events to both businesses and customers by identifying the location and contents using the ultrasonic signals and feature information in voice signals. We also develop the encoding and decoding algorithm of ultrasonic signals for this system and analyze the performance evaluation results. With the development of the hyper-connected society, the on-line marketing has been activated and is growing in size. Existing store marketing applications have disadvantages that customers have to find out events or promotional materials that the headquarters or stores throughusing the corresponding applications whenever they visit them. To solve these problems, there are attempts to create intelligent marketing tools using GPS technology and voice recognition technology. However, this approach has difficulties in technology development due to accuracy of location and speed of comparison and retrieval of voice recognition technology, and marketing services for customer relation are also much simplified.

Performance Comparison of Wave Information Retrieval Algorithms Based on 3D Image Analysis Using VTS Sensor (VTS 센서를 이용한 3D영상 분석에 기초한 파랑 정보 추출 알고리즘 성능 비교)

  • Ryu, Joong-seon;Lim, Dong-hee;Kim, Jin-soo;Lee, Byung-Gil
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.3
    • /
    • pp.519-526
    • /
    • 2016
  • As marine accidents happen frequently, it is required to establish a marine traffic monitoring system, which is designed to improve the safety and efficiency of navigation in VTS (Vessel Traffic Service). For this aim, recently, X-band marine radar is used for extracting the sea surface information and, it is necessary to retrieve wave information correctly and provide for the safe and efficient movement of vessel traffic within the VTS area. In this paper, three different current estimation algorithms including the classical least-squares (LS) fitting, a modified iterative least-square fitting routine and a normalized scalar product of variable current velocities are compared with buoy data and then, the iterative least-square method is modified to estimate wave information by improving the initial current velocity. Through several simulations with radar signals, it is shown that the proposed method is effective in retrieving the wave information compared to the conventional methods.

Analysis of the Blocking Probability for Wireless PKI (무선 PKI에서의 블러킹 확률 분석)

  • Shin Seung-Soo;Choi Seung Kwon;Ji Hong-Il;Shin Dong-Hwa;Cho Yong-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5A
    • /
    • pp.426-435
    • /
    • 2005
  • this paper, we made out blocking probability analysis for a new authentication structure for reducing the certificate acquisition time which is one of the factors that should be improved in a conventional wireless PKI. A conventional key exchange method simply performs the key exchange setup step based on discrete algebraic subjects. But the mutual-authentication procedure of wireless PKI for reducing authentication time uses an elliptical curve for a key exchange setup step. Besides, we proposed advanced handover method and blocking probability analysis for wireless PKI. Proposed handover method shows reduced handover processing time than conventional method since it can reduce CRL retrieval time. Also, we compared proposed authentication structure and conventional algorithm, and simulation results show that proposed authentication method outperforms conventional algorithm in all environment regardless of call arrival rate, queue service rate, queue size

3D Tile Application Method for Improvement of Performance of V-world 3D Map Service (브이월드 3D 지도 서비스 성능 향상을 위한 3D 타일 적용 방안 연구)

  • Kim, Tae Hoon;Jang, Han Sol;Yoo, Sung Hwan;Go, Jun Hee
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.25 no.1
    • /
    • pp.55-61
    • /
    • 2017
  • The V-world, korean type spatial information open platform, provides various services to easily utilize 2D, 3D map and administrative information of the country. Among them, V-world 3D map service, modeled in individual building unit, require requests for each building model file and the draw calls for drawing models on the screen by the request. This causes a large number of model requests and draw calls to occur that increase the latency occurring during the transmission and conversion process between the central processing unit(CPU) and the graphic processing unit(GPU), which lead to the performance degradation of the 3D map service. In this paper, we propose a performance improvement plan to reduce the performance degradation of 3D map service caused by multiple model requests and draw calls. Therefore, we tried to reduce the number of requests and draw calls for the model file by applying a 3D tile model that combined multiple building models to single tile. In addition, we applied the quadtree algorithm to reduce the time required to load the model file by shortening the retrieval time of the model. This is expected to contribute to improving the performance of 3D map service of V-world.

Automatic Tagging Scheme for Plural Faces (다중 얼굴 태깅 자동화)

  • Lee, Chung-Yeon;Lee, Jae-Dong;Chin, Seong-Ah
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.3
    • /
    • pp.11-21
    • /
    • 2010
  • To aim at improving performance and reflecting user's needs of retrieval, the number of researches has been actively conducted in recent year as the quantity of information and generation of the web pages exceedingly increase. One of alternative approaches can be a tagging system. It makes users be able to provide a representation of metadata including writings, pictures, and movies etc. called tag and be convenient in use of retrieval of internet resources. Tags similar to keywords play a critical role in maintaining target pages. However, they still needs time consuming labors to annotate tags, which sometimes are found to be a hinderance caused by overuse of tagging. In this paper, we present an automatic tagging scheme for a solution of current tagging system conveying drawbacks and inconveniences. To realize the approach, face recognition-based tagging system on SNS is proposed by building a face area detection procedure, linear-based classification and boosting algorithm. The proposed novel approach of tagging service can increase possibilities that utilized SNS more efficiently. Experimental results and performance analysis are shown as well.