• Journal of KIISE:Software and Applications
• /
• v.29 no.4
• /
• pp.248-257
• /
• 2002

Clustering is a method for grouping objects with similar properties into a same cluster. SVD(Singular Value Decomposition) is known as an efficient preprocessing method for clustering because of dimension reduction and noise elimination for a high dimensional and sparse data set like E-Commerce data set. However, it is hard to evaluate the worth of original attributes because of information loss of a converted data set by SVD. This research proposes a cluster feature selection method, called ENTROPY-SVD, to find important attributes for each cluster based on entropy weighting and SVD. Using SVD, one can take advantage of the latent structures in the association of attributes with similar objects and, using entropy weighting one can find highly dense attributes for each cluster. This paper also proposes a model-based collaborative filtering recommendation system with ENTROPY-SVD, called CFS-CF and evaluates its efficiency and utilization.

• Journal of Digital Convergence
• /
• v.14 no.4
• /
• pp.277-283
• /
• 2016

This study proposed new methods to classify normal and epileptic seizure signals from EEG signals using peaks extracted by wavelet transform(WT) and Hilbert transform(HT) based on a neural network with weighted fuzzy membership functions(NEWFM). This study has the following three steps for extracting inputs for NEWFM. In the first step, the WT was used to remove noise from EEG signals. In the second step, the HT was used to extract peaks from the wavelet coefficients. We also selected the peaks bigger than the average of peaks to extract big peaks. In the third step, statistical methods were used to extract 16 features used as inputs for NEWFM from peaks. The proposed methodology shows that accuracy, specificity, and sensitivity are 99.25%, 99.4%, 99% with 16 features, respectively. Improvement in feature selection method in view to enhancing the accuracy is planned as the future work for selecting good features from 16 features.

• The Journal of Korean Association of Computer Education
• /
• v.6 no.4
• /
• pp.37-47
• /
• 2003

In this paper. we propose a new digital watermarking technique which uses the self-similarity of OCT(Discrete Cosine Transform) coefficients for the ownership protection of an image, similar coefficients are classified by SOM(Self-Organizing Map) out of Neural Network. The watermark is inserted into the selected cluster among clusters which consist of coefficients. Generally, the inserted watermark in high frequency regions of an image is eliminated by the compression process such as JPEG compressions, and the inserted watermark in low frequency regions of an image causes the distortion of an image quality. Therefore, the watermark is inserted into the cluster that has many coefficients in the middle frequency regions. This algorithm reduces the distortion of an image quality because of inserting the watermark into an image according to the number of coefficients in selected cluster. To extract watermarks from the watermarked image, the selected cluster is used without an original image. In the experiment, the new proposed algorithm have a good quality and endure attacks(JPEG compressions, filtering. zoom in, zoom out, cropping, noises) very well.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.206-211
• /
• 2009

This paper presents a methodology to 1-day-forecast stock index using the automatic feature extraction method based on the neural network with weighted fuzzy membership functions (NEWFM). The distributed non-overlap area measurement method selects the minimized number of input features by automatically removing the worst input features one by one. CPP$_{n,m}$(Current Price Position of the day n: a percentage of the difference between the price of the day n and the moving average from the day n-1 to the day n-m) and the 2 wavelet transformed coefficients from the recent 32 days of CPP$_{n,m}$ are selected as minimized features using bounded sum of weighted fuzzy membership functions (BSWFMs). For the data sets, from 1989 to 1998, the proposed method shows that the forecast rate is 60.93%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2043-2052
• /
• 1997

The object-oriented coding technique which is one of the coding methods in very low bit rate environment is suitable for videophone image sequence. The selection of source model affect image analysis. In this paper, an image analysis method for the object-oriented coding is presented. The process is composed of changed region detection andmotion estimateion. First, we use the standard deviation of frame difference as thrreshold to extract themoving area. If thesum of gray values in mask is greater than the threshold, the center pixel of the mask is regarded as moving region. After moving is detected in changed region by edge operator, observation point is determined from moving region. The motion is estimated by 6-parameter mapping method with determined observation point. The experimantal resutls show that the proposed method can significantly improve the image quality.

• Journal of Advanced Marine Engineering and Technology
• /
• v.40 no.9
• /
• pp.818-823
• /
• 2016

Millimeter wave (mm-wave) communication systems provide high data rates owing to the large bandwidths available at mm-wave frequencies. Recently, analogue and digital combined beamforming, namely "hybrid beamforming" has drawn attentions owing to its ability to realize the required link margins in mm-wave systems. Taking into account the radio frequency (RF) hardware limitations, such as the analogue phase shifter gain constraint and the low resolution of the phase controller, we introduce an uplink hybrid beamforming system that includes discrete Fourier transform (DFT) based "fixed" analogue beamforming. We adopt a zero-forcing (ZF) multiple-input multiple-output (MIMO) equalizer to eliminate the uplink inter-user interferences. Moreover, to improve the sum-rate performances, we propose a transmit beam selection algorithm which makes the uplink effective channels, i.e., the beamformed channels, become near orthogonal. The effectiveness of the proposed beam selection algorithm was verified through numerical simulations.

• Progress in Medical Physics
• /
• v.9 no.2
• /
• pp.95-104
• /
• 1998

The dynamic properties of the 3rd-order neuron of the retina was investigated by using conventional intracellular recording techniques. Experiments were performed in the superfused retina-eyecup preparation of the channel catfish, Ictalurus punctatus. The cornea, iris, lens, and vitreous were removed by absorption with Kimwipe tissue under the dissection microscope thereby exposing the retina in a hemi -eyecup. The electrical signal was amplified by electrometer, viewed on oscilloscope. Regular signals from the cells were recorded on a penwriter and stored by data recorder and computer. Full-field, spot or annular light stimuli were generated on a computer monitor and focused onto the retina. Baclofen hyperpolarized the dark membrane potential, suppressed sustained component and enhanced transient component of the ON-sustained cell with a large transient component, but did not affect the surround antagonism of the cell. Baclofen selectively suppressed responses evoked by moving bar light stimuli on the ON-OFF transient cell. The results suggest that transient cells have directional selectivity in the inner retina. These dynamic properties of amacrine and ganglion cells were modulated by baclofen. Therefore, it is presumed that there is baclofen-induced directional selectivity in ON-OFF transient cells in the catfish retina.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.7
• /
• pp.27-32
• /
• 2010

We can cut and paste portions of MPEG coded bitstream efficiently to rearrange the audio and video sequences using our proposed method. The proposed method decodes the MPEG stream within just only one GOP(Group of Picture), edits the decoded video frames, and encodes it back to a MPEG stream. In this method, precise editing is possible. A pre-processing step is specially designed to provide easy cut and paste processing. In the pre-processing step for editing MPEG streams, the detail information is extracted. In addition, video quality is not degraded after the proposed editing process is applied. Consequently, the experimental results show significant improvements compared with traditional algorithms for video editing method in terms of the efficiency and exactness.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.1
• /
• pp.1-8
• /
• 2017

Given a multi-dimensional dataset of tuples, a skyline query returns a subset of tuples which are not 'dominated' by any other tuples. Skyline query is very useful in Big data analysis since it filters out uninteresting items. Much interest was devoted to the MapReduce-based parallel processing of skyline queries in large-scale distributed environment. There are three requirements to improve parallelism in MapReduced-based algorithms: (1) workload should be well balanced (2) avoid redundant computations (3) Optimize network communication cost. In this paper, we introduce MR-SEAP (MapReduce sample Skyline object Equality Angular Partitioning), an efficient angular space partitioning based skyline query processing using sampling-based pruning, which satisfies requirements above. We conduct an extensive experiment to evaluate MR-SEAP.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.3
• /
• pp.193-199
• /
• 2019

In this paper I propose an algorithm of linear time complexity for NP-complete Maximum Independent Set (MIS) problem. Based on the basic property of the MIS, which forbids mutually adjoining vertices, the proposed algorithm derives the solution by repeatedly selecting vertices in the ascending order of their degree, given that the degree remains constant when vertices ${\nu}$ of the minimum degree ${\delta}(G)$ are selected and incidental edges deleted in a graph of n vertices. When applied to 22 graphs, the proposed algorithm could obtain the MIS visually yet effortlessly. The proposed linear MIS algorithm of time complexity O(n) always executes ${\alpha}(G)$ times, the cardinality of the MIS, and thus could be applied as a general algorithm to the MIS problem.