• Title/Summary/Keyword: Feature Checking

Search Result 63, Processing Time 0.023 seconds

A Image Search Algorithm using Coefficients of The Cosine Transform (여현변환 계수를 이용한 이미지 탐색 알고리즘)

  • Lee, Seok-Han
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.1
    • /
    • pp.13-21
    • /
    • 2019
  • The content based on image retrieval makes use of features of information within image such as color, texture and share for Retrieval data. we present a novel approach for improving retrieval accuracy based on DCT Filter-Bank. First, we perform DCT on a given image, and generate a Filter-Bank using the DCT coefficients for each color channel. In this step, DC and the limited number of AC coefficients are used. Next, a feature vector is obtained from the histogram of the quantized DC coefficients. Then, AC coefficients in the Filter-Bank are separated into three main groups indicating horizontal, vertical, and diagonal edge directions, respectively, according to their spatial-frequency properties. Each directional group creates its histogram after employing Otsu binarization technique. Finally, we project each histogram on the horizontal and vertical axes, and generate a feature vector for each group. The computed DC and AC feature vectors bins are concatenated, and it is used in the similarity checking procedure. We experimented using 1,000 databases, and as a result, this approach outperformed the old retrieval method which used color information.

Identification of Transformed Image Using the Composition of Features

  • Yang, Won-Keun;Cho, A-Young;Cho, Ik-Hwan;Oh, Weon-Geun;Jeong, Dong-Seok
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.6
    • /
    • pp.764-776
    • /
    • 2008
  • Image identification is the process of checking whether the query image is the transformed version of the specific original image or not. In this paper, image identification method based on feature composition is proposed. Used features include color distance, texture information and average pixel intensity. We extract color characteristics using color distance and texture information by Modified Generalized Symmetry Transform as well as average intensity of each pixel as features. Individual feature is quantized adaptively to be used as bins of histogram. The histogram is normalized according to data type and it is used as the signature in comparing the query image with database images. In matching part, Manhattan distance is used for measuring distance between two signatures. To evaluate the performance of the proposed method, independent test and accuracy test are achieved. In independent test, 60,433 images are used to evaluate the ability of discrimination between different images. And 4,002 original images and its 29 transformed versions are used in accuracy test, which evaluate the ability that the proposed algorithm can find the original image correctly when some transforms was applied in original image. Experiment results show that the proposed identification method has good performance in accuracy test. And the proposed method is very useful in real environment because of its high accuracy and fast matching capacity.

  • PDF

A NODE PREDICTION ALGORITHM WITH THE MAPPER METHOD BASED ON DBSCAN AND GIOTTO-TDA

  • DONGJIN LEE;JAE-HUN JUNG
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.27 no.4
    • /
    • pp.324-341
    • /
    • 2023
  • Topological data analysis (TDA) is a data analysis technique, recently developed, that investigates the overall shape of a given dataset. The mapper algorithm is a TDA method that considers the connectivity of the given data and converts the data into a mapper graph. Compared to persistent homology, another popular TDA tool, that mainly focuses on the homological structure of the given data, the mapper algorithm is more of a visualization method that represents the given data as a graph in a lower dimension. As it visualizes the overall data connectivity, it could be used as a prediction method that visualizes the new input points on the mapper graph. The existing mapper packages such as Giotto-TDA, Gudhi and Kepler Mapper provide the descriptive mapper algorithm, that is, the final output of those packages is mainly the mapper graph. In this paper, we develop a simple predictive algorithm. That is, the proposed algorithm identifies the node information within the established mapper graph associated with the new emerging data point. By checking the feature of the detected nodes, such as the anomality of the identified nodes, we can determine the feature of the new input data point. As an example, we employ the fraud credit card transaction data and provide an example that shows how the developed algorithm can be used as a node prediction method.

Satellite Anomalous Behavior Detection System through Rough-Set and Fuzzy Model (러프집합과 퍼지 모델을 이용한 인공위성의 이상 동작 검출 시스템)

  • Yang, Seung-Eun
    • Journal of Satellite, Information and Communications
    • /
    • v.12 no.3
    • /
    • pp.35-40
    • /
    • 2017
  • Out-of-limit (OOL) alarm method that is threshold checking of telemetry value is widely used for the satellites fault diagnosis and health monitoring. However, it requires engineering knowledge and effort to define delicate threshold value and has limitations that anomalous behaviors within the defined limits can't be detected. In this paper, we propose a satellite anomalous behavior detection system through fuzzy model that is composed by important statistical feature selected by rough-set theory. Not pre-defined anomaly is detected because only normal state data is used for fuzzy model. Also, anomalous behavior within the threshold limit is detected by using statistic feature that can be collected without engineering knowledge. The proposed system successfully detected non-ordinary state for battery temperature telemetry.

Quality Driven Approach for Product Line Architecture Customization in Patient Navigation Program Software Product Line

  • Ashari, Afifah M.;Abd Halim, Shahliza;Jawawi, Dayang N.A.;Suvelayutnan, Ushananthiny;Isa, Mohd Adham
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.7
    • /
    • pp.2455-2475
    • /
    • 2021
  • Patient Navigation Program (PNP) is considered as an important implementation of health care systems that can assist in patient's treatment. Due to the feasibility of PNP implementation, a systematic reuse is needed for a wide adoption of PNP computerized system. SPL is one of the promising systematic reuse approaches for creating a reusable architecture to enabled reuse in several similar applications of PNP systems which has its own variations with other applications. However, stakeholder decision making which result from the imprecise, uncertain, and subjective nature of architecture selection based on quality attributes (QA) further hinders the development of the product line architecture. Therefore, this study aims to propose a quality-driven approach using Multi-Criteria Decision Analysis (MCDA) techniques for Software Product Line Architecture (SPLA) to have an objective selection based on the QA of stakeholders in the domain of PNP. There are two steps proposed to this approach. First, a clear representation of quality is proposed by extending feature model (FM) with QA feature to determine the QA in the early phase of architecture selection. Second, MCDA techniques were applied for architecture selection based on objective preference for certain QA in the domain of PNP. The result of the proposed approach is the implementation of the PNP system with SPLA that had been selected using MCDA techniques. Evaluation for the approach is done by checking the approach's applicability in a case study and stakeholder validation. Evaluation on ease of use and usefulness of the approach with selected stakeholders have shown positive responses. The evaluation results proved that the proposed approach assisted in the implementation of PNP systems.

A Supervised Feature Selection Method for Malicious Intrusions Detection in IoT Based on Genetic Algorithm

  • Saman Iftikhar;Daniah Al-Madani;Saima Abdullah;Ammar Saeed;Kiran Fatima
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.3
    • /
    • pp.49-56
    • /
    • 2023
  • Machine learning methods diversely applied to the Internet of Things (IoT) field have been successful due to the enhancement of computer processing power. They offer an effective way of detecting malicious intrusions in IoT because of their high-level feature extraction capabilities. In this paper, we proposed a novel feature selection method for malicious intrusion detection in IoT by using an evolutionary technique - Genetic Algorithm (GA) and Machine Learning (ML) algorithms. The proposed model is performing the classification of BoT-IoT dataset to evaluate its quality through the training and testing with classifiers. The data is reduced and several preprocessing steps are applied such as: unnecessary information removal, null value checking, label encoding, standard scaling and data balancing. GA has applied over the preprocessed data, to select the most relevant features and maintain model optimization. The selected features from GA are given to ML classifiers such as Logistic Regression (LR) and Support Vector Machine (SVM) and the results are evaluated using performance evaluation measures including recall, precision and f1-score. Two sets of experiments are conducted, and it is concluded that hyperparameter tuning has a significant consequence on the performance of both ML classifiers. Overall, SVM still remained the best model in both cases and overall results increased.

A study on Improvement of the performance of Block Motion Estimation Using Neighboring Search Point (인접 탐색점을 이용한 블록 움직임 추정의 성능 향상을 위한 연구)

  • 김태주;진화훈;김용욱;허도근
    • Proceedings of the IEEK Conference
    • /
    • 2000.06d
    • /
    • pp.143-146
    • /
    • 2000
  • Motion Estimation/compensation(ME/MC) is one of the efficient interframe ceding techniques for its ability to reduce the high redundancy between successive frames of an image sequence. Calculating the blocking matching takes most of the encoding time. In this paper a new fast block matching algorithm(BMA) is developed for motion estimation and for reduction of the computation time to search motion vectors. The feature of the new algorithm comes from the center-biased checking concept and the trend of pixel movements. At first, Motion Vector(MV) is searched in ${\pm}$1 of search area and then the motion estimation is exploited in the rest block. The ASP and MSE of the proposed search algorithm show good performance.

  • PDF

The analysis of inversion construction by Focalization and Topicalization (초점화(Focalization)와 화제화(Topicalization)로 분석한 영어 도치 구문)

  • Kang, Young-Ah
    • English Language & Literature Teaching
    • /
    • v.9 no.spc
    • /
    • pp.131-148
    • /
    • 2003
  • This paper, conducted within the GB framework, investigates inversion phenomena in the functional categories, Focalization Phrases and Topicalization Phrases. The leading idea of this paper is that formal feature checking in these two functional categories is mostly responsible for inversion in which either verb or auxiliary verbs appear in front of subjects and also it will try to find an answer to the following questions: "What are the features that trigger the inversion?" and "Can all the inversion constructions explained by Haegeman's Focalization & Topicalization?" My discussion is largely based on English inversion constructions such as wh-inversion, negative inversion, and adverbial inversion. Also I will show there are some problems in Topicalization and Focalization analysis to explain some inversion constructions and present Rizzi(1999)'s analysis for those problems.

  • PDF

Chessboard and Pieces Detection for Janggi Chess Playing Robot

  • Nhat, Vo Quang;Lee, GueeSang
    • International Journal of Contents
    • /
    • v.9 no.4
    • /
    • pp.16-21
    • /
    • 2013
  • Vision system is an indispensable part of constructing the chess-playing robot. Chessboard detection and pieces localization in the captured image of robot's camera are important steps for processes followed such as pieces recognition, move calculation, and robot controlling. We present a method for detecting the Janggi chessboard and pieces based on the edge and color feature. Hough transform combined with line extraction is used for segmenting the chessboard and warping it to form the rectangle shape in order to detect and interpolate the lines of chessboard. Then we detect the existence of pieces and their side by applying the saliency map and checking the color distribution at piece locations. While other methods either work only with the empty chessboard or do not care about the piece existence, our method could detect sufficiently side and position of pieces as well as lines of the chessboard even if the occlusion happens.

Drowsiness Detection using Eye-blink Patterns (눈 깜박임 패턴을 이용한 졸음 검출)

  • Choi, Ki-Ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.10 no.2
    • /
    • pp.94-102
    • /
    • 2011
  • In this paper, a novel drowsiness detection algorithm using eye-blink pattern is proposed. The proposed drowsiness detection model using finite automata makes it easy to detect eye-blink, drowsiness and sleep by checking the number of input symbols standing for closed eye state only. Also it increases the accuracy by taking vertical projection histogram after locating the eye region using the feature of horizontal projection histogram, and minimizes the external effects such as eyebrows or black-framed glasses. Experimental results in eye-blinks detection using the JZU eye-blink database show that our approach achieves more than 93% precision and high performance.