• Title/Summary/Keyword: many-to-one matching

Search Result 172, Processing Time 0.03 seconds

Anomaly Detection for User Action with Generative Adversarial Networks (적대적 생성 모델을 활용한 사용자 행위 이상 탐지 방법)

  • Choi, Nam woong;Kim, Wooju
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.3
    • /
    • pp.43-62
    • /
    • 2019
  • At one time, the anomaly detection sector dominated the method of determining whether there was an abnormality based on the statistics derived from specific data. This methodology was possible because the dimension of the data was simple in the past, so the classical statistical method could work effectively. However, as the characteristics of data have changed complexly in the era of big data, it has become more difficult to accurately analyze and predict the data that occurs throughout the industry in the conventional way. Therefore, SVM and Decision Tree based supervised learning algorithms were used. However, there is peculiarity that supervised learning based model can only accurately predict the test data, when the number of classes is equal to the number of normal classes and most of the data generated in the industry has unbalanced data class. Therefore, the predicted results are not always valid when supervised learning model is applied. In order to overcome these drawbacks, many studies now use the unsupervised learning-based model that is not influenced by class distribution, such as autoencoder or generative adversarial networks. In this paper, we propose a method to detect anomalies using generative adversarial networks. AnoGAN, introduced in the study of Thomas et al (2017), is a classification model that performs abnormal detection of medical images. It was composed of a Convolution Neural Net and was used in the field of detection. On the other hand, sequencing data abnormality detection using generative adversarial network is a lack of research papers compared to image data. Of course, in Li et al (2018), a study by Li et al (LSTM), a type of recurrent neural network, has proposed a model to classify the abnormities of numerical sequence data, but it has not been used for categorical sequence data, as well as feature matching method applied by salans et al.(2016). So it suggests that there are a number of studies to be tried on in the ideal classification of sequence data through a generative adversarial Network. In order to learn the sequence data, the structure of the generative adversarial networks is composed of LSTM, and the 2 stacked-LSTM of the generator is composed of 32-dim hidden unit layers and 64-dim hidden unit layers. The LSTM of the discriminator consists of 64-dim hidden unit layer were used. In the process of deriving abnormal scores from existing paper of Anomaly Detection for Sequence data, entropy values of probability of actual data are used in the process of deriving abnormal scores. but in this paper, as mentioned earlier, abnormal scores have been derived by using feature matching techniques. In addition, the process of optimizing latent variables was designed with LSTM to improve model performance. The modified form of generative adversarial model was more accurate in all experiments than the autoencoder in terms of precision and was approximately 7% higher in accuracy. In terms of Robustness, Generative adversarial networks also performed better than autoencoder. Because generative adversarial networks can learn data distribution from real categorical sequence data, Unaffected by a single normal data. But autoencoder is not. Result of Robustness test showed that he accuracy of the autocoder was 92%, the accuracy of the hostile neural network was 96%, and in terms of sensitivity, the autocoder was 40% and the hostile neural network was 51%. In this paper, experiments have also been conducted to show how much performance changes due to differences in the optimization structure of potential variables. As a result, the level of 1% was improved in terms of sensitivity. These results suggest that it presented a new perspective on optimizing latent variable that were relatively insignificant.

Protein Interaction Possibility Ranking Method based on Domain Combination (도메인 조합 기반 단백질 상호작용 가능성 순위 부여 기법)

  • Han Dong-Soo;Kim Hong-Song;Jong Woo-Hyuk;Lee Sung-Doke
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.5
    • /
    • pp.427-435
    • /
    • 2005
  • With the accumulation of protein and its related data on the Internet, many domain based computational techniques to predict protein interactions have been developed. However, most of the techniques still have many limitations to be used in real fields. They usually suffer from a low accuracy problem in prediction and do not provide any interaction possibility ranking method for multiple protein pairs. In this paper, we reevaluate a domain combination based protein interaction prediction method and develop an interaction possibility ranking method for multiple protein pairs. Probability equations are devised and proposed in the framework of domain combination based protein interaction prediction method. Using the ranking method, one can discern which protein pair is more probable to interact with each other than other protein pairs in multiple protein pairs. In the validation of the ranking method, we revealed that there exist some correlations between the interacting probability and the precision of the prediction in case of the protein pair group having the matching PIP(Primary Interaction Probability) values in the interacting or non interacting PIP distributions.

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.

Multiple Regression-Based Music Emotion Classification Technique (다중 회귀 기반의 음악 감성 분류 기법)

  • Lee, Dong-Hyun;Park, Jung-Wook;Seo, Yeong-Seok
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.6
    • /
    • pp.239-248
    • /
    • 2018
  • Many new technologies are studied with the arrival of the 4th industrial revolution. In particular, emotional intelligence is one of the popular issues. Researchers are focused on emotional analysis studies for music services, based on artificial intelligence and pattern recognition. However, they do not consider how we recommend proper music according to the specific emotion of the user. This is the practical issue for music-related IoT applications. Thus, in this paper, we propose an probability-based music emotion classification technique that makes it possible to classify music with high precision based on the range of emotion, when developing music related services. For user emotion recognition, one of the popular emotional model, Russell model, is referenced. For the features of music, the average amplitude, peak-average, the number of wavelength, average wavelength, and beats per minute were extracted. Multiple regressions were derived using regression analysis based on the collected data, and probability-based emotion classification was carried out. In our 2 different experiments, the emotion matching rate shows 70.94% and 86.21% by the proposed technique, and 66.83% and 76.85% by the survey participants. From the experiment, the proposed technique generates improved results for music classification.

A Dynamic Service Supporting Model for Semantic Web-based Situation Awareness Service (시맨틱 웹 기반 상황인지 서비스를 위한 동적 서비스 제공 모델)

  • Choi, Jung-Hwa;Park, Young-Tack
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.9
    • /
    • pp.732-748
    • /
    • 2009
  • The technology of Semantic Web realizes the base technology for context-awareness that creates new services by dynamically and flexibly combining various resources (people, concepts, etc). According to the realization of ubiquitous computing technology, many researchers are currently working for the embodiment of web service. However, most studies of them bring about the only predefined results those are limited to the initial description by service designer. In this paper, we propose a new service supporting model to provide an automatic method for plan related tasks which achieve goal state from initial state. The inputs on an planner are intial and goal descriptions which are mapped to the current situation and to the user request respectively. The idea of the method is to infer context from world model by DL-based ontology reasoning using OWL domain ontology. The context guide services to be loaded into planner. Then, the planner searches and plans at least one service to satisfy the goal state from initial state. This is STRIPS-style backward planner, and combine OWL-S services based on AI planning theory that enabling reduced search scope of huge web-service space. Also, when feasible service do not find using pattern matching, we give user alternative services through DL-based semantic searching. The experimental result demonstrates a new possibility for realizing dynamic service modeler, compared to OWLS-XPlan, which has been known as an effective application for service composition.

Subgraph Searching Scheme Based on Path Queries in Distributed Environments (분산 환경에서 경로 질의 기반 서브 그래프 탐색 기법)

  • Kim, Minyoung;Choi, Dojin;Park, Jaeyeol;Kim, Yeondong;Lim, Jongtae;Bok, Kyoungsoo;Choi, Han Suk;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.19 no.1
    • /
    • pp.141-151
    • /
    • 2019
  • A network of graph data structure is used in many applications to represent interactions between entities. Recently, as the size of the network to be processed due to the development of the big data technology is getting larger, it becomes more difficult to handle it in one server, and thus the necessity of distributed processing is also increasing. In this paper, we propose a distributed processing system for efficiently performing subgraph and stores. To reduce unnecessary searches, we use statistical information of the data to determine the search order through probabilistic scoring. Since the relationship between the vertex and the degree of the graph network may show different characteristics depending on the type of data, the search order is determined by calculating a score to reduce unnecessary search through a different scoring method for a graph having various distribution characteristics. The graph is sequentially searched in the distributed servers according to the determined order. In order to demonstrate the superiority of the proposed method, performance comparison with the existing method was performed. As a result, the search time is improved by about 3 ~ 10% compared with the existing method.

CERAMIC INLAY RESTORATIONS OF POSTERIOR TEETH

  • Jin, Myung-Uk;Park, Jeong-Won;Kim, Sung-Kyo
    • Proceedings of the KACD Conference
    • /
    • 2001.05a
    • /
    • pp.235-237
    • /
    • 2001
  • ;Dentistry has benefited from tremendous advances in technology with the introduction of new techniques and materials, and patients are aware that esthetic approaches in dentistry can change one's appearance. Increasingly. tooth-colored restorative materials have been used for restoration of posterior teeth. Tooth-colored restoration for posterior teeth can be divided into three categories: 1) the direct techniques that can be made in a single appointment and are an intraoral procedure utilizing composites: 2) the semidirect techniques that require both an intraoral and an extraoral procedure and are luted chairside utilizing composites: and 3) the indirect techniques that require several appointments and the expertise of a dental technician working with either composites or ceramics. But, resin restoration has inherent drawbacks of microleakage. polymerization shrinkage, thermal cycling problems. and wear in stress-bearing areas. On the other hand, Ceramic restorations have many advantages over resin restorations. Ceramic inlays are reported to have less leakage than resin restoration and to fit better. although marginal fidelity depends on technique and is laboratory dependent. Adhesion of luting resin is more reliable and durable to etched ceramic material than to treated resin composite. In view of color matching, periodontal health. resistance to abrasion, ceramic restoration is superior to resin restorationl. Materials which have been used for the fabrication of ceramic restorations are various. Conventional powder slurry ceramics are also available. Castable ceramics are produced by centrifugal casting of heat-treated glass ceramics. and machinable ceramics are feldspathic porcelains or cast glass ceramics which are milled using a CAD/CAM apparatus to produce inlays (for example, Cered. They may also be copy milled using the Celay apparatus. Pressable ceramics are produced from feldspathic porcelain which is supplied in ingot form and heated and moulded under pressure to produce a restoration. Infiltrated ceramics are another class of material which are available for use as ceramic inlays. An example is $In-Ceram^{\circledR}$(Vident. California, USA) which consists of a porous aluminum oxide or spinell core infiltrated with glass and subsequently veneered with feldspathic porcelain. In the 1980s. the development of compatible refractory materials made fabrication easier. and the development of adhesive resin cements greatly improved clinical success rates. This case report presents esthetic ceramic inlays for posterior teeth.teeth.

  • PDF

Multi-view Generation using High Resolution Stereoscopic Cameras and a Low Resolution Time-of-Flight Camera (고해상도 스테레오 카메라와 저해상도 깊이 카메라를 이용한 다시점 영상 생성)

  • Lee, Cheon;Song, Hyok;Choi, Byeong-Ho;Ho, Yo-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.4A
    • /
    • pp.239-249
    • /
    • 2012
  • Recently, the virtual view generation method using depth data is employed to support the advanced stereoscopic and auto-stereoscopic displays. Although depth data is invisible to user at 3D video rendering, its accuracy is very important since it determines the quality of generated virtual view image. Many works are related to such depth enhancement exploiting a time-of-flight (TOF) camera. In this paper, we propose a fast 3D scene capturing system using one TOF camera at center and two high-resolution cameras at both sides. Since we need two depth data for both color cameras, we obtain two views' depth data from the center using the 3D warping technique. Holes in warped depth maps are filled by referring to the surrounded background depth values. In order to reduce mismatches of object boundaries between the depth and color images, we used the joint bilateral filter on the warped depth data. Finally, using two color images and depth maps, we generated 10 additional intermediate images. To realize fast capturing system, we implemented the proposed system using multi-threading technique. Experimental results show that the proposed capturing system captured two viewpoints' color and depth videos in real-time and generated 10 additional views at 7 fps.

The Development of Image Processing System Using Area Camera for Feeding Lumber (영역카메라를 이용한 이송중인 제재목의 화상처리시스템 개발)

  • Kim, Byung Nam;Lee, Hyoung Woo;Kim, Kwang Mo
    • Journal of the Korean Wood Science and Technology
    • /
    • v.37 no.1
    • /
    • pp.37-47
    • /
    • 2009
  • For the inspection of wood, machine vision is the most common automated inspection method used at present. It is required to sort wood products by grade and to locate surface defects prior to cut-up. Many different sensing methods have been applied to inspection of wood including optical, ultrasonic, X-ray sensing in the wood industry. Nowadays the scanning system mainly employs CCD line-scan camera to meet the needs of accurate detection of lumber defects and real-time image processing. But this system needs exact feeding system and low deviation of lumber thickness. In this study low cost CCD area sensor was used for the development of image processing system for lumber being fed. When domestic red pine being fed on the conveyer belt, lumber images of irregular term of captured area were acquired because belt conveyor slipped between belt and roller. To overcome incorrect image merging by the unstable feeding speed of belt conveyor, it was applied template matching algorithm which was a measure of the similarity between the pattern of current image and the next one. Feeding the lumber over 13.8 m/min, general area sensor generates unreadable image pattern by the motion blur. The red channel of RGB filter showed a good performance for removing background of the green conveyor belt from merged image. Threshold value reduction method that was a image-based thresholding algorithm performed well for knot detection.

Generation and Detection of Cranial Landmark

  • Heo, Suwoong;Kang, Jiwoo;Kim, Yong Oock;Lee, Sanghoon
    • Journal of International Society for Simulation Surgery
    • /
    • v.2 no.1
    • /
    • pp.26-32
    • /
    • 2015
  • Purpose When a surgeon examines the morphology of skull of patient, locations of craniometric landmarks of 3D computed tomography(CT) volume are one of the most important information for surgical purpose. The locations of craniometric landmarks can be found manually by surgeon from the 3D rendered volume or 2D sagittal, axial, and coronal slices which are taken by CT. Since there are many landmarks on the skull, finding these manually is time-consuming, exhaustive, and occasionally inexact. These inefficiencies raise a demand for a automatic localization technique for craniometric landmark points. So in this paper, we propose a novel method through which we can automatically find these landmark points, which are useful for surgical purpose. Materials and Methods At first, we align the experimental data (CT volumes) using Frankfurt Horizontal Plane (FHP) and Mid Sagittal Plane(MSP) which are defined by 3 and 2 cranial landmark points each. The target landmark of our experiment is the anterior nasal spine. Prior to constructing a statistical cubic model which would be used for detecting the location of the landmark from a given CT volume, reference points for the anterior nasal spine were manually chosen by a surgeon from several CT volume sets. The statistical cubic model is constructed by calculating weighted intensity means of these CT sets around the reference points. By finding the location where similarity function (squared difference function) has the minimal value with this model, the location of the landmark can be found from any given CT volume. Results In this paper, we used 5 CT volumes to construct the statistical cubic model. The 20 CT volumes including the volumes, which were used to construct the model, were used for testing. The range of age of subjects is up to 2 years (24 months) old. The found points of each data are almost close to the reference point which were manually chosen by surgeon. Also it has been seen that the similarity function always has the global minimum at the detection point. Conclusion Through the experiment, we have seen the proposed method shows the outstanding performance in searching the landmark point. This algorithm would make surgeons efficiently work with morphological informations of skull. We also expect the potential of our algorithm for searching the anatomic landmarks not only cranial landmarks.