• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.548-555
• /
• 2001

In this paper, we proposed a HVS(human visual system) model-based digital image watermarking which is not only invariant to rotation and translation but also more robust to lossy compression, cropping, and scaling as compared to the conventional method. Fourier transform and log-polar mapping is used to make the proposed algorithm invariant to rotation and translation, and in addition, watermark energy is embedded maximally based on spatial frequency sensitivity of HVS without the deterioration of the invisibility. As a result, the robustness of watermarking is improved both in general image processing operations such as cropping, low pass filtering, and lossy compression and in geometrical transforms such as rotation, translation, and scaling. And, by disjoint embedding of the watermark and the template without intersection, the deterioration of invisibility and robustness is prevented. Experimental results show that proposed watermarking is about 30~75 [%] more robust af compared to the conventional methods.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.357-368
• /
• 2003

Evaluation of shape similarity for 3D models is essential in many areas - medicine, mechanical engineering, molecular biology, etc. Moreover, as 3D models are commonly used on the Web, many researches have been made on the classification and retrieval of 3D models. In this paper, we describe methods for 3D shape representation and major concepts of similarity evaluation, and analyze the key features of recent researches for shape comparison after classifying them into four categories including multi-resolution, topology, 2D image, and statistics based methods. In addition, we evaluated the performance of the reviewed methods by the selected criteria such as uniqueness, robustness, invariance, multi-resolution, efficiency, and comparison scope. Multi-resolution based methods have resulted in decreased computation time for comparison and increased preprocessing time. The methods using geometric and topological information were able to compare more various types of models and were robust to partial shape comparison. 2D image based methods incurred overheads in time and space complexity. Statistics based methods allowed for shape comparison without pose-normalization and showed robustness against affine transformations and noise.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.291-299
• /
• 2016

This paper raises a question of whether a simple periodic phenomenon is associated with the topology and provides the convincing answers to it. A variety of music instrumental sound signals are used to prove our assertion, which are embedded in Euclidean space to analyze their topologies by computing the homology groups. A commute time embedding is employed to transform segments of waveforms into the corresponding geometries, which is implemented by organizing patches according to the graph-based metric. It is shown that commute time embedding generates the intrinsic topological complexities although their geometries are varied according to the spectrums of the signals. This paper employs a persistent homology to determine the topological invariants of the simplicial complexes constructed by randomly sampling the commute time embedding of the waveforms, and discusses their applications.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.7
• /
• pp.774-781
• /
• 2014

The radar measurements are composed of range, Doppler and angles which are expressed as polar-coordinate components. An approach to match the measurements with the states of target dynamics which are modeled in cartesian coordinates is to use the pseudo-measurements or the extended Kalman filter in order to solve the mismatching problem. Another approach is that the states of dynamics are modeled in polar coordinates and measurement equation is linear. However, this approach bears that we have to deal with a time-varying dynamics. In this study, it is proposed that the states of dynamics are expressed as polar-coordinate component and the system matrix of the dynamic equation is modeled as a time-invariant. Nonlinear terms that appear due to the proposed modeling are regarded as a system input. The results of a series of simulation runs indicate that the tracking filter that uses the proposed modeling is viable from the fact that the Doppler measurement is easy to be augmented in the measurement equation.

• Journal of Advanced Navigation Technology
• /
• v.16 no.2
• /
• pp.394-400
• /
• 2012

SURF is a robust local invariant feature descriptor and has been used in many applications such as object recognition. Even though this algorithm has similar matching accuracy compared to the SIFT, which is another popular feature extraction algorithm, it has advantage in matching time. However, these descriptors do not consider relative location information of extracted interesting points to guarantee rotation invariance. Also, since they use gray image of original color image, they do not use the color information of images, either. In this paper, we propose a method for improving matching performance of SURF descriptor using the color and relative location information of interest points. The location information is built from the angles between the line connecting the centers of interest points and the orientation line constructed for the center of each interest points. For the color information, color histogram is constructed for the region of each interest point. We show the performance of our scheme through experiments.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.345-355
• /
• 2008

SIFT is popularly used in computer vision application such as object recognition, motion tracking, and 3D reconstruction among various shape descriptors. However, it is not easy to apply SIFT into the image similarity search as it is since it uses many high dimensional keypoint vectors. In this paper, we present a SIFT based image similarity search method using an edge image pyramid and an interesting region detection. The proposed method extracts keypoints, which is invariant to contrast, scale, and rotation of image, by using the edge image pyramid and removes many unnecessary keypoints from the image by using the hough transform. The proposed hough transform can detect objects of ellipse type so that it can be used to find interesting regions. Experimental results demonstrate that the retrieval performance of the proposed method is about 20% better than that of traditional SIFT in average recall.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10C
• /
• pp.1007-1016
• /
• 2005

This paper presents a feature extraction method for shape based retrieval of 3D models. Since the feature descriptor of 3D model should be invariant to translation, rotation and scaling, it is necessary to preprocess the 3D models to represent them in a canonical coordinate system. We use the PCA(Principal Component Analysis) method to preprocess the 3D models. Also, we apply that to make a MBR(Minimum Boundary Rectangle) and a circumsphere. The proposed algorithm is as follows. We generate a circumsphere around 3D models, where radius equals 1(r=1) and locate each model in the center of the circumsphere. We produce the concentric spheres with a different radius($r_i=i/n,\;i=1,2,{\ldots},n$). After looking for meshes intersected with the concentric spheres, we compute the curvature of the meshes. We use these curvatures as the model descriptor. Experimental results numerically show the performance improvement of proposed algorithm from min. 0.1 to max. 0.6 in comparison with conventional methods by ANMRR, although our method uses .relatively small bins. This paper uses $R{^*}-tree$ as the indexing.

• The Journal of Engineering Research
• /
• v.2 no.1
• /
• pp.23-30
• /
• 1997

For a effective management and easy tool integration of CAD database, Hierarchy interface System(HIS) was designed and GROCO(Graph Representation fOr Complex Objects) Model was presented in another my paper[10]. Hierarchy Interface System which is composed of two subsystems of a configurator and a converter is designed for the interface between a conventional database management system and CAD tools. In this paper, Version Management System is presented for supporting effective operations of HIS using GROCO model. Version Management System supports efficiently CAD database charaters having a hierarchical structure of composite objects. In Version Management System, A design evolves in discrete states through mutation and derivation for going phases of design giving rise to multiple versions. Operations and rules are provided transition between their different states. and for controlling update propagation and preventing version proliferation. Version Modeling Graph is proposed for dealing with versioning at the instance and type levels.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.147-157
• /
• 2017

In recent years, Super-pixels have become very popular for use in computer vision applications. Super-pixel algorithm transforms pixels into perceptually feasible regions to reduce stiff features of grid pixel. In particular, super-pixels are useful to depth estimation, skeleton works, body labeling, and feature localization, etc. But, it is not easy to generate a good super-pixel partition for doing these tasks. Especially, super-pixels do not satisfy more meaningful features in view of the gestalt aspects such as non-sum, continuation, closure, perceptual constancy. In this paper, we suggest an advanced algorithm which combines simple linear iterative clustering with fuzzy clustering concepts. Simple linear iterative clustering technique has high adherence to image boundaries, speed, memory efficient than conventional methods. But, it does not suggest good compact and regular property to the super-pixel shapes in context of gestalt aspects. Fuzzy similarity measures provide a reasonable graph in view of bounded size and few neighbors. Thus, more compact and regular pixels are obtained, and can extract locally relevant features. Simulation shows that fuzzy similarity based super-pixel building represents natural features as the manner in which humans decompose images.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.3
• /
• pp.285-290
• /
• 2007

In this paper, we presents robust digital redesign (DR) method for observer-based linear time-invariant (LTI) system. The term of DR involves converting an analog controller into an equivalent digital one by considering two condition: state-matching and stability. The design problems viewed as a convex optimization problem that we minimize the error of the norm bounds between interpolated linear operators to be matched. Also, by using the bilinear and inverse bilinear approximation method, we analyzed the uncertain parts of given observer-based system more precisely, When a sampling period is sufficiently small, the conversion of a analog structured uncertain system to an equivalent discrete-time system have proper reason. Sufficiently conditions for the state-matching of the digitally controlled system are formulated in terms of linear matrix inequalities (LMIs).