검색결과

검색조건
좁혀보기
검색필터
결과 내 재검색

간행물

    분야

      발행연도

      -

        검색결과 5

        1.
        2023.12 KCI 등재 구독 인증기관 무료, 개인회원 유료
        In this paper, we present a case study of developing MVIS (Machine Vision Inspection System) designed for exterior quality inspection of stamping dies used in the production of automotive exterior components in a small to medium-sized factory. While the primary processes within the factory, including machining, transportation, and loading, have been automated using PLCs, CNC machines, and robots, the final quality inspection process still relies on manual labor. We implement the MVIS with general- purpose industrial cameras and Python-based open-source libraries and frameworks for rapid and low-cost development. The MVIS can play a major role on improving throughput and lead time of stamping dies. Furthermore, the processed inspection images can be leveraged for future process monitoring and improvement by applying deep learning techniques.
        4,000원
        3.
        2021.09 KCI 등재 구독 인증기관 무료, 개인회원 유료
        Recently, transfer learning techniques with a base convolutional neural network (CNN) model have widely gained acceptance in early detection and classification of crop diseases to increase agricultural productivity with reducing disease spread. The transfer learning techniques based classifiers generally achieve over 90% of classification accuracy for crop diseases using dataset of crop leaf images (e.g., PlantVillage dataset), but they have ability to classify only the pre-trained diseases. This paper provides with an evaluation scheme on selecting an effective base CNN model for crop disease transfer learning with regard to the accuracy of trained target crops as well as of untrained target crops. First, we present transfer learning models called CDC (crop disease classification) architecture including widely used base (pre-trained) CNN models. We evaluate each performance of seven base CNN models for four untrained crops. The results of performance evaluation show that the DenseNet201 is one of the best base CNN models.
        4,000원
        4.
        2017.12 KCI 등재 구독 인증기관 무료, 개인회원 유료
        Collaborative filtering, one of the most widely used techniques to build recommender systems, is based on the idea that users with similar preferences can help one another find useful items. Credit card user behavior analytics show that most customers hold three or less credit cards without duplicates. This behavior is one of the most influential factors to data sparsity. The ‘cold-start’ problem caused by data sparsity prevents recommender system from providing recommendation properly in the personalized credit card recommendation scenario. We propose a personalized credit card recommender system to address the cold-start problem, using multiple user profiles. The proposed system consists of a training process and an application process using five user profiles. In the training process, the five user profiles are transformed to five user networks based on the cosine similarity, and an integrated user network is derived by weighted sum of each user network. The application process selects k-nearest neighbors (users) from the integrated user network derived in the training process, and recommends three of the most frequently used credit card by the k-nearest neighbors. In order to demonstrate the performance of the proposed system, we conducted experiments with real credit card user data and calculated the F1 Values. The F1 value of the proposed system was compared with that of the existing recommendation techniques. The results show that the proposed system provides better recommendation than the existing techniques. This paper not only contributes to solving the cold start problem that may occur in the personalized credit card recommendation scenario, but also is expected for financial companies to improve customer satisfactions and increase corporate profits by providing recommendation properly.
        4,000원
        5.
        2011.09 KCI 등재 구독 인증기관 무료, 개인회원 유료
        Finding the critical path (or the longest path) on acyclic directed graphs, which is well-known as PERT/CPM, the ambiguity of each acr’s length can be modeled as a range or an interval, in which the actual length of arc may realize. In this case, the min-
        4,000원