• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.25-33
• /
• 2006

We propose a method that automatically classifies the images into the object and non-object images. An object image is the image with object(s). An object in an image is defined as a set of regions that lie around center of the image and have significant color distribution against the other surround (or background) regions. We define four measures based on the characteristics of an object to classify the images. The center significance is calculated from the difference in color distribution between the center area and its surrounding region. Second measure is the variance of significantly correlated colors in the image plane. Significantly correlated colors are first defined as the colors of two adjacent pixels that appear more frequently around center of an image rather than at the background of the image. Third one is edge strength at the boundary of candidate for the object. By the way, it is computationally expensive to extract third value because central objects are extracted. So, we define fourth measure which is similar with third measure in characteristic. Fourth one can be calculated more fast but show less accuracy than third one. To classify the images we combine each measure by training the neural network and SYM. We compare classification accuracies of these two classifiers.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.2
• /
• pp.65-77
• /
• 2009

This paper proposes fast image processing algorithms using SSE (Streaming SIMD Extensions) instructions. The CPU's supporting SSE instructions have 128bit XMM registers; data included in these registers are processed at the same time with the SIMD (Single Instruction Multiple Data) mode. This paper develops new SIMD image processing algorithms for Mean filter, Sobel horizontal edge detector, and Morphological erosion operation which are most widely used in automated optical inspection systems and compares their processing times. In order to objectively evaluate the processing time, the developed algorithms are compared with OpenCV 1.0 operated in SISD (Single Instruction Single Data) mode, Intel's IPP 5.2 and MIL 8.0 which are fast image processing libraries supporting SIMD mode. The experimental result shows that the proposed algorithms on average are 8 times faster than the SISD mode image processing library and 1.4 times faster than the SIMD fast image processing libraries. The proposed algorithms demonstrate their applicability to practical image processing systems at high speed without commercial image processing libraries or additional hardwares.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.84-93
• /
• 2000

The conventional fractal decoding was implemented to IFS(iterated function system) for every range regions But a part of the range regions can be decoded without the iteration and there is a data dependence regions In order to decode $R{\times}R$ range blocks, It needs $2R{\times}2R$ domain blocks This decoding can be analyzed to the dependence graph The vertex of the graph represents the range blocks, and the vertex is classified into the vertex of the range and domain The edge indicates that the vertex is referred to the other vertices The in-degree and the out-degree are defined to the number of the edge that is entered and exited, respectively The proposed method is analyzed by a dependence graph to the fractal code, and the decoding order is recomposed by the information of the out-degree That is, If the out-degree of the vertex is zero, then this vertex can be used to the vertex with data dependence Thus, the proposed method can extend the data dependence regions by the recomposition of the decoding order As a result, the Iterated regions are minimized without loss of the image quality or PSNR(peak signal-to-noise ratio), Therefore, it can be a fast decoding by the reducing to the computational complexity for IFS in the fractal Image decoding.

• Investigative Magnetic Resonance Imaging
• /
• v.21 no.2
• /
• pp.71-81
• /
• 2017

Purpose: To compare three, motion-resistant, T1-weighted MR sequences on the hepatobiliary phase for gadoxetic acid-enhanced MR imaging of the liver. Materials and Methods: In this retrospective study, 79 patients underwent gadoxetic acid-enhanced, 3T liver MR imaging. Fifty-nine were examined using a standard protocol, and 20 were examined using a motion-resistant protocol. During the hepatocyte-specific phase, three MR sequences were acquired: 1) gradient recalled echo (GRE) with controlled aliasing in parallel imaging results in higher acceleration (CAIPIRINHA); 2) radial GRE with the interleaved angle-bisection scheme (ILAB); and 3) radial GRE with golden-angle scheme (GA). Two readers independently assessed images with motion artifacts, streaking artifacts, liver-edge sharpness, hepatic vessel clarity, lesion conspicuity, and overall image quality, using a 5-point scale. The images were assessed by measurement of liver signal-to-noise ratio (SNR), and tumor-to-liver contrast-to-noise ratio (CNR). The results were compared, using repeated post-hoc, paired t-tests with Bonferroni correction and the Wilcoxon signed rank test with Bonferroni correction. Results: In the qualitative analysis of cooperative patients, the results for CAIPIRINHA had significantly higher ratings for streak artifacts, liver-edge sharpness, hepatic vessel clarity, and overall image quality as compared to, radial GRE, (P < 0.016). In the imaging of uncooperative patients, higher scores were recorded for ILAB and GA with respect to all of the qualitative assessments, except for streak artifact, compared with CAIPIRINHA (P < 0.016). However, no significant differences were found between ILAB and GA. For quantitative analysis in uncooperative patients, the mean liver SNR and lesion-to-liver CNR with radial GRE were significantly higher than those of CAIPIRINHA (P < 0.016). Conclusion: In uncooperative patients, the use of the radial GRE sequence can improve the image quality compared to GRE imaging with CAIPIRINHA, despite the data acquisition methods used. The GRE imaging with CAIPIRINHA is applicable for patients without breath-holding difficulties.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.1
• /
• pp.696-701
• /
• 2017

This paper proposes an improved de-interlacing method that converts interlaced images into progressive images from one field. First, it calculates inter-pixel values applying third-order spline interpolation for the horizontal direction from four upper lower pixel values of missing pixels. From inter-pixel values obtained from spline interpolation and upper lower pixels with value, the proposed method makes an accurate estimate of the direction by applying the correlation between upper and lower pixels. The correlation between upper and lower pixels is calculated in nine directions of a missing pixel by using values obtained from spline interpolation and pixels with value. The direction of an edge is determined as the direction in which the correlation between upper and lower pixels is at its minimum. Thus, a missing pixel is calculated by taking the average of upper lower pixels obtained from the predicted direction of an edge. From the simulation results, there are problems in that it takes a bit more time for processing, but it is expected that the time problem will be improved by increasing CPU processing speed. As for image quality, it is shown that the proposed method improves both subjective and objective image quality and quantitatively improves picture signal-to-noise ratio (PSNR) in the range between 0.1 dB to 0.5 dB, as compared with previously presented de-interlacing methods.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.4 s.310
• /
• pp.58-66
• /
• 2006

In this paper, we apply DCM(Dilation of Color and Motion information) mask and Active Contour Models(Snakes) to extract facial outline in moving pictures with complex background. First, we propose DCM mask which is made by applying morphology dilation and AND operation to combine facial color and motion information, and use this mask to detect facial region without complex background and to remove noise in image energy. Also, initial curves are automatically set according to rotational degree estimated with geometric ratio of facial elements to overcome the demerit of Active Contour Models which is sensitive to initial curves. And edge intensity and brightness are both used as image energy of snakes to extract contour at parts with weak edges. For experiments, we acquired total 480 frames with various head-poses of sixteen persons with both eyes shown by taking pictures in inner space and also by capturing broadcasting images. As a result, it showed that more elaborate facial contour is extracted at average processing time of 0.28 seconds when using interpolated initial curves according to facial rotation degree and using combined image energy of edge intensity and brightness.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.12
• /
• pp.109-120
• /
• 1998

An image segmentation approach based on the fuzzy worm searching and MIN-MAX clustering algorithm is proposed in this paper. This algorithm deals with fuzzy worm value and min-max node at a gross scene level, which investigates the edge information including fuzzy worm action and spatial relationship of the pixels as the parameters of its objective function. But the conventional segmentation methods for edge extraction generally need the mask information for the algebraic model, and take long run times at mask operation, whereas the proposed algorithm has single operation according to active searching of fuzzy worms. In addition, we also propose both genetic fuzzy worm searching and genetic min-max clustering using genetic algorithm to complete clustering and fuzzy searching on grey-histogram of image for the optimum solution, which can automatically determine the size of ranges and has both strong robust and speedy calculation. The simulation results showed that the proposed algorithm adaptively divided the quantized images in histogram region and performed single searching methods, significantly alleviating the increase of the computational load and the memory requirements.

• The Journal of the Korea Contents Association
• /
• v.16 no.7
• /
• pp.681-688
• /
• 2016

This study assess their quality of radiation on analysis of the spectrum of resolution suggesting IEC 61267 in radiation quality that RQA3, RQA5, RQA7, RQA9 and combination of clinical condition using several quality of radiation. In experiments edge method first, the spatial resolution assessment used image of the additional filter and SID is obtained the IEC 62220-1, spatial resolution and sharpness of the obtained image was evaluated in the MTF value 10%(0.1), MTF value 50%(0.5) using a Matlab program. Second, MCNPX simulation used spatial resolution analysis was radiation quality particle fluence and spectrum analysis in energy. As a result, make use of additional filter, image quality evaluation of SID that RQA3 radiation quality combination qualification is higher spatial resolution and sharpness make unused of additional filter and SID 100cm. RQA7 radiation quality combination qualification is higher that spatial resolution make unused of additional filter and SID 150cm. RQA9 radiation quality combination qualification is higher that spatial resolution and sharpness make used of additional filter and SID 180cm. spectrum analysis of radiation quality by reducing consequent errors occurring in the experiment that error due to the reproducibility of the X-ray tube, occur in an error of correction the detector suggest ideal conditions from spectrum analysis through MCNPX simulation. In conclusion, by suggesting spatial resolution and sharpness of result for various radiation quality, It provide basic data that radiation quality condition and quantitative assessment method for laboratory in clinical using detector evaluation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.3
• /
• pp.271-278
• /
• 2014

In spite of that stop line and crosswalk should be aware of the most basic objects in transportation system, its features extracted are very limited. In addition to image-based recognition technology, laser and RF, GPS/INS recognition technology, it is difficult to recognize. For this reason, the limited research in this area has been done. In this paper, the algorithm to recognize the stop line and crosswalk is designed and implemented using image-based recognition technology with the images input through a vision sensor. This algorithm consists of three functions.; One is to select the area, in advance, needed for feature extraction in order to speed up the data processing, 'Region of Interest', another is to process the images only that white color is detected more than a certain proportion in order to remove the unnecessary operation, 'Color Pattern Inspection', the other is 'Feature Extraction and Recognition', which is to extract the edge features and compare this to the previously-modeled one to identify the stop line and crosswalk. For this, especially by using case based feature comparison algorithm, it can identify either both stop line and crosswalk exist or just one exists. Also the proposed algorithm is to develop existing researches by comparing and analysing effect of in-vehicle camera installation and changes in recognition rate of distance estimation and various constraints such as backlight and shadow.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.10
• /
• pp.520-529
• /
• 2005

A feature-based 3D modeling algorithm is presented in this paper. Since conventional methods use depth-based techniques, they need much time for the image matching to extract depth information. Even feature-based methods have less computation load than that of depth-based ones, the calculation of modeling error about whole pixels within a triangle is needed in feature-based algorithms. It also increase the computation time. Therefore, the proposed algorithm consists of three phases, which are an initial 3D model generation, model evaluation, and model refinement phases, in order to acquire an efficient 3D model. Intensity gradients and incremental Delaunay triangulation are used in the Initial model generation. In this phase, a morphological edge operator is adopted for a fast edge filtering, and the incremental Delaunay triangulation is modified to decrease the computation time by avoiding the calculation errors of whole pixels and selecting a vertex at the near of the centroid within the previous triangle. After the model generation, sparse vertices are matched, then the faces are evaluated with the size, approximation error, and disparity fluctuation of the face in evaluation stage. Thereafter, the faces which have a large error are selectively refined into smaller faces. Experimental results showed that the proposed algorithm could acquire an adaptive model with less modeling errors for both smooth and abrupt areas and could remarkably reduce the model acquisition time.