• The Journal of the Convergence on Culture Technology
• /
• v.7 no.3
• /
• pp.353-358
• /
• 2021

This study provides the syntactic analysis for the agreement attraction by proposing three types of syntactic subject-verb agreement. Because subject-verb number agreement codifies the link between a predicate and its subject, it must be the purely syntactic processes of the head-to-head agreement or the feature percolation, where relevant agreement features percolate upward or downward through the hierarchical syntactic structure. The agreement errors are not affected by linear proximity or minimal interference, but instead are affected by the hierarchical relationship between an agreement target and a local attractor. The data in this paper includes the complex noun phrases with a modifier PP or a relative clause CP. Here, the [+PL] feature is suggested to be a local attractor for subject-verb agreement errors as a strong feature. Therefore, speakers tend to erroneously produce plural agreement for a singular subject in a main clause due to a plural NP in a modifier PP or plural agreement for a singular subject in a relative clause due to plural main subject.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.5
• /
• pp.960-966
• /
• 2017

In this paper, we proposed an algorithm that can extract lesion by inputting a medical image. Feature points are extracted using SIFT algorithm to extract genetic training of medical image. To increase the intensity of the feature points, the input image and that raining image are matched using vector similarity and the lesion is extracted. The vector similarity match can quickly lead to lesions. Since the direction vector is generated from the local feature point pair, the direction itself only shows the local feature, but it has the advantage of comparing the similarity between the other vectors existing between the two images and expanding to the global feature. The experimental results show that the lesion matching error rate is 1.02% and the processing speed is improved by about 40% compared to the case of not using the feature point intensity information.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.367-370
• /
• 2005

This paper proposes a novel method for content-based watermarking based on feature points of an image. At each feature point, watermark is embedded after affine normalization according to the local characteristic scale and orientation. The characteristic scale is the scale at which the normalized scale-space representation of an image attains a maximum value, and the characteristic orientation is the angle of the principal axis of an image. By binding watermarking with the local characteristics of an image, resilience against affine transformations can be obtained. Experimental results show that the proposed method is robust against various image processing steps including affine transformations, cropping, filtering, and JPEG compression.

• Korean Journal of English Language and Linguistics
• /
• v.1 no.4
• /
• pp.629-649
• /
• 2001

This paper aims to provide an account for the English anaphors under the framework of the recent development of minimalism (Chomsky 1999, 2001). I propose that the anaphor has the uninterpretable [a] feature. The Agree operation erases the [a] feature by feature match. Once the [a] is deleted, the derivation converges, providing a proper interpretation of the anaphor. When there is no matching phi-features, the [a] cannot be eliminated, inducing the derivation to crash. The Agree operation can account for not only the typical local binding cases in English but the apparent long-distance binding cases in the picture-DP and expletive constructions. Consequently, the traditional concept of the binding domain and dichotomy between local and long-distance types are abandoned in favor of the analysis under the framework of minimalism. The minimalist accounts thus maximally simplifies the binding principles, using the general operation Agree only.

• Journal of KIISE:Software and Applications
• /
• v.31 no.8
• /
• pp.1113-1120
• /
• 2004

This paper proposes a novel hybrid genetic algorithm for the feature selection. Local search operations are devised and embedded in hybrid GAs to fine-tune the search. The operations are parameterized in terms of the fine-tuning power, and their effectiveness and timing requirement are analyzed and compared. Experimentations performed with various standard datasets revealed that the proposed hybrid GA is superior to a simple GA and sequential search algorithms.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.4
• /
• pp.1851-1863
• /
• 2015

– In the paper, to handle the problem of traditional bag-of-features model ignoring the spatial relationship of local features in human action recognition, we proposed a Multiscale Spatial Position Coding under Locality Constraint method. Specifically, to describe this spatial relationship, we proposed a mixed feature combining motion feature and multi-spatial-scale configuration. To utilize temporal information between features, sub spatial-temporal-volumes are built. Next, the pooled features of sub-STVs are obtained via max-pooling method. In classification stage, the Locality-Constrained Group Sparse Representation is adopted to utilize the intrinsic group information of the sub-STV features. The experimental results on the KTH, Weizmann, and UCF sports datasets show that our action recognition system outperforms the classical local ST feature-based recognition systems published recently.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.1-9
• /
• 2003

In this paper, we propose a new fingerprint feature extraction method using the convex structure. A fingerprint minutiae flows along the uniform direction and is regarded as a sinusoidal signal across the normal direction. Local maxima of the signal represent coarse thinned one-pixel-wide ridges in which the convex region of the signal correspond to ridges. The proposed fingerprint feature extraction method detects the convex structure and local maxima. Finally fingerprint features are extracted from one-pixel-wide ridges. Because it has no parameter, it is efficient for various fingerprint identification systems.

• Journal of Information Processing Systems
• /
• v.12 no.3
• /
• pp.502-510
• /
• 2016

Considering video copy transform diversity, a multi-feature video copy detection algorithm based on a Speeded-Up Robust Features (SURF) local descriptor is proposed in this paper. Video copy coarse detection is done by an ordinal measure (OM) algorithm after the video is preprocessed. If the matching result is greater than the specified threshold, the video copy fine detection is done based on a SURF descriptor and a box filter is used to extract integral video. In order to improve video copy detection speed, the Hessian matrix trace of the SURF descriptor is used to pre-match, and dimension reduction is done to the traditional SURF feature vector for video matching. Our experimental results indicate that video copy detection precision and recall are greatly improved compared with traditional algorithms, and that our proposed multiple features algorithm has good robustness and discrimination accuracy, as it demonstrated that video detection speed was also improved.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3721-3737
• /
• 2015

3D reconstruction based on binocular data is significant to machine vision. In our method, we propose a new and high efficiency 3D reconstruction approach by using a consumer camera aiming to: 1) address the configuration problem of dual camera in the binocular reconstruction system; 2) address stereo matching can hardly be done well problem in both time computing and precision. The kernel feature is firstly proposed in calibration stage to rectify the epipolar. Then, we segment the objects in the camera into background and foreground, for which system obtains the disparity by different method: local window matching and kernel feature-based matching. Extensive experiments demonstrate our proposed algorithm represents accurate 3D model.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.10
• /
• pp.90-99
• /
• 1992

In this paper, we propose a neural network model for speech recognition. The model consists of feature extraction parts and recognition parts. The interconnection model based on ${\Delta}^2$G operator was used for frequency analysis. Two features, global feature and local feature, were extracted from this model. Recognition parts consist of global grouping stage and local grouping stage. When the input pattern was coded by slope method, the recognition rate of speakers, A and B, was 100%. When the test was performed with the data of 9 speakers, the recognition rate of 91.4% was obtained.