• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.358-366
• /
• 2002

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the high speed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Maps(SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space and generates a topological feature map. A topological feature map preserves the mutual relations (similarities) in feature spaces of input data, and clusters mutually similar feature vectors in a neighboring nodes. Therefore each node of the topological feature map holds a node vector and similar images that is closest to each node vector. We implemented a k-NN search for similar image classification as to (1) access to topological feature map, and (2) apply to pruning strategy of high speed search. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• Spatial Information Research
• /
• v.13 no.4 s.35
• /
• pp.355-364
• /
• 2005

Vector data sets (e.g. maps) are currently major sources of displaying, querying, and identifying locations of spatial features in a variety of applications. Especially in mobile environment, the needs for using spatial data is increasing, and the relative large size of vector maps need to be smaller. Recently, there have been several studies about vector map compression. There was clustering-based compression method with novel encoding/decoding scheme. However, precedent studies did not consider that spatial data have to be updated periodically. This paper explores the problem of existing clustering-based compression method. We propose an adaptive approximation method that is capable of handling data updates as well as reducing error levels. Experimental evaluation showed that when an updated event occurred the proposed adaptive approximation method showed enhanced positional accuracy compared with simple cluster based compression method.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1135-1148
• /
• 2017

Speech recognition is one of the fascinating fields in the area of Computer science. Accuracy of speech recognition system may reduce due to the presence of noise present in speech signal. Therefore noise removal is an essential step in Automatic Speech Recognition (ASR) system and this paper proposes a new technique called combined thresholding for noise removal. Feature extraction is process of converting acoustic signal into most valuable set of parameters. This paper also concentrates on improving Mel Frequency Cepstral Coefficients (MFCC) features by introducing Discrete Wavelet Packet Transform (DWPT) in the place of Discrete Fourier Transformation (DFT) block to provide an efficient signal analysis. The feature vector is varied in size, for choosing the correct length of feature vector Self Organizing Map (SOM) is used. As a single classifier does not provide enough accuracy, so this research proposes an Ensemble Support Vector Machine (ESVM) classifier where the fixed length feature vector from SOM is given as input, termed as ESVM_SOM. The experimental results showed that the proposed methods provide better results than the existing methods.

• KIEAE Journal
• /
• v.8 no.5
• /
• pp.43-48
• /
• 2008

This study is about offering quantitatively analytic frame of streetscape, and also about making a way to be standardized and adapt changing landscape. This allows us to manage a form of elevation map after the application to GIS. The form of elevation map is a visible and vertical arrangement method of data recognizable while walking or driving. Applying measurable traits enables us to make a quantitative control over each element of which streetscape consists. After all, it would play a great roll in organizing and maintaining fine streetscape of each city. As the basic ways to make the elevation map, this study proposes the methods of providing quantitative analytic frame of streetscape after applying elevation data, Raster Data and Vector Data, which were investigated on the basis of GIS. In addition, as a simulation for increasing reality, certain streets, where the streetscape is very important, were chosen so that they enable us to utilize quantitatively analytic data of streetscape with analyzing the +degree of opening ratio in the boundary of D/H=2, comparing between wall area and windowpane area, comparing between facade area and sign board area, and calculating both area and ratio which are applied to ecospace.

• Journal of Digital Contents Society
• /
• v.15 no.3
• /
• pp.365-371
• /
• 2014

In the era of big data, algorithms for the existing IT environment cannot accept on a distributed architecture such as hadoop. Thus, new distributed algorithms which apply a distributed framework such as MapReduce are needed. Lloyd's algorithm commonly used for vector quantization is developed using MapReduce recently. In this paper, we proposed a decombined distributed VQ codebook generation algorithm based on a distributed VQ codebook generation algorithm using MapReduce to get a result more fast. The result of applying the proposed algorithm to big data showed higher performance than the conventional method.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.235-239
• /
• 2001

Finding intersection point between a surface and a line is one of major problem in CAD/CAM. The intersection point could be found in an exact form or with numerical method. In this paper, the exact solution of the intersection point between a ruled surface which is generated by the movement of an endmill and the z-direction vector is presented. The cutter swept surface which is a ruled surface and the Z-direction vector are represented with parametric equations. With the nature of parametric equations, the geometric properties at the intersection point are easily acquired.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.23-26
• /
• 2003

The vector field histogram(VFH) uses a two-dimensional Cartesian histogram grid as a world model. The VFH method subsequently employs a two-stage data-reduction process in order to compute the desired control commands for the vehicle. In the first stage the histogram grid is reduced to a one dimensional polar histogram that is constructed around the robot's momentary location. Each sector in the polar histogram contains a value representing the polar obstacle density in that direction. In the second stage, the algorithm selects the most suitable sector from among all polar histogram sectors with a low polar obstacle density, and the steering of the robot is aligned with that direction. We applied this algorithm to our four-legged robot.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1650-1669
• /
• 2017

In this study, each pixel in an ear is used as a centroid to generate a cake. Subsequently the major axis length of this cake is computed and obtained. This obtained major axis length serves as a feature to recognize an ear. Later, the ear hole is used as a centroid and a 16-circle template is generated to extract the major axis lengths of the ear. The 16-circle template extracted signals are used to recognize an ear. In the next step, a ring-to-line mapping technique is used to map these major axis lengths to several straight-line signals. Next, the complex plane vector computing technique is used to determine the similarity of these major axis lengths, whereby a solution to the image-rotating problem is achieved. The aforementioned extracted signals are also compared to the ones that are extracted from its neighboring pixels, whereby solving the image-shifting problem. The algorithm developed in this study can precisely identify an ear image by solving the image rotation and image shifting problems.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.478-480
• /
• 2002

영상 분할은 임상에서의 진단과 분석 및 3차원 가시화를 위해 선행되어야 할 필수 과정이다. 의료영상은 영상이 가지는 데이터 자체의 고유한 제약들과 해부학적 변이성 때문에 영상분할에 어려움이 있다. 본 논문에서는 의료영상의 분할을 위해 스네이크의 새로운 외부 힘으로 Gradient Vector Flow(GVF)를 이용한 방법을 제안한다. 제안된 방법은 2차원 의료영상에서 에지 맵(edge map)을 구하고, GVF을 계산하여 스네이크의 경계선과 같이 관심 있는 특징의 에너지 함수가 최소가 되는 GVF 스네이크(snake)를 구한다. 제안된 방법을 초음파영상과 자기공명영상 같은 의료영상의 분할에 적용한 결과 기존의 스네이크와 달리 잡음이나 오목한 부분이 있는 객체들을 성공적으로 분할하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.11a
• /
• pp.147-149
• /
• 2011

사용자에게 편리한 인터페이스를 제공하는 IT 기기가 널리 보급되면서 직관적인 인터페이스 기술에 대한 관심이 높아지고 있다. 이미지 센서로 입력된 사람의 손 모양이나 움직임을 이용하는 인터페이스가 그 중 하나이다. 한 편 이미지 센서 영상을 저장하기 위하여 H.264/AVC와 같은 영상 압축 기술이 사용된다. 영상을 압축하기 위해 부호기는 모든 Macroblock에서 움직임 추정을 수행한다. 추정된 움직임 정보는 손 움직임을 인식하는데 사용될 수 있고 이를 통해 전자 기기에 명령을 내리는 인터페이스 기술의 한 부분을 구현하는 것이 가능하다. 본 논문은 H.264/AVC 부호기의 Motion Vector를 이용하는 손 추적 알고리즘을 제시한다. 제시된 알고리즘은 손 움직임 추적의 정확도를 향상시키기 위하여 Motion Vector보다 신뢰도가 높은 Motion Density Map 정보를 사용한다. 이 정보를 이용하여 이동한 손을 포함하는 손 윈도우를 결정한다. 실험 결과를 통하여 제시된 알고리즘이 손의 움직임을 추적하는 것을 확인할 수 있다.