• Title/Summary/Keyword: 편집 알고리즘

Search Result 153, Processing Time 0.031 seconds

Design of an Integrated Simulator for TCAS-II using SCADE (SCADE를 활용한 항공기 공중충돌회피시스템-II의 통합 시뮬레이터 설계)

  • Jun, Byung-Kyu;Lim, Sang-Seok
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.5
    • /
    • pp.630-638
    • /
    • 2009
  • In this paper, we propose a new SCADE-based integrated simulator for aircraft mid-air collision avoidance. The new simulator is designed to provide a convenient simulation environment for analyzing the limitations of the existing collision avoidance system(CAS) and for realizing more realistic collision environment into the CAS performance evaluation. Furthermore, we have developed a scenario editor for TCAS-II performance analysis to simulate actual flight environment which is difficult to experiment. The performance of the proposed simulator for typical collision scenarios is demonstrated by simulation using the proposed scenario editor.

  • PDF

Polygonal Model Simplification Method for Game Character (게임 캐릭터를 위한 폴리곤 모델 단순화 방법)

  • Lee, Chang-Hoon;Cho, Seong-Eon;Kim, Tai-Hoon
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.1
    • /
    • pp.142-150
    • /
    • 2009
  • It is very important to generate a simplified model from a complex 3D character in computer game. We propose a new method of extracting feature lines from a 3D game character. Given an unstructured 3D character model containing texture information, we use model feature map (MFM), which is a 2D map that abstracts the variation of texture and curvature in the 3D character model. The MFM is created from both a texture map and a curvature map, which are produced separately by edge-detection to locate line features. The MFM can be edited interactively using standard image-processing tools. We demonstrate the technique on several data sets, including, but not limited to facial character.

  • PDF

Reconstruction System of Road Environment using Image-based Modeling (이미지 기반 모델링을 이용한 도로환경 재구성 시스템)

  • Lee, Kye-Young;Lee, Yong-Jae;Shin, Yeong Gil
    • Journal of the Korea Computer Graphics Society
    • /
    • v.3 no.1
    • /
    • pp.17-22
    • /
    • 1997
  • This paper presents a new modeling technique to reconstruct road environments. The reconstruction algorithm for road environments consists of three parts - reconstructing 3D models of architectures in road environments, editing and creating road models, and modeling auxiliary objects. Different modeling technique is applied to each of these three parts according to properties objects to be modeled contain. In this reconstruction system, modified Photogrammetric Modeling techique is used, of which the user interface is more convenient, and in which constraints of road environments are considered. These improvements make this road environment reconstruction system much simpler and easier to use compared with Photogrammetric Modeling technique[1, 2].

  • PDF

Counterfeit Money Detection Algorithm based on Morphological Features of Color Printed Images and Supervised Learning Model Classifier (컬러 프린터 영상의 모폴로지 특징과 지도 학습 모델 분류기를 활용한 위변조 지폐 판별 알고리즘)

  • Woo, Qui-Hee;Lee, Hae-Yeoun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.12
    • /
    • pp.889-898
    • /
    • 2013
  • Due to the popularization of high-performance capturing equipments and the emergence of powerful image-editing softwares, it is easy to make high-quality counterfeit money. However, the probability of detecting counterfeit money to the general public is extremely low and the detection device is expensive. In this paper, a counterfeit money detection algorithm using a general purpose scanner and computer system is proposed. First, the printing features of color printers are calculated using morphological operations and gray-level co-occurrence matrix. Then, these features are used to train a support vector machine classifier. This trained classifier is applied for identifying either original or counterfeit money. In the experiment, we measured the detection rate between the original and counterfeit money. Also, the printing source was identified. The proposed algorithm was compared with the algorithm using wiener filter to identify color printing source. The accuracy for identifying counterfeit money was 91.92%. The accuracy for identifying the printing source was over 94.5%. The results support that the proposed algorithm performs better than previous researches.

Digital Camera Identification Based on Interpolation Pattern Used Lens Distortion Correction (디지털 카메라의 렌즈 왜곡 보정에 사용된 보간 패턴 추출을 통한 카메라 식별 방법)

  • Hwang, Min-Gu;Kim, Dong-Min;Har, Dong-Hwan
    • Journal of Internet Computing and Services
    • /
    • v.13 no.3
    • /
    • pp.49-59
    • /
    • 2012
  • Throughout developing digital technology, reproduction of image is growing better day by day. And at the same time, diverse image editing softwares are developed to manage images easily. In the process of editing images, those programs could delete or modify EXIF files which have the original image information; therefore images without the origin source are widely spread on the web site after editing. This matter could affect analysis of images due to the distortion of originality. Especially in the court of law, the source of evidence should be expressed clearly; therefore digital image EXIF file without deletion or distortion could not be the objective evidence. In this research, we try to trace the identification of a digital camera in order to solve digital images originality, and also we focus on lens distortion correction algorism which is used in digital image processing. Lens distortion correction uses mapping algorism, and at this moment it also uses interpolation algorism to prevent aliasing artifact and reconstruction artifact. At this point interpolation shows the similar mapping pattern; therefore we want to find out the interpolation evidence. We propose a minimum filter algorism in order to detect interpolation pattern and adjust the same minimum filter coefficient in two areas; one has interpolation and the second has no interpolation. Throughout DFT, we confirm frequency character between each area. Based on this result, we make the final detection map by using differences between two areas. In other words, thereby the area which has the interpolation caused by mapping is adjusted using minimum filter for detection algorism; the second area which has no interpolation tends to different frequency character.

X-tree Diff: An Efficient Change Detection Algorithm for Tree-structured Data (X-tree Diff: 트리 기반 데이터를 위한 효율적인 변화 탐지 알고리즘)

  • Lee, Suk-Kyoon;Kim, Dong-Ah
    • The KIPS Transactions:PartC
    • /
    • v.10C no.6
    • /
    • pp.683-694
    • /
    • 2003
  • We present X-tree Diff, a change detection algorithm for tree-structured data. Our work is motivated by need to monitor massive volume of web documents and detect suspicious changes, called defacement attack on web sites. From this context, our algorithm should be very efficient in speed and use of memory space. X-tree Diff uses a special ordered labeled tree, X-tree, to represent XML/HTML documents. X-tree nodes have a special field, tMD, which stores a 128-bit hash value representing the structure and data of subtrees, so match identical subtrees form the old and new versions. During this process, X-tree Diff uses the Rule of Delaying Ambiguous Matchings, implying that it perform exact matching where a node in the old version has one-to one corrspondence with the corresponding node in the new, by delaying all the others. It drastically reduces the possibility of wrong matchings. X-tree Diff propagates such exact matchings upwards in Step 2, and obtain more matchings downwsards from roots in Step 3. In step 4, nodes to ve inserted or deleted are decided, We aldo show thst X-tree Diff runs on O(n), woere n is the number of noses in X-trees, in worst case as well as in average case, This result is even better than that of BULD Diff algorithm, which is O(n log(n)) in worst case, We experimented X-tree Diff on reat data, which are about 11,000 home pages from about 20 wev sites, instead of synthetic documets manipulated for experimented for ex[erimentation. Currently, X-treeDiff algorithm is being used in a commeercial hacking detection system, called the WIDS(Web-Document Intrusion Detection System), which is to find changes occured in registered websites, and report suspicious changes to users.

IMToon: Image-based Cartoon Authoring System using Image Processing (IMToon: 영상처리를 활용한 영상기반 카툰 저작 시스템)

  • Seo, Banseok;Kim, Jinmo
    • Journal of the Korea Computer Graphics Society
    • /
    • v.23 no.2
    • /
    • pp.11-22
    • /
    • 2017
  • This study proposes IMToon(IMage-based carToon) which is an image-based cartoon authoring system using an image processing algorithm. The proposed IMToon allows general users to easily and efficiently produce frames comprising cartoons based on image. The authoring system is designed largely with two functions: cartoon effector and interactive story editor. Cartoon effector automatically converts input images into a cartoon-style image, which consists of image-based cartoon shading and outline drawing steps. Image-based cartoon shading is to receive images of the desired scenes from users, separate brightness information from the color model of the input images, simplify them to a shading range of desired steps, and recreate them as cartoon-style images. Then, the final cartoon style images are created through the outline drawing step in which the outlines of the shaded images are applied through edge detection. Interactive story editor is used to enter text balloons and subtitles in a dialog structure to create one scene of the completed cartoon that delivers a story such as web-toon or comic book. In addition, the cartoon effector, which converts images into cartoon style, is expanded to videos so that it can be applied to videos as well as still images. Finally, various experiments are conducted to verify the possibility of easy and efficient production of cartoons that users want based on images with the proposed IMToon system.

Development of Retargetable Hadoop Simulation Environment Based on DEVS Formalism (DEVS 형식론 기반의 재겨냥성 하둡 시뮬레이션 환경 개발)

  • Kim, Byeong Soo;Kang, Bong Gu;Kim, Tag Gon;Song, Hae Sang
    • Journal of the Korea Society for Simulation
    • /
    • v.26 no.4
    • /
    • pp.51-61
    • /
    • 2017
  • Hadoop platform is a representative storing and managing platform for big data. Hadoop consists of distributed computing system called MapReduce and distributed file system called HDFS. It is important to analyse the effectiveness according to the change of cluster constructions and several parameters. However, since it is hard to construct thousands of clusters and analyse the constructed system, simulation method is required to analyse the system. This paper proposes Hadoop simulator based on DEVS formalism which provides hierarchical and modular modeling. Hadoop simulator provides a retargetable experimental environment that is possible to change of various parameters, algorithms and models. It is also possible to design input models reflecting the characteristics of Hadoop applications. To maximize the user's convenience, the user interface, real-time model viewer, and input scenario editor are also provided. In this paper, we validate Hadoop Simulator through the comparison with the Hadoop execution results and perform various experiments.

Geometric LiveWire and Geometric LiveLane for 3D Meshes (삼차원 메쉬에 대한 기하학 라이브와이어와 기하학 라이브레인)

  • Yoo Kwan-Hee
    • The KIPS Transactions:PartA
    • /
    • v.12A no.1 s.91
    • /
    • pp.13-22
    • /
    • 2005
  • Similarly to the edges defined in a 2D image, we can define the geometric features representing the boundary of the distinctive parts appearing on 3D meshes. The geometric features have been used as basic primitives in several applications such as mesh simplification, mesh deformation, and mesh editing. In this paper, we propose geometric livewire and geometric livelane for extracting geometric features in a 3D mesh, which are the extentions of livewire and livelane methods in images. In these methods, approximate curvatures are adopted to represent the geometric features in a 3D mesh and the 3D mesh itself is represented as a weighted directed graph in which cost functions are defined for the weights of edges. Using a well-known shortest path finding algorithm in the weighted directed graph, we extracted geometric features in the 3D mesh among points selected by a user. In this paper, we also visualize the results obtained from applying the techniques to extracting geometric features in the general meshes modeled after human faces, cows, shoes, and single teeth.

Mobile Automatic Conversion System using MLP (다층신경망을 이용한 모바일 자동 변환 시스템)

  • Han, Eun-Jung;Jang, Chang-Hyuk;Jung, Kee-Chul
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.2
    • /
    • pp.272-280
    • /
    • 2009
  • The recent mobile industry is providing of a lot of image on/off-line contents are being converted into the mobile contents for architectural design. However, it is difficult to provide users with the existing on/off-line contents without any considerations due to the small size of the mobile screen. In existing methods to overcome the problem, the comic contents on mobile devices are manually produced by computer software such as Photoshop. In this paper, I describe the Automatic Comics Conversion(ACC) system that provides the variedly form of offline comic contents into mobile device of the small screen using Multi-Layer Perceptorn(MLP). ACC produces an experience together with the comic contents fitting for the small screen, which introduces a clustering method that is useful for variety types of comic images and characters as a prerequisite as a stage for preserving semantic meaning. An application is to use the frame form of pictures, website and images in order into mobile device the availability and can bounce back the freeze images contents into dynamic images content.

  • PDF