• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.4
• /
• pp.353-361
• /
• 2000

In Computer Graphics, to select the element for modeling is very important in aspect of real-time processing of photorealistic images. Especially in modeling of informal objects, the criteria of choice are such as the minimum number of data, the easy rendering technique, and the expansibility. The metaball model which is one of the methods for modeling the implicit surface is excellent in modeling the complicated surface with a few data. However, a greater number of data are required for modeling objects that consist of planar surfaces with metaballs than with polygons. In this paper, we propose the new skeletal element, metacube which has the merits of metaball and improves the modeling ability of informal objects containing planar surfaces. A metacube has two parameters to change freely its shape from the cube to the sphere and can easily do the modeling of objects with curved surfaces and plane surfaces.

• Journal of the Korean Society of Earth Science Education
• /
• v.9 no.3
• /
• pp.243-254
• /
• 2016

This study investigated that internalized images of earth scientist's work of 110 high school students who complete a course in Earth Science I through drawing. As a result that reflected the character of earth science as a school subject, it is shown that nearly half of the students believe that earth scientist's working place is outside. An object of study is limited to such areas as astronomy and geology, it says that students has little understanding of areas of atmospheric and oceanic sciences. There are lots of answers that tools for working are telescope or microscope, it reveals a huge difference between the results of advanced research that analyzed the typical experimental devices, and students realized that working is not invention but survey. We should try students to recognize earth scientist as a job with relation to their future.

• Proceedings of the International Union of Geodesy And Geophysics Korea Journal of Geophysical Research Conference
• /
• 2003.05a
• /
• pp.14-14
• /
• 2003

SAR (Synthetic Aperture Radar) is an imaging radar which can scan and image Earth System targets without solar illumination. Most Earth observation Shh systems operate in X-, C-, S-, L-, and P-band frequencies, where the shortest wavelength is approximately 1.5 cm. This means that most opaque objects in the SAR signal path become transparent and SAR systems can image the planetary surface targets without sunlight and through rain, snow and/or even volcanic ash clouds. Most conventional SAR systems in operation, including the Canada's RADARSAT-1, operate in one frequency and in one polarization. This has resulted in black and with images, with which we are familiar now. However, with the launching of ENVTSAT on March 1 2002, the ASAR system onboard the ENVISAT can image Earth's surface targets with selected polarimetric signals, HH+VV, HH+VH, and VV+HV. In 2004, Canadian Space Agency will launch RADARSAT-II, which is C-band, fully polarimetric HH+VV+VH+HV. Almost same time, the NASDA of Japan will launch ALOS (Advanced land Observation Satellite) which will carry L-band PALSAR system, which is again fully polarimetric. This means that we will have at least three fully polarimetric space-borne SAR system fur civilian operation in less than one year. Are we then ready for this new all weather Earth Observation technology\ulcorner Actual imaging process of a fully polarimetric SAR system is not easy to explain. But, most Earth system scientists, including geologists, are familiar with polarization microscopes and other polarization effects in nature. The spatial resolution of the new generation of SAR systems have also been steadily increased, almost to the limit of highest optical resolution. In this talk some new applications how they are used for Earth system observation purpose.

• Journal of KIISE:Software and Applications
• /
• v.30 no.12
• /
• pp.1247-1254
• /
• 2003

Currently. the north american symptomatic carotid endarterectomy trial, european carotid surgery trial, and common carotid method are used to measure the carotid stenosis for determining candidate for carotid endarterectomy using the projection angiography from different modalities such as digital subtraction angiography. rotational angiography, computed tomography angiography and magnetic resonance angiography. A new computerized carotid stenosis measuring system was developed using MR angiography axial image to overcome the drawbacks of conventional carotid stenosis measuring methods, to reduce the variability of inter-observer and intra-observer. The gray-level thresholding is one of the most popular and efficient method for image segmentation. We segmented the carotid artery and lumen from three-dimensional time-of-flight MRA axial image using gray-level thresholding technique. Using the measured intima-media thickness value of common carotid artery for each cases, we separated carotid artery wall from the segmented carotid artery region. After that, the regions of segmented carotid without artery wall were divided into region of blood flow and plaque. The calculation of carotid stenosis degree was performed as the following; carotid stenosis grading is(area measure of plaque/area measure of blood flow region and plaque) * 100%.

• Journal of KIISE
• /
• v.42 no.6
• /
• pp.699-706
• /
• 2015

In recent years, as near-duplicate image has been increasing explosively by the spread of Internet and image-editing technology that allows easy access to image contents, related research has been done briskly. However, BoF (Bag-of-Feature), the most frequently used method for near-duplicate image detection, can cause problems that distinguish the same features from different features or the different features from same features in the quantization process of approximating a high-level local features to low-level. Therefore, a post-verification method for BoF is required to overcome the limitation of vector quantization. In this paper, we proposed and analyzed the performance of a post-verification method for BoF, which converts SIFT (Scale Invariant Feature Transform) descriptors into 128 bits binary codes and compares binary distance regarding of a short ranked list by BoF using the codes. Through an experiment using 1500 original images, it was shown that the near-duplicate detection accuracy was improved by approximately 4% over the previous BoF method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.966-974
• /
• 1999

완전 탐색 블록 정합 알고리즘(FBMA)은 다양한 움직임 추정 알고리즘 중 최상의 움직임 추정을 할 수 있으나, 방대한 계산량이 실시간 처리의 적용에 장애 요소이다. 본 논문에서는 완전 탐색 블록 정합 알고리즘에 비해 더 낮은 계산량과 유사한 화질을 가지는 새로운 고속 움직임 추정 알고리즘을 제안한다. 제안한 방법에서는 공간적인 상관성을 이용함으로써 적절한 탐색 영역의 크기를 예측할 수 있다. 현재 블록의 움직임 추정을 위하여 이웃 블록이 가지고 있는 움직임과 탐색 영역의 크기를 이용하여 현재 블록의 탐색 영역을 적응적으로 변화시키는 방법이다. 이 예측값으로 현재 블록의 탐색 영역 크기를 결정한 후, FBMA와 같이 이 영역 안의 모든 화소점들에 대하여 현재 블록을 정합하여 움직임 벡터를 추정한다. 컴퓨터 모의 실험 결과 계산량 측면에서 제안 방법이 완전 탐색 블록 정합 알고리즘보다 50%정도 감소하였으며, PSNR 측면에서는 0.08dB에서 1.29dB 정도 감소하는 좋은 결과를 얻었다.Abstract Full search block-matching algorithm (FBMA) was shown to be able to produce the best motion compensated images among various motion estimation algorithms. However, huge computational load inhibits its applicability in real applications. A new motion estimation algorithm with lower computational complexity and good image quality when compared to the FBMA will be presented in this paper. In the proposed method, The appropriate search area can be predicted by using the temporal correlation between neighbouring blocks. For motion estimation of the current block, it is the method changing adjustably search area of current block by using motion and search area size of the neighbouring block. After deciding search area size of the current block with this predicted value, we estimate motion vector that matching current block like the FBMA for every pixel in this area. By the computer simulation the computation amount of the proposed method can be greatly decreased about 50% than that of the FBMA and the good result of the PSNR can be attained.

• Journal of KIISE:Software and Applications
• /
• v.36 no.12
• /
• pp.996-1008
• /
• 2009

This paper proposes a novel approach for the model-based pose matching of a human body using Active Shape Models. To improve the processing time of model creation and registration, we use a skeleton-type model instead of the conventional silhouette-based models. The skeleton model defines feature information that is used to match the human pose. Images used to make the model are for 600 human bodies, and the model has 17 landmarks which indicate the body junction and key features of a human pose. When applying primary Active Shape Models to the skeleton-type model in the matching process, a problem may occur in the proximal joints of the arm and leg due to the color variations on a human body and the insufficient information for the fore-rear directions of profile normals. This problem is solved by using the background subtraction information of a body region in the input image and adding a 4-directions feature of the profile normal in the proximal parts of the arm and leg. In the matching process, the maximum iteration is less than 30 times. As a result, the execution time is quite fast, and was observed to be less than 0.03 sec in an experiment.

• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1474-1479
• /
• 2015

With mobile devices showing marked improvement in performance in the age of the Internet of Things (IoT), there is demand for rapid processing of the extensive amount of multimedia big data. However, because research on image searching is focused mainly on increasing accuracy despite environmental changes, the development of fast processing of high-resolution multimedia data queries is slow and inefficient. Hence, we suggest a new distributed image search algorithm that ensures both high accuracy and rapid response by using feature extraction of distributed images based on MapReduce, and solves the problem of memory scalability based on BIRCH indexing. In addition, we conducted an experiment on the accuracy, processing time, and scalability of this algorithm to confirm its excellent performance.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.324-333
• /
• 2001

In this paper we present a novel color image segmentation algorithm based on a Gaussian Mixture Model(GMM). It is introduced a Deterministic Annealing Expectation Maximization(DAEM) algorithm which is developed using the principle of maximum entropy to overcome the local maxima problem associated with the standard EM algorithm. In our approach, the GMM is used to represent the multi-colored objects statistically and its parameters are estimated by DAEM algorithm. We also develop the automatic determination method of the number of components in Gaussian mixtures models. The segmentation of image is based on the maximum posterior probability distribution which is calculated by using the GMM. The experimental results show that the proposed DAEM can estimate the parameters more accurately than the standard EM and the determination method of the number of mixture models is very efficient. When tested on two natural images, the proposed algorithm performs much better than the traditional algorithm in segmenting the image fields.

• Journal of KIISE:Software and Applications
• /
• v.32 no.7
• /
• pp.674-682
• /
• 2005

This paper proposes classification of multi-spectral satellite image based on fusion of fuzzy G-K (Gustafson-Kessel) algorithm and PCM algorithm. The suggested algorithm establishes the initial cluster centers by selecting training data from each category, and then executes the fuzzy G-K algorithm. PCM algorithm perform using classification result of the fuzzy G-K algorithm. The classification categories are allocated to the corresponding category when the results of classification by fuzzy G-K algorithm and PCM algorithm belong to the same category. If the classification result of two algorithms belongs to the different category, the pixels are allocated by Bayesian maximum likelihood algorithm. Bayesian maximum likelihood algorithm uses the data from the interior of the average intracluster distance. The information of the pixels within the average intracluster distance has a positive normal distribution. It improves classification result by giving a positive effect in Bayesian maximum likelihood algorithm. The proposed method is applied to IKONOS and Landsat TM remote sensing satellite image for the test. As a result, the overall accuracy showed a better outcome than individual Fuzzy G-K algorithm and PCM algorithm or the conventional maximum likelihood classification algorithm.