• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.883-891
• /
• 1994

In this paper, we introduce new thinning algorithm which is useful for handwritten Korean character by using pixel directivity. At first, the directivity detection is performed before thinning. Each pixel is classified into the straight line of the oblique line based on its directivity. The algorithm using Rutovitz corossing number is applied to the straight line. And the algorithm using Hilditch crossing number is applied to the oblique line. The proposed algorithm is compared with six convention algorithms. Comparison criteria are similarity, noisy branch, and phoneme segmentation rate. Experiments with 570 characters have been conducted. Experimental result shows that the proposed algorithm is superior to six conventional algorithm with respect to similarity and phoneme segmentation rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.228-246
• /
• 2011

A 3D model based approach for a face representation and recognition algorithm has been investigated as a robust solution for pose and illumination variation. Since a generative 3D face model consists of a large number of vertices, a 3D model based face recognition system is generally inefficient in computation time and complexity. In this paper, we propose a novel 3D face representation algorithm based on a pixel to vertex map (PVM) to optimize the number of vertices. We explore shape and texture coefficient vectors of the 3D model by fitting it to an input face using inverse compositional image alignment (ICIA) to evaluate face recognition performance. Experimental results show that the proposed face representation and recognition algorithm is efficient in computation time while maintaining reasonable accuracy.

• The KIPS Transactions:PartA
• /
• v.18A no.6
• /
• pp.249-254
• /
• 2011

This paper describes an efficient design of the interpolation circuit to generate the luma and chroma sub-pixels for H.264 motion estimation. The circuit based on the proposed architecture does not require any input data buffering and processes the horizontal, vertical and diagonal sub-pixel interpolations in parallel. The performance of the circuit is further improved by simultaneously processing the 1/2-pixel and 1/4-pixel interpolations for luma components and the 1/8-pixel interpolations for chroma components. In order to reduce the circuit size, we store the intermediate data required to process all the interpolations in parallel in the internal SRAM's instead of registers. We described the proposed circuit at register transfer level and verified its operation on FPGA board. We also synthesized the gate-level circuit using 130nm CMOS standard cell library. It consists of 20,674 gates and has the maximum operating frequency of 244MHz. The total number of SPSRAM bits used in our circuit is 3,232. The size of our circuit (including logic gates and SRAM's) is smaller than others and the performance is still comparable to them.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.543-550
• /
• 2000

An adaptive bit-reduced mean absolute difference (ABRMAD) is presented as a criterion for the block-matching algorithm (BMA) to reduce the complexity of the VLSI Implementation and to improve the processing time. The ABRMAD uses the lower pixel resolution of the significant bits instead of full resolution pixel values to estimate the motion vector (MV) by examining the pixels Ina block. Simulation results show that the 4-bit ABRMAD has competitive mean square error (MSE)results and a half less hardware complexity than the MAD criterion, It has also better characteristics in terms of both MSE performance and hardware complexity than the Minimax criterion and has better MSE performance than the difference pixel counting(DPC), binary block-matching with edge-map(BBME), and bit-plane matching(BPM) with the same number of bits.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.1
• /
• pp.52-57
• /
• 2003

In this paper, we propose a Fuzzy Classifier System(FCS) to find a set of fuzzy rules which can carry out the edge detection. The classifier system of Holland can evaluate the usefulness of rules represented by classifiers with repeated learning. FCS makes the classifier system be able to carry out the mapping from continuous inputs to outputs. It is the FCS that applies the method of machine learning to the concept of fuzzy logic. It is that the antecedent and consequent of classifier is same as a fuzzy rule. In this paper, the FCS is the Michigan style. A single fuzzy if-then rule is coded as an individual. The average gray levels which each group of neighbor pixels has are represented into fuzzy set. Then a pixel is decided whether it is edge pixel or not using fuzzy if-then rules. Depending on the average of gray levels, a number of fuzzy rules can be activated, and each rules makes the output. These outputs are aggregated and defuzzified to take new gray value of the pixel. To evaluate this edge detection, we will compare the new gray level of a pixel with gray level obtained by the other edge detection method such as Sobel edge detection. This comparison provides a reinforcement signal for FCS which is reinforcement learning. Also the FCS employs the Genetic Algorithms to make new rules and modify rules when performance of the system needs to be improved.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.681-684
• /
• 2015

Magnetization is very important in the ferro-magnetic physics and provides useful informations in the application field of magnetic devices. Generally, the only first acquired domain pattern is not helpful to recognize domain pattern. Many images are needed to visualize domain pattern through image processing. These images were obtained a 8-bit digital camera. The operation was the subtraction of pixel values of multi domain imanges from the images with 255 of pixel value, which was obtained in the saturated state of magnetic materials. The magnetic domain images was visualized gradually with increasing the number of subtracion operation. LABVIEW was used as an image processing tool and the optic microscope with a polarizer was used in this experiment.

• Computers and Concrete
• /
• v.33 no.6
• /
• pp.671-688
• /
• 2024

The modeling efficiency of concrete meso-models close to real concrete is one of the important issues that limit the accuracy of mechanical simulation. In order to improve the modeling efficiency and the closeness of the numerical aggregate shape to the real aggregate, this paper proposes a method for generating a two-dimensional concrete meso-model based on pixel matrix and skeleton theory. First, initial concrete model (a container for placing aggregate) is generated using pixel matrix. Then, the skeleton curve of the residual space that is the model after excluding the existing aggregate is obtained using a thinning algorithm. Finally, the final model is obtained by placing the aggregate according to the curve branching points. Compared with the traditional Monte Carlo placement method, the proposed method greatly reduces the number of overlaps between aggregates by up to 95%, and the placement efficiency does not significantly decrease with increasing aggregate content. The model developed is close to the actual concrete experiments in terms of aggregate gradation, aspect ratio, asymmetry, concavity and convexity, and old-new mortar ratio, cracking form, and stress-strain curve. In addition, the cracking loss process of concrete under uniaxial compression was explained at the mesoscale.

• Journal of Korea Multimedia Society
• /
• v.23 no.2
• /
• pp.166-173
• /
• 2020

Multi-view images, which are widely used for providing free-viewpoint services, can enhance the quality of synthetic views when the number of views increases. However, there needs an efficient representation method because of the tremendous amount of data. In this paper, we propose a method for generating point cloud data for the efficient representation of multi-view color and depth images. The proposed method conducts sequential reconstruction of point clouds at each viewpoint as a method of deleting duplicate data. A 3D point of a point cloud is projected to a frame to be reconstructed, and the color and depth of the 3D point is compared with the pixel where it is projected. When the 3D point and the pixel are similar enough, then the pixel is not used for generating a 3D point. In this way, we can reduce the number of reconstructed 3D points. Experimental results show that the propose method generates a point cloud which can generate multi-view images while minimizing the number of 3D points.

• Korean Journal of Remote Sensing
• /
• v.30 no.1
• /
• pp.137-147
• /
• 2014

We proposed and verified the methods to maintain data qualities as well as to reduce data volume for the Geostationary Ocean Color Imager (GOCI), the world's first ocean color sensor operated in geostationary orbit. For the GOCI level-2 data, 92.9% of data volume could be saved by only the data compression. For the GOCI level-1 data, however, just 20.7% of data volume could be saved by the data compression therefore another approach was required. First, we found the optimized number of bits per a pixel for the GOCI level-1 data from an idea that the quantization bit for the GOCI (i.e. 12 bit) was less than the number of bits per a pixel for the GOCI level-1 data (i.e. 32 bit). Experiments were conducted using the $R^2$ and the Modulation Transfer Function (MTF). It was quantitatively revealed that the data qualities were maintained although the number of bits per a pixel was reduced to 14. Also, we performed network simulations using the Network Simulator 2 (Ns2). The result showed that 57.7% of the end-toend delay for a GOCI level-1 data was saved when the number of bits per a pixel was reduced to 14 and 92.5% of the end-to-end delay for a GOCI level-2 data was saved when 92.9% of the data size was reduced due to the compression.

• Journal of the Korean Society of Radiology
• /
• v.13 no.3
• /
• pp.481-487
• /
• 2019

Based on the scan conditions and algorithms that are generally applied during examinations during head CT examinations, the results of dose reduction through the application of algorithm changes were investigated through experiments. As a result, the dose reduction effect was more meaningful for the change of perfusion than for the tube voltage, and the quality evaluation using the brain phantom was relatively less reduced when the dose was reduced after the application of the Bone algorithm, especially for the application of the Bone algorithm, and the deviation of the mean CT number or Pixel value was measured relatively significantly. In other words, the conditions under which dose was reduced and quality was maintained to reduce the patient's exposure dose and obtain images of the same quality were obtained with the application of the Smooth algorithm and the resulting values of 120 kVp, 160 mA. At this point, doses were reduced by about 28%, and the mean CT number or Pixel value was also measured with relatively little error. If the results are applied to patients who visit the hospital for examination or follow-up after applying various algorithms and follow up scan conditions, the results are considered to be very useful in reducing patient exposure dose.