• Geomechanics and Engineering
• /
• v.36 no.3
• /
• pp.205-215
• /
• 2024

Manually mapping fractures in construction stone mines is challenging, time-consuming, and hazardous. In this method, there is no physical access to all points. In contrast, digital image processing offers a safe, cost-effective, and fast alternative, with the capability to map all joints. In this study, two methods of detecting the trace of discontinuities using image processing in construction stone mines are presented. To achieve this, we employ two modified Hough transform algorithms and the degree of neighborhood technique. Initially, we introduced a method for selecting the best edge detector and smoothing algorithms. Subsequently, the Canny detector and median smoother were identified as the most efficient tools. To trace discontinuities using the mentioned methods, common preprocessing steps were initially applied to the image. Following this, each of the two algorithms followed a distinct approach. The Hough transform algorithm was first applied to the image, and the traces were represented through line drawings. Subsequently, the Hough transform results were refined using fuzzy clustering and reduced clustering algorithms, along with a novel algorithm known as the farthest points' algorithm. Additionally, we developed another algorithm, the degree of neighborhood, tailored for detecting discontinuity traces in construction stones. After completing the common preprocessing steps, the thinning operation was performed on the target image, and the degree of neighborhood for lineament pixels was determined. Subsequently, short lines were removed, and the discontinuities were determined based on the degree of neighborhood. In the final step, we connected lines that were previously separated using the method to be described. The comparison of results demonstrates that image processing is a suitable tool for identifying rock mass discontinuity traces. Finally, a comparison of two images from different construction stone mines presented at the end of this study reveals that in images with fewer traces of discontinuities and a softer texture, both algorithms effectively detect the discontinuity traces.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.6
• /
• pp.36-42
• /
• 2007

According to the increased demand of high quality multimedia content, it needs to recover an old movies. But the film of old movie is damaged with line scratches and dust. In this paper, the detection and restoration algorithm of B/W line scratch is proposed. Our scheme estimates and interpolates the damaged partial information of line scratch using the linear recursive curve trace which consider the intensity values of left and right region of line scratch and then median filtering processed. As a result, the film image PSNR 44.68 with B/W line scratch is increased up to 48.60 and the intensity of the interpolate pixel is approached about 14 against the pixel of original image.

• Journal of Digital Contents Society
• /
• v.13 no.1
• /
• pp.75-81
• /
• 2012

SSDs(Solid State Drives) have many attractive features such as high performance, low power consumption, shock resistance, and low weight, so they replace HDDs to a certain extent. An SSD has FTL(Flash Translation Layer) which emulate block storage devices like HDDs. A garbage collection, one of major functions of FTL, effects highly on the performance and the lifetime of SSDs. However, there is no de facto standard for new garbage collection algorithms. To solve this problem, we propose trace driven offline optimal algorithms for garbage collection of FTL. The proposed algorithm always guarantees minimal number of erase operation. In addition, we verify our proposed algorithm using TPC trace.

• Transactions of Materials Processing
• /
• v.12 no.6
• /
• pp.542-549
• /
• 2003

Three-dimensional forging analysis becomes an inevitable tool to make design process more reliable and more producible. In this study, in order to make the investigation for three-dimensional forging analysis more conveniently and accurately, a new post processor was developed. For post-processing of multi-stage forging simulation, efficient data structure was proposed and applied by using STL. New file architecture was developed to handle successive and huge data efficiently, common in three-dimensional forging analysis. Since sectioning and flow tracing plays an important role in the investigation of analysis result, we developed an algorithm suitable for 4-node and 10-node tetrahedron. This flow tracing algorithm can trace and reverse-trace flow through remeshing. Developed program shows good performance and functionality. Especially, a big size problem can be handled easily due to proposed data structure and file architecture.

• Journal of Broadcast Engineering
• /
• v.5 no.2
• /
• pp.281-289
• /
• 2000

While acquiring images, the relative motion between the imaging device and the object scene seriously damages the image quality. This phenomenon is called motion blur. The peak-trace approach, which is our recent previous work, identifies important parameters to characterize the point spread function (PSF) of the blur, given only the blurred image itself. With the peak-trace approach the direction of the motion blur can be extracted regardless of the noise corruption and does not need much Processing time. In this paper stochastic peak-trace approaches are introduced. The erroneous data can be selected through the ML classification, and can be made small through weighting. Therefore the distortion of the direction in the low frequency region can be prevented. Using the linear prediction method, the irregular data are prohibited from being selected as the peak point. The detection of the second peak using the proposed moving average least mean (MALM) method is used in the Identification of the motion extent. The MALM method itself includes a noise removal process, so it is possible to extract the parameters even an environment of heavy noise. In the experiment, we could efficiently restore the degraded image using the information obtained by the proposed algorithm.

• Journal of Power System Engineering
• /
• v.13 no.2
• /
• pp.71-82
• /
• 2009

This paper presents a real-time haptic rendering method for a realistic force feedback in a remote environment with varying communication time-delay. The remote environment is assumed as a virtual environment based on a computer graphics, for example, on-line shopping mall, internet game and cyber-education. The properties of a virtual object such as stiffness and viscosity are assumed to be unknown because they are changed according to the contact position and/or a penetrated depth into the object. The DARMAX model based output estimator is proposed to trace the correct impedance of the virtual object in real-time. The output estimator is developed on the input-output relationship. It can trace the varying impedance in real-time by virtue of P-matrix resetting algorithm. And the estimator can trace the correct impedance by using a white noise that prevents the biased input-output information. Realistic output forces are generated in real-time, by using the inputs and the estimated impedance, even though the communication time delay and the impedance of the virtual object are unknown and changed. The generated forces trace the analytical forces computed from the virtual model of the remote environment. Performance is demonstrated by experiments with a 1-dof haptic device and a spring-damper-based virtual model.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.9 s.351
• /
• pp.38-43
• /
• 2006

In this paper, we propose the efficient dead pixel detection algorithm for CMOS image sensors and its hardware architecture. The CMOS image sensors as image input devices are becoming popular due to the demand for miniaturized, low-power and cost-effective imaging systems. However, the presence of the dead pixels degrade the image quality. To detect the dead pixels, the proposed algorithm is composed of scan, trace and detection step. The experimental results showed that it could detect 99.99% of dead pixels. It was designed in a hardware description language and total logic gate count is 3.2k using 0.25 CMOS standard cell library.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.1
• /
• pp.61-66
• /
• 2001

In this paper, we design high speed Viterbi decoding algorithm which is aimed for Wireless LAN. Wireless LAN transmits data at rate 6∼54 Mbps. This high speed is not easy to implement Viterbi decoder with single ACS. So parallel ACS butterfly structure is to be used and several time-dependent problem is to be solved. We simulate Viterbi algorithm using new branch metric calculating method to save time, and consider trace back algorithm which is adaptable to high speed Viterbi decoder. With simulated, we determine the structure of Viterbi decoder. This architecture is available to high speed and low power Viterbi decoder.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.3
• /
• pp.654-661
• /
• 2011

This paper is about a personal identification algorithm using an ECG that has been studied by a few researchers recently. Previously published algorithm can be classified as two methods. One is the method that analyzes of ECG features and the other is the morphological analysis of ECG. The main characteristic of proposed algorithm can be classified the method of analysis ECG features. Proposed algorithm adopts DSTW(Down Slope Trace Wave) for extracting ECG features, and applies SVM(Support Vector Machine) to training and testing as a classifier algorithm. We choose 18 ECG files from MIT-BIH Normal Sinus Rhythm Database for estimating of algorithm performance. The algorithm extracts 100 heartbeats from each ECG file, and use 40 heartbeats for training and 60 heartbeats for testing. The proposed algorithm shows clearly superior performance in all ECG data, amounting to 93.89% heartbeat recognition rate and 100% ECG recognition rate.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.269-283
• /
• 1999

Surface/surface intersection is a common and important problem in geometric modeling and CAD/CAM. Several methods have been used to approach this problem. All possible intersection curves can be obtained by using the subdivision algorithm, while it requires a great deal of memory and is somewhat inefficient. The tracing algorithm is much faster than the subdivision algorithm, and can find points on the intersection curve sequentially. But, the tracing algorithm has some problems in the intersection curves on surface boundaries. In this paper, an Improved tracing algorithm that includes some ideas such as a new trace-terminating condition for the intersection curves on surface boundaries, detecting closed intersections and extension for composite surfaces is suggested. This algorithm consists of three step: generating state points for curve tracing, tracing intersection curves and sorting pieces of the intersection curves. The results of this algorithm and comparisons to the 'DESIGNBASE' and 'ACIS' system are presented.