• 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.

• 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 information and communication convergence engineering
• /
• v.9 no.2
• /
• pp.207-211
• /
• 2011

This paper presents a method for facial feature representation and recognition from the Covariance Matrices of the Gabor-filtered images. Gabor filters are a very powerful tool for processing images that respond to different local orientations and wave numbers around points of interest, especially on the local features on the face. This is a very unique attribute needed to extract special features around the facial components like eyebrows, eyes, mouth and nose. The Covariance matrices computed on Gabor filtered faces are adopted as the feature representation for face recognition. Geodesic distance measure is used as a matching measure and is preferred for its global consistency over other methods. Geodesic measure takes into consideration the position of the data points in addition to the geometric structure of given face images. The proposed method is invariant and robust under rotation, pose, or boundary distortion. Tests run on random images and also on publicly available JAFFE and FRAV3D face recognition databases provide impressively high percentage of recognition.

• Journal of IKEEE
• /
• v.17 no.4
• /
• pp.478-483
• /
• 2013

This paper presents an adaptive Retinex algorithm for improving dynamic range of image representation. The proposed Retinex algorithm detects degraded brightness by using skewness and the degraded components are compensated with local statistics. In particular, we propose a new compensation function for dynamic range so that effectinve image representation can be achieved. Experimental results show that the proposed algorithm has the capability to improve the dynamic range with reduction of color degradation.

• Journal of Korea Multimedia Society
• /
• v.21 no.12
• /
• pp.1473-1480
• /
• 2018

The extraction and recognition of human motion characteristics need to combine biometrics to determine and judge human behavior in the movement and distinguish individual identities. The so-called biometric technology, the specific operation is the use of the body's inherent biological characteristics of individual identity authentication, the most noteworthy feature is the invariance and uniqueness. In the past, the behavior recognition technology based on the single characteristic was too restrictive, in this paper, we proposed a mixed feature which combined global silhouette feature and local optical flow feature, and this combined representation was used for human action recognition. And we will use the KTH database to train and test the recognition system. Experiments have been very desirable results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.5058-5072
• /
• 2015

Quaternions have been commonly employed in color image processing, but when the existing pure quaternion representation for color images is used in perceptual hashing, it would degrade the robustness performance since it is sensitive to image manipulations. To improve the robustness in color image perceptual hashing, in this paper a full quaternion representation for color images is proposed by introducing the local image luminance variances. Based on this new representation, a novel Full Quaternion Discrete Cosine Transform (FQDCT)-based hashing is proposed, in which the Quaternion Discrete Cosine Transform (QDCT) is applied to the pseudo-randomly selected regions of the novel full quaternion image to construct two feature matrices. A new hash value in binary is generated from these two matrices. Our experimental results have validated the robustness improvement brought by the proposed full quaternion representation and demonstrated that better performance can be achieved in the proposed FQDCT-based hashing than that in other notable quaternion-based hashing schemes in terms of robustness and discriminability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.131-146
• /
• 2021

Multimodal biometric-based recognition has been an active topic because of its higher convenience in recent years. Due to high user convenience of finger, finger-based personal identification has been widely used in practice. Hence, taking Finger-Print (FP), Finger-Vein (FV) and Finger-Knuckle-Print (FKP) as the ingredients of characteristic, their feature representation were helpful for improving the universality and reliability in identification. To usefully fuse the multimodal finger-features together, a new robust representation algorithm was proposed based on hierarchical model. Firstly, to obtain more robust features, the feature maps were obtained by Gabor magnitude feature coding and then described by Local Binary Pattern (LBP). Secondly, the LGBP-based feature maps were processed hierarchically in bottom-up mode by variable rectangle and circle granules, respectively. Finally, the intension of each granule was represented by Local-invariant Gray Features (LGFs) and called Hierarchical Local-Gabor-based Gray Invariant Features (HLGGIFs). Experiment results revealed that the proposed algorithm is capable of improving rotation variation of finger-pose, and achieving lower Equal Error Rate (EER) in our homemade database.

• Journal of Mechanical Science and Technology
• /
• v.16 no.11
• /
• pp.1522-1539
• /
• 2002

In the present study, an explicit algebraic stress model is shown to be the exact tensor representation of algebraic stress model by directly solving a set of algebraic equations without resort to tensor representation theory. This repeals the constraints on the Reynolds stress, which are based on the principle of material frame indifference and positive semi-definiteness. An a priori test of the explicit algebraic stress model is carried out by using the DNS database for a fully developed channel flow at Rer = 135. It is confirmed that two-point correlation function between the velocity fluctuation and the Laplacians of the pressure-gradient i s anisotropic and asymmetric in the wall-normal direction. Thus, a novel composite algebraic Reynolds stress model is proposed and applied to the channel flow calculation, which incorporates non-local effect in the algebraic framework to predict near-wall behavior correctly.

• International Journal of Knowledge Content Development & Technology
• /
• v.10 no.2
• /
• pp.19-37
• /
• 2020

There are limited research questioning the relationship between the disabled community and media, particularly in Malaysia. The lack of awareness and common assumption of specialty towards the disabled community have caused a small amount of local disability researches that question the relationship between the disabled community and the media. This research aims to find out the types of representation of disability in the Malaysian mainstream media, particularly press. Interview with visual disabled personnel and content analysis from news coverage of mainstream press are deployed in the study. The findings indicated the invalidity of disability culture as the misrepresentation of disabled community in Malaysia is not as severe as depicted by scholars because the news coverage focusing on them is getting more positive. Besides that, disabled people are not defensive towards the terms used to refer them as long as media practitioners do not over amplify their disability. The application of charity approach is still common in news coverage to portray the disabled community as victim, and therefore they are partially marginalized due to the misrepresentation in Malaysian mainstream press.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4007-4024
• /
• 2020

It is tremendously important to construct decision trees to use as a tool for knowledge representation from a given decision table. However, the usual algorithms may split the decision table based on each value, which is not efficient for numerical attributes. The methodology of this paper is to split the given decision table into binary groups as like the CART algorithm, that uses binary split to work for both categorical and numerical attributes. The difference is that it uses split for each attribute established by the directed acyclic graph in a dynamic programming fashion whereas, the CART uses binary split among all considered attributes in a greedy fashion. The aim of this paper is to study the effect of binary splits in comparison with each value splits when building the decision trees. Such effect can be studied by comparing the number of nodes, local and global misclassification rate among the constructed decision trees based on three proposed algorithms.