• Title/Summary/Keyword: model matching problems

Search Result 103, Processing Time 0.027 seconds

Tracking by Detection of Multiple Faces using SSD and CNN Features

  • Tai, Do Nhu;Kim, Soo-Hyung;Lee, Guee-Sang;Yang, Hyung-Jeong;Na, In-Seop;Oh, A-Ran
    • Smart Media Journal
    • /
    • v.7 no.4
    • /
    • pp.61-69
    • /
    • 2018
  • Multi-tracking of general objects and specific faces is an important topic in the field of computer vision applicable to many branches of industry such as biometrics, security, etc. The rapid development of deep neural networks has resulted in a dramatic improvement in face recognition and object detection problems, which helps improve the multiple-face tracking techniques exploiting the tracking-by-detection method. Our proposed method uses face detection trained with a head dataset to resolve the face deformation problem in the tracking process. Further, we use robust face features extracted from the deep face recognition network to match the tracklets with tracking faces using Hungarian matching method. We achieved promising results regarding the usage of deep face features and head detection in a face tracking benchmark.

Context Prediction Using Right and Wrong Patterns to Improve Sequential Matching Performance for More Accurate Dynamic Context-Aware Recommendation (보다 정확한 동적 상황인식 추천을 위해 정확 및 오류 패턴을 활용하여 순차적 매칭 성능이 개선된 상황 예측 방법)

  • Kwon, Oh-Byung
    • Asia pacific journal of information systems
    • /
    • v.19 no.3
    • /
    • pp.51-67
    • /
    • 2009
  • Developing an agile recommender system for nomadic users has been regarded as a promising application in mobile and ubiquitous settings. To increase the quality of personalized recommendation in terms of accuracy and elapsed time, estimating future context of the user in a correct way is highly crucial. Traditionally, time series analysis and Makovian process have been adopted for such forecasting. However, these methods are not adequate in predicting context data, only because most of context data are represented as nominal scale. To resolve these limitations, the alignment-prediction algorithm has been suggested for context prediction, especially for future context from the low-level context. Recently, an ontological approach has been proposed for guided context prediction without context history. However, due to variety of context information, acquiring sufficient context prediction knowledge a priori is not easy in most of service domains. Hence, the purpose of this paper is to propose a novel context prediction methodology, which does not require a priori knowledge, and to increase accuracy and decrease elapsed time for service response. To do so, we have newly developed pattern-based context prediction approach. First of ail, a set of individual rules is derived from each context attribute using context history. Then a pattern consisted of results from reasoning individual rules, is developed for pattern learning. If at least one context property matches, say R, then regard the pattern as right. If the pattern is new, add right pattern, set the value of mismatched properties = 0, freq = 1 and w(R, 1). Otherwise, increase the frequency of the matched right pattern by 1 and then set w(R,freq). After finishing training, if the frequency is greater than a threshold value, then save the right pattern in knowledge base. On the other hand, if at least one context property matches, say W, then regard the pattern as wrong. If the pattern is new, modify the result into wrong answer, add right pattern, and set frequency to 1 and w(W, 1). Or, increase the matched wrong pattern's frequency by 1 and then set w(W, freq). After finishing training, if the frequency value is greater than a threshold level, then save the wrong pattern on the knowledge basis. Then, context prediction is performed with combinatorial rules as follows: first, identify current context. Second, find matched patterns from right patterns. If there is no pattern matched, then find a matching pattern from wrong patterns. If a matching pattern is not found, then choose one context property whose predictability is higher than that of any other properties. To show the feasibility of the methodology proposed in this paper, we collected actual context history from the travelers who had visited the largest amusement park in Korea. As a result, 400 context records were collected in 2009. Then we randomly selected 70% of the records as training data. The rest were selected as testing data. To examine the performance of the methodology, prediction accuracy and elapsed time were chosen as measures. We compared the performance with case-based reasoning and voting methods. Through a simulation test, we conclude that our methodology is clearly better than CBR and voting methods in terms of accuracy and elapsed time. This shows that the methodology is relatively valid and scalable. As a second round of the experiment, we compared a full model to a partial model. A full model indicates that right and wrong patterns are used for reasoning the future context. On the other hand, a partial model means that the reasoning is performed only with right patterns, which is generally adopted in the legacy alignment-prediction method. It turned out that a full model is better than a partial model in terms of the accuracy while partial model is better when considering elapsed time. As a last experiment, we took into our consideration potential privacy problems that might arise among the users. To mediate such concern, we excluded such context properties as date of tour and user profiles such as gender and age. The outcome shows that preserving privacy is endurable. Contributions of this paper are as follows: First, academically, we have improved sequential matching methods to predict accuracy and service time by considering individual rules of each context property and learning from wrong patterns. Second, the proposed method is found to be quite effective for privacy preserving applications, which are frequently required by B2C context-aware services; the privacy preserving system applying the proposed method successfully can also decrease elapsed time. Hence, the method is very practical in establishing privacy preserving context-aware services. Our future research issues taking into account some limitations in this paper can be summarized as follows. First, user acceptance or usability will be tested with actual users in order to prove the value of the prototype system. Second, we will apply the proposed method to more general application domains as this paper focused on tourism in amusement park.

Seismic analysis of turbo machinery foundation: Shaking table test and computational modeling

  • Tripathy, Sungyani;Desai, Atul K
    • Earthquakes and Structures
    • /
    • v.12 no.6
    • /
    • pp.629-641
    • /
    • 2017
  • Foundation plays a significant role in safe and efficient turbo machinery operation. Turbo machineries generate harmonic load on the foundation due to their high speed rotating motion which causes vibration in the machinery, foundation and soil beneath the foundation. The problems caused by vibration get multiplied if the soil is poor. An improperly designed machine foundation increases the vibration and reduces machinery health leading to frequent maintenance. Hence it is very important to study the soil structure interaction and effect of machine vibration on the foundation during turbo machinery operation in the design stage itself. The present work studies the effect of harmonic load due to machine operation along with earthquake loading on the frame foundation for poor soil conditions. Various alternative foundations like rafts, barrette, batter pile and combinations of barrettes with batter pile are analyzed to study the improvements in the vibration patterns. Detailed computational analysis was carried out in SAP 2000 software; the numerical model was analyzed and compared with the shaking table experiment results. The numerical results are found to be closely matching with the experimental data which confirms the accuracy of the numerical model predictions. Both shake table and SAP 2000 results reveal that combination of barrette and batter piles with raft are best suitable for poor soil conditions because it reduces the displacement at top deck, bending moment and horizontal displacement of pile and thereby making the foundation more stable under seismic loading.

Speedup Analysis Model for High Speed Network based Distributed Parallel Systems (고속 네트웍 기반의 분산병렬시스템에서의 성능 향상 분석 모델)

  • 김화성
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.12C
    • /
    • pp.218-224
    • /
    • 2001
  • The objective of Distributed Parallel Computing is to solve the computationally intensive problems, which have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. In this paper, we propose a computational model including the generalized graph representation method of distributed parallel systems for speedup analysis, and analyze how the super-linear speedup is achieved when scheduling of programs with diverse embedded parallelism modes onto a distributed heterogeneous supercomputing network environment. The proposed representation method can also be applied to simple homogeneous or heterogeneous systems whose components are heterogeneous only in terms of the processor speed. In order to obtain the core speedup, the matching of the parallelism characteristics between tasks and parallel machines should be carefully handled while minimizing the communication overhead.

  • PDF

Fast Handwriting Recognition Using Model Graph (모델 그래프를 이용한 빠른 필기 인식 방법)

  • Oh, Se-Chang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.5
    • /
    • pp.892-898
    • /
    • 2012
  • Rough classification methods are used to improving the recognition speed in many character recognition problems. In this case, some irreversible result can occur by an error in rough classification. Methods for duplicating each model in several classes are used in order to reduce this risk. But the errors by rough classfication can not be completely ruled out by these methods. In this paper, an recognition method is proposed to increase speed that matches models selectively without any increase in error. This method constructs a model graph using similarity between models. Then a search process begins from a particular point in the model graph. In this process, matching of unnecessary models are reduced that are not similar to the input pattern. In this paper, the proposed method is applied to the recognition problem of handwriting numbers and upper/lower cases of English alphabets. In the experiments, the proposed method was compared with the basic method that matches all models with input pattern. As a result, the same recognition rate, which has shown as the basic method, was obtained by controlling the out-degree of the model graph and the number of maintaining candidates during the search process thereby being increased the recognition speed to 2.45 times.

A Case Study on the Personalized Online Recruitment Services : Focusing on Worldjob+'s Use of Splunk (개인화된 구직정보서비스 제공에 관한 사례연구 : 월드잡플러스의 스플렁크 활용을 중심으로)

  • Rhee, MoonKi Kyle;Lee, Jae Deug;Park, Seong Taek
    • Journal of the Korea Convergence Society
    • /
    • v.9 no.2
    • /
    • pp.241-250
    • /
    • 2018
  • Online recruitment services have emerged as one of the most popular Internet services, providing job seekers with a comprehensive list of jobs and a search engine. But many recruitment services suffer from shortcomings due to their reliance on traditional client-pull information access model, in manay cases resulting in unfocused search results. Worldjob+, being operated by The Human Resources Development Service of Korea, addresses these problems and uses Splunk, a platform for analyzing machine data, to provide a more proactive and personalised services. It focuses on enhancing the existing system in two different ways: (a) using personalised automated matching techniques to proactively recommend most preferrable profile or specification information for each job opening announcement or recruiting company, (b) and to recommend most preferrable or desirable job opening announcement for each job-seeker. This approach is a feature-free recommendation technique that recommends information items to a given user based on what similar users have previously liked. A brief discussion about the potential benefit is also provided as a conclusion.

Context-Awareness Modeling Method using Timed Petri-nets (시간 페트리 넷을 이용한 상황인지 모델링 기법)

  • Park, Byung-Sung;Kim, Hag-Bae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4B
    • /
    • pp.354-361
    • /
    • 2011
  • Increasing interest and technological advances in smart home has led to active research on context-awareness service and prediction algorithms such as Bayesian Networks, Tree-Dimensional Structures and Genetic prediction algorithms. Context-awareness service presents that providing automatic customized service regarding individual user's pattern surely helps users improve the quality of life. However, it is difficult to implement context-awareness service because the problems are that handling coincidence with context information and exceptional cases have to consider. To overcome this problem, we proposes an Intelligent Sequential Matching Algorithm(ISMA), models context-awareness service using Timed Petri-net(TPN) which is petri-net to have time factor. The example scenario illustrates the effectiveness of the Timed Petri-net model and our proposed algorithm improves average 4~6% than traditional in the accuracy and reliability of prediction.

An Embedded Information Extraction of Color QR Code for Offline Applications (오프라인 응용을 위한 컬러 QR코드의 삽입 정보 추출 방법)

  • Kim, Jin-soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.9
    • /
    • pp.1123-1131
    • /
    • 2020
  • The quick-response (QR) code is a two-dimensional barcode which is widely being used. Due to several interesting features such as small code size, high error correction capabilities, easy code generation and reading process, the QR codes are used in many applications. Nowadays, a printed color QR code for offline applications is being studied to improve the information storage capacity. By multiplexing color information into the conventional black-white QR code, the storage capacity is increased, however, it is hard to extract the embedded information due to the color crosstalk and geometrical distortion. In this paper, to overcome these problems, a new type of QR code is designed based on the CMYK color model and the local spatial searching as well as the global spatial matching is introduced in the reading process. These results in the recognition rate increase. Through practical experiments, it is shown that the proposed algorithm can perform the bit recognition rate improvement of about 3% to 5%.

Intelligent Digital Redesign for Uncertain Nonlinear Systems Using Power Series (Powrer Series를 이용한 불확실성을 갖는 비선형 시스템의 지능형 디지털 재설계)

  • Sung Hwa Chang;Park Jin Bae;Go Sung Hyun;Joo Young Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.7
    • /
    • pp.881-886
    • /
    • 2005
  • This paper presents intelligent digital redesign method of global approach for hybrid state space fuzzy-model-based controllers. For effectiveness and stabilization of continuous-time uncertain nonlinear systems under discrete-time controller, Takagi-Sugeno(TS) fuzzy model is used to represent tile complex system. And global approach design problems viewed as a convex optimization problem that we minimize the error of the norm bounds between nonlinearly interpolated linear operators to be matched. Also, by using the power series, we analyzed nonlinear system's uncertain parts more precisely. When a sampling period is sufficiently small, the conversion of a continuous-time structured uncertain nonlinear system to an equivalent discrete-time system have proper reason. Sufficiently conditions for the global state-matching of tile digitally controlled system are formulated in terms of linear matrix inequalities (LMIs). Finally, a TS fuzzy model for the chaotic Lorentz system is used as an example to guarantee the stability and effectiveness of the proposed method.

Generation of 3-D City Model using Aerial Imagery (항공사진을 이용한 3차원 도시 모형 생성)

  • Yeu Bock Mo;Jin Kyeong Hyeok;Yoo Hwan Hee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.23 no.3
    • /
    • pp.233-238
    • /
    • 2005
  • 3-D virtual city model is becoming increasingly important for a number of GIS applications. For reconstruction of 3D building in urban area aerial images, satellite images, LIDAR data have been used mainly and most of researches related to 3-D reconstruction focus on development of method for extraction of building height and reconstruction of building. In case of automatically extracting and reconstructing of building height using only aerial images or satellite images, there are a lot of problems, such as mismatching that result from a geometric distortion of optical images. Therefore, researches of integrating optical images and existing digital map (1/1,000) has been in progress. In this paper, we focused on extracting of building height by means of interest points and vertical line locus method for reducing matching points. Also we used digital plotter in order to validate for the results in this study using aerial images (1/5,000) and existing digital map (1/1,000).