• Journal of Computing Science and Engineering
• /
• v.6 no.4
• /
• pp.310-319
• /
• 2012

Next generation wireless receivers demand low computational complexity algorithms with high computing power in order to perform fast signal detections and error estimations. Several signal detection and estimation algorithms have been proposed for next generation wireless receivers which are primarily designed to provide reasonable performance in terms of signal to noise ratio (SNR) and bit error rate (BER). However, none of them have been chosen for direct implementation as they offer high computational complexity with relatively lower computing power. This paper presents a low-complexity power-efficient algorithm that improves the computing power and provides relatively faster signal detection for next generation wireless multiuser receivers. Measurement results of the proposed algorithm are provided and the overall system performance is indicated by BER and the computational complexity. Finally, in order to verify the low-complexity of the proposed algorithm we also present a formal mathematical proof.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2010-2014
• /
• 2005

Object detection and parameter estimation in point cloud data is a relevant subject to robotics, reverse engineering, computer vision, and sport mechanics. In this paper a software is presented for fully-automatic object detection and parameter estimation in unordered, incomplete and error-contaminated point cloud with a large number of data points. The software consists of three algorithmic modules each for object identification, point segmentation, and model fitting. The newly developed algorithms for orthogonal distance fitting (ODF) play a fundamental role in each of the three modules. The ODF algorithms estimate the model parameters by minimizing the square sum of the shortest distances between the model feature and the measurement points. Curvature analysis of the local quadric surfaces fitted to small patches of point cloud provides the necessary seed information for automatic model selection, point segmentation, and model fitting. The performance of the software on a variety of point cloud data will be demonstrated live.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.333-335
• /
• 2011

In the transmitting process of image processing system, images always be corrupted by impulse noise, especially random-valued impulse noise. So removing the random-valued impulse noise is very important, but it is also one of the most difficult case in image processing. The most famous method is the standard median filter, but at edge, the filter has a special feature which has a tendency to decrease the preserve. As a result, we proposed a filter that detection random-valued impulse noise firstly, next to use efficient method to remove the noise and preserve the details. And through the simulation, we compared with the algorithms and indicated that proposed method significant improvement over many other existing algorithms.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.11
• /
• pp.804-815
• /
• 1988

Real-time image processing algorithms to detect position and orientation of rectangular type electronic components are developed. The position detection algorithm is implemented with the use of projection method which is insensitive to noise. Also dynamic thresholding method of projection is employed in order to distinguish between the boundary of a component and any marking on the component. The orientation is determined by Hough transform of boundary candidates of a component, which is obtained a priori by a simple edge detection method. For real-time processing of both position and orientation for a component which is not aligned well, parallel processing method of image data is proposed and tested in real-time.

• ETRI Journal
• /
• v.34 no.4
• /
• pp.503-510
• /
• 2012

We analyze the relationship between channel coherence bandwidth and two complexity-reduced lattice reduction aided detection (LRAD) algorithms for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems in correlated fading channels. In both the adaptive LR algorithm and the fixed interval LR algorithm, we exploit the inherent feature of unimodular transformation matrix P that remains the same for the adjacent highly correlated subcarriers. Complexity simulations demonstrate that the adaptive LR algorithm could eliminate up to approximately 90 percent of the multiplications and 95 percent of the divisions of the brute-force LR algorithm with large coherence bandwidth. The results also show that the adaptive algorithm with both optimum and globally suboptimum initial interval settings could significantly reduce the LR complexity, compared with the brute-force LR and fixed interval LR algorithms, while maintaining the system performance.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.4
• /
• pp.312-317
• /
• 1999

An inflection point on a curve is a point where the curvature vanishes. An inflection point is useful for various geometric operations such as the approximation of curves and intersection points between curves or curve approximations. An inflection point on planar Bezier curves can be easily detected using a hodograph and a derivative of hodograph, since the closed from of hodograph is known. In the case of rational Bezier curves, for the detection of inflection point, it is needed to use the first and the second derivatives have higher degree and are more complex than those of non-rational Bezier curvet. This paper presents three methods to detect inflection points of rational Bezier curves. Since the algorithms avoid explicit derivations of the first and the second derivatives of rational Bezier curve to generate polynomial of relatively lower degree, they turn out to be rather efficient. Presented also in this paper is the theoretical analysis of the performances of the algorithms as well as the experimental result.

• The Journal of Korea Robotics Society
• /
• v.4 no.3
• /
• pp.192-200
• /
• 2009

In this paper, we report the progress in the development of performance evaluation method for detection algorithms of face region and facial components. This paper aims to provide a standardized evaluation method for general approach in face recognition application as a potential component in futuristic intelligent robot systems. From an image capture process to the retrieval of face-related information, all the necessary steps are shown with examples.

• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.11
• /
• pp.319-322
• /
• 1997

This paper presents a CAD (Computer-Aided Diagnosis) system or detection of breast cancer, which is composed of personal computer, X-ray film scanner, high resolution display and application softwares. There are three major algorithms implemented in the application software. The irst algorithm is the adaptive enhancement of the digitized X-ray mammograms based on the first derivative and the local statistics. The second one is to detect the clustered microcalcifications by using the statistical texture analysis, and the third one is the classification of the clustered microcalcifications as malignant or benign by using the shape analysis. These algorithms were verified by real experiments.

• Journal of the Korea Safety Management & Science
• /
• v.17 no.2
• /
• pp.47-54
• /
• 2015

To prevent safety hazards in dangerous working area, we have proposed an intelligent image analysis system. Six common patterns of safety violations of workers' are defined and its motion detection algorithms are developed for alarm to CCTV monitoring system. Developed algorithms are implemented at 195 dangerous areas such as chemical and gas treated room. The results of violated motion detection ratio by developed system shows 94.95% of true positive cases, and 0.21% of false positive cases from all 587,645 event cases in one month implementation period. In the period, it is observed that the number of safety rule violations and the following accidents are decreased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.1
• /
• pp.74-84
• /
• 1988

This paper presents feature extraction technique for linear image using edge detection algorithms. The process of edge finding consists of determining edge magnitud and direction by convolution of an image with a number of edge masks, of thinning and ghresholding these edge magnitudes, of linking the edge elemtnts based on proximity ans orientation, and finally, of approximating the linked elements by piede-wise linear segmentss. These techniques are intened to be general and opplications to terminal detection and road recognition tasks are described. The presentation will be helpful to other researchers attempting to implement similar algorithms.