• International Journal of Control, Automation, and Systems
• /
• 제1권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.

• 전자공학회논문지B
• /
• 제33B권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.

• Structural Engineering and Mechanics
• /
• 제19권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.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권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.

• 콘크리트학회지
• /
• 제11권1호
• /
• pp.161-171
• /
• 1999

본 연구는 비파괴 검사방법인 충격 공진법을 이용하여 결함을 갖는 콘크리트 시험체로부터의 반사신호를 정량적으로 해석하기 위한 연구이다. 충격 공진법은 비교적 저주파의 강한 에너지를 콘크리트내에 가하여 그 반사신호로부터 결함이나 경계층 등을 조사하기 때문에 굵은 골재 등을 포함하고 중량물인 콘크리트 구조물의 탐사에 유용하다. 그러나, 보나 기둥 등의 작은 경계를 갖는 콘크리트 시험체를 대상으로 할 경우에는 각 경계로부터 수평방향을 왕복하는 R-파의 영향이 크기 때문에 결함 또는 경계층으로부터의 반사신호인 수직방향으로부터의 P-파의 세기가 충분히 크지 못하면, 결함 등으로부터의 신호를 검출하기 어렵게 된다. 따라서, 본 연구에서는 시험체의 경계조건과 결함의 위치에 따라 발생 가능한 각 진동모드를 정량적으로 해석하는 방법을 연구하여 결함으로부터의 신호를 검출하는 방법에 대해 검토하였다. 그 결과, 각모서리의 길이가 50cm 이내의 작은 경계조건과 50cm의 깊은 두계를 갖는 콘크리트 시험체내의 결함에 대해서도 콘크리트가 부배합 조건이고 결함의 깊이가 30cm이내일 경우 정량적 탐사가 가능하며, 각 모서리의 크기가 충분히 큰 대형 시험체 조건에서는 보다 용이하고 폭넓게 다양한 조건의 결함 등에 대한 정량적 참사가 가능하였다.

• 전자공학회논문지B
• /
• 제32B권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%.

• Asian Pacific Journal of Cancer Prevention
• /
• 제16권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.

• ETRI Journal
• /
• 제28권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.

• 한국정보통신학회논문지
• /
• 제15권4호
• /
• pp.913-920
• /
• 2011

본 논문에서는 수동형 900MHz RFID 태그 칩용 로직 공정 기반 저면적.저전력 1Kb EEPROM를 설계하였다. 1Kb 셀 배열 (cell array)은 1 워드 (word)의 EEPROM 팬텀 셀 (phantom cell)을 2차원 배열 형태인 (16행 ${\times}$ 16열) ${\times}$ 4블록으로 구성하였으며, 4개의 메모리 블록이 CG (Control Gate)와 TG (Tunnel Gate) 구동회로를 공유하므로 저면적 IP 설계를 하였다. TG 구동회로를 공유하기 위해 소자간의 전압을 신뢰성이 보장되는 5.5V 이내로 유지하면서 동작 모드별 TG 바이어스 전압을 스위칭해 주는 TG 스위치 회로를 제안하였다. 그리고 4 메모리 블록 중 하나의 블록만 활성화하는 partial activation 방식을 사용하므로 읽기 모드에서 전력소모를 줄였다. 그리고 하나의 열 (column)당 연결되는 셀의 수를 줄이므로 읽기 모드에서 BL (Bit-Line)의 스위칭 시간을 빠르게 하여 액세스 시간 (access time)을 줄였다. Tower $0.18{\mu}m$ CMOS 공정을 이용하여 (32행 ${\times}$ 16열) ${\times}$ 2블록과 (16행 ${\times}$ 16열) ${\times}$ 4블록의 2가지 배열 형태의 1Kb EEPROM IP를 설계하였으며, (16행 ${\times}$ 16열) ${\times}$ 4블록의 IP가 (32행 ${\times}$ 16열) ${\times}$ 2블록의 IP에 비해 레이아웃 면적은 11.9% 줄였으며, 읽기 모드 시 전력소모는 51% 줄였다.