• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.2
• /
• pp.358-363
• /
• 2009

Text region detection from the natural scene images used in a variety of applications, many research are needed in this field. Recent research methods is to detect the text region using various algorithm which it is combination of edge based and connected component based. Therefore, this paper proposes an text region detection using edge and regional minima/maxima transformation algorithm from natural scene images, and then detect the connected components of edge and regional minima/maxima, labeling edge and regional minima/maxima connected components. Analysis the labeled regions and then detect a text candidate regions, each of detected text candidates combined and create a single text candidate image, Final text region validated by comparing the similarity and adjacency of individual characters, and then as the final text regions are detected. As the results of experiments, proposed algorithm improved the correctness of text regions detection using combined edge and regional minima/maxima connected components detection methods.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1372-1381
• /
• 2017

In this paper, a texture feature extraction method using local energy and local correlation of Gabor transformed images is proposed and applied to an image retrieval system. The Gabor wavelet is known to be similar to the response of the human visual system. The outputs of the Gabor transformation are robust to variants of object size and illumination. Due to such advantages, it has been actively studied in various fields such as image retrieval, classification, analysis, etc. In this paper, in order to fully exploit the superior aspects of Gabor wavelet, local energy and local correlation features are extracted from Gabor transformed images and then applied to an image retrieval system. Some experiments are conducted to compare the performance of the proposed method with those of the conventional Gabor method and the popular rotation-invariant uniform local binary pattern (RULBP) method in terms of precision vs recall. The Mahalanobis distance is used to measure the similarity between a query image and a database (DB) image. Experimental results for Corel DB and VisTex DB show that the proposed method is superior to the conventional Gabor method. The proposed method also yields precision and recall 6.58% and 3.66% higher on average in Corel DB, respectively, and 4.87% and 3.37% higher on average in VisTex DB, respectively, than the popular RULBP method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.9
• /
• pp.1-6
• /
• 2019

One method for image recognition is template matching. In conventional template matching, the block matching algorithm (BMA) is performed while changing the two-dimensional translational displacement of the template within a given matching image. The template size and shape do not change during the BMA. Since only two-dimensional translational displacement is considered, the success rate decreases if the size and direction of the object do not match in the template and the matching image. In this paper, a variable is added to adjust the two-dimensional direction and size of the template, and the optimal value of the variable is automatically calculated in the block corresponding to each two-dimensional translational displacement. Using the calculated optimal value, the template is automatically transformed into an optimal template for each block. The matching error value of each block is then calculated based on the automatically deformed template. Therefore, a more stable result can be obtained for the difference in direction and size. For ease of use, this study focuses on designing the algorithm in a closed form that does not require additional information beyond the template image, such as distance information.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.306-306
• /
• 2019

전지구적 기온상승으로 인해 미래기후의 관한 연구가 중요시 되고 있다. 위와 같은 현상으로 인하여 다양한 기후변화 연구가 진행되고 있다. 미래기후 연구에는 GCM (General Circulation Model) 모의 결과가 이용된다. 격자 자료로 구성된 GCM은 연구 지점으로 지역적 상세화와 연구지역의 관측자료 사이의 편이 보정(bias correction)이 필수적이다. 위와 같은 근거로 편이 보정 방법의 선택은 매우 중요하며 편의 보정의 방법에 따라서 결과가 다르게 도출될 수 있다. 또한 국내외 연구에서는 다양한 상세화 기법과 편이 보정 기법을 분석 및 평가하는 연구가 진행되고 있으며, 편의 기법 중 대표적인 기법인 Quantile mapping과 Random Forest 기법이 있다. Quantile mapping 기법은 GCM의 과거 모의 데이터와의 편이 보정에 있어서 우수하게 나타났으나, GCM 데이터의 미래 예측 기간(2010년~2018년)까지의 데이터에서는 극한 강수를 정량적으로 분석 가능한 Random Forest 기법이 편이 보정 과정에서 성능이 우수할 것으로 판단된다. 본 연구에서는 우리나라 21개 관측소를 기준으로 총 4개의 GCM(GISS, CSIRO, CCSM4,MIROC5)의 과거 기간 자료(1970년~2005년)를 실제 관측소에서 관측된 강수량을 편의 보정하는 방법에 있어서 편의 보정 기법의 성능을 비교한 결과와 GCM 미래 예측 기간 자료(2010년~2018년)에서의 편의 보정 기법의 성능 결과를 비교하였다. 이를 토대로 편이 보정 기법의 결과를 6개의 평가지수를 이용하여 정량적으로 분석하였으며, 다기준의사결정기법인 TOPSIS(Technique for Order of Preference by Similarity to Ideal Solution)를 이용하여 편이 보정기법들의 성능에 있어서 우선순위를 선정하였다. 본 연구에서 편이 보정 방법으로 Quantile mapping 방법을 사용했으며, Quantile mapping의 기법으로는 비모수 변환법(non-parametric transformation)과 분포기반 변환법(distribution derived transformation)이 사용되었다. 또한 머신러닝 방법 중 하나인 Random Forest 방법을 동시에 사용하여 결과를 비교하였다. 또한 GCM 자료가 격자식으로 제공하고 있기 때문에 관측소 강수량도 공간적으로 환산하여야 하는데, 본 연구에서는 역거리 가중치법(inverse distance weighting, IDW) 방법을 이용하였다.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.73-83
• /
• 2009

In this paper we propose an object similarity matching method based on shape characteristics of an object in an image. The proposed method extracts edge points from edges of objects and generates a log polar histogram with respect to each edge point to represent the relative placement of extracted points. It performs the matching in such a way that it compares polar histograms of two edge points sequentially along with edges of objects, and uses a well-known k-NN(nearest neighbor) approach to retrieve similar objects from a database. To verify the proposed method, we've compared it to an existing Shape-Context method. Experimental results reveal that our method is more accurate in object matching than the existing method, showing that when k=5, the precision of our method is 0.75-0.90 while that of the existing one is 0.37, and when k=10, the precision of our method is 0.61-0.80 while that of the existing one is 0.31. In the experiment of rotational transformation, our method is also more robust compared to the existing one, showing that the precision of our method is 0.69 while that of the existing one is 0.30.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1270-1281
• /
• 1999

피라미드 기법 1 은 d-차원의 공간을 2d개의 피라미드들로 분할하는 특별한 공간 분할 방식을 이용하여 고차원 데이타를 효율적으로 색인할 수 있는 새로운 색인 방법으로 제안되었다. 피라미드 기법은 고차원 사각형 형태의 영역 질의에는 효율적이나, 유사성 검색에 많이 사용되는 고차원 구형태의 영역 질의에는 비효율적인 면이 존재한다. 본 논문에서는 고차원 데이타를 많이 사용하는 유사성 검색에 효율적인 새로운 색인 기법으로 구형 피라미드 기법을 제안한다. 구형 피라미드 기법은 먼저 d-차원의 공간을 2d개의 구형 피라미드로 분할하고, 각 단일 구형 피라미드를 다시 구형태의 조각으로 분할하는 특별한 공간 분할 방법에 기반하고 있다. 이러한 공간 분할 방식은 피라미드 기법과 마찬가지로 d-차원 공간을 1-차원 공간으로 변환할 수 있다. 따라서, 변환된 1-차원 데이타를 다루기 위하여 B+-트리를 사용할 수 있다. 본 논문에서는 이렇게 분할된 공간에서 고차원 구형태의 영역 질의를 효율적으로 처리할 수 있는 알고리즘을 제안한다. 마지막으로, 인위적 데이타와 실제 데이타를 사용한 다양한 실험을 통하여 구형 피라미드 기법이 구형태의 영역 질의를 처리하는데 있어서 기존의 피라미드 기법보다 효율적임을 보인다.Abstract The Pyramid-Technique 1 was proposed as a new indexing method for high- dimensional data spaces using a special partitioning strategy that divides d-dimensional space into 2d pyramids. It is efficient for hypercube range query, but is not efficient for hypersphere range query which is frequently used in similarity search. In this paper, we propose the Spherical Pyramid-Technique, an efficient indexing method for similarity search in high-dimensional space. The Spherical Pyramid-Technique is based on a special partitioning strategy, which is to divide the d-dimensional data space first into 2d spherical pyramids, and then cut the single spherical pyramid into several spherical slices. This partition provides a transformation of d-dimensional space into 1-dimensional space as the Pyramid-Technique does. Thus, we are able to use a B+-tree to manage the transformed 1-dimensional data. We also propose the algorithm of processing hypersphere range query on the space partitioned by this partitioning strategy. Finally, we show that the Spherical Pyramid-Technique clearly outperforms the Pyramid-Technique in processing hypersphere range queries through various experiments using synthetic and real data.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.15 no.5
• /
• pp.64-74
• /
• 2019

Although a non-rigid registration has high demands in clinical practice, it has a high computational complexity and it is very difficult for ensuring the accuracy and robustness of registration. This study proposes a method of applying a non-rigid registration to 3D magnetic resonance images of brain in an unsupervised learning environment by using a deep-learning network. A feature vector between two images is produced through the network by receiving both images from two different patients as inputs and it transforms the target image to match the source image by creating a displacement vector field. The network is designed based on a U-Net shape so that feature vectors that consider all global and local differences between two images can be constructed when performing the registration. As a regularization term is added to a loss function, a transformation result similar to that of a real brain movement can be obtained after the application of trilinear interpolation. This method enables a non-rigid registration with a single-pass deformation by only receiving two arbitrary images as inputs through an unsupervised learning. Therefore, it can perform faster than other non-learning-based registration methods that require iterative optimization processes. Our experiment was performed with 3D magnetic resonance images of 50 human brains, and the measurement result of the dice similarity coefficient confirmed an approximately 16% similarity improvement by using our method after the registration. It also showed a similar performance compared with the non-learning-based method, with about 10,000 times speed increase. The proposed method can be used for non-rigid registration of various kinds of medical image data.

• Journal of Magnetics
• /
• v.21 no.3
• /
• pp.468-475
• /
• 2016

In this article, entropy generation on MHD Williamson nanofluid over a porous shrinking sheet has been analyzed. Nonlinear thermal radiation and chemical reaction effects are also taken into account with the help of energy and concentration equation. The fluid is electrically conducting by an external applied magnetic field while the induced magnetic field is assumed to be negligible due to small magnetic Reynolds number. The governing equations are first converted into the dimensionless expression with the help of similarity transformation variables. The solution of the highly nonlinear coupled ordinary differential equation has been obtained with the combination of Successive linearization method (SLM) and Chebyshev spectral collocation method. Influence of all the emerging parameters on entropy profile, temperature profile and concentration profile are plotted and discussed. Nusselt number and Sherwood number are also computed and analyzed. It is observed that entropy profile increases for all the physical parameters. Moreover, it is found that when the fluid depicts non-Newtonian (Williamson fluid) behavior then it causes reduction in the velocity of fluid, however, non-Newtonian behavior enhances the temperature and nanoparticle concentration profile.

• The KIPS Transactions:PartB
• /
• v.17B no.1
• /
• pp.79-84
• /
• 2010

Matching spots between two sets of 2-dimensional electrophoresis can make it possible to find out the generation, extinction and change of proteins. Generally protein spots are separated by 2-dimensional electrophoresis. This process makes the position of the same protein spot a little different according to the status of the tissue or the experimental environment. Matching the spots shows that the relation of spots is non-uniform and non-linear transformation. However we can also find that the local relation preserves the topology. This study proposes a matching method motivated by the preservation of the topology. To compare the similarity of the topology, we compared the distance and the angle between neighbour spots. Experimental result shows that the proposed method is effective.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.2
• /
• pp.630-643
• /
• 1991

The hydrodynamic stability equations are formulated for buoyancy-induced flows adjacent to a vertical, planar, isothermal surface in cold pure water. The resulting stability equations, when reduced to ordinary differential equation by a similarity transformation, constitute a two-point boundary-value(eigenvalue) problem, which was numerically solved for various values of the density extremum parameter R=( $T_{m}$ - $T_.inf./) / ( $T_{o}$ - $T_.inf./). These stability equations have been solved using a computer code designed to accurately solve two-point boundary-value problems. The present numerical study includes neutral stability results for the region of the flows corresponding to 0.0.leq. R. leq.0.15, where the outside buoyancy force reversals arise. The results show that a small amount of outside buoyancy force reversal causes the critical Grashof number $G^*/ to increase significantly. A further increase of the outside buoyancy force reversal causes the critical Grashof number to decrease. But the dimensionless frequency parameter $B^*/ at $G^*/ is systematically decreased. When the stability results of the present work are compared to the experimental data, the numerical results agree in a qualitative way with the experimental data.erimental data.