• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.9
• /
• pp.913-917
• /
• 2010

To inspect the defects of printed markings on the surface of IC package, the OCV (Optical Character Verification) method based on NCC (Normalized Correlation Coefficient) pattern matching is widely used. In order to detect the micro pattern defects appearing on the small portion of the markings, a Partitioned NCC pattern matching method was proposed to overcome the limitation of the NCC pattern matching. In this method, the reference pattern is first partitioned into several blocks and the NCC values are computed and are combined in these small partitioned blocks, rather than just using the NCC value for the whole reference pattern. In this paper, we proposed a method to decide the proper number of partition blocks and a method to inspect and combine the NCC values of each partitioned block to identify the defective markings.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.99-105
• /
• 2014

The performance improvement in MPEG-4 AVC is provided at the expense for higher computational complexity. Most of the complexity is caused by Inter prediction. To improve coding efficiency, some functions are added in H.264/MPEG-4 AVC, such as variable block size motion compensation, multi reference frame and quarter-pel motion compensation. A fast macroblock partition decision method is proposed in this paper. The macroblock size is efficiently determined by using the pixel value difference between encoding and the referred macroblock.

• Convergence Security Journal
• /
• v.13 no.4
• /
• pp.109-115
• /
• 2013

Security threats through e-mail service, a representative tool to convey information on the internet, are on the sharp rise. The security threats are made in the path where malicious codes are inserted into documents files attached and infect users' systems by taking advantage of the weak points of relevant application programs. Therefore, to block infection of camouflaged malicious codes in the course of file transfer, this work proposed an integrity-checking and behavior-based detection system using File Transfer System (FTS), logical network partition, and conducted a comparison analysis with the conventional security techniques.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.6
• /
• pp.99-105
• /
• 2022

This paper deals with the problem of appropriately allocating multiple processors arriving at the ready queue to the block in the user space of the main memory is divided into blocks of variable size at compilation time. The existing allocation methods, first fit(FF), best fit(BF), worst fit(WF), and next fit(NF) methods, had the disadvantage of waiting for a specific processor because they failed to allocate all processors arriving at the ready queue. The proposed algorithm in this paper is a simple block packing algorithm that allocates as many processors as possible to the largest block by sorting the size of the partitioned blocks(holes) and the size of the processor in the ready queue in descending order. The application of the proposed algorithm to nine benchmarking experimental data showed the performance of allocating all processors while having minimal internal fragment(IF) for all eight data except one data in which the weiting processor occurs due to partition errors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1155-1166
• /
• 2016

In this paper, we propose a new embedded video compression scheme which uses three-dimensional rate-distortion optimization based block coder. After the proposed scheme removes temporal redundancy by applying the motion compensated temporal filtering(MCTF) on input video frames, two dimensional discrete wavelet transform is applied on video frames to remove spatial redundancy. The three-dimensional wavelet coefficients generated in this way are sorted according to their expected rate-distortion slope and encoded by using the three-dimensional block partition coding method. The proposed scheme also uses both the effective color video coding method which maintains embedded features, and the efficient bit-rate control method. Experimental results demonstrate that the proposed scheme not only produces embedded bit-streams, but also outperforms existing video compression schemes.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1183-1194
• /
• 2004

Network partitioning problem is to partition a network into multiple blocks such that the size of cutset is minimized while keeping the block sizes balanced. Among these, iterative algorithms are regarded as simple and efficient which are based on cell move of Fiduccia and Mattheyses algorithm, Sanchis algorithm, or Kernighan and Lin algorithm. All these algorithms stipulate balanced block size as a constraint that should be satisfied, which makes a cell movement be inefficient. Park and Park introduced a balancing coefficient R by which the block size balance is considered as a part of partitioning cost, not as a constraint. However, Park and Park's algorithm has a square time complexity with respect to the number of cells. In this paper, we proposed Bucket algorithm that has a linear time complexity with respect to the number of cells, while taking advantage of the balancing coefficient. Reducing time complexity is made possible by a simple observation that balancing cost does not vary so much when a cell moves. Bucket data structure is used to maintain partitioning cost efficiently. Experimental results for MCNC test sets show that cutset size of proposed algorithm is 63.33% 92.38% of that of Sanchis algorithm while our algorithm satisfies predefined balancing constraints and acceptable execution time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.725-733
• /
• 2000

In this paper, we propose a modified boundary block merging technique for the texture coding of MPEG-4. We propose an ORP(Optimized Region Partitioning) method that partition the VOP-based reference position to minimize the number of coding blocks. The merging possibility is improved by adding +90。and -90。 Rotation merging. We propose a MRM(Multiple Rotation Merging) method which applies the rotation merging in the order of 180。, +90。and -90。. If a pair of boundary blocks has low correlation, existing BBM's padding technique is not efficient. Our padding after merging method gives better result even if it has low correlation. The proposed method showed 5 ~8(%) coding bit reduction at the same PSNR values compared to BBM method.

• Applied Chemistry for Engineering
• /
• v.25 no.2
• /
• pp.147-151
• /
• 2014

In many polymer processing operations, the diffusion of small molecules in polymeric materials plays an important role. The fundamental physical property required to design and optimize processing operations is the mutual diffusion coefficient. To investigate the transport properties of polymer/solvent systems at infinite dilution, capillary column inverse gas chromatography (CCIGC) is often employed. In this study, diffusion and partition coefficients of cyclic solvents in styrene/butadiene/styrene (SBS) block copolymer were measured over a wide temperature range using the CCIGC technique.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.5 s.311
• /
• pp.37-44
• /
• 2006

In this paper, a new version of the ICM method(MICM, modified ICM) in which the contextual information is modelled by Markov random fields (MRF) is introduced. To extract the feature, a new local MRF model with a fitting block neighbourhood is proposed. This model selects contextual information not only from the relative intensity levels but also from the geometrically directional position of neighbouring cliques. Feature extraction depends on each block's contribution to the local variance. They discriminates it into several regions, for example context and background. Boundaries between these regions are also distinctive. The proposed algerian performs segmentation using directional block fitting procedure which confines merging to spatially adjacent elements and generates a partition such that pixels in unified cluster have a homogeneous intensity level. From experiment with ink rubbed copy images(Takbon, 拓本), this method is determined to be quite effective for feature identification. In particular, the new algorithm preserves the details of the images well without over- and under-smoothing problem occurring in general iterated conditional modes (ICM). And also, it may be noted that this method is applicable to the handwriting recognition.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.100-103
• /
• 2010

In this paper we propose a method of detecting moving object in H.264/AVC bitstream by representing the $4{\times}4$ block partition units as nodes of graph. By constructing hierarchical graph by taking into account the relation between nodes and the spatial-temporal relations between graphs in frames, we are able to track small objects, distinguish two occluded objects, and identify objects that move and stop alternatively.