• Title/Summary/Keyword: Block Indexing

Search Result 25, Processing Time 0.033 seconds

THE EFFECT OF SOLDERING INDICES FOR THE DISTORTION OF SPLIT CAST (납착 인기재료가 분할 주조체의 변형에 미치는 영향)

  • Lee, Dong-Wook;Im, Jang-Seop;Jeong, Chang-Mo;Jeon, Yeong-Chan
    • The Journal of Korean Academy of Prosthodontics
    • /
    • v.38 no.1
    • /
    • pp.26-37
    • /
    • 2000
  • The purpose of this study was to investigate the effect that three resin indexing materials had on the distortion of split cast in the procedures of solder indexing and block fabrication. The specimen had two cylinders and connecting bar Two cylinders were a reference cylinder and a test cylinder that were machined precisely and placed on metal base. The total of specimens were 30 and they were divided into 3 groups according to the resin indexing materials : Acrylic $solder^{(R)}$, G-C Pattern $resin^{(R)},\;Z-100^{(R)}$. The relative coordinates (X, Y, Z) of centroids of both cylinders were measured by using 3-D cool dinates measuring machine. The value of indexing distortion was obtained after application of indexing material, and the value of the block distortion was obtained after fabrication of soldering block, and the value of total distortion was a value sum of indexing distortion and block distortion. Intercentroidal linear distortion ${(\sqrt{X^{'2}+Y^{'2}+Z^{'2}}-{\sqrt{X^2+Y^2+Z^2)}$ and global distortion $(\sqrt{{(X^'-X)}^2+{(Y^'-Y)}^2+{(Z^'-Z)}^2}$ were calculated from data of coordinates of centroids at each measuring stages. The results of this study were as belows ; 1. The intercentroidal distance between the split casts was reduced by indexing distortion and increased by block distortion. 2. The indexing global distortion between the split casts was smaller than block global distortion. 3. The intercentroidal linear distortion and the global distortion were no significant difference between indexing materials.

  • PDF

Indexing Methods of Splitting XML Documents (XML 문서의 분할 인덱스 기법)

  • Kim, Jong-Myung;Jin, Min
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.3
    • /
    • pp.397-408
    • /
    • 2003
  • Existing indexing mechanisms of XML data using numbering scheme have a drawback of rebuilding the entire index structure when insertion, deletion, and update occurs on the data. We propose a new indexing mechanism based on split blocks to cope with this problem. The XML data are split into blocks, where there exists at most a relationship between two blocks, and numbering scheme is applied to each block. This mechanism reduces the overhead of rebuilding index structures when insertion, deletion, and update occurs on the data. We also propose two algorithms, Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm which retrieve the relationship between two entities in the XML hierarchy using this indexing mechanism. We also propose a mechanism in which the identifier of a block has the information of its Parents' block to expedite retrieval process of the ancestor-descendent relationship and also propose two algorithms. Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm using this indexing mechanism.

  • PDF

A Novel Blind Watermarking Scheme Using Block Indexing (블록 인덱싱을 이용한 블라인드 워터마킹 기법)

  • Kang Hyun-Ho;Shin Sang-Uk;Han Seung-Wu
    • The Journal of the Korea Contents Association
    • /
    • v.5 no.6
    • /
    • pp.331-342
    • /
    • 2005
  • In this paper, we propose an efficient watermarking algorithm using block indexing. The proposed algorithm is a novel blind watermarking scheme using the indexed watermark value based on the spread spectrum method. The watermark insertion is allocated into index value of each block after dividing original image into sub-blocks. The watermark embedded in mappinged with index values of blocks, And the mappinged blocks convert to DCT and then the PN sequence embedded to middle frequency band. Consequently the watermark is expressed by index value of sub-blocks. The watermark extracted from the correlation of between PN sequence and watermarked image. Experimental results demonstrate that the watermarked image has a good quality in terms of imperceptibility and is robust against various attacks.

  • PDF

Inverted Indexing Method for XML Data (XML 데이터의 역 인덱싱 기법)

  • 김종명;진민
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2002.11b
    • /
    • pp.343-346
    • /
    • 2002
  • 관계데이터베이스를 이용한 XML 데이터저장방법에서 데이터가 삽입, 삭제, 갱신될 경우 인덱스를 제정의해야 하는 부담을 줄여주는 인덱스 기법을 제안한다. XML 데이터를 블록과 블록사이에 많아야 하나의 관계가 유지되도록 블록단위로 나누어 각 블록에 대해 Numbering 스킴을 적용하여 인덱스를 정의한다. 또한 정의된 인덱스를 이용하여 XML 질의 처리하기 Parent-Child Block Merge Algorithm과 Ancestor-Descendent Block Merge Algorithm을 제안한다.

  • PDF

Delay Operation Techniques for Efficient MR-Tree on Nand Flash Memory (낸드 플래시 메모리 상에서 효율적인 MR-트리 동작을 위한 지연 연산 기법)

  • Lee, Hyun-Seung;Song, Ha-Yoon;Kim, Kyung-Chang
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.8
    • /
    • pp.758-762
    • /
    • 2008
  • Embedded systems usually utilize Flash Memories with very nice characteristics of non-volatility, low access time, low power and so on. For the multimedia database systems, R-tree is an indexing tree with nice characteristics for multimedia access. MR-tree, which is an upgraded version of R-tree, has shown better performance in searching, inserting and deleting operations than R-tree. Flash memory has sectors and blocks as a unit of read, write and delete operations. Especially, the delete is done on a unit of 512 byte blocks with very large operation time and it is also known that read and write operations on a unit of block matches caching nature of MT-tree. Our research optimizes MR-tree operations in a unit of Flash memory blocks. Such an adjusting leads in better indexing performance in database accesses. With MR-tree on a 512B block units we achieved fast search time of database indexing with low height of MR-tree as well as faster update time of database indexing with the best fit of flash memory blocks. Thus MR-tree with optimized operations shows good characteristics to be a database index schemes on any systems with flash memory.

Video Indexing using Motion vector and brightness features (움직임 벡터와 빛의 특징을 이용한 비디오 인덱스)

  • 이재현;조진선
    • Journal of the Korea Society of Computer and Information
    • /
    • v.3 no.4
    • /
    • pp.27-34
    • /
    • 1998
  • In this paper we present a method for automatic motion vector and brightness based video indexing and retrieval. We extract a representational frame from each shot and compute some motion vector and brightness based features. For each R-frame we compute the optical flow field; motion vector features are then derived from this flow field, BMA(block matching algorithm) is used to find motion vectors and Brightness features are related to the cut detection of method brightness histogram. A video database provided contents based access to video. This is achieved by organizing or indexing video data based on some set of features. In this paper the index of features is based on a B+ search tree. It consists of internal and leaf nodes stores in a direct access a storage device. This paper defines the problem of video indexing based on video data models.

  • PDF

Shot Boundary Detection Using Relative Difference between Two Frames (프레임간의 상대적인 차이를 이용한 비디오의 셔트 검출 기법)

  • 정인식;권오진
    • Proceedings of the IEEK Conference
    • /
    • 2001.06d
    • /
    • pp.101-104
    • /
    • 2001
  • This paper proposes a unique shot boundary detection algorithm for the video indexing and/or browsing. Conventional methods based on the frame differences and the histogram differences are improved. Instead of using absolute frame differences, block by block based relative frame differences are employed. Frame adaptive thresholding values are also employed for the better detection. for the cases that the frame differences are not enough to detect the shot boundary, histogram differences are selectively applied. Experimental results show that the proposed algorithm reduces both the “false positive” errors and the “false negative” errors especially for the videos of dynamic local and/or global motions

  • PDF

Detecting Faces on Still Images using Sub-block Processing (서브블록 프로세싱을 이용한 정지영상에서의 얼굴 검출 기법)

  • Yoo Chae-Gon
    • The KIPS Transactions:PartB
    • /
    • v.13B no.4 s.107
    • /
    • pp.417-420
    • /
    • 2006
  • Detection of faces on still color images with arbitrary backgrounds is attempted in this paper. The newly proposed method is invariant to arbitrary background, number of faces, scale, orientation, skin color, and illumination through the steps of color clustering, cluster scanning, sub-block processing, face area detection, and face verification. The sub-block method makes the proposed method invariant to the size and the number of faces in the image. The proposed method does not need any pre-training steps or a preliminary face database. The proposed method may be applied to areas such as security control, video and photo indexing, and other automatic computer vision-related fields.

Music Source Signature Indexing Method for Quick Search (빠른 검색을 위한 음원 시그니처 인덱싱 방법)

  • Kim, Sang-Kyun;Lee, Kyoung-Sik
    • Journal of Broadcast Engineering
    • /
    • v.26 no.3
    • /
    • pp.321-326
    • /
    • 2021
  • Blockchain is increasing in value as a platform for safe transmission of capital transactions or secure data. In addition, blockchain has the potential as a new platform that can safely store large amounts of data such as videos, music, and photos, and safely manage transaction details and service usage specifications. Since it is not possible to store large-capacity media data in a block, research on the performance of storing sound source information in a block and retrieving the stored sound source data by using the distributed storage system (IPFS) and the hash information of the sound source signature data was conducted. In this paper, we propose a sound source signature indexing method using a bloom filter that can improve the search speed suggested by previous studies. As a result of the experiment, it was confirmed that improved search performance (O(1)) than the existing search performance (O(n)) can be achieved.

A Study on the DB-IR Integration: Per-Document Basis Online Index Maintenance

  • Jin, Du-Seok;Jung, Hoe-Kyung
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.3
    • /
    • pp.275-280
    • /
    • 2009
  • While database(DB) and information retrieval(IR) have been developed independently, there have been emerging requirements that both data management and efficient text retrieval should be supported simultaneously in an information system such as health care, customer support, XML data management, and digital libraries. The great divide between DB and IR has caused different manners in index maintenance for newly arriving documents. While DB has extended its SQL layer to cope with text fields due to lack of intact mechanism to build IR-like index, IR usually treats a block of new documents as a logical unit of index maintenance since it has no concept of integrity constraint. However, In the DB-IR integrations, a transaction on adding or updating a document should include maintenance of the posting lists accompanied by the document. Although DB-IR integration has been budded in the research filed, the issue will remain difficult and rewarding areas for a while. One of the primary reasons is lack of efficient online transactional index maintenance. In this paper, performance of a few strategies for per-document basis transactional index maintenance - direct index update, pulsing auxiliary index and posting segmentation index - will be evaluated. The result shows that the pulsing auxiliary strategy and posting segmentation indexing scheme, can be a challenging candidates for text field indexing in DB-IR integration.