• Spatial Information Research
• /
• v.3 no.1
• /
• pp.19-27
• /
• 1995

In this paper, a semi-automated mapping system, which can produ¬ce digital maps by using information acquired from pre-processing procedure, was introduced. To get a binary edge image, which is very important in vectori¬zation process, we applied adaptive smoothing and connection preserving thresho¬Iding algorithm. In mapper program, binary images are converted to vectors and for in-core data structure, extended PR quad tree was used. These procedures are dispatched to personal computers and workstations and through network resource sharing, the whole process was unified and simplified.

• 전기의세계
• /
• v.28 no.6
• /
• pp.61-77
• /
• 1979

This paper is concerned with minimization process of the binary logic function. This paper describes an algorithm called the SIMPLE TABLE METHOD that well suited to minimization a switching function of any number of variables. For the Simple Table construction, a theorem based upon the numerical properties of the logic function is derived from the relationships governing minterms of the given function. Finally the minimal sum of products can be obtained in terms of the Direct Method or the Indirect Method from the table and table characteristics derived from the Simple Table. The properties and table characteristics used in this paper are described. All the minterms of a switching function are manipulated only by decimal numbers, not binary numbers. Some examples are used as a vehicle to guide the readers who are familiar with the Karnaugh map and Quine-McCluskey tabular method to this New method. These examples not only treat how to handle Don't Care miterms but also show the multiple output functions.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.2
• /
• pp.21-27
• /
• 2008

This paper describes a CMOS 16:1 binary-tree multiplexer(MUX) using $0.18-{\mu}m$ technology. To provide immunity for wide frequency range and process-and-temperature variations, the MUX adopts several delay compensation techniques. Simulation results show that the proposed MUX maintains the setup margins and hold margins close to the optimal value, i.e., 0.5UI, in wide frequency-range and in wide process-and-temperature variations, with standard deviation of 0.05UI approximately. These results represent that these proposed delay compensations are effective and the reliability is much improved although CMOS logic circuits are sensitive to those variations. The MUX is fabricated using $0.18-{\mu}m$ CMOS process, and tested with a test board. At power supply voltage of 1.8-V, maximum data-rate and area of the MUX is 1.65-Gb/s and 0.858 $mm^2$, respectively. The MUX dissipates a power of 24.12 mW, and output eye opening is 272.53 mV, 266.55 ps at 1.65-Gb/s operation.

• Journal of Service Research and Studies
• /
• v.3 no.1
• /
• pp.9-16
• /
• 2013

Data analysis is the universal classification techniques, which requires a lot of effort. It can be easily analyzed to understand the results. Decision tree which is developed by Breiman can be the most representative methods. There are two core contents in decision tree. One of the core content is to divide dimensional space of the independent variables repeatedly, Another is pruning using the data for evaluation. In classification problem, the response variables are categorical variables. It should be repeatedly splitting the dimension of the variable space into a multidimensional rectangular non overlapping share. Where the continuous variables, binary, or a scale of sequences, etc. varies. In this paper, we obtain the coefficients of precision, reproducibility and accuracy of the classification tree to classify and evaluate the performance of the new cases, and through experiments to evaluate.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.4
• /
• pp.552-558
• /
• 2009

We proposed a semi-blind digital image watermarking technique for copyright protection. The proposed algorithm embedded a binary sequence watermark into significant wavelet coefficients by using a quantization method. The main idea of the quantization method was to quantize a middle coefficient of the triplet of a significant wavelet coefficient according to the watermark's value. Unlike an existing algorithm, which used a random location table to find a coefficient in which the watermark bit will be embedded: the proposed algorithm used quad-tree decomposition to find a significant wavelet coefficient for embedding. For watermark detection, an original host image was not required. Thanks to the usage of significant wavelet coefficients, the proposed algorithm improved the correlation value, up to 0.43, in comparison with the existing algorithm.

• Nuclear Engineering and Technology
• /
• v.19 no.4
• /
• pp.279-291
• /
• 1987

The event tree/fault tree techniques used in the current probabilistic risk assessment (PRA) of nuclear power plants are based on the binary and static description of the components and the system. While these techniques Bay be adequate in most of the safety studies, more advanced techniques, e.g., the Markov reliability analysis, are required to accurately study such problems as the plant availability assessments and technical specifications evaluations that are becoming increasingly important. This paper describes a Markov model for the Reactor Protection System of a pressurized water reactor and presents results of model evaluations for two testing policies in technical specifications.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.3
• /
• pp.565-574
• /
• 2004

Classification tree algorithms including as CART by Brieman et al.(1984) in some aspects, recursively partition the data space with the aim of making the distribution of the class variable as pure as within each partition and consist of several steps. SUPPORT(smoothed and unsmoothed piecewise-polynomial regression trees) method of Chaudhuri et al(1994), a weighted averaging technique is used to combine piecewise polynomial fits into a smooth one. We focus on applying SUPPORT to a binary class variable. Logistic model is considered in the caculation techniques and the results are shown good classification rates compared with other methods as CART, QUEST, and CHAID.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2008.06a
• /
• pp.33-38
• /
• 2008

최근 컴퓨터비전이나 로봇 공학 분야에서 가격이 저렴한 웹캠을 이용한 영상, 즉 2차원 영상으로부터 물체를 인식하는 연구가 활발히 이루어지고 있다. 이러한 로봇이나 비전에서 물체를 찾아내는 여러 가지 방향들이 제시되고 있으며, 지속적으로 로봇은 사람과 유사해져가고 있다. 이를 실현하기 위해서는 사람이 사과를 보고 사과라고 알기 때문에 사과라고 인식하듯이 로봇 또한 미리 알고 있어야 한다는 가정 하에 내용기반의 물체인식이 필요하다. 그러나 엄청난 양의 내용의 데이터베이스가 필요하다. 그래서 용량은 하드웨어기술로 커버가 가능하지만 화면상에 있는 물체들을 빠르게 데이터베이스상의 자료와 매칭이 되어야한다. 본 논문에서는 이미지를 SIFT(Scale Invariant Feature Transform)알고리즘으로 BTS(Binary Search Tree)로 트리구조의 데이터베이스를 구축하여 많은 양의 데이터베이스 중 빠르게 검색하여 화면에 있는 물체를 인식하는 방법을 제안하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.255-256
• /
• 2018

본 논문에서는 비디오 부호화 성능 향상을 위하여 QTBT (QuadTree Plus Binary Tree) 블록 구조에서 대각선 움직임 분할 (DMP: Diagonal Motion Partition) 방법을 제안한다. HEVC 이후의 비디오 압축 표준을 위한 탐색 과정에서 다양한 부호화 성능 향상 방법들이 제안되고 있으며, 그 중 제안하는 대각선 움직임 분할 방법은 하나의 정방형 혹은 직방형의 부호화 유닛 (CU: Coding Unit)을 두 개의 삼각형으로 분할하여 움직임 예측 및 보상을 수행하는 방법이다. 제안하는 방법에서는 두 가지 대각선 방향만을 사용하여 블록을 분할하지만, QTBT 블록 구조와 결합하여 다양한 임의의 블록 분할 형태를 표현하는 것이 가능하다. 본 논문에서는 제안하는 방법을 JEM-7.0에 구현하여 0.15%의 부호화 효율 향상 결과를 획득하였다.

• Journal of the Korean Society for Precision Engineering
• /
• v.10 no.3
• /
• pp.175-181
• /
• 1993

In this paper, a practical method to generate task strategies applicable to chamferless and high-precision assembly, is proposed. The difficulties in devising reliable assembly strategies result from various forms of uncertainty such as imperfect knowledge on the parts being assembled and functional limitations of the assembly devices. In approach to cope with these problems, the robot is provided with the capability of learning the corrective motion in response to the force signal trrough iterative task execution. The strategy is realized by adopting a learning algorithm and represented in a binary tree type database. To verify the effectiveness of the proposed algorithm, a series of simulations and experiments are carried out under assimilated real production environments. The results show that the sensory signal-to-robot action mapping can be acquired effectively and, consequently, the chamferless assembly can be performed successfully.