• Title/Summary/Keyword: memory reconstruction

Search Result 79, Processing Time 0.028 seconds

On-line Handwriting Chinese Character Recognition for PDA Using a Unit Reconstruction Method (유닛 재구성 방법을 이용한 PDA용 온라인 필기체 한자 인식)

  • Chin, Won;Kim, Ki-Doo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.1
    • /
    • pp.97-107
    • /
    • 2002
  • In this paper, we propose the realization of on-line handwritten Chinese character recognition for mobile personal digital assistants (PDA). We focus on the development of an algorithm having a high recognition performance under the restriction that PDA requires small memory storage and less computational complexity in comparison with PC. Therefore, we use index matching method having computational advantage for fast recognition and we suggest a unit reconstruction method to minimize the memory size to store the character models and to accomodate the various changes in stroke order and stroke number of each person in handwriting Chinese characters. We set up standard model consisting of 1800 characters using a set of pre-defined units. Input data are measured by similarity among candidate characters selected on the basis of stroke numbers and region features after preprocessing and feature extracting. We consider 1800 Chinese characters adopted in the middle and high school in Korea. We take character sets of five person, written in printed style, irrespective of stroke ordering and stroke numbers. As experimental results, we obtained an average recognition time of 0.16 second per character and the successful recognition rate of 94.3% with MIPS R4000 CPU in PDA.

Hybrid MBE Growth of Crack-Free GaN Layers on Si (110) Substrates

  • Park, Cheol-Hyeon;O, Jae-Eung;No, Yeong-Gyun;Lee, Sang-Tae;Kim, Mun-Deok
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2013.02a
    • /
    • pp.183-184
    • /
    • 2013
  • Two main MBE growth techniques have been used: plasma-assisted MBE (PA-MBE), which utilizes a rf plasma to supply active nitrogen, and ammonia MBE, in which nitrogen is supplied by pyrolysis of NH3 on the sample surface during growth. PA-MBE is typically performed under metal-rich growth conditions, which results in the formation of gallium droplets on the sample surface and a narrow range of conditions for optimal growth. In contrast, high-quality GaN films can be grown by ammonia MBE under an excess nitrogen flux, which in principle should result in improved device uniformity due to the elimination of droplets and wider range of stable growth conditions. A drawback of ammonia MBE, on the other hand, is a serious memory effect of NH3 condensed on the cryo-panels and the vicinity of heaters, which ruins the control of critical growth stages, i.e. the native oxide desorption and the surface reconstruction, and the accurate control of V/III ratio, especially in the initial stage of seed layer growth. In this paper, we demonstrate that the reliable and reproducible growth of GaN on Si (110) substrates is successfully achieved by combining two MBE growth technologies using rf plasma and ammonia and setting a proper growth protocol. Samples were grown in a MBE system equipped with both a nitrogen rf plasma source (SVT) and an ammonia source. The ammonia gas purity was >99.9999% and further purified by using a getter filter. The custom-made injector designed to focus the ammonia flux onto the substrate was used for the gas delivery, while aluminum and gallium were provided via conventional effusion cells. The growth sequence to minimize the residual ammonia and subsequent memory effects is the following: (1) Native oxides are desorbed at $750^{\circ}C$ (Fig. (a) for [$1^-10$] and [001] azimuth) (2) 40 nm thick AlN is first grown using nitrogen rf plasma source at $900^{\circ}C$ nder the optimized condition to maintain the layer by layer growth of AlN buffer layer and slightly Al-rich condition. (Fig. (b)) (3) After switching to ammonia source, GaN growth is initiated with different V/III ratio and temperature conditions. A streaky RHEED pattern with an appearance of a weak ($2{\times}2$) reconstruction characteristic of Ga-polarity is observed all along the growth of subsequent GaN layer under optimized conditions. (Fig. (c)) The structural properties as well as dislocation densities as a function of growth conditions have been investigated using symmetrical and asymmetrical x-ray rocking curves. The electrical characteristics as a function of buffer and GaN layer growth conditions as well as the growth sequence will be also discussed. Figure: (a) RHEED pattern after oxide desorption (b) after 40 nm thick AlN growth using nitrogen rf plasma source and (c) after 600 nm thick GaN growth using ammonia source for (upper) [110] and (lower) [001] azimuth.

  • PDF

Design and Implementation of ECQV Implicit Certificate (ECQV 묵시적 인증서의 설계 및 구현에 관한 연구)

  • Seong, Jeong-Gi;Kim, Eun-Gi
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.4
    • /
    • pp.744-752
    • /
    • 2017
  • ECQV implicit certificate reconstructs the public key from the certificate without validation of the signature unlike the explicit certificate. Like this, the certificate and the public key is implicitly validated when a public key is reconstructed from a certificate. Hence, ECQV implicit certificate is shorter than the explicit certificate due to be only comprised of the public key reconstruction data instead of the signature and the public key, and faster to reconstruct the public key from the certificate than validating the signature. Furthermore, ECQV is well suited for environments and application that resources such as memory and bandwidth are limited because it is shorter the key length, and faster the performance than other cipher cryptography due to be run on ECC. In this paper, we describe prerequisites of ECQV specified in the SECG SEC 4 and issuance of an implicit certificate, reconstruction of the public key from an implicit certificate. Also we designed and implemented ECQV, and measured the performance of it.

An Efficient 2D Discrete Wavelet Transform Filter Design Using Lattice Structure (Lattice 구조를 갖는 효율적인 2차원 이산 웨이블렛 변환 필터 설계)

  • Park, Tae-Geun;Jeong, Seon-Gyeong
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.39 no.6
    • /
    • pp.59-68
    • /
    • 2002
  • In this paper, we design the two-dimensional Discrete Wavelet Transform (2D DWT) filter that is widely used in various applications such as image compression because it has no blocking effects and relatively high compression rate. The filter that we used here is two-channel four-taps QMF(Quadrature Mirror Filter) Lattice filter with PR (Perfect Reconstruction) property. The proposed DWT architecture, with two consecutive inputs shows an efficient performance with a minimum of such hardware resources as multipliers, adders, and registers due to a simple scheduling. The proposed architecture was verified by the RTL simulation, and utilizes the hardware 100%. Our architecture shows a relatively high performance with a minimum hardware when compared with other approaches. An efficient memory mapping and address generation techniques are introduced and the fixed-point arithmetic analysis for minimizing the PSNR degradation due to quantization is discussed.

Random Partial Haar Wavelet Transformation for Single Instruction Multiple Threads (단일 명령 다중 스레드 병렬 플랫폼을 위한 무작위 부분적 Haar 웨이블릿 변환)

  • Park, Taejung
    • Journal of Digital Contents Society
    • /
    • v.16 no.5
    • /
    • pp.805-813
    • /
    • 2015
  • Many researchers expect the compressive sensing and sparse recovery problem can overcome the limitation of conventional digital techniques. However, these new approaches require to solve the l1 norm optimization problems when it comes to signal reconstruction. In the signal reconstruction process, the transform computation by multiplication of a random matrix and a vector consumes considerable computing power. To address this issue, parallel processing is applied to the optimization problems. In particular, due to huge size of original signal, it is hard to store the random matrix directly in memory, which makes one need to design a procedural approach in handling the random matrix. This paper presents a new parallel algorithm to calculate random partial Haar wavelet transform based on Single Instruction Multiple Threads (SIMT) platform.

Fast Generation and Reconstruction of Digital Holograms Using a Novel Look-up Table (새로운 룩업테이블을 이용한 3차원 디지털 홀로그램의 고속 합성 및 복원)

  • Kim, Seung-Chul;Kim, Eun-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.3C
    • /
    • pp.255-261
    • /
    • 2008
  • Conventional look-up table(LT) has gained a lot of speed increase in generation of digital holograms for 3D objects, but it has required an enormous memory size of the LT. In this paper, a novel approach to dramatically reduce the size of the conventional LT, still keeping its advantage of fast computational speed is proposed, which is called here a N-LT(novel look-up table) method. In the proposed method, only the fringe patterns of the center points on each image plane are pre-calculated, called elemental fringe patterns and stored in the look-up table. Then, the fringe patterns for other object points on each image plane can be obtained by simply shifting this pre-calculated elemental fringe pattern according to the displaced values from the center to those points and adding them together. Some experimental results revealed that the computational speed and the required memory size of the proposed approach are found to be 48.7 times faster than that of the ray-tracing method and 217 times smaller than that of the conventional LT method, respectively.

Surface Extraction from Point-Sampled Data through Region Growing

  • Vieira, Miguel;Shimada, Kenji
    • International Journal of CAD/CAM
    • /
    • v.5 no.1
    • /
    • pp.19-27
    • /
    • 2005
  • As three-dimensional range scanners make large point clouds a more common initial representation of real world objects, a need arises for algorithms that can efficiently process point sets. In this paper, we present a method for extracting smooth surfaces from dense point clouds. Given an unorganized set of points in space as input, our algorithm first uses principal component analysis to estimate the surface variation at each point. After defining conditions for determining the geometric compatibility of a point and a surface, we examine the points in order of increasing surface variation to find points whose neighborhoods can be closely approximated by a single surface. These neighborhoods become seed regions for region growing. The region growing step clusters points that are geometrically compatible with the approximating surface and refines the surface as the region grows to obtain the best approximation of the largest number of points. When no more points can be added to a region, the algorithm stores the extracted surface. Our algorithm works quickly with little user interaction and requires a fraction of the memory needed for a standard mesh data structure. To demonstrate its usefulness, we show results on large point clouds acquired from real-world objects.

Memory, deconstruction and reconstruction of 'history': Suzan-Lori Parks' The America Play ('역사'의 기억과 해체 그리고 재구성: 수잔-로리 팍스의 "미국 극")

  • Park, Jin-Sook
    • English Language & Literature Teaching
    • /
    • v.15 no.3
    • /
    • pp.315-332
    • /
    • 2009
  • The purpose of this paper is to scrutinize how Parks recalling, deconstructing and reconstructing African-American memories of the absences in American history through a black Lincoln impersonator named, The Foundling Father or The Lesser Known. Parks unearths and reconstitutes a significance for the historical event of Lincoln's assassination by repetitive mimicry and verbal puns. As a pun of the Founding Father, the Foundling Father reminds us of Abraham Lincoln, one of the most venerated figures in American history. In the first act, the black Foundling Father performs as The Great Man. This inverted minstrel show of the black Foundling Father performing a white Lincoln exposes the desire of the Foundling Father to insert his narrative within the history of America. With a series of assassinations, the African-American performers figuratively murder the power and control of the American myth. In the second act, his wife Lucy and his son Brazil dig relics from the past out of 'The great hole of history' instead of the Foundling Father. Digging and burial for African-Americans are their livelihood and their calling as well. As Parks pointed out, they should locate the ancestral buried ground, dig for bones and find bones because so much of African-American history has been unrecorded, dismembered and washed out. Parks leaves the possibilities of digging and burying on the black history through Lucy and Brazil.

  • PDF

Holographic Data Storage System using prearranged plan table by fuzzy rule and Genetic algorithm

  • Kim, Jang-Hyun;Kim, Sang-Hoon;Yang, Hyun-Seok;Park, Jin-Bae;Park, Young-Pil
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1260-1263
    • /
    • 2005
  • Data storage related with writing and retrieving requires high storage capacity, fast transfer rate and less access time. Today any data storage system cannot satisfy these conditions, however holographic data storage system can perform faster data transfer rate because it is a page oriented memory system using volume hologram in writing and retrieving data. System can be constructed without mechanical actuating part therefore fast data transfer rate and high storage capacity about 1Tb/cm3 can be realized. In this research, to reduce errors of binary data stored in holographic data storage system, a new method for bit error reduction is suggested. First, find fuzzy rule using experimental system for Element of Holographic Digital Data System. Second, make fuzzy rule table using Genetic algorithm. Third, reduce prior error element and recording Digital Data. Recording ratio and reconstruction ratio will be very good performance

  • PDF

Simple Signal Reconstruction by Faster Adaptive MRP Algorithm (고속 적응 MRP 알고리즘에 의한 저주파 신호 복원)

  • Jeong, Won-Yong;Kim, Jong-Su;Choe, Tae-Won;Bae, Jin-Ho
    • The Journal of the Acoustical Society of Korea
    • /
    • v.11 no.2
    • /
    • pp.5-14
    • /
    • 1992
  • In the fields of astronomy, communication, X-ray crystallography, and engineering, it is a very important and useful fact that the original signal can be reconstructed from a partial information, only spectral magnitude or phase, of the signal. In this paper, we proposed a modified iterative algorithm to solve the Magnitude Retrieval Problem (MRP) for 1-D, 2-D signals. In oder to accelerate the convergence rate, the unit constant initial function which is used in the references is replaced by the exponential initial function for the modified adaptive iterative method. As a result, MRP with 1-D signal and low-pass detail image is significantly enhanced from an iterative convergence rate and a computer storage memory points of view.

  • PDF