• 제목/요약/키워드: Merging Algorithm

검색결과 296건 처리시간 0.027초

Robust surface segmentation and edge feature lines extraction from fractured fragments of relics

  • Xu, Jiangyong;Zhou, Mingquan;Wu, Zhongke;Shui, Wuyang;Ali, Sajid
    • Journal of Computational Design and Engineering
    • /
    • 제2권2호
    • /
    • pp.79-87
    • /
    • 2015
  • Surface segmentation and edge feature lines extraction from fractured fragments of relics are essential steps for computer assisted restoration of fragmented relics. As these fragments were heavily eroded, it is a challenging work to segment surface and extract edge feature lines. This paper presents a novel method to segment surface and extract edge feature lines from triangular meshes of irregular fractured fragments. Firstly, a rough surface segmentation is accomplished by using a clustering algorithm based on the vertex normal vector. Secondly, in order to differentiate between original and fracture faces, a novel integral invariant is introduced to compute the surface roughness. Thirdly, an accurate surface segmentation is implemented by merging faces based on face normal vector and roughness. Finally, edge feature lines are extracted based on the surface segmentation. Some experiments are made and analyzed, and the results show that our method can achieve surface segmentation and edge extraction effectively.

Progress Report : Quantifying and Classifying Peculiarity of Cluster Galaxies

  • 오슬희;이석영;신윤경;경재만;성언창;;김민진;박병곤
    • 천문학회보
    • /
    • 제38권1호
    • /
    • pp.42.1-42.1
    • /
    • 2013
  • In the LCDM paradigm, hierarchical merging is thought to play a key role in the formation and evolution of massive galaxies. Theoretical and observational studies suggest that massive galaxies started forming at high redshifts and were assembled via numerous mergers. Galaxy clusters are the sites where the most massive galaxies are found and the most dramatic merger histories are embedded. The previous work of Sheen et al. (2012) identified via visual inspection many massive galaxies with merger features in clusters, which surprised the community. In this study we aim to quantify peculiarity of galaxies to pin down the merger frequency in cluster environments more objectively. We have performed optical deep imaging of 4 Abell clusters by using IMACS f/2 on a Magellan Badde 6.5-m telescope. For the galaxies in our data, we applied GALFIT algorithm, which fits analytic models to galaxy data, and we analyzed their residuals. We present the preliminary results of our sample galaxies.

  • PDF

An Optimized Approach of Fault Distribution for Debugging in Parallel

  • Srivasatav, Maneesha;Singh, Yogesh;Chauhan, Durg Singh
    • Journal of Information Processing Systems
    • /
    • 제6권4호
    • /
    • pp.537-552
    • /
    • 2010
  • Software Debugging is the most time consuming and costly process in the software development process. Many techniques have been proposed to isolate different faults in a program thereby creating separate sets of failing program statements. Debugging in parallel is a technique which proposes distribution of a single faulty program segment into many fault focused program slices to be debugged simultaneously by multiple debuggers. In this paper we propose a new technique called Faulty Slice Distribution (FSD) to make parallel debugging more efficient by measuring the time and labor associated with a slice. Using this measure we then distribute these faulty slices evenly among debuggers. For this we propose an algorithm that estimates an optimized group of faulty slices using as a parameter the priority assigned to each slice as computed by value of their complexity. This helps in the efficient merging of two or more slices for distribution among debuggers so that debugging can be performed in parallel. To validate the effectiveness of this proposed technique we explain the process using example.

컬러영상에서 Mean-Shift 군집화와 단계별 병합 방법을 이용한 자동 원료 선별 알고리즘 (Automatic Source Classification Algorithm using Mean-Shift Clustering and stepwise merging in Color Image)

  • 김상준;장지현;고병철
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2015년도 추계학술발표대회
    • /
    • pp.1597-1599
    • /
    • 2015
  • 본 논문에서는 곡물이나 광석 등의 원료들 중에서 양품 및 불량품을 검출하기 위해, Color CCD 카메라로 촬영한 원료영상에서 Mean-Shift 클러스터링 알고리즘과 단계별 병합 방법을 제안하고 있다. 먼저 원료 학습 영상에서 배경을 제거하고 영상 색 분포정도를 기준으로 모폴로지를 이용하여 영상의 전경맵을 얻는다. 전경맵 영상에 대해서 Mean-Shift 군집화 알고리즘을 적용하여 영상을 N개의 군집으로 나누고, 단계별로 위치 근접성, 색상대푯값 유사성을 비교하여 비슷한 군집끼리 통합한다. 이렇게 통합된 원료 객체는 영상채널마다의 연관관계를 반영할 수 있도록 RG/GB/BR의 2차원 컬러분포도로 표현한다. 원료 객체별로 변환된 2차원 컬러 분포도에서 분포의 주성분의 기울기와 타원들을 생성한다. 객체별 분포 타원은 테스트 원료 영상데이터에서 양품과 불량품을 검출하는 임계값이 된다. 본 논문에서 제안한 방법으로 다양한 원료영상에 실험한 결과, 기존 선별방식에 비해 사용자의 인위적 조작이 적고 정확한 원료 선별 결과를 얻을 수 있었다.

Block Unit Mapping Technique of NAND Flash Memory Using Variable Offset

  • Lee, Seung-Woo;Ryu, Kwan-Woo
    • 한국컴퓨터정보학회논문지
    • /
    • 제24권8호
    • /
    • pp.9-17
    • /
    • 2019
  • In this paper, we propose a block mapping technique applicable to NAND flash memory. In order to use the NAND flash memory with the operating system and the file system developed on the basis of the hard disk which is mainly used in the general PC field, it is necessary to use the system software known as the FTL (Flash Translation Layer). FTL overcomes the disadvantage of not being able to overwrite data by using the address mapping table and solves the additional features caused by the physical structure of NAND flash memory. In this paper, we propose a new mapping method based on the block mapping method for efficient use of the NAND flash memory. In the case of the proposed technique, the data modification operation is processed by using a blank page in the existing block without using an additional block for the data modification operation, thereby minimizing the block unit deletion operation in the merging operation. Also, the frequency of occurrence of the sequential write request and random write request Accordingly, by optimally adjusting the ratio of pages for recording data in a block and pages for recording data requested for modification, it is possible to optimize sequential writing and random writing by maximizing the utilization of pages in a block.

Evolutionary-base finite element model updating and damage detection using modal testing results

  • Vahidi, Mehdi;Vahdani, Shahram;Rahimian, Mohammad;Jamshidi, Nima;Kanee, Alireza Taghavee
    • Structural Engineering and Mechanics
    • /
    • 제70권3호
    • /
    • pp.339-350
    • /
    • 2019
  • This research focuses on finite element model updating and damage assessment of structures at element level based on global nondestructive test results. For this purpose, an optimization system is generated to minimize the structural dynamic parameters discrepancies between numerical and experimental models. Objective functions are selected based on the square of Euclidean norm error of vibration frequencies and modal assurance criterion of mode shapes. In order to update the finite element model and detect local damages within the structural members, modern optimization techniques is implemented according to the evolutionary algorithms to meet the global optimized solution. Using a simulated numerical example, application of genetic algorithm (GA), particle swarm (PSO) and artificial bee colony (ABC) algorithms are investigated in FE model updating and damage detection problems to consider their accuracy and convergence characteristics. Then, a hybrid multi stage optimization method is presented merging advantages of PSO and ABC methods in finding damage location and extent. The efficiency of the methods have been examined using two simulated numerical examples, a laboratory dynamic test and a high-rise building field ambient vibration test results. The implemented evolutionary updating methods show successful results in accuracy and speed considering the incomplete and noisy experimental measured data.

GF($2^m$)상에서 디지트 단위 모듈러 곱셈/제곱을 위한 시스톨릭 구조 (Systolic Architecture for Digit Level Modular Multiplication/Squaring over GF($2^m$))

  • 이진호;김현성
    • 정보보호학회논문지
    • /
    • 제18권1호
    • /
    • pp.41-47
    • /
    • 2008
  • 본 논문에서는 유한 필드 GF($2^m$)상에서 모듈러 곱셈과 제곱을 동시에 수행하는 새로운 디지트 단위 LSB-우선 시스톨릭 구조를 제안한다. 디지트의 크기를 L이라고 할 경우, $L{\times}L$ 크기의 디지트 구조로 유도하기 위하여 기존의 곱셈과 제곱을 동시에 수행하는 알고리즘을 사용하고, 그 알고리즘에서 유도된 구조의 각 셀을 분리하고 인덱스 변환시킨 후 병합하는 방법을 사용한다. 본 논문에서 제안된 구조는 암호 프로세서를 위한 기본 구조로 이용될 수 있고, 단순성, 규칙성, 병렬성으로 인해 VLSI 구현에 적합하다.

Lightweight high-precision pedestrian tracking algorithm in complex occlusion scenarios

  • Qiang Gao;Zhicheng He;Xu Jia;Yinghong Xie;Xiaowei Han
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권3호
    • /
    • pp.840-860
    • /
    • 2023
  • Aiming at the serious occlusion and slow tracking speed in pedestrian target tracking and recognition in complex scenes, a target tracking method based on improved YOLO v5 combined with Deep SORT is proposed. By merging the attention mechanism ECA-Net with the Neck part of the YOLO v5 network, using the CIoU loss function and the method of CIoU non-maximum value suppression, connecting the Deep SORT model using Shuffle Net V2 as the appearance feature extraction network to achieve lightweight and fast speed tracking and the purpose of improving tracking under occlusion. A large number of experiments show that the improved YOLO v5 increases the average precision by 1.3% compared with other algorithms. The improved tracking model, MOTA reaches 54.3% on the MOT17 pedestrian tracking data, and the tracking accuracy is 3.7% higher than the related algorithms and The model presented in this paper improves the FPS by nearly 5 on the fps indicator.

한글 모음의 구조적 특징을 이용한 문자영역 검출 기법 (Character Region Detection Using Structural Features of Hangul Vowel)

  • 박종천;이근왕;박형근
    • 한국산학기술학회논문지
    • /
    • 제13권2호
    • /
    • pp.872-877
    • /
    • 2012
  • 본 논문은 한글 모음의 구조적 특징을 이용하여 자연영상에 포함된 한글 문자영역을 검출하는 기법을 제안하였다. 자연 영상을 명도영상으로 변환하고 에지 및 연결요소 기반 방법으로 특징값을 추출하며, 추출된 특징값은 필터링을 수행하여 한글 문자의 특징에 맞지 않는 특징값을 제거하여 한글 문자영역 병합을 위한 후보를 선정한다. 선정된 후보 특징값은 한글 자소 병합 알고리즘으로 하나의 문자로 병합하여 후보 문자영역으로 검출하고, 한글 문자 유형 판별 알고리즘으로 한글 문자영역 여부를 판별함으로서 최종적인 한글 문자영역을 검출한다. 실험결과, 복잡한 배경을 갖고 다양한 환경에서 촬영된 영상에서 한글 문자영역을 효과적으로 검출하였고, 제안한 문자영역 검출 방법은 향상된 검출 결과를 보여 주었다.

자연영상에서 한글 및 영문자의 구조적 특징을 이용한 문자영역 검출 (Character Region Detection Using Structural Features of Hangul & English Characters in Natural Image)

  • 오명관;박종천
    • 한국산학기술학회논문지
    • /
    • 제15권3호
    • /
    • pp.1718-1723
    • /
    • 2014
  • 본 논문은 한글 및 영문자의 구조적 특징을 이용하여 자연영상에서 문자영역을 검출하는 기법을 제안하였다. 자연 영상에서 에지 특징 값을 추출하고 추출된 특징 값은 필터링을 수행하여 문자의 특징에 맞지 않는 특징 값을 제거하여 문자영역 후보를 선정한다. 선정된 문자영역 후보는 한글 자소 병합 알고리즘으로 하나의 문자로 병합하여 후보 문자영역으로 검출하고, 한글 문자 유형 판별 알고리즘으로 한글 문자영역 여부를 판별함으로서 한글 문자영역을 검출하고, 영문자는 영문자 에지 특징 값을 적용하여 영문자 영역을 검출한다. 실험결과, 복잡한 배경을 갖고 다양한 환경에서 촬영된 영상에서 한글 및 영문자 영역을 효과적으로 검출하였고, 제안한 문자영역 검출 방법은 향상된 검출 결과를 보여 주었다.