• Title/Summary/Keyword: Merging Unit

Search Result 51, Processing Time 0.034 seconds

Segmentation of region strings using connection-characteristic function (연결특성함수를 이용한 문서화상에서의 영역 분리와 문자열 추출)

  • 김석태;이대원;박찬용;남궁재찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.11
    • /
    • pp.2531-2542
    • /
    • 1997
  • This paper describes a method for region segmentation and string extractionin documents which are mixed with text, graphic and picture images by the use of the structural characteristic of connceted components. In segmentation of non-text regionas, with connection-characteristic functions which are made by structural characteristic of connected components, segmentation process is progressed. In the string extraction, first we organize basic-unit-region of which vertical and horizontal length are 1/4 of average length of connection components. Second, by merging the basic-unit-regions one other that have smaller values than a given connection intensity threshold. Third, by linking the word blocks with similar block anagles, initial strings are cresed. Finally the whold strings are generated by merging remaining word blocks whose angles are not decided, if their height and prosition are similar to the initial strings. This method can extract strings that are neither horizontal nor of various character sizes. Through computer exteriments with different style documents, we have shown that the feasibility of our method successes.

  • PDF

A Study on real-time Sampled Values transmission method of Merging Unit based on IEC 61850 (IEC 61850 기반 병합 장치의 샘플 값 실시간 전송 방안에 대한 연구)

  • Hong, Jun-Ho;Rim, Seong-Jeong;Choi, Myeon-Song;Lee, Seung-Jae;Yu, Yang
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.215-216
    • /
    • 2008
  • 병합 장치(Merging unit)는 계전용 IED로 측정된 전압 및 전류의 값을 A/D 변환한 샘플 값(Sampled values)을 전송하는 IED로써 실시간으로 통신을 하여야 하는 측면에서 해결해야 할 많은 요소를 가지고 있다. 본 논문에서는 병합 장치를 구현하면서 실시간으로 샘플 값을 전송하는 방법에 관한 고려해야 할 전송 요구사항, 네트워크 시간 지연, 네트워크 과부하 현상 등의 문제점들에 대해 실시간 통신 방안을 설명하였다.

  • PDF

Korean Word Recognition Using Diphone- Level Hidden Markov Model (Diphone 단위 의 hidden Markov model을 이용한 한국어 단어 인식)

  • Park, Hyun-Sang;Un, Chong-Kwan;Park, Yong-Kyu;Kwon, Oh-Wook
    • The Journal of the Acoustical Society of Korea
    • /
    • v.13 no.1
    • /
    • pp.14-23
    • /
    • 1994
  • In this paper, speech units appropriate for recognition of Korean language have been studied. For better speech recognition, co-articulatory effects within an utterance should be considered in the selection of a recognition unit. One way to model such effects is to use larger units of speech. It has been found that diphone is a good recognition unit because it can model transitional legions explicitly. When diphone is used, stationary phoneme models may be inserted between diphones. Computer simulation for isolated word recognition was done with 7 word database spoken by seven male speakers. Best performance was obtained when transition regions between phonemes were modeled by two-state HMM's and stationary phoneme regions by one-state HMM's excluding /b/, /d/, and /g/. By merging rarely occurring diphone units, the recognition rate was increased from $93.98\%$ to $96.29\%$. In addition, a local interpolation technique was used to smooth a poorly-modeled HMM with a well-trained HMM. With this technique we could get the recognition rate of $97.22\%$ after merging some diphone units.

  • PDF

Merging of Two Artificial Neural Networks

  • Kim, Mun-Hyuk;Park, Jin-Young
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.258-261
    • /
    • 2002
  • This paper addresses the problem of merging two feedforward neural networks into one network. Merging is accomplished at the level of hidden layer. A new network selects its hidden layer's units from the two networks to be merged We uses information theoretic criterion (quadratic mutual information) in the selection process. The hidden unit's output and the target patterns are considers as random variables and the mutual information between them is calculated. The mutual information between hidden units are also considered to prevent the statistically dependent units from being selected. Because mutual information is invariant under linear transformation of the variables, it shows the property of the robust estimation.

  • PDF

Merging, Recoiling, or Slingshotting of Supermassive Black Holes in a Red AGN 1659+1834

  • Kim, Dohyeong;Im, Myungshin
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.46 no.1
    • /
    • pp.31.1-31.1
    • /
    • 2021
  • We report the Gemini Multi-Object Spectrograph (GMOS) Integral Field Unit (IFU) observation of a red active galactic nucleus (AGN), 2MASSJ165939.7+183436 (1659+1834). 1659+1834 is a prospective merging supermassive black hole (SMBH) candidate due to its merging features and double-peaked broad emission lines. The double-peaked broad emission lines are kinematically separated by 3000 km/s, with the SMBH of each component weighing at 10^8.9 and 10^7.1 solar mass. Our GMOS IFU observation reveals that the two components of the double-peaked broad emission line are spatially separated by 0.085" (~250pc). In different assumptions for the line fitting, however, a null (<0.05") or a larger spatial separation (~0.15") are also possible. For this GMOS IFU observational results of 1659+1834, various models can be viable solutions, such as the disk emitter and multiple SMBH models. We believe that these results show the need for future research of finding more multiple SMBH systems in red AGNs.

  • PDF

Rolled Fingerprint Merge Algorithm Using Adaptive Projection Mask (가변 투영마스크를 이용한 회전지문 정합 알고리즘에 관한 연구)

  • Baek, Young Hyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.12
    • /
    • pp.176-183
    • /
    • 2013
  • We propose a rolled fingerprint merging algorithm that effectively merges plain fingerprints in consecutive frame units that are fed through rolling and detects more fingerprint minutiae in order to increase the fingerprint recognition rate. The proposed rolled fingerprint merging algorithm uses a adaptive projection mask; it contains a detector that separates plain fingerprints from the background and a projection mask generator that sequentially projects the detect ed images. In addition, in the merging unit, the pyramid-shaped projection method is used to detect merged rolled fingerprints from the generated variable projective mask, starting from the main images. Simulations show that the extracted minutia e are 46.79% more than those from plain fingerprints, and the proposed algorithm exhibits excellent performance by detecting 52.0% more good fingerprint minutiae that are needed for matching.

Gradation Image Processing for Text Recognition in Road Signs Using Image Division and Merging

  • Chong, Kyusoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.13 no.2
    • /
    • pp.27-33
    • /
    • 2014
  • This paper proposes a gradation image processing method for the development of a Road Sign Recognition Platform (RReP), which aims to facilitate the rapid and accurate management and surveying of approximately 160,000 road signs installed along the highways, national roadways, and local roads in the cities, districts (gun), and provinces (do) of Korea. RReP is based on GPS(Global Positioning System), IMU(Inertial Measurement Unit), INS(Inertial Navigation System), DMI(Distance Measurement Instrument), and lasers, and uses an imagery information collection/classification module to allow the automatic recognition of signs, the collection of shapes, pole locations, and sign-type data, and the creation of road sign registers, by extracting basic data related to the shape and sign content, and automated database design. Image division and merging, which were applied in this study, produce superior results compared with local binarization method in terms of speed. At the results, larger texts area were found in images, the accuracy of text recognition was improved when images had been gradated. Multi-threshold values of natural scene images are used to improve the extraction rate of texts and figures based on pattern recognition.

A new merging-zone flow injection system for the quantification of ferrous and ferric ions in aqueous solution and sludge of wastewater

  • Farhood, Ahmed Saleh;Taha, Dakhil Nassir
    • Analytical Science and Technology
    • /
    • v.35 no.5
    • /
    • pp.218-227
    • /
    • 2022
  • A simple and fast throughput flow injection (FI) system with a merging-zone technique was designed to determine ferrous and ferric in an aqueous solution. The method is based on the direct reaction of ferrous with a Bathophenanthroline reagent (Bphen) in acidic media. The forming red complex absorbs light at 533 nm. All conditions of the flow injection system were investigated. The analytical curve of ferrous was linear in the range of 0.07 to 4 mg/L with an r2 value of 0.9968. The detection and quantification limits were 0.02 and 0.04 mg/L, respectively. The molar absorptivity and Sandell's sensitivity were 4.0577 × 106 L/mol cm and 25 × 10-5 ㎍/cm2, respectively. The homemade valve was low-cost with high repeatability (n = 7) at an RSD of 1.26 % and zero dead volume. The values of the dispersion coefficient were 2.318, 2.022, and 1.636 for the concentrations of 0.2, 1, and 3 mg/L, respectively. The analysis throughput of the designed flow injection unit was 57 sample per hour.

A Construction Theory of Arithmetic Operation Unit Systems over $GF(2^m)$ ($GF(2^m)$ 상의 산술연산기시스템 구성 이론)

  • 박춘명;김흥수
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.6
    • /
    • pp.910-920
    • /
    • 1990
  • This paper presents a method of constructing an Arithmetic Operation Unit Systems (A.O.U.S.) over Galois Field GF(2**m) for the purpose of the four arithmetical operation(addition, subtraction, multiplication and division between two elements in GF(2**mm). The proposed A.O.U.S. is constructed by following procedure. First of all, we obtained each four arithmetical operation algorithms for performing the four arithmetical operations using by mathematical properties over GF(2**m). Next, for the purpose of realizing the four arithmetical unit module (adder module, subtracter module, multiplier module and divider module), we constructed basic cells using the four arithmetical operation algorithms. Then, we realized the four Arithmetical Operation Unit Modules(A.O.U.M.) using basic cells and we constructd distributor modules for the purpose of merging A.O.U.M. with distributor modules. Finally, we constructed the A.O.U.S. over GF(2**m) by synthesizing A.O.U.M. with distributor modules. We prospect that we are able to construct an Arithmetic & Logical Operation Unit Systems (A.L.O.U.S.) if we will merge the proposed A.O.U.S. in this paper with Logical Operation Unit Systems (L.O.U.S.).

  • PDF

Reference Frame Memory Compression Using Selective Processing Unit Merging Method (선택적 수행블록 병합을 이용한 참조 영상 메모리 압축 기법)

  • Hong, Soon-Gi;Choe, Yoon-Sik;Kim, Yong-Goo
    • Journal of Broadcast Engineering
    • /
    • v.16 no.2
    • /
    • pp.339-349
    • /
    • 2011
  • IBDI (Internal Bit Depth Increase) is able to significantly improve the coding efficiency of high definition video compression by increasing the bit depth (or precision) of internal arithmetic operation. However the scheme also increases required internal memory for storing decoded reference frames and this can be significant for higher definition of video contents. So, the reference frame memory compression method is proposed to reduce such internal memory requirement. The reference memory compression is performed on 4x4 block called the processing unit to compress the decoded image using the correlation of nearby pixel values. This method has successively reduced the reference frame memory while preserving the coding efficiency of IBDI. However, additional information of each processing unit has to be stored also in internal memory, the amount of additional information could be a limitation of the effectiveness of memory compression scheme. To relax this limitation of previous memory compression scheme, we propose a selective merging-based reference frame memory compression algorithm, dramatically reducing the amount of additional information. Simulation results show that the proposed algorithm provides much smaller overhead than that of the previous algorithm while keeping the coding efficiency of IBDI.