• Title/Summary/Keyword: $A^*$ search algorithm

Search Result 3,553, Processing Time 0.037 seconds

A Fast and Accurate Face Detection and Tracking Method by using Depth Information (깊이정보를 이용한 고속 고정밀 얼굴검출 및 추적 방법)

  • Bae, Yun-Jin;Choi, Hyun-Jun;Seo, Young-Ho;Kim, Dong-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7A
    • /
    • pp.586-599
    • /
    • 2012
  • This paper proposes a fast face detection and tracking method which uses depth images as well as RGB images. It consists of the face detection procedure and the face tracking procedure. The face detection method basically uses an existing method, Adaboost, but it reduces the size of the search area by using the depth image. The proposed face tracking method uses a template matching technique and incorporates an early-termination scheme to reduce the execution time further. The results from implementing and experimenting the proposed methods showed that the proposed face detection method takes only about 39% of the execution time of the existing method. The proposed tracking method takes only 2.48ms per frame with $640{\times}480$ resolution. For the exactness, the proposed detection method showed a little lower in detection ratio but in the error ratio, which is for the cases when a detected one as a face is not really a face, the proposed method showed only about 38% of that of the previous method. The proposed face tracking method turned out to have a trade-off relationship between the execution time and the exactness. In all the cases except a special one, the tracking error ratio is as low as about 1%. Therefore, we expect the proposed face detection and tracking methods can be used individually or in combined for many applications that need fast execution and exact detection or tracking.

An Optimal Conjunctive Operation of Water Transmission Systems from Multiple Sources with applying EPAnet and KModSim Model (KModSim 모형(模型)에 의한 도시지역(都市地域) 다중수원(多衆水源) 송수관망간(送水管網間) 최적(最適) 연계(連繫) 운영(運營) 연구(硏究))

  • Ryu, Tae-Sang;Cheong, Tae-Sung;Ko, Ick-Hwan;Ha, Sung-Ryong
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2008.05a
    • /
    • pp.500-504
    • /
    • 2008
  • The objective of this paper is to evaluate the feasibility of using an optimization model as a effective way to search conjunctive operation scheme to meet two conditions; one is to minimize the electric cost for pumping and another is to meet the water demand for satisfying customers. The feasibility is confirmed as comparing the best combinations of pumps between multi-regional water supply networks from multiple sources which are obtained through an optimization modeling and EPAnet modeling. KModsim model, a network optimization model, was used to determine conjunctive operation scheme in the pipe system. KModsim, based on Lagrangian Relaxation algorithm, is useful for modeling network system and obtaining simultaneously pump combination and water allocation with given input option such as energy unit cost supplying from a source into a consumer, operating pumping combination. This study develops the procedure of determining optimal conjunctive operation scheme with using KModsim model. As a study region, the water supplying systems of the Geojae-city in the Geongsang Namdo Province was selected and investigated. The EPAnet hydraulic simulation result(Ryu et al, 2007, KSWW) gave input data for optimization model; energy unit price(won/$m^3$), water service available area etc.. It was assured that the combination of pump operation through optimum conjunctive operation is to be optimum scheme to obtain the best economic water allocation with comparison to the hydraulic simulation result such as electric cost and pump combination cases. The results obtained through the study are as follows. First, It was found that a well-allocated water supply scheme, the best combination of pump operation through optimum joint operation, promises to save the electric cost and satisfy all operational goals such as stability and revenues during the period. Second, an application of KModSim, a network model, gave the amount of water allocation from each source to a consumer with consideration of economic supply. Finally, in a service area available to supply through conjunctive operation of existing inter-regional water supply networks within short distance, a conjunctive operation is useful for determining each transmission pipeline's service area and maximizing the effectiveness of optimizations in pumping operation time.

  • PDF

Analysis of Football Fans' Uniform Consumption: Before and After Son Heung-Min's Transfer to Tottenham Hotspur FC (국내 프로축구 팬들의 유니폼 소비 분석: 손흥민의 토트넘 홋스퍼 FC 이적 전후 비교)

  • Choi, Yeong-Hyeon;Lee, Kyu-Hye
    • Journal of Intelligence and Information Systems
    • /
    • v.26 no.3
    • /
    • pp.91-108
    • /
    • 2020
  • Korea's famous soccer players are steadily performing well in international leagues, which led to higher interests of Korean fans in the international leagues. Reflecting the growing social phenomenon of rising interests on international leagues by Korean fans, the study examined the overall consumer perception in the consumption of uniform by domestic soccer fans and compared the changes in perception following the transfers of the players. Among others, the paper examined the consumer perception and purchase factors of soccer fans shown in social media, focusing on periods before and after the recruitment of Heung-Min Son to English Premier League's Tottenham Football Club. To this end, the EPL uniform is the collection keyword the paper utilized and collected consumer postings from domestic website and social media via Python 3.7, and analyzed them using Ucinet 6, NodeXL 1.0.1, and SPSS 25.0 programs. The results of this study can be summarized as follows. First, the uniform of the club that consistently topped the league, has been gaining attention as a popular uniform, and the players' performance, and the players' position have been identified as key factors in the purchase and search of professional football uniforms. In the case of the club, the actual ranking and whether the league won are shown to be important factors in the purchase and search of professional soccer uniforms. The club's emblem and the sponsor logo that will be attached to the uniform are also factors of interest to consumers. In addition, in the decision making process of purchase of a uniform by professional soccer fan, uniform's form, marking, authenticity, and sponsors are found to be more important than price, design, size, and logo. The official online store has emerged as a major purchasing channel, followed by gifts for friends or requests from acquaintances when someone travels to the United Kingdom. Second, a classification of key control categories through the convergence of iteration correlation analysis and Clauset-Newman-Moore clustering algorithm shows differences in the classification of individual groups, but groups that include the EPL's club and player keywords are identified as the key topics in relation to professional football uniforms. Third, between 2002 and 2006, the central theme for professional football uniforms was World Cup and English Premier League, but from 2012 to 2015, the focus has shifted to more interest of domestic and international players in the English Premier League. The subject has changed to the uniform itself from this time on. In this context, the paper can confirm that the major issues regarding the uniforms of professional soccer players have changed since Ji-Sung Park's transfer to Manchester United, and Sung-Yong Ki, Chung-Yong Lee, and Heung-Min Son's good performances in these leagues. The paper also identified that the uniforms of the clubs to which the players have transferred to are of interest. Fourth, both male and female consumers are showing increasing interest in Son's league, the English Premier League, which Tottenham FC belongs to. In particular, the increasing interest in Son has shown a tendency to increase interest in football uniforms for female consumers. This study presents a variety of researches on sports consumption and has value as a consumer study by identifying unique consumption patterns. It is meaningful in that the accuracy of the interpretation has been enhanced by using a cluster analysis via convergence of iteration correlation analysis and Clauset-Newman-Moore clustering algorithm to identify the main topics. Based on the results of this study, the clubs will be able to maximize its profits and maintain good relationships with fans by identifying key drivers of consumer awareness and purchasing for professional soccer fans and establishing an effective marketing strategy.

Fast Join Mechanism that considers the switching of the tree in Overlay Multicast (오버레이 멀티캐스팅에서 트리의 스위칭을 고려한 빠른 멤버 가입 방안에 관한 연구)

  • Cho, Sung-Yean;Rho, Kyung-Taeg;Park, Myong-Soon
    • The KIPS Transactions:PartC
    • /
    • v.10C no.5
    • /
    • pp.625-634
    • /
    • 2003
  • More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

Cloud P2P OLAP: Query Processing Method and Index structure for Peer-to-Peer OLAP on Cloud Computing (Cloud P2P OLAP: 클라우드 컴퓨팅 환경에서의 Peer-to-Peer OLAP 질의처리기법 및 인덱스 구조)

  • Joo, Kil-Hong;Kim, Hun-Dong;Lee, Won-Suk
    • Journal of Internet Computing and Services
    • /
    • v.12 no.4
    • /
    • pp.157-172
    • /
    • 2011
  • The latest active studies on distributed OLAP to adopt a distributed environment are mainly focused on DHT P2P OLAP and Grid OLAP. However, these approaches have its weak points, the P2P OLAP has limitations to multidimensional range queries in the cloud computing environment due to the nature of structured P2P. On the other hand, the Grid OLAP has no regard for adjacency and time series. It focused on its own sub set lookup algorithm. To overcome the above limits, this paper proposes an efficient central managed P2P approach for a cloud computing environment. When a multi-level hybrid P2P method is combined with an index load distribution scheme, the performance of a multi-dimensional range query is enhanced. The proposed scheme makes the OLAP query results of a user to be able to reused by other users' volatile cube search. For this purpose, this paper examines the combination of an aggregation cube hierarchy tree, a quad-tree, and an interval-tree as an efficient index structure. As a result, the proposed cloud P2P OLAP scheme can manage the adjacency and time series factor of an OLAP query. The performance of the proposed scheme is analyzed by a series of experiments to identify its various characteristics.

An Efficient Frequent Melody Indexing Method to Improve Performance of Query-By-Humming System (허밍 질의 처리 시스템의 성능 향상을 위한 효율적인 빈번 멜로디 인덱싱 방법)

  • You, Jin-Hee;Park, Sang-Hyun
    • Journal of KIISE:Databases
    • /
    • v.34 no.4
    • /
    • pp.283-303
    • /
    • 2007
  • Recently, the study of efficient way to store and retrieve enormous music data is becoming the one of important issues in the multimedia database. Most general method of MIR (Music Information Retrieval) includes a text-based approach using text information to search a desired music. However, if users did not remember the keyword about the music, it can not give them correct answers. Moreover, since these types of systems are implemented only for exact matching between the query and music data, it can not mine any information on similar music data. Thus, these systems are inappropriate to achieve similarity matching of music data. In order to solve the problem, we propose an Efficient Query-By-Humming System (EQBHS) with a content-based indexing method that efficiently retrieve and store music when a user inquires with his incorrect humming. For the purpose of accelerating query processing in EQBHS, we design indices for significant melodies, which are 1) frequent melodies occurring many times in a single music, on the assumption that users are to hum what they can easily remember and 2) melodies partitioned by rests. In addition, we propose an error tolerated mapping method from a note to a character to make searching efficient, and the frequent melody extraction algorithm. We verified the assumption for frequent melodies by making up questions and compared the performance of the proposed EQBHS with N-gram by executing various experiments with a number of music data.

Planning of Optimal Work Path for Minimizing Exposure Dose During Radiation Work in Radwaste Storage (방사성 폐기물 저장시설에서의 방사선 작업 중 피폭선량 최소화를 위한 최적 작업경로 계획)

  • Park, Won-Man;Kim, Kyung-Soo;Whang, Joo-Ho
    • Journal of Radiation Protection and Research
    • /
    • v.30 no.1
    • /
    • pp.17-25
    • /
    • 2005
  • Since the safety of nuclear power plant has been becoming a big social issue the exposure dose of radiation for workers has been one of the important factors concerning the safety problem. The existing calculation methods of radiation dose used in the planning of radiation work assume that dose rate does not depend on the location within a work space thus the variation of exposure dose by different work path is not considered. In this study, a modified numerical method was presented to estimate the exposure dose during radiation work in radwaste storage considering the effects of the distance between a worker and sources. And a new numerical algorithm was suggested to search the optimal work path minimizing the exposure dose in pre-defined work space with given radiation sources. Finally, a virtual work simulation program was developed to visualize the exposure dose of radiation doting radiation works in radwaste storage and provide the capability of simulation for work planning. As a numerical example, a test radiation work was simulated under given space and two radiation sources, and the suggested optimal work path was compared with three predefined work paths. The optimal work path obtained in the study could reduce the exposure dose for the given test work. Based on the results, tile developed numerical method and simulation program could be useful tools in the planning of radiation work.

Development of GML Map Visualization Service and POI Management Tool using Tagging (GML 지도 가시화 서비스 및 태깅을 이용한 POI 관리 도구 개발)

  • Park, Yong-Jin;Song, Eun-Ha;Jeong, Young-Sik
    • Journal of Internet Computing and Services
    • /
    • v.9 no.3
    • /
    • pp.141-158
    • /
    • 2008
  • In this paper, we developed the GML Map Server which visualized the map based on GML as international standard for exchanging the common format map and for interoperability of GIS information. And also, it should transmit effectively GML map into the mobile device by using dynamic map partition and caching. It manages a partition based on the visualization area of a mobile device in order to visualize the map to a mobile device in real time, and transmits the partition area by serializing it for the benefit of transmission. Also, the received partition area is compounded in a mobile device and is visualized by being partitioned again as four visible areas based on the display of a mobile device. Then, the area is managed by applying a caching algorithm in consideration of repetitiveness for a received map for the efficient operation of resources. Also, in order to prevent the delay in transmission time as regards the instance density area of the map, an adaptive map partition mechanism is proposed for maintaining the regularity of transmission time. GML Map Server can trace the position of mobile device with WIPI environment in this paper. The field emulator can be created mobile devices and mobile devices be moved and traced it's position instead of real-world. And we developed POIM(POI Management) for management hierarchically POI information and for the efficiency POI search by using the individual tagging technology with visual interface.

  • PDF

Computational Optimization for RC Columns in Tall Buildings (초고층 철근콘크리트 기둥의 전산최적설계 프로세스)

  • Lee, Yunjae;Kim, Chee-Kyeong;Choi, Hyun-Chul
    • Journal of the Korea Concrete Institute
    • /
    • v.26 no.3
    • /
    • pp.401-409
    • /
    • 2014
  • This research develops tools and strategies for optimizing RC column sections applied in tall buildings. Optimization parameters are concrete strength and section shape, the objective function for which is subject to several predefined constraints drawn from the original structural design. For this purpose, we developed new components for StrAuto, a parametric modeling and optimization tool for building structure. The components receive from external analysis solvers member strengths calculated from the original design model, and output optimized column sections satisfying the minimum cost. Using these components, optimized sections are firstly obtained for each predefined concrete strength applied to the whole floors in the project building. The obtained results for each concrete strength are comparatively examined to determine the fittest sections which will also result in the fittest vertical zoning for concrete strength. The main optimization scenario for this is to search for the vertical levels where the identical optimized sections coincide for the two different concrete strengths in concern, and select those levels for the boundaries where a concrete strength will be changed to another. The optimization process provided in this research is a product of an intensive development designed for a specific member in a specific project. Thus, the algorithm suggested takes on a microscopic and mathematical approach. However, the technique has a lot of potential that it can further be extensively developed and applied for future projects.

Sentiment Analysis of movie review for predicting movie rating (영화리뷰 감성 분석을 통한 평점 예측 연구)

  • Jo, Jung-Tae;Choi, Sang-Hyun
    • Management & Information Systems Review
    • /
    • v.34 no.3
    • /
    • pp.161-177
    • /
    • 2015
  • Currently, the influence of the Internet portal sites that can make it quick and easy to contact the vast amount of information is increasing. Users can connect the Internet through a portal to obtain information, such as communication between Internet users, which can be used to meet a variety of purposes. People are exposed to a variety of information from other users in the search for a movie and get information. The impact on the reviews and ratings with the limited number of characters of the film allows users to form a relationship to the movie, decide whether you want to see the movie or find another movie. but, the user can not read the whole movie review. When user see the overall evaluation, the user can receive the correct information. This research conducted a study on the prediction of the rating by the use of review data. Information of reviews, is divided into two main areas: the"fact" and "opinion". "Fact" is to convey the dispassionate information and "Opinion" is, to represent the user's feelings. In this study, we built sentiment dictionary based on the assessment and evaluation of the online review and applied to evaluate other movies. In the comparative study with a simple emotion evaluation technique, we found the suggested algorithm got the more accurate results.

  • PDF