• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.032 seconds

Effectiveness of Fuzzy Graph Based Document Model

  • Aswathy M R;P.C. Reghu Raj;Ajeesh Ramanujan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.8
    • /
    • pp.2178-2198
    • /
    • 2024
  • Graph-based document models have good capabilities to reveal inter-dependencies among unstructured text data. Natural language processing (NLP) systems that use such models as an intermediate representation have shown good performance. This paper proposes a novel fuzzy graph-based document model and to demonstrate its effectiveness by applying fuzzy logic tools for text summarization. The proposed system accepts a text document as input and identifies some of its sentence level features, namely sentence position, sentence length, numerical data, thematic word, proper noun, title feature, upper case feature, and sentence similarity. The fuzzy membership value of each feature is computed from the sentences. We also propose a novel algorithm to construct the fuzzy graph as an intermediate representation of the input document. The Recall-Oriented Understudy for Gisting Evaluation (ROUGE) metric is used to evaluate the model. The evaluation based on different quality metrics was also performed to verify the effectiveness of the model. The ANOVA test confirms the hypothesis that the proposed model improves the summarizer performance by 10% when compared with the state-of-the-art summarizers employing alternate intermediate representations for the input text.

Linking Algorithm between IoT devices for smart factory environment of SMEs (중소기업의 스마트팩토리 환경을 위한 IoT 장치 간 연계 알고리즘)

  • Jeong, Yoon-Su
    • Journal of Convergence for Information Technology
    • /
    • v.8 no.2
    • /
    • pp.233-238
    • /
    • 2018
  • SMEs and small enterprises are making various attempts to manage SMEs in terms of equipment, safety and energy management as well as production management. However, SMEs do not have the investment capacity and it is not easy to build a smart factory to improve management and productivity of SMEs. In this paper, we propose a smart factory construction algorithm that partially integrates the factory equipment currently operated by SMEs. The proposed algorithm supports collection, storage, management and processing of product information and release information through IoT device during the whole manufacturing process so that SMEs' smart factory environment can be constructed and operated in stages. In addition, the proposed algorithm is characterized in that central server manages authentication information between devices to automate the linkage between IoT devices regardless of the number of IoT devices. As a result of the performance evaluation, the proposed algorithm obtained 13.7% improvement in the factory process and efficiency before building the Smart Factory environment, and 19.8% improvement in the processing time in the factory. Also, the cost of input of manpower into process process was reduced by 37.1%.

Super-Resolution Algorithm by Motion Estimation with Sub-Pixel Accuracy using 6-Tap FIR Filter (6-Tap FIR 필터를 이용한 부화소 단위 움직임 추정을 통한 초해상도 기법)

  • Kwon, Soon-Chan;Yoo, Ji-Sang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6A
    • /
    • pp.464-472
    • /
    • 2012
  • In this paper, we propose a new super-resolution algorithm that uses successive frames by applying the block matching motion estimation algorithm. Usually, single frame super-resolution algorithms are based on probability or discrete wavelet transform (DWT) approach to extract high-frequency components of the input image, but only limited information is available for these algorithms. To solve this problem, various multiple-frame based super-resolution algorithms are proposed. The accuracy of registration between frames is a very important factor for the good performance of an algorithm. We therefore propose an algorithm using 6-Tap FIR filter to increase the accuracy of the image registration with sub-pixel unit. Proposed algorithm shows better performance than other conventional interpolation based algorithms such as nearest neighborhood, bi-linear and bi-cubic methods and results in about the same image quality as DWT based super-resolution algorithm.

Development of Knocking discrimination and Engine balance Correction Algorithm of CRDI Engine ECU (CRDI 엔진 전자제어컨트롤러(ECU)의 노킹 판별 및 엔진 밸런스 보정 알고리즘 개발)

  • Kim, Hwa-Seon;Jang, Seong-Jin;Jang, Jong-Yug
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.391-394
    • /
    • 2012
  • Recently, for appling to industrial engines to CRDI diesel engine to meet enhanced emission regulatory standards in native and foreign, ECU that be controlled only automaker develop engine control algorithm that adjust injection timing and injection as user's need and use testing, verification for engine performance and emissions reduction. For development only CRDI diesel engine emulator, using CKP and CMP sensor performance property of CRDI engine control ECU input element, in this paper, there determine the diesel knocking and propose design methodology of engine balance correction algorithm design of the correction algorithm. And there propose efficient Improvement for fuel efficiency increasing and reduction of emissions.

  • PDF

A Simple Shortest Path Algorithm for L-visible Polygons

  • Kim, Soo-Hwan
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.1
    • /
    • pp.59-63
    • /
    • 2010
  • The shortest path between two points inside a simple polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a given polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in case that the input without very large size is given because its time complexity has a big constant factor. Two points of a polygon P are said to be L-visible from each other if they can be joined by a simple chain of at most two rectilinear line segments contained in P completely. An L-visible polygon P is a polygon such that there is a point from which every point of P is L-visible. We present the customized optimal shortest path algorithm for an L-visible polygon. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls and operations for convex polygons, so it is easy to implement and runs very fast in linear time.

A Secret Key Watermarking for Authentication and Integrity (인증과 무결성을 위한 비밀키 워터마킹)

  • Woo, Chan-Il;Shin, In-Chul
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.11
    • /
    • pp.3576-3583
    • /
    • 2000
  • Digital watermarks have recently been proposed for the purposes of copyright ptotechtion and autheutication for multimedia contents. A watermarking technique consists of an algorithm that incorporates a watermarking structure into an image in the spatial or frequency domains. In this paper we proposed a new watermarking method for authentication and integrity of digital images and the proposed algorithm uses the MD5 hash funiction and a symmetric key encryption algorithm. To decide the position of embedding watermark and the bit pasitionin the original image, the secret key is used as an input of the MD5 hash function. The simulation results show that the proposed algorithm has the advantage of difficulty to find positions of inserted watermarks, and keep the similar watermarked image quabty with Wong's method.

  • PDF

Real-time Face Localization for Video Monitoring (무인 영상 감시 시스템을 위한 실시간 얼굴 영역 추출 알고리즘)

  • 주영현;이정훈;문영식
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.11
    • /
    • pp.48-56
    • /
    • 1998
  • In this paper, a moving object detection and face region extraction algorithm which can be used in video monitoring systems is presented. The proposed algorithm is composed of two stages. In the first stage, each frame of an input video sequence is analyzed using three measures which are based on image pixel difference. If the current frame contains moving objects, their skin regions are extracted using color and frame difference information in the second stage. Since the proposed algorithm does not rely on computationally expensive features like optical flow, it is well suited for real-time applications. Experimental results tested on various sequences have shown the robustness of the proposed algorithm.

  • PDF

Extreme Learning Machine Ensemble Using Bagging for Facial Expression Recognition

  • Ghimire, Deepak;Lee, Joonwhoan
    • Journal of Information Processing Systems
    • /
    • v.10 no.3
    • /
    • pp.443-458
    • /
    • 2014
  • An extreme learning machine (ELM) is a recently proposed learning algorithm for a single-layer feed forward neural network. In this paper we studied the ensemble of ELM by using a bagging algorithm for facial expression recognition (FER). Facial expression analysis is widely used in the behavior interpretation of emotions, for cognitive science, and social interactions. This paper presents a method for FER based on the histogram of orientation gradient (HOG) features using an ELM ensemble. First, the HOG features were extracted from the face image by dividing it into a number of small cells. A bagging algorithm was then used to construct many different bags of training data and each of them was trained by using separate ELMs. To recognize the expression of the input face image, HOG features were fed to each trained ELM and the results were combined by using a majority voting scheme. The ELM ensemble using bagging improves the generalized capability of the network significantly. The two available datasets (JAFFE and CK+) of facial expressions were used to evaluate the performance of the proposed classification system. Even the performance of individual ELM was smaller and the ELM ensemble using a bagging algorithm improved the recognition performance significantly.

An Implementation of a Feature Extraction Hardware Accelerator based on Memory Usage Improvement SURF Algorithm (메모리 사용률을 개선한 SURF 알고리즘 특징점 추출기의 하드웨어 가속기 설계)

  • Jung, Chang-min;Kwak, Jae-chang;Lee, Kwang-yeob
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.77-80
    • /
    • 2013
  • SURF algorithm is an algorithm to extract feature points and to generate descriptors from input images. It is robust to change of environment such as scale, rotation, illumination and view points. Because of these features, it is used for many image processing applications such as object recognition, constructing panorama pictures and 3D image restoration. But there is disadvantage for real time operation because many recognition algorithms such as SURF algorithm requires a lot of calculations. In this paper, we propose a design of feature extractor and descriptor generator based on SURF for high memory efficiency. The proposed design reduced a memory access and memory usage to operate in real time.

  • PDF

Volume Calculation Using Stereo Camera and Non-uniform Mesh (스테레오 카메라와 비균일 메시를 이용한 체적 계산 알고리즘)

  • Lee, Young-Dae;Cho, Sung-Yun
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2012.07a
    • /
    • pp.429-432
    • /
    • 2012
  • In this paper, we proposed the algorithm computes the waste volume periodically for the way of waste repository standard. For the construction of safe and clear urban environment, it is necessary that we identify the rubbish waste volume and we know the accuracy volume. After camera calibration, we obtained the point cloud on the surface of the object and took this as the input of the calculation algorithm of the object volume. We proposed the two volume calculation algorithms based on the triangularmeshing methods and verified the validity of the algorithm through simulation and real experiments. The proposed algorithm can be used not only as the volume calculation of the waste repository but also as the general volume calculation of a three dimensional object.

  • PDF