• Title/Summary/Keyword: Geometric Information Systems

Search Result 284, Processing Time 0.027 seconds

High-Capacity and Robust Watermarking Scheme for Small-Scale Vector Data

  • Tong, Deyu;Zhu, Changqing;Ren, Na;Shi, Wenzhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.6190-6213
    • /
    • 2019
  • For small-scale vector data, restrictions on watermark scheme capacity and robustness limit the use of copyright protection. A watermarking scheme based on robust geometric features and capacity maximization strategy that simultaneously improves capacity and robustness is presented in this paper. The distance ratio and angle of adjacent vertices are chosen as the watermark domain due to their resistance to vertex and geometric attacks. Regarding watermark embedding and extraction, a capacity-improved strategy based on quantization index modulation, which divides more intervals to carry sufficient watermark bits, is proposed. By considering the error tolerance of the vector map and the numerical accuracy, the optimization of the capacity-improved strategy is studied to maximize the embedded watermark bits for each vertex. The experimental results demonstrated that the map distortion caused by watermarks is small and much lower than the map tolerance. Additionally, the proposed scheme can embed a copyright image of 1024 bits into vector data of 150 vertices, which reaches capacity at approximately 14 bits/vertex, and shows prominent robustness against vertex and geometric attacks for small-scale vector data.

A fingerprint Alignment with a 3D Geometric Hashing Table based on the fuzzy Fingerprint Vault (3차원 기하학적 해싱을 이용한 퍼지볼트에서의 지문 정합)

  • Lee, Sung-Ju;Moon, Dae-Sung;Kim, Hak-Jae;Yi, Ok-Yeon;Chung, Yong-Wha
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.1
    • /
    • pp.11-21
    • /
    • 2008
  • Biometrics-based user authentication has several advantages over traditional password-based systems for standalone authentication applications. This is also true for new authentication architectures known as crypto-biometric systems, where cryptography and biometrics are merged to achieve high security and user convenience at the same time. Recently, a cryptographic construct, called fuzzy vault, has been proposed for crypto-biometric systems. This construct aims to secure critical data(e.g., secret key) with the fingerprint data in a way that only the authorized user can access the secret by providing the valid fingerprint, and some implementations results for fingerprint have been reported. However, the previous results had some limitation of the provided security due to the limited numbers of chaff data fer hiding real fingerprint data. In this paper, we propose an approach to provide both the automatic alignment of fingerprint data and higher security by using a 3D geometric hash table. Based on the experimental results, we confirm that the proposed approach of using the 3D geometric hash table with the idea of the fuzzy vault can perform the fingerprint verification securely even with more chaff data included.

Base Station Placement for Wireless Sensor Network Positioning System via Lexicographical Stratified Programming

  • Yan, Jun;Yu, Kegen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4453-4468
    • /
    • 2015
  • This paper investigates optimization-based base station (BS) placement. An optimization model is defined and the BS placement problem is transformed to a lexicographical stratified programming (LSP) model for a given trajectory, according to different accuracy requirements. The feasible region for BS deployment is obtained from the positioning system requirement, which is also solved with signal coverage problem in BS placement. The LSP mathematical model is formulated with the average geometric dilution of precision (GDOP) as the criterion. To achieve an optimization solution, a tolerant factor based complete stratified series approach and grid searching method are utilized to obtain the possible optimal BS placement. Because of the LSP model utilization, the proposed algorithm has wider application scenarios with different accuracy requirements over different trajectory segments. Simulation results demonstrate that the proposed algorithm has better BS placement result than existing approaches for a given trajectory.

Compact Catadioptric Wide Imaging with Secondary Planar Mirror

  • Ko, Young-Jun;Yi, Soo-Yeong
    • Current Optics and Photonics
    • /
    • v.3 no.4
    • /
    • pp.329-335
    • /
    • 2019
  • Wide FOV imaging systems are important for acquiring rich visual information. A conventional catadioptric imaging system deploys a camera in front of a curved mirror to acquire a wide FOV image. This is a cumbersome setup and causes unnecessary occlusions in the acquired image. In order to reduce both the burden of the camera deployment and the occlusions in the images, this study uses a secondary planar mirror in the catadioptric imaging system. A compact design of the catadioptric imaging system and a condition for the position of the secondary planar mirror to satisfy the central imaging are presented. The image acquisition model of the catadioptric imaging system with a secondary planar mirror is discussed based on the principles of geometric optics in this study. As a backward mapping, the acquired image is restored to a distortion-free image in the experiments.

Active shape exploration of an unknown object by using robot hand (로봇손을 이용한 미지 물체의 능동적 형상탐사에 관한 연구)

  • 김진호;오상록;최혁렬
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.768-771
    • /
    • 1997
  • Geometric probing addresses the problem of determining geometric aspects of a structure from the mathematics and results of a physical measuring device such as a probe. This paper presents a new algorithm to recognize the shape of an unknown object by using a robot hand with a force and torque sensor. The new algorithm is called S.E.P.(Shape Exploration Procedure) which finds the global shape of an unknown object. The proposed method is composed of three major parts, finding contact informations such as contact point, calculation of shape information such as curvature, and expression of global shape from these informations. Comparing with the conventional approaches, the advantages of the proposed method are explained and verified by conducting experiments with a 3-dof SCARA robot.

  • PDF

Integration of Geometrically Exact Shell Finite Element With Trimmed Surface Modeling base on the NURBS (기하학적으로 정확한 셀 유한요소와 NURBS기반의 Trimmed Surface 모델링과의 연동)

  • Choi Jin-Bork;Roh Hee-Yuel;Cho Maeng-Hyo
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2006.04a
    • /
    • pp.794-801
    • /
    • 2006
  • The linkage framework of geometric modeling and analysis based on the NURBS technology is developed in this study. The NURBS surfaces are generated by interpolating the given set of data points or by extracting the necessary information to construct the NURBS surface from the IGES format file which is generated by the commercial CAD systems in the present study. Numerical examples shows the rate of displacement convergence according to the paramterization methods of the NURBS surface. NURBS can generate quadric surfaces in an exact manner. It is the one of the advantages of the NURBS. A trimmed NURBS surface that is often encountered in the modeling process of the CAD systems is also presented in the present study. The performance of the developed geometrically exact shell element integrated with the exact geometric representations by the NURBS equation is compared to those of the previous reported FE shell elements in the selected benchmark problems.

  • PDF

Reversible Sub-Feature Retrieval: Toward Robust Coverless Image Steganography for Geometric Attacks Resistance

  • Liu, Qiang;Xiang, Xuyu;Qin, Jiaohua;Tan, Yun;Zhang, Qin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.3
    • /
    • pp.1078-1099
    • /
    • 2021
  • Traditional image steganography hides secret information by embedding, which inevitably leaves modification traces and is easy to be detected by steganography analysis tools. Since coverless steganography can effectively resist steganalysis, it has become a hotspot in information hiding research recently. Most coverless image steganography (CIS) methods are based on mapping rules, which not only exposes the vulnerability to geometric attacks, but also are less secure due to the revelation of mapping rules. To address the above issues, we introduced camouflage images for steganography instead of directly sending stego-image, which further improves the security performance and information hiding ability of steganography scheme. In particular, based on the different sub-features of stego-image and potential camouflage images, we try to find a larger similarity between them so as to achieve the reversible steganography. Specifically, based on the existing CIS mapping algorithm, we first can establish the correlation between stego-image and secret information and then transmit the camouflage images, which are obtained by reversible sub-feature retrieval algorithm. The received camouflage image can be used to reverse retrieve the stego-image in a public image database. Finally, we can use the same mapping rules to restore secret information. Extensive experimental results demonstrate the better robustness and security of the proposed approach in comparison to state-of-art CIS methods, especially in the robustness of geometric attacks.

Development of a Fast Alignment Method of Micro-Optic Parts Using Multi Dimension Vision and Optical Feedback

  • Han, Seung-Hyun;Kim, Jin-Oh;Park, Joong-Wan;Kim, Jong-Han
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.273-277
    • /
    • 2003
  • A general process of electronic assembly is composed of a series of geometric alignments and bonding/screwing processes. After assembly, the function is tested in a following process of inspection. However, assembly of micro-optic devices requires both processes to be performed in equipment. Coarse geometric alignment is made by using vision and optical function is improved by the following fine motion based on feedback of tunable laser interferometer. The general system is composed of a precision robot system for 3D assembly, a 3D vision guided system for geometric alignment and an optical feedback system with a tunable laser. In this study, we propose a new fast alignment algorithm of micro-optic devices for both of visual and optical alignments. The main goal is to find a fastest alignment process and algorithms with state-of-the-art technology. We propose a new approach with an optimal sequence of processes, a visual alignment algorithm and a search algorithm for an optimal optical alignment. A system is designed to show the effectiveness and efficiency of the proposed method.

  • PDF

Automatic Drawing Input by Segmentation of Text Region and Recognltion of Geometric Drawing Element (문자영역의 분리와 기하학적 도면요소의 인식에 의한 도면 자동입력)

  • 배창석;민병우
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.6
    • /
    • pp.91-103
    • /
    • 1994
  • As CAD systems are introduced in the filed of engineering design, the necessities for automatic drawing input are increased . In this paper, we propose a method for realizing automatic drawing input by separation of text regions and graphic regions, extraction of line vectors from graphic regions, and recognition of circular arcs and circles from line vectors. Sizes of isolated regions, on a drawing are used for separating text regions and graphic regions. Thinning and maximum allowable error method are used to extract line vectors. And geometric structures of line vectors are analyzed to recognize circular arcs and circles. By processing text regions and graphic regions separately, 30~40% of vector information can be reduced. Recognition of circular arcs and circles can increase the utilization of automatic drawing input function.

  • PDF

A Performance Bound of Mu1ti-hop Mu1ti-Relay Wireless Communication Systems with Optimal Path Selection (다중-홉 다중-릴레이 무선 통신 시스템에서 최적 경로 선택 기법의 성능 한계)

  • Almuradov, Kamol;Park, Jin-Bae;Kim, Yun-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1C
    • /
    • pp.1-7
    • /
    • 2011
  • Recently, multi-hop relay transmission has drawn much attention owing to its advantage of coverage extension at low power consumption. In this paper, we derive a performance bound of multi-hop communication systems with multiple amplify-and-forward relays when the optimal path is selected. The bound is derived in generalized Nakagami fading channels with different parameters for each hop by applying the geometric mean bound to the path signal-to-noise ratio (SNR) and obtaining the moment generation function of the bound. It is shown that the bound based on the geometric mean is closer to the actual performance of optimal path selection when the fading effect is small.