• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.11
• /
• pp.49-54
• /
• 2005

This paper proposes the low power MDCT algorithm for precise FV with minimum size of sub-window in mobile phone. Proposed algerian uses the coefficient at the middle of whole result process requiring the least number of calculations, since it has a good characteristic when used as standard of the FV and needs minimum amount of operation. In addition, using the DCT result related to the middle frequency makes the characteristic of FV more superior because it suppresses the impulsive noise and difference of focus values is larger than any others. The proposed algorithm is implemented using Verilog HDL and verified using Excalibur-ARM board.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.6
• /
• pp.10-16
• /
• 2000

A new algorithm for estimating bladder volume for portable bladder volume measurement system is proposed. Given the actual image of a bladder, edges between bladder wall and urine are extracted first. Axes are calculated from these data and actual cross section shape is obtained by filtering. Since ordinary shape of a bladder is irregular, two cross-sections(transverse and longitudinal) are considered. With the area of a longitudinal cross-section projected along the axes of transverse cross-section, or vice versa, two estimated volume are obtained. Averaging these two value yields the volume of the bladder. Applied to actual experiments, the proposed algorithm showed explicitly good results in comparison with the conventional techniques.

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.30-34
• /
• 1998

Path Planning is one of the important fields in robot technologies. Local path planning may be done in on-line modes while recognizing an environment of robot by itself. In dynamic environments to obtain fluent information for environments vision system as a sensing equipment is a one of the most necessary devices for safe and effective guidance of robots. If there is a predictor that tells what future sensing outputs will be, robot can respond to anticipated environmental changes in advance. The tracking of obstacles has a deep relationship to the prediction for safe navigation. We tried to deal with active contours, that is snakes, to find out the possibilities of stable tracking of objects in image plane. Snakes are defined based on energy functions, and can be deformed to a certain contour form which would converge to the minimum energy states by the forces produced from energy differences. By using point algorithm we could have more speedy convergence time because the Brent's method gives the solution to find the local minima fast. The snake algorithm may be applied to sequential image frames to track objects in the images by these characteristics of speedy convergence and robust edge detection ability.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.2
• /
• pp.175-180
• /
• 2018

In this paper, a feature extraction and object recognition algorithm using only morphological operations is proposed. The morphological operations used in feature extraction are erosion and dilation, opening and closing combining erosion and dilation, and morphological edge and skeleton detection operation. In the process of recognizing an object based on features, a pooling operation is applied to reduce the dimension. Among various structuring elements, $3{\times}3$ rhombus, $3{\times}3$ square, and $5{\times}5$ circle are arbitrarily selected in morphological operation process. It has confirmed that the proposed algorithm can be applied in object recognition fields through experiments using Internet images.

• Journal of Information Processing Systems
• /
• v.18 no.1
• /
• pp.97-114
• /
• 2022

Interest is increasing in electrocardiogram (ECG) signal analysis for embedded devices, creating the need to develop an algorithm suitable for a low-power, low-memory embedded device. Linear approximation of the ECG signal facilitates the detection of fiducial points by expressing the signal as a small number of vertices. However, dynamic programming, a global optimization method used for linear approximation, has the disadvantage of high complexity using memoization. In this paper, the calculation area and memory usage are improved using a linear approximated template. The proposed algorithm reduces the calculation area required for dynamic programming through local optimization around the vertices of the template. In addition, it minimizes the storage space required by expressing the time information using the error from the vertices of the template, which is more compact than the time difference between vertices. When the length of the signal is L, the number of vertices is N, and the margin tolerance is M, the spatial complexity improves from O(NL) to O(NM). In our experiment, the linear approximation processing time was 12.45 times faster, from 18.18 ms to 1.46 ms on average, for each beat. The quality distribution of the percentage root mean square difference confirms that the proposed algorithm is a stable approximation.

• Journal of KIISE:Software and Applications
• /
• v.37 no.3
• /
• pp.170-176
• /
• 2010

Prediction is an important step in high-performance lossless data compression. In this paper, we propose a novel lossless image coding algorithm to increase prediction accuracy which can display low-resolution images quickly with a multi-resolution image technique. At each resolution, we use pixels of the previous resolution image to estimate current pixel values. For each pixel, we determine its estimated value by considering horizontal, vertical, diagonal edge information and average, weighted-average information obtained from its neighborhood pixels. In the experiment, we show that our method obtains better prediction than JPEG-LS or HINT.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.44 no.6
• /
• pp.11-20
• /
• 2007

This paper proposes a new efficient method to detect ellipses using a segment merging based Randomized Hough Transform. The key idea of the proposed method is to separate single line segments from an edge image, to estimate ellipses from any pair of the single line segments using Randomized Hough Transform (RHT), and to merge the ellipses. This algorithm is able to accuracy estimate the number of ellipses and largely improves the computational time by reducing iterations.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.7
• /
• pp.718-723
• /
• 2014

In this paper, we developed the inspection system of electric vehicle battery plate using image processing. Four cameras are used for acquiring the principal parts of the plate, and several steps of image processing for extracting significant dimensions of the plate such as widths and lengths. As a preceding step, calibration of four cameras is carried for compensating distorted images using dot-arrayed sheet. Coordinate systems for four cameras are defined where one coordinate system is assigned to the reference coordinate system to which the others are relatively described. Line information of the edge in the windowed image is extracted using elaborate edge-detection algorithm, and finally the intersection points between lines are extracted to calculate widths and lengths of the plate from which the error status of the battery plate is decided.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.1000-1009
• /
• 2007

This paper presents a content adaptive interpolation (CAI) for intra deinterlacing. The CAI consists of three steps: pre-processing, content classification, and adaptive interpolation. There are also three main interpolation methods in our proposed CAI, i.e. modified edge-based line averaging (M-ELA), gradient directed interpolation (GDI), and window matching method (WMM). Each proposed method shows different performances according to spatial local features. Therefore, we analyze the local region feature using the gradient detection and classify each missing pixel into four categories. And then, based on the classification result, a different do-interlacing algorithm is activated in order to obtain the best performance. Experimental results demonstrate that the CAI method performs better than previous techniques.

• Korean Journal of Remote Sensing
• /
• v.27 no.3
• /
• pp.359-367
• /
• 2011

A suitable pan-sharpening method has to be chosen with respect to the used spectral characteristic of the multispectral bands and the intended application. The research on pan-sharpening algorithm in improving the accuracy of image classification has been reported. For a classification, preserving the spectral information is important. Other applications such as road detection depend on a sharp and detailed display of the scene. Various criteria applied to scenes with different characteristics should be used to compare the pan-sharpening methods. The pan-sharpening methods in our research comprise rather common techniques like Brovey, IHS(Intensity Hue Saturation) transform, and PCA(Principal Component Analysis), and more complex approaches, including wavelet transformation. The extraction of matching pairs was performed through SIFT descriptor and Canny edge detector. The experiments showed that pan-sharpening techniques for spatial enhancement were effective for extracting point and linear features. As a result of the validation it clearly emphasized that a suitable pan-sharpening method has to be chosen with respect to the used spectral characteristic of the multispectral bands and the intended application. In future it is necessary to design hybrid pan-sharpening for the updating of features and land-use class of a map.