• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.5
• /
• pp.162-167
• /
• 1994

The binary image normalization method in image processing can be used in several fields, Especially, its high speed processing method and its hardware implmentation is more useful, A normalization process of each character in character recognition requires a lot of processing time. Therefore, the research was done as a part of high speed process of OCR (optical character reader) implementation as a pipeline structure with host computer in hardware to give temporal parallism. For normalization process, general purpose CPU,MC68000, was used to implement it. As a result of experiment, the normalization speed of the hardware is sufficient to implement high speed OCR which the recognition speed is over 140 characters per second.

• Journal of Animal Environmental Science
• /
• v.3 no.2
• /
• pp.105-113
• /
• 1997

The environment for pig production should be controlled according to a criterion based on the pig's thermoregulartory behavior. Quantifying the pig's thermoregulatroy behavior was needed to prepare a criterion based on the pig's thermoregulatory behavior. Therefore, this study was conducted to quantify the pig's thermoregulatory behavior. The raw images were acquired according to the pig's thermoregulatory behavior and they were processed to binary images. The mean deviations of x and y coordinates of pig's images in a binary image were computed and they were multiplied. The values computed in this manner showed very wide differences according to the pig's thermoregulatory behavior. Therefore, the image processing and mean deviation can be certainly used as a method for classifying the pig's thermoregulatory behavior.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2027-2040
• /
• 1998

In this paper, we present efficient reconfigurable mesh algorithms for transforming between a binary image and its corresponding boundary code. These algorithms use $n\timesn\timesn$ processors when the size of the binary image is $n\timesn$. Recent published results show that these transformations can be done in O(1) time using $O(n^4)$ processors. The number of processors used by these algorithms is very large compared to the number of pixels in the image. Here, we present fast transformation algorithms which use $n^3 processors only. the transformation from a houndary code to a binary image takes O(1) time, and the converse transformation takes O(log n) time.

• Journal of Information Processing Systems
• /
• v.13 no.2
• /
• pp.385-399
• /
• 2017

Nowadays, with the development of signal processing technique, the protection to the integrity and authenticity of images has become a topic of great concern. A blind image authentication technology with high tamper detection accuracy for different common attacks is urgently needed. In this paper, an improved fragile watermarking method based on local binary pattern (LBP) is presented for blind tamper location in images. In this method, a binary watermark is generated by LBP operator which is often utilized in face identification and texture analysis. In order to guarantee the safety of the proposed algorithm, Arnold transform and logistic map are used to scramble the authentication watermark. Then, the least significant bits (LSBs) of original pixels are substituted by the encrypted watermark. Since the authentication data is constructed from the image itself, no original image is needed in tamper detection. The LBP map of watermarked image is compared to the extracted authentication data to determine whether it is tampered or not. In comparison with other state-of-the-art schemes, various experiments prove that the proposed algorithm achieves better performance in forgery detection and location for baleful attacks.

• Journal of the Korean Institute of Telematics and Electronics D
• /
• v.36D no.11
• /
• pp.71-81
• /
• 1999

In this paper, digital holographic data storage system is implemented to record and retrieve the color images using new direct access method and binary image processing. As a result of applying image processing via a proposed direct access method, we can reduce the number of data page than binary image processing using raw file and replay color image of resolution of $128{\times}80{\times}256$ (6.6KB). Also it is showed that the input data can be transformed into digital holograms regardless of any kinds of file such as character data, moving picture. etc.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.97-111
• /
• 2008

Commercial data mining tools basically support binary attributes only in mining association rules, that is, they can mine binary association rules only. In general, however. transaction databases contain not only binary attributes but also quantitative attributes. Thus, in this paper we propose a systematic approach to mine quantitative association rules---association rules which contain quantitative attributes---using commercial mining tools. To achieve this goal, we first propose an overall working framework that mines quantitative association rules based on commercial mining tools. The proposed framework consists of two steps: 1) a pre-processing step which converts quantitative attributes into binary attributes and 2) a post-processing step which reconverts binary association rules into quantitative association rules. As the pre-processing step, we present the concept of domain partition, and based on the domain partition, we formally redefine the previous bipartition and multi-partition techniques, which are mean-based or median-based techniques for bipartition, and are equi-width or equi-depth techniques for multi-partition. These previous partition techniques, however, have the problem of not considering distribution characteristics of attribute values. To solve this problem, in this paper we propose an intuitive partition technique, named standard deviation minimization. In our standard deviation minimization, adjacent attributes are included in the same partition if the change of their standard deviations is small, but they are divided into different partitions if the change is large. We also propose the post-processing step that integrates binary association rules and reconverts them into the corresponding quantitative rules. Through extensive experiments, we argue that our framework works correctly, and we show that our standard deviation minimization is superior to other partition techniques. According to these results, we believe that our framework is practically applicable for naive users to mine quantitative association rules using commercial data mining tools.

• Journal of Animal Environmental Science
• /
• v.5 no.2
• /
• pp.93-100
• /
• 1999

Pig's original image data was transformed to a binary image, an image excluding head and tail portion from the whole binary image, and a projected image associated with pig's height. Then the length of body, width of shoulder, and area of pig were calculated and the relationships among the above characteristics and pig's weight were analyzed. The results obtained from this study were as follows: 1. Whole binary image data was considered to be improper to determine the pig's weight because the movement of pig's head and tail portion affected the image data. 2. Binary image data excluding head and tail portion from the whole binary image showed a better estimation of the pig's weight than the whole binary image. 3. Pig's should width was analyzed to be improper factor to determine the pig's weight. 4. The projected image associated with pig's height showed the highest correlation between the pig's area of the image and pig's weight(R2=0.9965). From this research the projected image associated with pig's height, which is excluding head and tail portion from the whole body of pig's image, was considered to be the prime factor to measure the pig's weight by the noncontact measurement.

• Journal of electromagnetic engineering and science
• /
• v.6 no.4
• /
• pp.244-252
• /
• 2006

A block Jacket transform and. its block inverse Jacket transformn have recently been reported in the paper 'Fast block inverse Jacket transform'. But the multiplication of the block Jacket transform and the corresponding block inverse Jacket transform is not equal to the identity transform, which does not conform to the mathematical rule. In this paper, new binary block Jacket transforms and the corresponding binary block inverse Jacket transforms of orders $N=2^k,\;3^k\;and\;5^k$ for integer values k are proposed and the mathematical proofs are also presented. With the aid of the Kronecker product of the lower order Jacket matrix and the identity matrix, the fast algorithms for realizing these transforms are obtained. Due to the simple inverse, fast algorithm and prime based $P^k$ order of proposed binary block inverse Jacket transform, it can be applied in communications such as space time block code design, signal processing, LDPC coding and information theory. Application of circular permutation matrix(CPM) binary low density quasi block Jacket matrix is also introduced in this paper which is useful in coding theory.

• Annual Conference of KIPS
• /
• 2006.05a
• /
• pp.81-84
• /
• 2006

유비쿼터스 컴퓨팅 환경으로 발전하면서 문자열 위주의 획일적 형태에서 음성, 이미지 등 다양한 형태의 데이터들을 처리하게 되었으며, 또한 빠르고 정확하게 처리되기를 요구하고 있다. 현재 데이터 처리 중심부에 있는 Database는 대부분이 Relation DB 위주로 되어 있어 Datafile 에 데이터를 저장하고 있어 대용량의 이미지 데이터 처리에 적합하지가 않다. 본 논문에서는 이러한 단점을 보강하기 위해 Relation DB 하에서 대용량의 이미지 데이터 처리를 가능하게 하는 기법을 제시한다. 이렇게 함으로써 이미지 데이터를 Upload, Download 시 따른 응답 속도를 보장 할 수 있도록 LRU 알고리즘 기반으로 제안을 하였다. 본 논문에서 제안된 기법은 시뮬레이션을 통해 (1)기존 RDB(Relational Database)의 BLOB(Binary Large Object)필드를 이용한 이미지 데이터 처리 방식, (2)별도의 저장 공간에 이미지 데이터를 입/출하는 방식, (3)별도의 저장 공간에 이미지 데이터를 입/출력할 때 LRU(least Recently Used)알고리즘을 이용하는 방식에 대하여 성능 평가를 하였다. 그 결과 (3)별도의 저장 공간에 LRU(least Recently Used)알고리즘을 이용하여 입/출력하는 방식이 (1)기존의 RDB(Relational Database)형태에 BLOB(binary large object)필드를 이용한 것 보다 성능이 높음을 확인하였다.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.10
• /
• pp.152-159
• /
• 1996

We have designed and implemented an optoelectronic hardware of binary phase extraction joint transform correlator (BPEJTC) which provides higher peak-to-sidelobe ratio than many other versions of JTC that has been published so far and does not produce correlation peaks due to intra-class association, to construct a multi-target tracking system. The digital processing unit controlling the entire system plays the part of modifying and binarizing the joint transform power spectrum (JTPS) and the optical processing unit is mainly used to take fourier transform operations. Some experimental results conducted by designed system along with its architecture showed the processing rate of 6 frames per second, thereby the potential applicability of the proposed system to real-time multitarget tracking system is given.