• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.125-128
• /
• 2001

본 논문은 파동분할(Wave partitioning) 방식을 이용한 순차적(Sequential) 메쉬 부호화 방식을 제안한다. 파동분할 방식은 호수에 물방울이 퍼져 나가는 자연 원리를 이용하여 초기 삼각형의 주위에 삼각형을 덧붙여 가면서 하나의 SPB(Small Processing Block)을 만들어내는 방식이다. 이 방식을 이용하여 하나의 모델을 서로 독립적인 SPB로 분할하고, 각각의 SPB 내에서 초기 삼각형을 중심으로 그것에 덧붙여진 삼각형에 의해 만들어진 원 또는 반원을 찾는다. 또한 그 원주를 따라 순차적으로 꼭지점을 구하면 각각의 꼭지점들은 일정한 패턴으로 늘어서게 되고, 이를 이용하여 연결성 정보 없이 부가 정보만 이용하여 모델을 순차적으로 무손실 부호화한다.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.273-275
• /
• 2006

Ladder Diagram(LD) is the most widely utilized among many sorts of existing programs using for the design of process control system. But it is very difficult to grasp sequential flow of control logic. In this paper, we proposed the method that we can control a lot of blocks. We used PLC in process control system. And, in order to design we used Sequential Function Chart(SFC). In this paper, we proposed the method of block contro. and confirmed feasibility through a simulation.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1507-1510
• /
• 2002

In this paper, we propose a sequential mesh cod- ing algorithm using the vertex pedigree based on the wave partitioning. After a mesh model is partitioned into several small processing blocks (SPB) using wave partitioning, we obtain vertices for each SPB along circumferences defined by outer edges of the attached triangles. Once all the vertices within each circumference are arranged into one line, we can encode mesh models

• Journal of the Institute of Convergence Signal Processing
• /
• v.16 no.1
• /
• pp.1-8
• /
• 2015

In many image processing tasks, connected component labeling (CCL) is performed to extract regions of interest. CCL was usually done in a sequential fashion when image resolution was relatively low and there are small number of input channels. As image resolution gets higher up to HD or Full HD and as the number of input channels increases, sequential CCL is too time-consuming to be used in real time applications. To cope with this situation, parallel CCL framework was introduced where multiple cores are utilized simultaneously. Several parallel CCL methods have been proposed in the literature. Among them are NSZ label equivalence (NSZ-LE) method[1], modified 8 directional label selection (M8DLS) method[2], and HYBRID1 method[3]. Soh [3] showed that HYBRID1 outperforms NSZ-LE and M8DLS, and argued that HYBRID1 is by far the best. In this paper we propose an improved hybrid parallel CCL algorithm termed as HYBRID2 that hybridizes M8DLS with label backtracking (LB) and show that it runs around 20% faster than HYBRID1 for various kinds of images.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.4
• /
• pp.96-104
• /
• 1998

In this paper, the circuit of DTCNN designed using dilation and erosion operation, a basic operation of gray-scale morphology, also each cell designed PE in order to having extension using the local connectivity. In this PE design, connection of between cell and cell become simple. And it is realized to easily VLSI realization as well as to circuit to be parallel processing. As the resutls of simulations, the proposed method was verified to improved more operation speed than the sequential data processing, parallel processing DTCNN was implemented in a 0.8.mu.m CMOS technology using COMPASS Tool.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.9
• /
• pp.35-46
• /
• 2010

Sequential pattern mining is one of the essential data mining tasks, and it is widely used to analyze data generated in various application fields such as web-based applications, E-commerce, bioinformatics, and USN environments. Recently data generated in the application fields has been taking the form of continuous data streams rather than finite stored data sets. Considering the changes in the form of data, many researches have been actively performed to efficiently find sequential patterns over data streams. However, conventional researches focus on reducing processing time and memory usage in mining sequential patterns over a target data stream, so that a research on mining more interesting and useful sequential patterns that efficiently reflect the characteristics of the data stream has been attracting no attention. This paper proposes a mining method of sequential patterns over data streams with a gap constraint, which can help to find more interesting sequential patterns over the data streams. First, meanings of the gap for a sequential pattern and gap-constrained sequential patterns are defined, and subsequently a mining method for finding gap-constrained sequential patterns over a data stream is proposed.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.2
• /
• pp.272-278
• /
• 1994

The paper proposes a test pattern generator and a signature analyzer for pseudoexhaustive testing of the combinational circuit part within a sequential circuit when performing built-in self test of the circuit. The test pattern generator can scan in the seed test pattern and generate exhaustive test patterns. The signature analyzer can perform the analysis of the circuit response and scan out the result. Such test pattern generator and signature analyzer have been developed using SRL(shift register latch) and LFSR(linear feedback shift register).

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.153-156
• /
• 1996

A new filtering algorithm for radar tracking is developed based on the fact that correct evaluation of the measurement error covariance can be made possible by doing it with respect to the Cartesian state vector. The new filter may be viewed as a modification of the extended Kalman filter where the variance of the range measurement errors is evaluated in an adaptive manner. The structure of the proposed filter allows sequential measurement processing scheme to be incorporated into the scheme, and this makes the resulting algorithm favorable in both estimation accuracy and computational efficiency.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1044-1049
• /
• 2000

In detection of a scene change of the moving pictures which has massive information capacity, the temporal sampling method has faster searching speed than the sequential searching method for the whole moving pictures, yet employed searching algorithm and detection interval greatly affect searching time and searching precision. In this study, the whole moving pictures were primarily retrieved by the temporal sampling method. When there exist a scene change within the sampling interval, we suggested a fast searching algorithm using binary searching and derived an equation formula to determine optimal primary retrieval which can minimize computation, and showed the result of the experiment on MPEG moving pictures. The result of the experiment shows that the searching speed of the suggested algorithm is maximum 13 times faster than the one of he sequential searching method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1831-1834
• /
• 2003

부정자 추적 기법(traitor tracing)은 컨텐츠에 대한 무단 배포, 불법 복사 등의 부정 행위를 한 부정자(traitor)를 추적할 수 있는 방식이다. 본 논문은 부정자 추적 기법을 이용하여 디지털 방송용 컨텐츠 보호 시스템 모델을 구성하고자 한다. 기존의 traitor tracing 기법들이 암호학적 측면에서 키 유출에 대한 부정을 추적하기 위한 방식들이었다면, dynamic traitor tracing 기법과 sequential traitor tracing 기법은 복호화된 후의 컨텐츠에 대한 부정 배포를 막기 위한 방식이다. 본 논문에서는 sequential traitor tracing 기법을 기반으로 하여 컨텐츠 암호화 키 생성 및 전송 그리고 키 유출에 대한 추적 기능까지 제공하는 부정자 추적 기법을 제안하여 디지털 방송용 컨텐츠 보호 시스템에 대한 모델을 구성하고자 한다.