• Title/Summary/Keyword: Block Based Information

Search Result 2,213, Processing Time 0.026 seconds

A Low Bit Rate Speech Coder Based on the Inflection Point Detection

  • Iem, Byeong-Gwan
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.15 no.4
    • /
    • pp.300-304
    • /
    • 2015
  • A low bit rate speech coder based on the non-uniform sampling technique is proposed. The non-uniform sampling technique is based on the detection of inflection points (IP). A speech block is processed by the IP detector, and the detected IP pattern is compared with entries of the IP database. The address of the closest member of the database is transmitted with the energy of the speech block. In the receiver, the decoder reconstructs the speech block using the received address and the energy information of the block. As results, the coder shows fixed data rate contrary to the existing speech coders based on the non-uniform sampling. Through computer simulation, the usefulness of the proposed technique is shown. The SNR performance of the proposed method is approximately 5.27 dB with the data rate of 1.5 kbps.

Motion Estimation with Optical Flow-based Adaptive Search Region

  • Kim, Kyoung-Kyoo;Ban, Seong-Won;Won Sik cheong;Lee, Kuhn-Il
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.843-846
    • /
    • 2000
  • An optical flow-based motion estimation algorithm is proposed for video coding. The algorithm uses block-matching motion estimation with an adaptive search region. The search region is computed from motion fields that are estimated based on the optical flow. The algorithm is based on the fact that true block-motion vectors have similar characteristics to optical flow vectors. Thereafter, the search region is computed using these optical flow vectors that include spatial relationships. In conventional block matching, the search region is fixed. In contrast, in the new method, the appropriate size and location of the search region are both decided by the proposed algorithm. The results obtained using test images show that the proposed algorithm can produce a significant improvement compared with previous block-matching algorithms.

  • PDF

Generation of Block Assembly Sequence by Case Based Reasoning (사례기반 추론을 이용한 블록조립계획)

  • 신동목;김태운;서윤호
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.21 no.7
    • /
    • pp.163-170
    • /
    • 2004
  • In order to automatically determine the sequences of block assembly operations in shipbuilding, a process planning system using case-based reasoning (CBR) is developed. A block-assembly planning problem is modeled as a constraint satisfaction problem where the precedence relations between operations are considered constraints. The process planning system generates an assembly sequence by adapting information such as solutions and constraints collected from similar cases retrieved from the case base. In order to find similar cases, the process planning system first matches the parts of the problem and the parts of each case based on their roles in the assembly, and then it matches the relations related to the parts-pairs. The part involved in more operations are considered more important. The process planning system is applied to simple examples fur verification and comparison.

Prioritization of the Block Chain-based Financial Services for Bank : Focused on the Case Study of a Local Bank (블록체인 기반 대고객 뱅킹 서비스에 대한 우선순위 도출 : 지방은행의 사례를 중심으로)

  • Ko, Min-Seok;Kim, Jaehee
    • Journal of Information Technology Services
    • /
    • v.20 no.3
    • /
    • pp.87-101
    • /
    • 2021
  • Since the introduction of block chain technology, its potential use in financial service area have been increasing, and financial firms are seeking ways to take advantage of the benefits of it. The purpose of this study is to present an approach to prioritize block chain-based services for bank. Toward this, we picked out potential financial services through focus group interview and derived the criteria that can be used in evaluating the priorities of block chain-based banking services in the same way. Then, we propose an analytic hierarchy process model to help decision makers prioritize the banking services while considering multiple criteria of technology issues, governmental regulations in the financial industry, cost, managerial issues, customers' needs, and the business opportunity for the bank. By using the analytic hierarchy process model, we can estimate the weighting coefficients to be assigned to each criteria and determine the order of priority in determining the best block chain-based service for the case study bank. The results show that banking login authentication would be forefront service, followed by money transfer, document notarization, and trade financing service in the order, and the trade financing could be most important service in terms of the business profitability for the bank in the future.

Block Unit Mapping Technique of NAND Flash Memory Using Variable Offset

  • Lee, Seung-Woo;Ryu, Kwan-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.8
    • /
    • pp.9-17
    • /
    • 2019
  • In this paper, we propose a block mapping technique applicable to NAND flash memory. In order to use the NAND flash memory with the operating system and the file system developed on the basis of the hard disk which is mainly used in the general PC field, it is necessary to use the system software known as the FTL (Flash Translation Layer). FTL overcomes the disadvantage of not being able to overwrite data by using the address mapping table and solves the additional features caused by the physical structure of NAND flash memory. In this paper, we propose a new mapping method based on the block mapping method for efficient use of the NAND flash memory. In the case of the proposed technique, the data modification operation is processed by using a blank page in the existing block without using an additional block for the data modification operation, thereby minimizing the block unit deletion operation in the merging operation. Also, the frequency of occurrence of the sequential write request and random write request Accordingly, by optimally adjusting the ratio of pages for recording data in a block and pages for recording data requested for modification, it is possible to optimize sequential writing and random writing by maximizing the utilization of pages in a block.

Depth-map coding using the block-based decision of the bitplane to be encoded (블록기반 부호화할 비트평면 결정을 이용한 깊이정보 맵 부호화)

  • Kim, Kyung-Yong;Park, Gwang-Hoon
    • Journal of Broadcast Engineering
    • /
    • v.15 no.2
    • /
    • pp.232-235
    • /
    • 2010
  • This paper proposes an efficient depth-map coding method. The adaptive block-based depth-map coding method decides the number of bit planes to be encoded according to the quantization parameters to obtain the desired bit rates. So, the depth-map coding using the block-based decision of the bit-plane to be encoded proposes to free from the constraint of the quantization parameters. Simulation results show that the proposed method, in comparison with the adaptive block-based depth-map coding method, improves the average BD-rate savings by 3.5% and the average BD-PSNR gains by 0.25dB.

Feature-based Object Tracking using an Active Camera (능동카메라를 이용한 특징기반의 물체추적)

  • 정영기;호요성
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.3
    • /
    • pp.694-701
    • /
    • 2004
  • In this paper, we proposed a feature-based tracking system that traces moving objects with a pan-tilt camera after separating the global motion of an active camera and the local motion of moving objects. The tracking system traces only the local motion of the comer features in the foreground objects by finding the block motions between two consecutive frames using a block-based motion estimation and eliminating the global motion from the block motions. For the robust estimation of the camera motion using only the background motion, we suggest a dominant motion extraction to classify the background motions from the block motions. We also propose an efficient clustering algorithm based on the attributes of motion trajectories of corner features to remove the motions of noise objects from the separated local motion. The proposed tracking system has demonstrated good performance for several test video sequences.

Fast Variable-size Block Matching Algorithm for Motion Estimation Based on Bit-pattern (비트패턴을 기반으로 한 고속의 적응적 가변 블록 움직임 예측 알고리즘)

  • 신동식;안재형
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.4
    • /
    • pp.372-379
    • /
    • 2000
  • In this paper, we propose a fast variable-size block matching algorithm for motion estimation based on bit-pattern. Motion estimation in the proposed algorithm is performed after the representation of image sequence is transformed 8bit pixel values into 1bit ones depending on the mean value of search block, which brings a short searching time by reducing the computational complexity. Moreover, adaptive searching methods according to the motion information of the block make the procedure of motion estimation efficient by eliminating an unnecessary searching of low motion block and deepening a searching procedure in high motion block. Experimental results show that the proposed algorithm provides better performance-0.5dB PSNR improvement-than full search block matching algorithm with a fixed block size.

  • PDF

Training of Accounting Professionals Following the Introduction of Block Chain Technology (블록체인 기술 다식부기 시스템 도입에 따른 회계전문인 육성 방안)

  • Yang, Haejin;Bae, Kheesu
    • Journal of Information Technology Applications and Management
    • /
    • v.26 no.4
    • /
    • pp.41-50
    • /
    • 2019
  • Block chain technology revolutionizes the 'double entry bookkeeping' of accounting principles in 600 years. It will be an opportunity for you to become one. The advent of the block chain will revolutionize the accounting world. It is no exaggeration to say that it is a skill. The use of block chains for accounting leads to the occurrence of transactions. It's easy to identify a transaction, and it's easy to fake or tamper with it. The accounting industry because it is difficult to communicate transparent accounting information to stake holders. Transformations will be possible across the board (Carlozo, 2017). An entity shall provide financial information that is useful to interested parties in making reasonable economic decisions. Transactions arising from business activities are recorded and provided in the books. Interested parties are here. We need to make decisions to protect our interests and make those decisions rationally. To make a decision, we know how the outcome of the decision will affect our self-interest. Because it has to do so, it uses corporate information for this purpose. But the investor is one way of doing business. It is difficult to trust the information provided by (Yermack, 2017). As a result, ICO companies, startups, small businesses lose a lot of business opportunities because they don't have investors. In addition, the management mixes cash flows with accounting interests to indicate changes in cash flows. It experiences failure in its business due to its inability to analyze and predict faithfully. But it's a blockhead in accounting. Applying the factors and recording them in the book will result in a number of benefits for different stake holders. It can be provided. The financial information in the block chain is not subject to further review or verification. It can improve the timeliness and increase reliability of financial information because it cannot be forged or tampered with (Delloitte, 2016). Based on the fourth industrial revolution, the pace of change in all sectors of society has never been faster. Based on block chain technology, decision-making structure is based on vertical structure of the past. Transforming into a horizontal structure collapses existing tools and advances transparency and decentralization a change of Copernican interpersonal awareness with the trend of the times, which is becoming angry with modern people.

Adaptive Predictive Image Coding of Variable Block Shapes Based on Edge Contents of Blocks (경계의 방향성에 근거를 둔 가변블록형상 적응 예측영상부호화)

  • Do, Jae-Su;Kim, Ju-Yeong;Jang, Ik-Hyeon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.7
    • /
    • pp.2254-2263
    • /
    • 2000
  • This paper proposes an efficient predictive image-compression technique based on vector quantization of blocks of pels. In the proposed method edge contents of blocks control the selection of predictors and block shapes as well. The maximum number of bits assigned to quantizers has been in creased to 3bits/pel from 1/5bits/pel, the setting employed by forerunners in predictive vector quantization of images. This increase prevents the saturation in SNR observed in their results in high bit rates. The variable block shape is instrumental in eh reconstruction of edges. The adaptive procedure is controlled by means of he standard deviation ofp rediction errors generated by a default predictor; the standard deviation address a decision table which can be set up beforehand. eh proposed method is characterized by overall improvements in image quality over A-VQ-PE and A-DCT VQ, both of which are known for their efficient use of vector quantizers.

  • PDF