• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1507-1514
• /
• 2016

Full-image guided filter reflects all pixels of image in filtering by using weight propagation and two-pass model, whereas the existing guide filter is processed based on the kernel window. Therefore the computational complexity can be improved while maintaining characteristics of guide filter, such as edge-preserving, smoothing, and so on. In this paper, we propose an efficient VLSI architecture for the full-image guided filter by analyzing the data dependency, the data frequency and the PSNR analysis of the image in order to achieve enough speed for various applications such as stereo vision, real-time systems, etc. In addition, the proposed efficient scheduling enables the realtime process by minimizing the idle period in weight computation. The proposed VLSI architecture shows 214MHz of maximum operating frequency (image size: 384*288, 965 fps) and 76K of gates (internal memory excluded).

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.89-98
• /
• 2009

As data stream is entered into system continuously and the memory space is limited, the data exceeding the memory size cannot be processed. In order to solve the problem, load shedding methods which drop a part of data to prevent exceeding the storage space have been researched. Generally, a traditional load shedding method uses random sampling with optimized rate according to data deviation. The method samples data not to distinguish those used in spatial query because the method uses only a random sampling with optimized rate according to data deviation. Therefore, the accuracy of query was reduced in u-GIS environment including spatial query. In this paper, we researched a new load shedding method improving accuracy of the query in u-GIS environment which runs spatial query and aspatial query simultaneously. The method uses a new sampling method that samples data having low probability used in query. Therefore proposed method improves spatial query accuracy and query processing speed as applying spatial filtering operation to sampling operator.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.6
• /
• pp.1477-1484
• /
• 2015

This paper proposes a robust method for object tracking based on Kalman filters algorithm and covariance matrix. As a feature of the object to be tracked, covariance matrix ensures the continuity of the moving target tracking in the image frames because the covariance is addressed spatial and statistical properties as well as the correlation properties of the features, despite the changes of the form and shape of the target. However, if object moves faster than operation time, real time tracking is difficult. In order to solve the problem, Kalman filters are used to estimate the area of the moving object and covariance matrices as a feature vector are compared with candidate regions within the estimated Kalman window. The results show that the tracking rate of 96.3% achieved using the proposed method.

• Journal of Digital Contents Society
• /
• v.18 no.1
• /
• pp.175-182
• /
• 2017

Noises are usually generated by various external causes and low quality devices in image data acquisition and recording as well as by channel interference in image transmission. Since these noise signals result in the loss of information, subsequent image processing is subject to the corruption of the original image. In general, image processing is performed in the mixed noise environment where common types of noise, known to be Gaussian and impulse, are present. This study proposes an iterative weighted mean filter for reducing mixed type of noise. Impulse noise pixels are first turned off in the input image, then $3{\times}3$ sliding window regions are processed by replacing center pixel with the result of weighted mean mask operation. This filtering processes are iterated until all the impulse noise pixels are replaced. Applied to images corrupted by Gaussian noise with ${\sigma}=10$ and different levels of impulse noise, the proposed filtering method improved the PSNR by up to 12.98 dB, 1.97 dB, 1.97 dB respectively, compared to SAWF, AWMF, MMF when impulse noise desities are less than 60%.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.9
• /
• pp.45-53
• /
• 2015

Adaptive support-weight based algorithm can produce better disparity map compared to generic area-based algorithms and also can be implemented as a realtime system. In this paper, we propose a realtime system based on geodesic support-weight which performs better segmentation of objects in the window. The data scheduling is analyzed for efficient hardware design and better performance and the parallel architecture for weight update which takes the longest delay is proposed. The exponential function is efficiently designed using a simple step function by careful error analysis. The proposed architecture is designed with verilogHDL and synthesized using Donbu Hitek 0.18um standard cell library. The proposed system shows 2.22% of error rate and can run up to 260Mhz (25fps) operation frequency with 182K gates.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.2021-2030
• /
• 2012

Premature ventricular contraction(PVC) is the most common disease among arrhythmia and it may cause serious situations such as ventricular fibrillation and ventricular tachycardia. Particularly, in the healthcare system that must continuously monitor patient's situation, it is necessary to process ECG (Electrocardiography) signal in realtime. In other words, the design of algorithm that exactly detects R wave using minimal computation and classifies PVC by analyzing the persons's physical condition and/or environment is needed. Thus, the patient adaptive pattern matching algorithm for the classification of PVC is presented in this paper. For this purpose, we detected R wave through the preprocessing method, adaptive threshold and window. Also, we applied pattern matching method to classify each patient's normal cardiac behavior through the Hash function. The performance of R wave detection and abnormal beat classification is evaluated by using MIT-BIH arrhythmia database. The achieved scores indicate the average of 99.33% in R wave detection and the rate of 0.32% in abnormal beat classification error.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1A
• /
• pp.71-79
• /
• 2010

The algorithm of multiple channel signal processing requires the flexibility of variable frequency band, efficient allocation of transmission power, and flexible frequency band reallocation to satisfy various service types which requires different transmission rates and frequency band. This paper proposes an improved multiple channel signal processing for converting the frequency band of multiple carrier signals efficiently using a window function and DFT in the time domain. In contrast to the previous algorithm of multiple-channel signal processing performing band-pass signal processing in the frequency domain, the proposed algorithm is a method of block signal processing using a window function in the time domain. In addition, the complexity of proposed algorithm of the window function is lower than that of the previous algorithm performing signal processing in the frequency domain, and it performs the frequency band transform efficiently. The computer simulation result shows that the perfect reconstruction of output signal and the flexible frequency band reallocation is performed efficiently by the proposed algorithm.

• Convergence Security Journal
• /
• v.22 no.1
• /
• pp.121-127
• /
• 2022

Recently, social issues related to cryptocurrency mining are continuously occurring at the same time as cryptocurrency prices are rapidly increasing. In particular, since cryptocurrency can be acquired through cryptographic operation, anyone with a computer can easily try mining, and as the asset value of major cryptocurrencies such as Bitcoin and Ethereum in creases, public interest is increasing. In addition, the number of cases where individuals who own high-spec computers mine cryptocurrencies in various places such as homes and businesses are increasing. Some miners are mining at companies or public places, not at home, due to the heat problem of computers that consume a lot of electrical energy, causing various problems in companies as well as personal moral problems. Therefore, this study studies the technology to obtain evidence for the traces of mining attempts using the Windows artifacts of the computers that mined cryptocurrency. Through this, it is expected that it can be used for internal audit to strengthen corporate security.

• Journal of Broadcast Engineering
• /
• v.20 no.5
• /
• pp.697-705
• /
• 2015

This paper proposes a high-speed and high-quality haze removal method based on dual dark channels. In the conventional method, the halo artifacts are suppressed by the additional transmission refinement, but the transmission refinement is computationally intensive and the quality of the haze removal is sometimes unsatisfactory because of the residual halo artifacts. In the proposed method, the transmission is estimated with the mixture of the two dark channels with different window size. By mixing the two dark channels so as to avoid the halo artifacts, the proposed method realizes a high-quality haze removal even without the transmission refinement. Experimental results demonstrate that the quality of the results by the proposed method is superior to those by the conventional method and the speed of the haze removal is about 14.2 times higher than that of the conventional method.

• Journal of Korean Society for Geospatial Information Science
• /
• v.4 no.1 s.6
• /
• pp.93-102
• /
• 1996

For an atomatic generation of DEM(Digital Elevation Model) by computer, it is a time-consumed work to determine adquate matches from stereo images. Correlation and evenly distributed area-based method is generally used for matching operation. In this paper, we propose a new approach that computes matches efficiantly by changing the size of mask window and search area according to the given terrain information. For image segmentation, at first edge-preserving smoothing filter is used for preprocessing, and then region growing algorithm is applied for the filterd images. The segmented regions are classifed into mountain, plain and water area by using MRF(Markov Random Filed) model. Maching is composed of predicting parallex and fine matching. Predicted parallex determines the location of search area in fine matching stage. The size of search area and mask window is determined by terrain information for each pixel. The execution time of matching is reduced by lessening the size of search area in the case of plain and water. For the experiments, four images which are covered $10km{\times}10km(1024{\times}1024\;pixel)$ of Taejeon-Kumsan in each are studied. The result of this study shows that the computing time of the proposed method using terrain information for matching operation can be reduced from 25% to 35%.