• Title/Summary/Keyword: 이미지 개수

Search Result 164, Processing Time 0.021 seconds

A Study on the Effect of the Name Node and Data Node on the Big Data Processing Performance in a Hadoop Cluster (Hadoop 클러스터에서 네임 노드와 데이터 노드가 빅 데이터처리 성능에 미치는 영향에 관한 연구)

  • Lee, Younghun;Kim, Yongil
    • Smart Media Journal
    • /
    • v.6 no.3
    • /
    • pp.68-74
    • /
    • 2017
  • Big data processing processes various types of data such as files, images, and video to solve problems and provide insightful useful information. Currently, various platforms are used for big data processing, but many organizations and enterprises are using Hadoop for big data processing due to the simplicity, productivity, scalability, and fault tolerance of Hadoop. In addition, Hadoop can build clusters on various hardware platforms and handle big data by dividing into a name node (master) and a data node (slave). In this paper, we use a fully distributed mode used by actual institutions and companies as an operation mode. We have constructed a Hadoop cluster using a low-power and low-cost single board for smooth experiment. The performance analysis of Name node is compared through the same data processing using single board and laptop as name nodes. Analysis of influence by number of data nodes increases the number of data nodes by two times from the number of existing clusters. The effect of the above experiment was analyzed.

Analyzing the Modes of Mathematically Gifted Students' Visualization on the Duality of Regular Polyhedrons (다면체의 쌍대 탐구 과정에서 초등수학영재들이 보여주는 시각화 방법 분석)

  • Lee, Jin Soo;Song, Sang Hun
    • Journal of Elementary Mathematics Education in Korea
    • /
    • v.17 no.2
    • /
    • pp.351-370
    • /
    • 2013
  • The purpose of this study is to analyze the modes of visualization which appears in the process of thinking that mathematically gifted 6th grade students get to understand components of the three-dimensional shapes on the duality of regular polyhedrons, find the duality relation between the relations of such components, and further explore on whether such duality relation comes into existence in other regular polyhedrons. The results identified in this study are as follows: First, as components required for the process of exploring the duality relation of polyhedrons, there exist primary elements such as the number of faces, the number of vertexes, and the number of edges, and secondary elements such as the number of vertexes gathered at the same face and the number of faces gathered at the same vertex. Second, when exploring the duality relation of regular polyhedrons, mathematically gifted students solved the problems by using various modes of spatial visualization. They tried mainly to use visual distinction, dimension conversion, figure-background perception, position perception, ability to create a new thing, pattern transformation, and rearrangement. In this study, by investigating students' reactions which can appear in the process of exploring geometry problems and analyzing such reactions in conjunction with modes of visualization, modes of spatial visualization which are frequently used by a majority of students have been investigated and reactions relating to spatial visualization that a few students creatively used have been examined. Through such various reactions, the students' thinking in exploring three dimensional shapes could be understood.

  • PDF

Face Recognition using Eigenfaces and Fuzzy Neural Networks (고유 얼굴과 퍼지 신경망을 이용한 얼굴 인식 기법)

  • 김재협;문영식
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.3
    • /
    • pp.27-36
    • /
    • 2004
  • Detection and recognition of human faces in images can be considered as an important aspect for applications that involve interaction between human and computer. In this paper, we propose a face recognition method using eigenfaces and fuzzy neural networks. The Principal Components Analysis (PCA) is one of the most successful technique that have been used to recognize faces in images. In this technique the eigenvectors (eigenfaces) and eigenvalues of an image is extracted from a covariance matrix which is constructed form image database. Face recognition is Performed by projecting an unknown image into the subspace spanned by the eigenfaces and by comparing its position in the face space with the positions of known indivisuals. Based on this technique, we propose a new algorithm for face recognition consisting of 5 steps including preprocessing, eigenfaces generation, design of fuzzy membership function, training of neural network, and recognition. First, each face image in the face database is preprocessed and eigenfaces are created. Fuzzy membership degrees are assigned to 135 eigenface weights, and these membership degrees are then inputted to a neural network to be trained. After training, the output value of the neural network is intupreted as the degree of face closeness to each face in the training database.

Efficient Object Localization using Color Correlation Back-projection (칼라 상관관계 역투영법을 적용한 효율적인 객체 지역화 기법)

  • Lee, Yong-Hwan;Cho, Han-Jin;Lee, June-Hwan
    • Journal of Digital Convergence
    • /
    • v.14 no.5
    • /
    • pp.263-271
    • /
    • 2016
  • Localizing an object in image is a common task in the field of computer vision. As the existing methods provide a detection for the single object in an image, they have an utilization limit for the use of the application, due to similar objects are in the actual picture. This paper proposes an efficient method of object localization for image recognition. The new proposed method uses color correlation back-projection in the YCbCr chromaticity color space to deal with the object localization problem. Using the proposed algorithm enables users to detect and locate primary location of object within the image, as well as candidate regions can be detected accurately without any information about object counts. To evaluate performance of the proposed algorithm, we estimate success rate of locating object with common used image database. Experimental results reveal that improvement of 21% success ratio was observed. This study builds on spatially localized color features and correlation-based localization, and the main contribution of this paper is that a different way of using correlogram is applied in object localization.

Cluster Cell Separation Algorithm for Automated Cell Tracking (자동 세포 추적을 위한 클러스터 세포 분리 알고리즘)

  • Cho, Mi Gyung;Shim, Jaesool
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.37 no.3
    • /
    • pp.259-266
    • /
    • 2013
  • An automated cell tracking system is used to automatically analyze and track the changes in cell behavior in time-lapse cell images acquired using a microscope with a cell culture. Clustering is the partial overlapping of neighboring cells in the process of cell change. Separating clusters into individual cells is very important for cell tracking. In this study, we proposed an algorithm for separating clusters by using ellipse fitting based on a direct least square method. We extracted the contours of clusters, divided them into line segments, and then produced their fitted ellipses using a direct least square method for each line segment. All of the fitted ellipses could be used to separate their corresponding clusters. In experiments, our algorithm separated clusters with average precisions of 91% for two overlapping cells, 84% for three overlapping cells, and about 73% for four overlapping cells.

Research on the Development of an Integral Imaging System Framework and an Improved Viewpoint Vector Rendering Method Utilizing GPU (GPU를 이용한 개선된 뷰포인트 벡터 렌더링 방식의 집적영상시스템 프레임워크에 관한 연구)

  • Lee, Bin-Na-Ra;Park, Kyoung-Shin;Cho, Yong-Joo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.10
    • /
    • pp.1767-1772
    • /
    • 2006
  • Computer-generated integral imaging system is an auto-stereoscopic display system that users can see and feel the stereoscopic images when they see the pre-rendered elemental images through a lens array. The process of constructing elemental images using computer graphics is called image mapping. Viewpoint vector rendering (VVR) method is one of the image mapping algorithm specially designed for real-time graphics applications, which would not be affected by the size of the rendered objects or the number of elemental lenses used in the integral imaging system. This paper describes a new VVR framework which improved its rendering performance considerably. It also compares the previous VVR implementation with the new VVR work utilizing GPU and shows that newer implementation shows pretty big improvements over the old method.

Execution-based System and Its Performance Analysis for Detecting Malicious Web Pages using High Interaction Client Honeypot (고 상호작용 클라이언트 허니팟을 이용한 실행 기반의 악성 웹 페이지 탐지 시스템 및 성능 분석)

  • Kim, Min-Jae;Chang, Hye-Young;Cho, Seong-Je
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.12
    • /
    • pp.1003-1007
    • /
    • 2009
  • Client-side attacks including drive-by download target vulnerabilities in client applications that interact with a malicious server or process malicious data. A typical client-side attack is web-based one related to a malicious web page exploiting specific browser vulnerability that can execute mal ware on the client system (PC) or give complete control of it to the malicious server. To defend those attacks, this paper has constructed high interaction client honeypot system using Capture-HPC that adopts execution-based detection in virtual machine. We have detected and classified malicious web pages using the system. We have also analyzed the system's performance in terms of the number of virtual machine images and the number of browsers executed simultaneously in each virtual machine. Experimental results show that the system with one virtual machine image obtains better performance with less reverting overhead. The system also shows good performance when the number of browsers executed simultaneously in a virtual machine is 50.

Technique for Malicious Code Detection using Stacked Convolution AutoEncoder (적층 콘볼루션 오토엔코더를 활용한 악성코드 탐지 기법)

  • Choi, Hyun-Woong;Heo, Junyoung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.2
    • /
    • pp.39-44
    • /
    • 2020
  • Malicious codes cause damage to equipments while avoiding detection programs(vaccines). The reason why it is difficult to detect such these new malwares using the existing vaccines is that they use "signature-based" detection techniques. these techniques effectively detect already known malicious codes, however, they have problems about detecting new malicious codes. Therefore, most of vaccines have recognized these drawbacks and additionally make use of "heuristic" techniques. This paper proposes a technology to detecting unknown malicious code using deep learning. In addition, detecting malware skill using Supervisor Learning approach has a clear limitation. This is because, there are countless files that can be run on the devices. Thus, this paper utilizes Stacked Convolution AutoEncoder(SCAE) known as Semi-Supervisor Learning. To be specific, byte information of file was extracted, imaging was carried out, and these images were learned to model. Finally, Accuracy of 98.84% was achieved as a result of inferring unlearned malicious and non-malicious codes to the model.

Convolutional Neural Network Model Using Data Augmentation for Emotion AI-based Recommendation Systems

  • Ho-yeon Park;Kyoung-jae Kim
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.12
    • /
    • pp.57-66
    • /
    • 2023
  • In this study, we propose a novel research framework for the recommendation system that can estimate the user's emotional state and reflect it in the recommendation process by applying deep learning techniques and emotion AI (artificial intelligence). To this end, we build an emotion classification model that classifies each of the seven emotions of angry, disgust, fear, happy, sad, surprise, and neutral, respectively, and propose a model that can reflect this result in the recommendation process. However, in the general emotion classification data, the difference in distribution ratio between each label is large, so it may be difficult to expect generalized classification results. In this study, since the number of emotion data such as disgust in emotion image data is often insufficient, correction is made through augmentation. Lastly, we propose a method to reflect the emotion prediction model based on data through image augmentation in the recommendation systems.

Species-level Zooplankton Classifier and Visualization using a Convolutional Neural Network (합성곱 신경망을 이용한 종 수준의 동물플랑크톤 분류기 및 시각화)

  • Man-Ki Jeong;Ho Young Soh;Hyi-Thaek Ceong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.19 no.4
    • /
    • pp.721-732
    • /
    • 2024
  • Species identification of zooplankton is the most basic process in understanding the marine ecosystem and studying global warming. In this study, we propose an convolutional neural network model that can classify females and males of three zooplankton at the species level. First, training data including morphological features is constructed based on microscopic images acquired by researchers. In constructing training data, a data argumentation method that preserves morphological feature information of the target species is applied. Next, we propose a convolutional neural network model in which features can be learned from the constructed learning data. The proposed model minimized the information loss of training image in consideration of high resolution and minimized the number of learning parameters by using the global average polling layer instead of the fully connected layer. In addition, in order to present the generality of the proposed model, the performance was presented based on newly acquired data. Finally, through the visualization of the features extracted from the model, the key features of the classification model were presented.