• 제목/요약/키워드: Pattern Processing

검색결과 2,352건 처리시간 0.025초

레이저 파면 획득용 Lenslet Array 점 패턴 검출 알고리즘 (Detection Algorithm of Lenslet Array Spot Pattern for Acquisition of Laser Wavefront)

  • 이재일;이영철;허준
    • 한국군사과학기술학회지
    • /
    • 제8권4호
    • /
    • pp.110-119
    • /
    • 2005
  • In this paper, a new detection algorithm was proposed for finding the position of lenslet array spot pattern used to acquire laser wavefront. Based on the analysis of the required signal processing characteristics, we categorized into and designed four main signal processing functions. The proposed was designed in order to have robust feature against a variation of geometrical form of the spot and also implemented to have semi-automatic thresholding capability based on CCD noise analysis. For performance evaluation, we made qualitative and quantitative comparisons with Carvalho's algorithm which has been published in recent. In the given experimental spot images, the proposed could detect the spots which has 1/3 times lower than the least S/N of which Carvalho's can detect and could reach to a detection precision of 0.1 pixel at the S/N. In functional aspect, the proposed could separate all valid spots locally. From these results, the proposed could have a superior precision of location detection of spot pattern in wider S/N range.

전수받은 값을 이용한 조합회로에 대한 검사 패턴 발생 (Test Pattern Generation for Combinational Circuits using Inherited Values)

  • 송상훈
    • 한국정보처리학회논문지
    • /
    • 제4권2호
    • /
    • pp.606-615
    • /
    • 1997
  • 본 논문은 효과적인 검사 패턴 발생 방법을 제안한다. 기존의 검사 패턴 발생 방법 들은 고장 $F_{i+l}$에 대한 검사 패턴 발생을 고장 F1,F2....,Fi들에 대한 검사 패턴 발생시 행한 계산과는 독립적으로 행하게 된다. 제안된 방법에서는 고장 Fi에 대한 검사벡터를 전수받아 고장$F_{i+l}$에 대한 검사벡터를 발생한다. 전수받은 값을 점차로 바꾸어 나가 면서 새로운 검사벡터가 발생된다. 전수받은 값은 부분적으로 고장 신호를 활성화하고 이 고장 신호를 전파시키기도 한다. 보통 이들은 다음 탈식과정에서 결정단계의 수와 회귀 의 수를 감소 시킨다. 잘로서 알려진 벤치마크 회로에 대한 실험 결과는 낮은 회귀한계 에서 매우 효과적임을 보여주고, 다른 알고리즘과 병합시키면 임의의 회귀한계에서도 매우 효과적임음을 보여 준다.

  • PDF

Using an Adaptive Search Tree to Predict User Location

  • Oh, Se-Chang
    • Journal of Information Processing Systems
    • /
    • 제8권3호
    • /
    • pp.437-444
    • /
    • 2012
  • In this paper, we propose a method for predicting a user's location based on their past movement patterns. There is no restriction on the length of past movement patterns when using this method to predict the current location. For this purpose, a modified search tree has been devised. The search tree is constructed in an effective manner while it additionally learns the movement patterns of a user one by one. In fact, the time complexity of the learning process for a movement pattern is linear. In this process, the search tree expands to take into consideration more details about the movement patterns when a pattern that conflicts with an existing trained pattern is found. In this manner, the search tree is trained to make an exact matching, as needed, for location prediction. In the experiments, the results showed that this method is highly accurate in comparison with more complex and sophisticated methods. Also, the accuracy deviation of users of this method is significantly lower than for any other methods. This means that this method is highly stable for the variations of behavioral patterns as compared to any other method. Finally, 1.47 locations were considered on average for making a prediction with this method. This shows that the prediction process is very efficient.

LBP and DWT Based Fragile Watermarking for Image Authentication

  • Wang, Chengyou;Zhang, Heng;Zhou, Xiao
    • Journal of Information Processing Systems
    • /
    • 제14권3호
    • /
    • pp.666-679
    • /
    • 2018
  • The discrete wavelet transform (DWT) has good multi-resolution decomposition characteristic and its low frequency component contains the basic information of an image. Based on this, a fragile watermarking using the local binary pattern (LBP) and DWT is proposed for image authentication. In this method, the LBP pattern of low frequency wavelet coefficients is adopted as a feature watermark, and it is inserted into the least significant bit (LSB) of the maximum pixel value in each block of host image. To guarantee the safety of the proposed algorithm, the logistic map is applied to encrypt the watermark. In addition, the locations of the maximum pixel values are stored in advance, which will be used to extract watermark on the receiving side. Due to the use of DWT, the watermarked image generated by the proposed scheme has high visual quality. Compared with other state-of-the-art watermarking methods, experimental results manifest that the proposed algorithm not only has lower watermark payloads, but also achieves good performance in tamper identification and localization for various attacks.

Automatic In-Text Keyword Tagging based on Information Retrieval

  • Kim, Jin-Suk;Jin, Du-Seok;Kim, Kwang-Young;Choe, Ho-Seop
    • Journal of Information Processing Systems
    • /
    • 제5권3호
    • /
    • pp.159-166
    • /
    • 2009
  • As shown in Wikipedia, tagging or cross-linking through major keywords in a document collection improves not only the readability of documents but also responsive and adaptive navigation among related documents. In recent years, the Semantic Web has increased the importance of social tagging as a key feature of the Web 2.0 and, as its crucial phenotype, Tag Cloud has emerged to the public. In this paper we provide an efficient method of automated in-text keyword tagging based on large-scale controlled term collection or keyword dictionary, where the computational complexity of O(mN) - if a pattern matching algorithm is used - can be reduced to O(mlogN) - if an Information Retrieval technique is adopted - while m is the length of target document and N is the total number of candidate terms to be tagged. The result shows that automatic in-text tagging with keywords filtered by Information Retrieval speeds up to about 6 $\sim$ 40 times compared with the fastest pattern matching algorithm.

고온 임프린팅을 통한 알루미늄합금 표면의 마이크로/나노 구조 성형 기술 (Hot Imprinted Hierarchical Micro/Nano Structures on Aluminum Alloy Surfaces)

  • 문인용;이호원;오영석;김세종;김지훈;강성훈
    • 소성∙가공
    • /
    • 제28권5호
    • /
    • pp.239-246
    • /
    • 2019
  • Various surface texturing techniques have been studied because of the effective applicability of micro or nano scale surface patterns. Particularly, the most promising types of patterns include the hierarchical patterns, which consists of micro/nano structures. Different processes such as MEMS, laser machining, micro cutting and micro grinding have been applied in the production of hierarchical patterns on various material surfaces. This study demonstrates the process of hot imprinting to induce the hierarchical patterns on the Al alloy surfaces. Wire electrical discharge machining (WEDM) process was used to imprint molds with micro scale sinusoidal pattern. In addition, the sinusoidal pattern with rough surface morphology was obtained as a result of the discharge craters. Consequently, the hierarchical patterns consisting of the sinusoidal pattern and the discharge craters were prepared on the imprinting mold surface. Hot imprinting process for the Al plates was conducted on the prepared mold, and the replication performance was analyzed. As a result, it was confirmed that the hierarchical patterns of the mold were effectively duplicated on the surface of Al plate.

Shape Description and Retrieval Using Included-Angular Ternary Pattern

  • Xu, Guoqing;Xiao, Ke;Li, Chen
    • Journal of Information Processing Systems
    • /
    • 제15권4호
    • /
    • pp.737-747
    • /
    • 2019
  • Shape description is an important and fundamental issue in content-based image retrieval (CBIR), and a number of shape description methods have been reported in the literature. For shape description, both global information and local contour variations play important roles. In this paper a new included-angular ternary pattern (IATP) based shape descriptor is proposed for shape image retrieval. For each point on the shape contour, IATP is derived from its neighbor points, and IATP has good properties for shape description. IATP is intrinsically invariant to rotation, translation and scaling. To enhance the description capability, multiscale IATP histogram is presented to describe both local and global information of shape. Then multiscale IATP histogram is combined with included-angular histogram for efficient shape retrieval. In the matching stage, cosine distance is used to measure shape features' similarity. Image retrieval experiments are conducted on the standard MPEG-7 shape database and Swedish leaf database. And the shape image retrieval performance of the proposed method is compared with other shape descriptors using the standard evaluation method. The experimental results of shape retrieval indicate that the proposed method reaches higher precision at the same recall value compared with other description method.

3D 프린팅을 이용한 3차원 채움 패턴의 중량과 출력시간을 고려한 인장강도 연구 (A Study on Tensile Strength Considering Weight and Printing Time of 3D Infill Patterns using 3D Printing)

  • 나두현;김호준;김현준
    • 소성∙가공
    • /
    • 제32권5호
    • /
    • pp.255-267
    • /
    • 2023
  • Recently, 3D printing using a material extrusion method is used in various fields. Since plastic material has lower strength than steel, research to increase the strength is continuously being conducted. This study investigates the lattice structure for additive manufacturing of six 3D infill patterns (octet, quarter cubic, cubic, cubic subdivision, triangles and cross 3D) which consist of tetragons, hexagonal trusses, equilateral triangles and cross shapes. Consequently, in the tensile strength considering the weight and printing time, octet, quarter cubic, cubic and triangles patterns tended to increase linearly as the infill density increased, except for the infill density of 20%. However, the tensile strength/weight performed better than the infill density of 100% when the cubic subdivision pattern had the infill density of 20% and the cross 3D pattern had the infill density of 40%. Considering the weight and printing time, the infill patterns of high tensile strength were octet, quarter cubic, cubic, cubic subdivision, triangles and cross 3D order.

네트워크 침입방지 시스템을 위한 고속 패턴 매칭 가속 시스템 (A High-speed Pattern Matching Acceleration System for Network Intrusion Prevention Systems)

  • 김선일
    • 정보처리학회논문지A
    • /
    • 제12A권2호
    • /
    • pp.87-94
    • /
    • 2005
  • 패턴 매칭(Pattern Matching)은 네트워크 침입방지 시스템에서 가장 중요한 부분의 하나며 많은 연산을 필요로 한다. 날로 증가되는 많은 수의 공격 패턴을 다루기 위해, 네트워크 침입방지 시스템에서는 회선 속도로 들어오는 패킷을 처리 할 수 있는 다중 패턴 매칭 방법이 필수적이다. 본 논문에서는 현재 많이 사용되고있는 네트워크 침입방지 및 탐지 시스템인 Snort와 이것의 패턴 매칭 특성을 분석한다. 침입방지 시스템을 위한 패턴 매칭 방법은 다양한 길이를 갖는 많은 수의 패턴과 대소문자 구분 없는 패턴 매칭을 효과적으로 다룰 수 있어야 한다. 또한 여러 개의 입력 문자들을 동시에 처리 할 수 있어야 한다. 본 논문에서 Shift-OR 패턴 매칭 알고리즘에 기반을 둔 다중 패턴 매칭 하드웨어 가속기를 제시하고 여러 가지 가정 하에서 성능 측정을 하였다. 성능 측정에 따르면 제시된 하드웨어 가속기는 현재 Snort에서 사용되는 가장 빠른 소프트웨어 다중 패턴 매칭 보다 80배 이상 빠를 수 있다.

관계상관식을 이용한 QRS 패턴분류 (Pattern Classification of the QRS-complexes Using Relational Correlation)

  • 황선철;정희교;신건수;이병채;이명호
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1990년도 추계학술대회 논문집 학회본부
    • /
    • pp.428-431
    • /
    • 1990
  • This paper describes a pattern classification algorithm of QRS-complexes using significant point detection for extracting features of signals. Significant point extraction was processed by zero-crossing method, and decision function based on relational spectrum was used for pattern classification of the QRS-complexes. The hierarchical AND/OR graph was obtained by decomposing the signal, and by use of this graph, QRS's patterns were classified. By using the proposed algorithm, the accuracy of pattern classification and the processing speed were improved.

  • PDF