Korean | English

pISSN : 1598-849X / eISSN : 2383-9945

2020 KCI Impact Factor : 0.4
Home > Explore Content > All Issues > Article List

2014, Vol.19, No.7

  • 1.

    A New Clustering Method for Minimum Classification Error

    Heo Gyeongyong | Seong Hoon Kim | 2014, 19(7) | pp.1~8 | number of Cited : 1
    Abstract PDF
    Clustering is one of the most popular unsupervised learning methods, which is widely used toform clusters with homogeneous data. Clustering was used to extract contexts corresponding toclusters and a classification method was applied to each context or cluster individually. However,it is difficult to say that the unsupervised clustering is the best context forming method from theview of classification. In this paper, a new clustering method considering classification was proposed. The proposedmethod tries to minimize classification error in each cluster when a classification method is applied to each context locally. For this purpose, the proposed method adds constraints forcing two datapoints belong to the same class to have small distances, and two data points belong to differentclasses to have large distances in each cluster like in linear discriminant analysis. The usefulnessof the proposed method is confirmed by experimental results.
  • 2.

    A Parallel Memory Suitable for SIMD Architecture Processing High-Definition Image Haze Removal in High-Speed

    Lee Hyung | 2014, 19(7) | pp.9~16 | number of Cited : 0
    Abstract PDF
    Since the haze removal algorithm using dark channel prior was introduced, many researches forimproving processing speed have been addressed even if it presented impressive results. Remarkable one is using median dark channel prior. Although it has been considered as a veryattactive method, processing speed is as low as ever. So, a parallel memory model which is suitablefor SIMD architecture processing haze removal on high-definition images in high-speed is introduced in this paper. The proposed parallel memory model allows to access n pixelssimultaneously. It is also support stride 3, 5, 7, and 11 in order to execute convolution maskoperations, e.g., median filter. The proposed parallel memory model can therefore support enoughdata bandwidth to process the algorithm using median dark channel prior in high-speed.
  • 3.

    Distinction of Real Face and Photo using Stereo Vision

    shin jin seob | KIM HYUN JUNG | 원일용 | 2014, 19(7) | pp.17~25 | number of Cited : 0
    Abstract PDF
    In the devices that leave video records, it is an important issue to distinguish whether the inputimage is a real object or a photo when securing an identifying image. Using a single image andsensor, which is a simple way to distinguish the target from distance measurement has manyweaknesses. Thus, this paper proposes a way to distinguish a simple photo and a real object byusing stereo images. It is not only measures the distance to the target, but also checks athree-dimensional effect by making the depth map of the face area. They take pictures of thephotos and the real faces, and the measured value of the depth map is applied to the learningalgorithm. Exactly through iterative learning to distinguish between the real faces and the photoslooked for patterns. The usefulness of the proposed algorithm was verified experimentally.
  • 4.

    Analysis of the Film’s Promotional Website - Focus on Motion Graphic

    JangGeun Min | SangHoon Han | 2014, 19(7) | pp.27~35 | number of Cited : 0
    Abstract PDF
    Motion Graphic developed in the visual fields such as film and TV is widely used from the fieldsof arts such as applied paintings to interactive media such as web sites. In particular, MotionGraphic is actively used in the film’s promotion websites with the form of a mixture betweencharacteristics of visual media and characteristics of websites. In this study, we analyze the characteristics of film’s promotion websites, investigate previousstudies for Motion Graphic analysis. And present a model for the analysis of websites includingvisual elements, media elements and motion elements as main elements. We select some ofpromotion websites for films among 2013 domestic hot films, carry out a case analysis, and present the direction of development on the base of the results.
  • 5.

    The Design and An Implementation of effective algorithms Effect Based on XNA Game Development Environment

    Seo Jeong-Man | 최창수 | 2014, 19(7) | pp.37~46 | number of Cited : 2
    Abstract PDF
    In this paper, by using Visual C # XNA game development application relates to a technique. This paper proposes the design and an implement effective algorithms Effect Based on XNA GameDevelopment Environment. Existing in the development of the game using Directx C++ gamedevelopers, game development, it is necessary to position a lot of the source code. Particularlyeffective effect was much difficulty in the processing section. However, to eliminate this difficultywas proposed in the paper. The possibility of developing the game in XNA-based group. For the superiority of the proposed paper and the comparative analysis of existing games were designed forthe development of the game was. The future study will be the design of various effects and eventswhich give more immersive game implementation.
  • 6.

    An Implementation Strategy for the Physical Security Threat Meter Using Information Technology

    Koohong Kang | 2014, 19(7) | pp.47~57 | number of Cited : 2
    Abstract PDF
    In order to publicly notify the information security (Internet or Cyber) threat level, the securitycompanies have developed the Threat Meters. As the physical security devices are getting moreintelligent and can be monitored and managed through networks, we propose a physical securitythreat meter (PSTM) to determine the current threat level of physical security; that is a verysimilar compared with the one of information security. For this purpose, we investigate andprioritize the physical security events, and consider the impact of temporal correlation amongmultiple security events. We also present how to determine the threshold values of threat levels, and then propose a practical PSTM using the threshold based decision. In particular, we show thatthe proposed scheme is fully implementable through showing the block diagram in detail and thewhole implementation processes with the access controller and CCTV+video analyzer system. Finally the simulation results show that the proposed PSTM works perfectly under some testscenarios.
  • 7.

    A Domain-based Reactive Routing Protocol for the Hybrid WMN

    Kim, Ho-Cheal | 2014, 19(7) | pp.59~70 | number of Cited : 0
    Abstract PDF
    This paper propose a new wireless multi-hop routing protocol that takes the hierarchical meshof the hybrid WMN into account. WMN that is possible to provide various applications of wirelessnetworks still has many open issues that should be solved despite the studies carried out over adecade. Especially, in routing protocol area, a problem degrading the routing efficiency byapplying one of the routing protocols, which are designed for the MANET, to the hybrid WMN besolved above all. For the improvement of the routing performance, both good routing protocol and metric are essential. However, the recent studies are only concentrated in routing metric by use ofthe cross-layer design. Therefore, this paper is dedicated to the routing protocol that is essentialfor the performance of the routing but needed more studies. The proposed protocol in this paper isreactive, and designed to reorganize the hybrid WMN with several pseudo domains, and carry outdomain-based route decision. By the simulation result for the performance analysis of the proposedprotocol, the average delay for the route decision was decreased by 43% compared to AODV that isthe typical reactive protocol.
  • 8.

    A 2kβ Algorithm for Euler function φ(n) Decryption of RSA

    Sang-Un, Lee | 2014, 19(7) | pp.71~76 | number of Cited : 0
    Abstract PDF
    There is to be virtually impossible to solve the very large digits of prime number p and q fromcomposite number n=pq using integer factorization in typical public-key cryptosystems, RSA. When the public key e and the composite number n are known but the private key d remainsunknown in an asymmetric-key RSA, message decryption is carried out by first obtaining φ(n)=(p-1)(q-1)=n+1-(p+q) and then using a reverse function of d=e-¹(modn)). Integerfactorization from n to p,q is most widely used to produce φ(n), which has been regarded asmathematically hard. Among various integer factorization methods, the most popularly used is thecongruence of squares of a² ≡b²(modn), a=(p+q)/2, b=(q-p)/2 which is more commonly used then n/p=q trial division. Despite the availability of a number of congruence of scares methods,however, many of the RSA numbers remain unfactorable. This paper thus proposes an algorithmthat directly and immediately obtains φ(n). The proposed algorithm computes 2kβj≡2t(modn), 0≤ i ≤ γ-1,k=1,2,⋯or 2kβj=2βj for 2j≡βj(modn),2 γ-1<n<2γ, j=γ-1,γ,γ+1 to obtain thesolution. It has been found to be capable of finding an arbitrarily located φ(n) in a range of n-10 ⌊√2⌋< φ(n) ≤ n-2⌊√2⌋ much more efficiently than conventional algorithms.
  • 9.

    A Realtime Malware Detection Technique Using Multiple Filter

    박재경 | 2014, 19(7) | pp.77~85 | number of Cited : 4
    Abstract PDF
    Recently, several environment damage caused by malicious or suspicious code is increasing. Westudy comprehensive response system actively for malware detection. Suspicious code is installedon your PC without your consent, users are unaware of the damage. Also, there are need totechnology for realtime processing of Big Data. We must develope advanced technology for malwaredetection. We must analyze the static, dynamic of executable file for fundamentally malwaredetection in recently and verified by a reputation for verification. It is need to judgment ofsimilarity for realtime response with big data. In this paper, we proposed realtime detection andverification technology using multiple filter. Our malware study suggests a new direction ofrealtime malware detection.
  • 10.

    A Study on Definitions of Security Requirements for Identification and Authentication on the Step of Analysis

    SeongYoon Shin | 2014, 19(7) | pp.87~93 | number of Cited : 2
    Abstract PDF
    In analysis as the first step of S/W development, security requirements of identification andauthentication, ID and password management, authentication process, authentication method, ete. should be defined. Identification is to uniquely identify certain users and applications running ona certain system. Authentication means the function to determine true or false users andapplications in some cases. This paper is to suggest the security requirements for identificationand authentication in analysis step. Firstly, individual ID should be uniquely identified. Thesecond element is to apply the length limitations, combination and periodic changes of passwords. The third should require the more reinforced authentication methods besides ID and passwords and satisfy the defined security elements on authentication process. In this paper, the securityrequirements for the step of identification and authentication have been explained through severalpractical implementation methods.
  • 11.

    An Efficient Dynamic Workload Balancing Strategy Design of the Wireless Reading/Management System for the Corrosion Monitoring of Underground Structures

    권용광 | 2014, 19(7) | pp.95~102 | number of Cited : 0
    Abstract PDF
    There are a variety of structures below the surface are buried. In particular, if It is experiencingproblems in the city gas pipe or electrical wire, our safety would be greatly jeopardized. Therefore,the underground structures which encounter a variety of pollutants are highly sensitive tocorrosion. So if you are not identify the degree of corrosion, it can lead to large accidents such asgas leakage. Until now, person visit directly every underground structure to measure and recordmanually, but This approach requires a lot of human and material resources and the continuity of management. Therefore, the research to find out the risk factors quickly via the continuousmanagement is needed, and in this paper the structures management systems in the vehicle beingmoved by combining ICT underground structures for state information wirelessly collects andanalyzes system is proposed.
  • 12.

    A Point-to-Point Shortest Path Search Algorithm in an Undirected Graph Using Minimum Spanning Tree

    Sang-Un, Lee | 2014, 19(7) | pp.103~111 | number of Cited : 1
    Abstract PDF
    This paper proposes a modified algorithm that improves on Dijkstra’s algorithm by applying it topurely two-way traffic paths, given that a road where bi-directional traffic is made possible shallbe considered as an undirected graph. Dijkstra’s algorithm is the most generally utilized form ofshortest-path search mechanism in GPS navigation system. However, it requires a large amount ofmemory for execution for it selects the shortest path by calculating distance between the starting node and every other node in a given directed graph. Dijkstra’s algorithm, therefore, mayoccasionally fail to provide real-time information on the shortest path. To rectify theaforementioned shortcomings of Dijkstra’s algorithm, the proposed algorithm creates conditionsfavorable to the undirected graph. It firstly selects the shortest path from all path vertices exceptfor the starting and destination vertices. It later chooses all vertex-outgoing edges that coincidewith the shortest path setting edges so as to simultaneously explore various vertices. When testedon 9 different undirected graphs, the proposed algorithm has not only successfully found theshortest path in all, but did so by reducing the time by 60% and requiring less memory.
  • 13.

    BLOCS: Block Correlation Aware Sequential Pattern Mining based Caching Algorithm for Hybrid Storages

    Lee, Seong-jin | Youjip Won | 2014, 19(7) | pp.113~130 | number of Cited : 0
    Abstract PDF
    In this paper, we propose BLOCS algorithm to find sequence of data that should be saved incache device of hybrid storage system which uses SSD as a cache device. BLOCS algorithm whichuses a sequence pattern mining scheme, creates a set of frequently requested sectors with respectto requested order of sectors. To compare the performance of the proposed scheme, we introduce Distance (DIST) based scheme, Request Frequency (FREQ) based scheme, and Frequency timesSize (F-S) based scheme. We measure the hit ratio and I/O latency of different caching schemesusing hybrid storage caching simulator. We acquired booting workload along with ten scenarios oflaunching applications and use the workloads as input to the cache simulator. After experimentwith booting workload, we find that BLOCS scheme gives hit ratio of 61% which is about 15%higher than the least performing DIST scheme.
  • 14.

    An Efficient Implementation of Kruskal's Algorithm for A Minimum Spanning Tree

    Lee Ju-Young | 2014, 19(7) | pp.131~140 | number of Cited : 1
    Abstract PDF
    In this paper, we present an efficient implementation of Kruskal's algorithm to obtain aminimum spanning tree. The proposed method utilizes the union-find data structure, reducing thedepth of the tree of the node set by making the nodes in the path to root be the child node of theroot of combined tree. This method can reduce the depth of the tree by shortening the path to theroot and lowering the level of the node. This is an efficient method because if the tree's depthreduces, it could shorten the time of finding the root of the tree to which the node belongs. Theperformance of the proposed method is evaluated through the graphs generated randomly. Theresults showed that the proposed method outperformed the conventional method in terms of thedepth of the tree.
  • 15.

    Development of Video Watermark System for Low-specification System as Android Platforms

    황선철 | 2014, 19(7) | pp.141~149 | number of Cited : 1
    Abstract PDF
    This paper describes a method to insert and detect watermark or fingerprint to/from videos inlow-computing powered system as Android platforms. Fingerprint, which is a kind of watermark,has features such as patterns that contain information. The inserting frame numbers invideo-stream and the positions in a picture were chosen from the encrypted user ID to insert the watermarks. The used encrypt algorithm is the HIGHT algorithm which was developed forlow-computing powered systems by KISA(Korean Internet & Security Agency). Subtracting aninferred picture from the previous picture was used to extract a candidate feature. Median filteringwas used to get rid of noise and stabilize the candidate feature. New algorithm that reducescalculating steps of the median filtering was developed and applied for low-specification systems. The stabilized features were accumulated over 150 times and calculated by correlation coefficientmethod to recognize the patterns. We examined 22 videos and successfully detected the patternsfrom 21 videos. The correlation coefficient r values that we examined through this study exceededover 0.79 more than the threshold (0.7).
  • 16.

    A study on the Necessity of the Death Penalty in the Information Society -Focused on the misjudgement cases-

    이동명 | 2014, 19(7) | pp.151~159 | number of Cited : 1
    Abstract PDF
    Sometimes, the misjudgement of imperfect human can not be avoided because capitalpunishment is decided by a judicial officer, human. Dreiinstanzen system has been adopted toprevent misjudgement. However the possibility of misjudgement can not be entirely excluded in thejudgement by a judicial officer as the judgement of a lower court and a higher tribunal depends on the specific criminal cases. And in case of capital punishment executed by misjudgement, it leadsto a cruelty result which has not ways to recover the damage. There is an opinion thatdangerousness of misjudgement is lacking in persuasiveness because of insufficient demonstrationfor the abolition of capital punishment. However, also, there is an opinion that the abolition ofcapital punishment in case of misjudgement is persuasive with reality. In this case, even if otherpunishments are discussed separately, once capital punishment is executed, it can be irrevocableunjustice because a nation itself commits a crime. According to this, I would like to find out causesof misjudgement in the criminal justice system through the cases of advanced countries, such asUnited states, Japan, which are rich in studies and case analysis related to misjudgement, andintroduce their efforts to prevent misjudgement in this paper.