• Title/Summary/Keyword: blocks of size two

Search Result 128, Processing Time 0.025 seconds

Efficient Tracking of a Moving Object using Optimal Representative Blocks

  • Kim, Wan-Cheol;Hwang, Cheol-Ho;Lee, Jang-Myung
    • International Journal of Control, Automation, and Systems
    • /
    • v.1 no.4
    • /
    • pp.495-502
    • /
    • 2003
  • This paper focuses on the implementation of an efficient tracking method of a moving object using optimal representative blocks by way of a pan-tilt camera. The key idea is derived from the fact that when the image size of a moving object is shrunk in an image frame according to the distance between the mobile robot camera and the object in motion, the tracking performance of a moving object can be improved by reducing the size of representative blocks according to the object image size. Motion estimations using Edge Detection (ED) and Block-Matching Algorithm (BMA) are regularly employed to track objects by vision sensors. However, these methods often neglect the real-time vision data since these schemes suffer from heavy computational load. In this paper, a representative block able to significantly reduce the amount of data to be computed, is defined and optimized by changing the size of representative blocks according to the size of the object in the image frame in order to improve tracking performance. The proposed algorithm is verified experimentally by using a two degree-of- freedom active camera mounted on a mobile robot.

An Efficient Block Segmentation and Classification of a Document Image Using Edge Information (문서영상의 에지 정보를 이용한 효과적인 블록분할 및 유형분류)

  • 박창준;전준형;최형문
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.10
    • /
    • pp.120-129
    • /
    • 1996
  • This paper presents an efficient block segmentation and classification using the edge information of the document image. We extract four prominent features form the edge gradient and orientaton, all of which, and thereby the block clssifications, are insensitive to the background noise and the brightness variation of of the image. Using these four features, we can efficiently classify a document image into the seven categrories of blocks of small-size letters, large-size letters, tables, equations, flow-charts, graphs, and photographs, the first five of which are text blocks which are character-recognizable, and the last two are non-character blocks. By introducing the clumn interval and text line intervals of the document in the determination of th erun length of CRLA (constrained run length algorithm), we can obtain an efficient block segmentation with reduced memory size. The simulation results show that the proposed algorithm can rigidly segment and classify the blocks of the documents into the above mentioned seven categories and classification performance is high enough for all the categories except for the graphs with too much variations.

  • PDF

Size effect in concrete blocks under local pressure

  • Ince, R.;Arici, E.
    • Structural Engineering and Mechanics
    • /
    • v.19 no.5
    • /
    • pp.567-580
    • /
    • 2005
  • Numerous tests on concrete structure members under local pressure demonstrated that the compressive strength of concrete at the loaded surface is increased by the confinement effect provided by the enveloping concrete. Even though most design codes propose specific criteria for preventing bearing failure, they do not take into consideration size effect which is an important phenomenon in the fracture mechanics of concrete/reinforced concrete. In this paper, six series of square prism concrete blocks with three different depths (size range = 1:4) and two different height/depth ratios of 2 and 3 are tested under concentrated load. Ultimate loads obtained from the test results are analysed by means of the modified size effect law (MSEL). Then, a prediction formula, which considers effect of both depth and height on size effect, is proposed. The developed formula is compared with experimental data existing in the literature. It is concluded that the observed size effect is in good agreement with the MSEL.

Efficient Tracking of a Moving Object Using Representative Blocks Algorithm

  • Choi, Sung-Yug;Hur, Hwa-Ra;Lee, Jang-Myung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.678-681
    • /
    • 2004
  • In this paper, efficient tracking of a moving object using optimal representative blocks is implemented by a mobile robot with a pan-tilt camera. The key idea comes from the fact that when the image size of moving object is shrunk in an image frame according to the distance between the camera of mobile robot and the moving object, the tracking performance of a moving object can be improved by changing the size of representative blocks according to the object image size. Motion estimation using Edge Detection(ED) and Block-Matching Algorithm(BMA) is often used in the case of moving object tracking by vision sensors. However these methods often miss the real-time vision data since these schemes suffer from the heavy computational load. In this paper, the optimal representative block that can reduce a lot of data to be computed, is defined and optimized by changing the size of representative block according to the size of object in the image frame to improve the tracking performance. The proposed algorithm is verified experimentally by using a two degree-of-freedom active camera mounted on a mobile robot.

  • PDF

A reversible data hiding scheme in JPEG bitstreams using DCT coefficients truncation

  • Zhang, Mingming;Zhou, Quan;Hu, Yanlang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.1
    • /
    • pp.404-421
    • /
    • 2020
  • A reversible data hiding scheme in JPEG compressed bitstreams is proposed, which could avoid decoding failure and file expansion by means of removing of bitstreams corresponding to high frequency coefficients and embedding of secret data in file header as comment part. We decode original JPEG images to quantified 8×8 DCT blocks, and search for a high frequency as an optimal termination point, beyond which the coefficients are set to zero. These blocks are separated into two parts so that termination point in the latter part is slightly smaller to make the whole blocks available in substitution. Then spare space is reserved to insert secret data after comment marker so that data extraction is independent of recovery in receiver. Marked images can be displayed normally such that it is difficult to distinguish deviation by human eyes. Termination point is adaptive for variation in secret size. A secret size below 500 bits produces a negligible distortion and a PSNR of approximately 50 dB, while PSNR is also mostly larger than 30 dB for a secret size up to 25000 bits. The experimental results show that the proposed technique exhibits significant advantages in computational complexity and preservation of file size for small hiding capacity, compared to previous methods.

Analysis of Vibration Modes of Small and Large Concrete Blocks Containing Flaws by Impact Resonance Method (충격 공진법에 의한 대소 경계조건하 콘크리트 블록 내부결함 신호의 해석)

  • Park, Seok-Kyun;Yoon, Seok-Soo
    • Magazine of the Korea Concrete Institute
    • /
    • v.11 no.1
    • /
    • pp.161-171
    • /
    • 1999
  • Impact resonance testing was carried out on small and large concrete blocks containing several types of artificial flaws respectively. Quantitative analysis of the observed peak frequencies in the impact resonance tests identifies the possible normal modes of concrete blocks containing flaws. and enables to determine the depth and size of the flaws in concrete blocks. In this study, concrete can be treated as a homogeneous and isotropic material. The flaw size and location at each section of artificial flaw series in small and large concrete blocks, determined through two-dimensional scanning of impact point and real-time fast Fourier transform, are in good agreement with real size location, respectively. Consequently, quantitative analysis method of vibration modes in the impact resonance tests, which can be applied for homogeneous and isotropic material, can be useful for the detection of flaws in any case of small and large concrete blocks in this study.

Automatic Real-time Identification of Fingerprint Images Using Block-FFT (블럭 FFT를 이용한 실시간 지문 인식 알고리즘)

  • 안도성;김학일
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.6
    • /
    • pp.909-921
    • /
    • 1995
  • The objective of this paper is to develop an algorithm for a real-time automatic fingerprint recognition system. The algorithm employs the Fast Fourier Transform (FFT) in determining the directions of ridges in fingerprint images, and utilizes statistical information in recognizing the fingerprints. The information used in fingerprint recognition is based on the dircetions along ridge curves and characteristic points such as core points and delta points. In order to find ridge directions, the algorithm applies the FFT to a small block of the size 8x8 pixels, and decides the directions by interpreting the resulted Fourier spectrum. By using the FFT, the algorithm does not require conventional preprocessing procedures such as smoothing, binarization, thinning, and restorationl. Finally, in matching two fingerprint images, the algorithm searches and compares two kinds of feature blocks, one as the blocks where the dircetions cannot be defined from the Fourier spectrum, and the other as the blocks where the changes of directions become abrupt. The proposed algorithm has been implemented on a SunSparc-2 workstation under the Open Window environment. In the experiment, the proposed algorithm has been applied to a set of fingerprint images obtained by a prism system. The result has shown that while the rate of Type II error - Incorrect recognition of two different fingerprints as the identical fingerprints - is held at 0.0%, the rate of Type I error - Incorrect recognition of two identical fingerprints as the different ones - is 2.2%.

  • PDF

High Quality Tissue Miniarray Technique Using a Conventional TV/Radio Telescopic Antenna

  • Elkablawy, Mohamed A.;Albasri, Abdulkader M.
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.16 no.3
    • /
    • pp.1129-1133
    • /
    • 2015
  • Background: The tissue microarray (TMA) is widely accepted as a fast and cost-effective research tool for in situ tissue analysis in modern pathology. However, the current automated and manual TMA techniques have some drawbacks restricting their productivity. Our study aimed to introduce an improved manual tissue miniarray (TmA) technique that is simple and readily applicable to a broad range of tissue samples. Materials and Methods: In this study, a conventional TV/radio telescopic antenna was used to punch tissue cores manually from donor paraffin embedded tissue blocks which were pre-incubated at $40^{\circ}C$. The cores were manually transferred, organized and attached to a standard block mould, and filled with liquid paraffin to construct TmA blocks without any use of recipient paraffin blocks. Results: By using a conventional TV/radio antenna, it was possible to construct TmA paraffin blocks with variable formats of array size and number ($2-mm{\times}42$, $2.5-mm{\times}30$, $3-mm{\times}24$, $4-mm{\times}20$ and $5-mm{\times}12$ cores). Up to $2-mm{\times}84$ cores could be mounted and stained on a standard microscopic slide by cutting two sections from two different blocks and mounting them beside each other. The technique was simple and caused minimal damage to the donor blocks. H&E and immunostained slides showed well-defined tissue morphology and array configuration. Conclusions: This technique is easy to reproduce, quick, inexpensive and creates uniform blocks with abundant tissues without specialized equipment. It was found to improve the stability of the cores within the paraffin block and facilitated no losses during cutting and immunostaining.

Fuzzy Logic Based Temporal Error Concealment for H.264 Video

  • Lee, Pei-Jun;Lin, Ming-Long
    • ETRI Journal
    • /
    • v.28 no.5
    • /
    • pp.574-582
    • /
    • 2006
  • In this paper, a new error concealment algorithm is proposed for the H.264 standard. The algorithm consists of two processes. The first process uses a fuzzy logic method to select the size type of lost blocks. The motion vector of a lost block is calculated from the current frame, if the motion vectors of the neighboring blocks surrounding the lost block are discontinuous. Otherwise, the size type of the lost block can be determined from the preceding frame. The second process is an error concealment algorithm via a proposed adapted multiple-reference-frames selection for finding the lost motion vector. The adapted multiple-reference-frames selection is based on the motion estimation analysis of H.264 coding so that the number of searched frames can be reduced. Therefore the most accurate mode of the lost block can be determined with much less computation time in the selection of the lost motion vector. Experimental results show that the proposed algorithm achieves from 0.5 to 4.52 dB improvement when compared to the method in VM 9.0.

  • PDF

Design of Low-Area and Low-Power 1-kbit EEPROM (저면적.저전력 1Kb EEPROM 설계)

  • Yu, Yi-Ning;Yang, Hui-Ling;Jin, Li-Yan;Jang, Ji-Hye;Ha, Pan-Bong;Kim, Young-Hee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.4
    • /
    • pp.913-920
    • /
    • 2011
  • In this paper, a logic process based 1-kbit EEPROM IP for RFID tag chips of 900MHz is designed. The cell array of the designed 1-kbit EEPROM IP is arranged in a form of four blocks of 16 rows x 16 columns, that is in a two-dimensional arrangement of one-word EEPROM phantom cells. We can reduce the IP size by making four memory blocks share CG (control gate) and TG (tunnel gate) driver circuits. We propose a TG switch circuit to supply respective TG bias voltages according to operational modes and to keep voltages between devices within 5.5V in terms of reliability in order to share the TG driver circuit. Also, we can reduce the power consumption in the read mode by using a partial activation method to activate just one of four memory blocks. Furthermore, we can reduce the access time by making BL (bit line) switching times faster in the read mode from reduced number of cells connected to each column. We design and compare two 1-kbit EEPROM IPs, two blocks of 32 rows ${\times}$ 16 columns and four blocks of 16 rows ${\times}$ 16 columns, which use Tower's $0.18{\mu}m$ CMOS process. The four-block IP is smaller by 11.9% in the layout size and by 51% in the power consumption in the read mode than the two-block counterpart.