• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.158-166
• /
• 2005

Even though post-processing methods based on projections onto convex sets (POCS) have shown good performance for blocking artifact reduction, it is infeasible to implement POCS for real-time practical applications. This paper proposes DCT domain post-processing method based on POCS. The proposed method shows very similar performance compared to the conventional POCS method, while it reduces tremendously the computational complexity. DCT domain POCS performs the lowpass filtering in the DCT domain, and it removes the inverse DCT and forward DCT modules. Through the investigation of lowpass filtering in the iterative POCS method, we define kth order lowpass filtering which is equivalent to the lowpass filtering in the kth iteration, and the corresponding kth order DCT domain POCS. Simulation results show that the kth order DCT domain POCS without iteration gives very similar performance compared to the conventional POCS with k iterations, while it requires much less computations. Hence the proposed DCT domain POCS method can be used efficiently in the practical post-processing applications with real-time constraints.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.297-300
• /
• 2002

In this paper, we propose a post-processing method to reduce the blocking artifacts. We perform the post-processing only in the spatial domain so that it is readily applicable to real-time video decoder. Many approaches proposed so far for deblocking deal with only The luminance signal. but here we propose processing the chrominance signals as well since the low bit rare application where the blocking artifacts are most problematic suffers significantly from the color misalignment caused by blocking artifacts occurring to chrominance data as well. The proposed method is composed of low pass filtering in two steps considering the edge direction. The first step is the IIR low pass filtering in the diagonal direction, and the second step is another IIR low pass filtering in horizontal and vertical directions.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.16 no.2
• /
• pp.119-124
• /
• 2016

According to the expansion of smartphone penetration and development of wearable device, personal context information can be easily collected. To use this information, the context aware recommender system has been actively studied. The key issue in this field is how to deal with the context information, as users are influenced by different contexts while rating items. But measuring the similarity among contexts is not a trivial task. To solve this problem, we propose context aware post-filtering to apply the context compensation. To be specific, we calculate the compensation for different context information by measuring their average. After reflecting the compensation of the rating data, the mechanism recommends the items to the user. Based on the item recommendation list, we recover the rating score considering the context information. To verify the effectiveness of the proposed method, we use the real movie rating dataset. Experimental evaluation shows that our proposed method outperforms several state-of-the-art approaches.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.3
• /
• pp.49-58
• /
• 2020

Image interpolation, a technology that converts low resolution images into high resolution images, has been widely used in various image processing fields such as CCTV, web-cam, and medical imaging. This technique is based on the fact that the statistical distributions of the white Gaussian noise and the difference between the interpolated image and the original image is similar to each other. The proposed algorithm is composed of three steps. In first, the interpolated image is derived by random image interpolation. In second, we derive weighting functions that are used to apply non-local mean filtering. In the final step, the prediction error is corrected by performing non-local mean filtering by applying the selected weighting function. It can be considered as a post-processing algorithm to further reduce the prediction error after applying an arbitrary image interpolation algorithm. Simulation results show that the proposed method yields reasonable performance.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.44 no.3
• /
• pp.308-317
• /
• 2011

A MBES (multibeam echo sounder) survey around Yokji Island, Korea, was conducted to find an effective method for removing error data. Two post-processing software programs, PDS2000 (RESON) and HIPS (CARIS), were used to remove the error data using an interactive editing method and the CUBE algorithm filter. The post-processing with the PDS2000 and HIPS programs, using the interactive editing method, took 120 and 168 hours, respectively, and there was little difference in the seafloor images. The processing time of the PDS2000 and HIPS programs using the CUBE algorithm filter was 36 and 60 hours, respectively. Nevertheless, there was little difference in the seafloor images because of differences in the factor parameters in each of the post-processing programs. Therefore, post-processing using CUBE filtering can save time in data processing and provide consistent results, excluding the subjective decisions of the operator. This method is more effective than other methods for rejecting erroneous multibeam echo sounder data.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.117-126
• /
• 2011

Recently, AR applications provide location-based spatial information by GPS. Also, the spatial information is displayed by the angle of the camera. So far, traditional spatial indexes in spatial database field retrieve and filter spatial information by the minimum bounding rectangle (MBR) algorithm.(ex. R-tree) MBR strategy is a useful technique in the geographic information systems and location based services. But MBR technique doesn't reflect the characteristics of spatial queries in AR. Spatial queries of AR applications have high possibility of the dead space area between MBRs of non-leaf node and query area. We propose triangle node filtering algorithm that improved efficiency of spatial retrieval used the triangle node filtering techniques by exclusion the dead space. In this paper, the proposed algorithm has been implemented on PostgreSQL/PostGIS. Experimental results show the spatial retrieval that using the proposed algorithm better performance than the spatial retrieval that of the minimum bounding rectangle algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1518-1531
• /
• 1999

The reconstructed images from highly compressed MPEG or H.263 data have noticeable image degradations, such as blocking artifacts near the block boundaries, corner outliers at cross points of blocks, and ringing noise near image edges, because the MPEG or H.263 quantizes the transformed coefficients of 8$\times$8 pixel blocks. A post-processing algorithm has been proposed by authors to reduce quantization effects, such as blocking artifacts, corner outliers, and ringing noise, in MPEG-decompressed images. Our signal-adaptive post-processing algorithm reduces the quantization effects adaptively by using both spatial frequency and temporal information extracted from the compressed data. The blocking artifacts are reduced by one-dimensional (1-D) horizontal and vertical low pass filtering (LPF), and the ringing noise is reduced by two-dimensional (2-D) signal-adaptive filtering (SAF). A comparison study of the subjective quality evaluation using modified single stimulus method (MSSM), the objective quality evaluation (PSNR) and the computation complexity analysis between the signal-adaptive post-processing algorithm and the MPEG-4 VM (Verification Model) post-processing algorithm is performed by computer simulation with several MPEG-4 image sequences. According to the comparison study, the subjective image qualities of both algorithms are similar, whereas the PSNR and the comparison complexity analysis of the signal-adaptive post-processing algorithm shows better performance than the VM post-processing algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.648-661
• /
• 1997

This paper presents a new method for post-processing of coded images based upon the low-pass filtering followed by the projection onto the NQCS (narrow quantization constraint set). We also investigate how the proposed method works on JPEG-coded real images. The starting point of the QCS-based post-processing techniques is the centroid of the QCS, where the original image belongs. The low-pass filtering followed by the projection onto the QCS makes the images lie on the boundary of the QCS. It is likely that, however, the original image is inside the QCS. Hence projection onto the NQCS gives a lower MSE (mean square error) than does the projection onto the QCS. Simulation results show that setting the narrowing coefficients of the NQCS to be 0.2 yields the best performance in most cases. Even though the JPEG-coded image is low-pass filtered and projected onto the NQCS repeatedly, there is no guarantee that the resultant image has a lower MSE and goes closer to the original image. Thus only one iteration is sufficient for the post-processing of the coded images. This is interesting because the main drawback of the iterative post-processing techniques is the heavy computational burden. The single iteration method reduces the computational burden and gives us an easy way to implement the real time VLSI post-processor.

• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.709-716
• /
• 2004

According to the current increase of the usefulness of information by Internet Communication network, several methods are proposed in which a specific domain information nay be efficiently constructed and serviced. This paper proposes Relationship Grouping of Fuzzy Filtering Objects for Multimedia Statistic Post-office Box Construction. The proposed method exploits RelCRO( $D_{omain}$, Gi), RelSRO( $D_{omain}$, Gi) and FAS in order to group using (equation omitted)-cut. To know how well the proposed method is able to work, this paper have test against the methods with 1600 items of multimedia type information, and our system are compared with Random-Key, OGM and the proposed method. The results shows that the proposed method provides the better performance than the other methods.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.4
• /
• pp.195-201
• /
• 2015

For median filtering (MF) detection in altered digital images, this paper presents a new feature vector that is formed from autoregressive (AR) coefficients via an AR model of the gradients between the neighboring row and column lines in an image. Subsequently, the defined 10-D feature vector is trained in a support vector machine (SVM) for MF detection among forged images. The MF classification is compared to the median filter residual (MFR) scheme that had the same 10-D feature vector. In the experiment, three kinds of test items are area under receiver operating characteristic (ROC) curve (AUC), classification ratio, and minimal average decision error. The performance is excellent for unaltered (ORI) or once-altered images, such as $3{\times}3$ average filtering (AVE3), QF=90 JPEG (JPG90), 90% down, and 110% up to scale (DN0.9 and Up1.1) images, versus $3{\times}3$ and $5{\times}5$ median filtering (MF3 and MF5, respectively) and MF3 and MF5 composite images (MF35). When the forged image was post-altered with AVE3, DN0.9, UP1.1 and JPG70 after MF3, MF5 and MF35, the performance of the proposed scheme is lower than the MFR scheme. In particular, the feature vector in this paper has a superior classification ratio compared to AVE3. However, in the measured performances with unaltered, once-altered and post-altered images versus MF3, MF5 and MF35, the resultant AUC by 'sensitivity' (TP: true positive rate) and '1-specificity' (FN: false negative rate) is achieved closer to 1. Thus, it is confirmed that the grade evaluation of the proposed scheme can be rated as 'Excellent (A)'.