• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.149-159
• /
• 2008

In this paper, we propose a blind watermarking algorithm of 3d mesh model using spherical parameterization. Spherical parameterization is a useful method which is applicable to 3D data processing. Especially, orthogonal coordinate can not analyse the feature of the vertex coordination of the 3D mesh model, but this is possible to analyse and process. In this paper, the centroid center of the 3D model was set to the origin of the spherical coordinate, the orthogonal coordinate system was transformed to the spherical coordinate system, and then the spherical parameterization was applied. The watermark was embedded via addition/modification of the vertex after the feature analysis of the geometrical information and topological information. This algorithm is robust against to the typical geometrical attacks such as translation, scaling and rotation. It is also robust to the mesh reordering, file format change, mesh simplification, and smoothing. In this case, the this algorithm can extract the watermark information about $90{\sim}98%$ from the attacked model. This means it can be applicable to the game, virtual reality and rapid prototyping fields.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.3
• /
• pp.247-254
• /
• 2006

Biometrics are getting more and more attention in recent years for security and other concerns. So far, only fingerprint recognition has seen limited success for on-line security check, since other biometrics verification and identification systems require more complicated and expensive acquisition interfaces and recognition processes. Hand-Geometry can be used for biometric verification and identification because of its acquisition convenience and good performance for verification and identification performance. It could also be a good candidate for online checks. Therefore, this paper proposes a Hand-Geometry recognition system based on geometrical features of hand. From anatomical point of view, human hand can be characterized by its length, width, thickness, geometrical composition, shapes of the palm, and shape and geometry of the fingers. This paper proposes thirty relevant features for a Hand-Geometry recognition system. This system presents verification results based on hand measurements of 20 individuals. The verification process has been tested on a size of $320{\times}240$ image, and result of the verification process have hit rate of 95% and FAR of 0.020.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.103-111
• /
• 2011

In this paper, we propose a Geometrical Centroid Contour Distance(GCCD) which is described by shape signature based on contour sequence. The proposed method uses geomertrical relation features instead of the absolute angle based features after it was normalized and aligned with dominant feature of the shape. Experimental result with MPEG-7 CE-Shape-1 Data Set reveals that our method has low time/spatial complexity and scale/rotation robustness than the other methods, showing that the precision of our method is more accurate than the conventional desctiptors. However, performance of the GCCD is limited with concave and complex shaped objects.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.4 s.316
• /
• pp.1-7
• /
• 2007

In this paper, we analyze geometrical relations of 3D shape reconstruction from 2D images taken under anne projection. The purpose of this research is to contribute to more accurate 3-D reconstruction under noise distribution by analyzing geometrically the 2D to 3D relationship. In situation for no missing feature points (FPs) or no noise in 2D image plane, the accurate solution of 3D shape reconstruction is blown to be provided by Singular Yalue Decomposition (SVD) factorization. However, if several FPs not been observed because of object occlusion and image low resolution, and so on, there is no simple solution. Moreover, the 3D shape reconstructed from noise-distributed FPs is peturbed because of the influence of the noise. This paper focuses on analysis of geometrical properties which can interpret the missing FPs even though the noise is distributed on other FPs.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.11
• /
• pp.5834-5840
• /
• 2013

Along with the development of high-speed, wired and wireless Internet technology, various harmful images in a form of photos and video clips have become prevalent these days. In this paper, we suggest a method of automatically detecting adult images by extracting woman's nipple areas which represent obscenity of the image. The suggested algorithm first segments skin color areas in the $YC_bC_r$ color space from input images and extracts nipple's candidate areas from the segmented skin areas through the suggested nipple map. We then select real nipple areas by using geometrical information and determines input images as harmful images if they contain nipples. Experimental results show that the suggested nipple map-based method effectively detects adult images.

• Journal of Sensor Science and Technology
• /
• v.32 no.2
• /
• pp.110-117
• /
• 2023

Reconstructing underwater geometry in real time with forward-looking sonar is critical for applications such as localization, mapping, and path planning. Geometrical data must be repeatedly calculated and overwritten in real time because the reliability of the acoustic data is affected by various factors. Moreover, scattering of signal data during the coordinate conversion process may lead to geometrical errors, which lowers the accuracy of the information obtained by the sensor system. In this study, we propose a three-step data processing method with low computational cost for real-time operation. First, the number of data points to be interpolated is determined with respect to the distance between each point and the size of the data grid in a Cartesian coordinate system. Then, the data are processed with a nonlinear interpolation so that they exhibit linear properties in the coordinate system. Finally, the data are transformed based on variations in the position and orientation of the sonar over time. The results of an evaluation of our proposed approach in a simulation show that the nonlinear interpolation operation constructed a continuous underwater geometry dataset with low geometrical error.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04b
• /
• pp.859-862
• /
• 2001

본 논문에서는 칼라 CCB 카메라로부터 입력된 얼굴 영상에서 HSI 정보와 눈, 코, 입 등의 얼굴 영역 특징자 및 특징자의 기하학적 특징각을 이용한 얼굴 인식 알고리즘을 제안하였다. 제안한 알고리즘에서는 인간의 시각 체계와 비교적 유사한 HSI좌표계 상에서 피부색에 대한 색상 정보와 명암값 정보를 함에 이용함으로써 얼굴영역 추출의 효율을 높였고, 또한 추출된 얼굴 영역에서 얼굴 인식율 개선을 위해 눈, 코, 입 등의 구조적 위치 정보와 특징자들의 기하학적 특징각을 이용하여 얼굴 인식율을 개선하였다. 제안한 알고리즘에서는 기존의 명암 정보를 이용하는 방법과는 달리 색상 정보와 명암 정보를 함께 이용함으로써 정확한 얼굴 영역의 검출이 가능하였으며 인식 방법에 있어서 특징자들의 기하학적 관계값을 이용함으로써 인식 효율을 개선하였다.

• The Journal of Korean Society for Radiation Therapy
• /
• v.24 no.2
• /
• pp.77-84
• /
• 2012

Purpose: To develop a geometrical quality control real-time analysis program using an electronic portal imaging to replace film evaluation method. Materials and Methods: A geometrical quality control item was established with the Eclipse treatment planning system (Version 8.1, Varian, USA) after the Electronic Portal Imaging Device (EPID) took care of the problems occurring from the fixed substructure of the linear accelerator (CL-iX, Varian, USA). Electronic portal image (single exposure before plan) was created at the treatment room's 4DTC (Version 10.2, Varian, USA) and a beam was irradiated in accordance with each item. The gaining the entire electronic portal imaging at the Off-line review and was evaluated by a self-developed geometrical quality control real-time analysis program. As for evaluation methods, the intra-fraction error was analyzed by executing 5 times in a row under identical conditions and procedures on the same day, and in order to confirm the infer-fraction error, it was executed for 10 days under identical conditions of all procedures and was compared with the film evaluation method using an Iso-align$^{TM}$ quality control device. Measurement and analysis time was measured by sorting the time into from the device setup to data achievement and the time amount after the time until the completion of analysis and the convenience of the users and execution processes were compared. Results: The intra-fraction error values for each average 0.1, 0.2, 0.3, 0.2 mm at light-radiation field coincidence, collimator rotation axis, couch rotation axis and gantry rotation axis. By checking the infer-fraction error through 10 days of continuous quality control, the error values obtained were average 1.7, 1.4, 0.7, 1.1 mm for each item. Also, the measurement times were average 36 minutes, 15 minutes for the film evaluation method and electronic portal imaging system, and the analysis times were average 30 minutes, 22 minutes. Conclusion: When conducting a geometrical quality control using an electronic portal imaging, it was found that it is efficient as a quality control tool. It not only reduces costs through not using films, but also reduces the measurement and analysis time which enhances user convenience and can improve the execution process by leaving out film developing procedures etc. Also, images done with evaluation from the self-developed geometrical quality control real-time analysis program, data processing is capable which supports the storage of information.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.567-571
• /
• 2008

In this paper, an overview on the ordering sphere decoder (SD) class for space-time codes (STC) will be presented. In SDs, the ordering techniques are considered as promising methods for reducing complexity by exploiting a sorted list of candidates, thus decreasing the number of tested points. First, we will present the current state of art of SD with their advantages and disadvantages. Then, the overview of simply geometrical approaches for ordering is presented to address the question to overcome the disadvantages. The computer simulation results shown that, thanks to the aid of ordering, the ordering SDs can achieve optimal bit-error-rate (BER) performance while requiring the very low complexity, which is comparable to that of linear sub-optimal decoders.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.657-667
• /
• 2019

This paper studies synthetic aperture radar (SAR) imaging problem which the scatterers are often distributed in block sparse pattern. To exploiting the sparse geometrical feature, a Kronecker constrained SAR imaging algorithm is proposed by combining the block sparse characteristics with the multiway sparse reconstruction framework with Tucker modeling. We validate the proposed algorithm via real data and it shows that the our algorithm can achieve better accuracy and convergence than the reference methods even in the demanding environment. Meanwhile, the complexity is smaller than that of the existing methods. The simulation experiments confirmed the effectiveness of the algorithm as well.