• Transactions of Materials Processing
• /
• v.13 no.7
• /
• pp.580-585
• /
• 2004

Almost all injection molds have multi-cavity runner system fur productivity and are designed with geometrically balanced runner system in order to minimize filling imbalance between cavity to cavity during processing. However, filling imbalances have been observed though geometrically balanced runner lay-out. Generally, these filling imbalances are due to thermal unbalance, viscosity, characteristic of polymers and so on. These kinds of filling imbalances have already been reported by Beaumont since 1997, but his research has mainly focused on filling imbalance at binary runner. In this study, we conducted an experimental study about the filling imbalances in unary branch runner as well as binary branch runner and inquired into the causes of filling imbalances. The results could be summarized as fellowing: Filling imbalances existed in multi-cavity mold with unary branch runner, it could be decreased by optimizing processing condition such as increasing injection rate, and it is almost proportion to each polymer's temperature sensibility.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.1426-1428
• /
• 2011

컴퓨터에서 사용하는 데이터의 기본 단위는 2진수 형식으로 표현되는 이진(binary) 데이터이며 이는 CPU 연산에서부터 이기종간 네트워크 통신에 이르기까지 폭넓은 영역에서 사용되고 있다. 이진데이터를 처리하는 소프트웨어를 개발하기 위하여 다양한 원시타입(Primitive Type)을 사용하는 프로그래밍 언어가 사용되는데, 일반적으로 이러한 프로그래밍 언어를 통한 개발은 소스코드에 구조체, 공용체 및 클래스로 이진 데이터를 정적으로 정의함으로써 추후 데이터 변경에 대한 유연성이 떨어지는 문제가 존재한다. XML 기반의 객체 모델은 프로그래밍 언어에서 사용되는 모든 타입 및 이진 데이터 구성 형식을 제공하고 이를 통해 이진 데이터를 동적으로 관리함으로써 이러한 유연성의 문제를 해결하고 있으며 실제 이진 데이터를 사용하는 분야에 적용할 수 있다.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 1996.06c
• /
• pp.842-851
• /
• 1996

Median filter(MF) has often been applied to color or gray images as a noise fiilter in image processing . Application of MF to binary images was tried in this study. For binary images, MF not only can remove noise but can also work as an indicator showing the dominant color in a region which is called window . Fro example, MF can be used to categorize clusters and to detect interested parts of an object. In other words, MF can also be used to remove unnecessary parts. The function of MF can be intensified by introducing a thresholding value, which is determined by the size of the interested part of an object. This improved MF for binary images is called the modified median filter(MMF), and its applicability to grade produce will be discussed in this paper.

• The Journal of Korean Association of Computer Education
• /
• v.5 no.4
• /
• pp.43-52
• /
• 2002

A theory of binary wavelets which are performed over binary field has been recently proposed. Binary wavelet transform (BWT) of binary images can be used as an alternative to the real-valued wavelet transform of binary images in image processing applications such as compression, edge detection, and recognition. The BWT, however, requires large amount of computations for binary wavelet reconstruction since its operation is accomplished by matrix multiplication. In this paper, an efficient binary wavelet reconstruction method which utilizes filtering operation instead of matrix multiplication is presented. Experimental results show that the proposed algorithm can significantly reduce the computational complexity of the BWT. For the reconstruction of an $N{\times}N$ image, the proposed technique requires only $2MN^2$ multiplications and $2N(M-1)^2$ additions when the filter length M, while the BWT needs $2N^3$ multiplications and $2N(N-1)^2$ additions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.3
• /
• pp.127-139
• /
• 2014

In this paper, we present two signal processing techniques for designing binary error correction codes for Multi-Level Cell(MLC) NAND flash memory. MLC NAND flash memory saves the non-binary symbol at each cell and shows asymmetric channel LLR l-density which makes it difficult to design soft-decision binary error correction codes such as LDPC codes and Polar codes. Therefore, we apply density mirroring and EM algorithm for approximating the MLC NAND flash memory channel to the binary-input memoryless channel. The density mirroring processes channel LLRs to satisfy roughly all-zero codeword assumption, and then EM algorithm is applied to l-density after density mirroring for approximating it to mixture of symmetric Gaussian densities. These two signal processing techniques make it possible to use conventional code design algorithms, such as density evolution and EXIT chart, for MLC NAND flash memory channel.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.3
• /
• pp.11-25
• /
• 2012

We present the method to infer Context-Free Grammars by applying genetic algorithm to the Binary Third-order Recurrent Neural Networks(BTRNN). BTRNN is a multiple-layered architecture of recurrent neural networks, each of which is corresponding to an input symbol, and is combined with external stack. All parameters of BTRNN are represented as binary numbers and each state transition is performed with any stack operation simultaneously. We apply Genetic Algorithm to BTRNN chromosomes and obtain the optimal BTRNN inferring context-free grammar of positive and negative input patterns. This proposed method infers BTRNN, which includes the number of its states equal to or less than those of existing methods of Discrete Recurrent Neural Networks, with less examples and less learning trials. Also BTRNN is superior to the recent method of chromosomes representing grammars at recognition time complexity because of performing deterministic state transitions and stack operations at parsing process. If the number of non-terminals is p, the number of terminals q, the length of an input string k, and the max number of BTRNN states m, the parallel processing time is O(k) and the sequential processing time is O(km).

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1990.10a
• /
• pp.267-270
• /
• 1990

• Journal of Sensor Science and Technology
• /
• v.23 no.5
• /
• pp.332-336
• /
• 2014

In this paper, we propose a complementary metal oxide semiconductor (CMOS) binary image sensor with a gate/body-tied (GBT) PMOSFET-type photodetector for high-speed operation. The GBT photodetector of an active pixel sensor (APS) consists of a floating gate ($n^+$-polysilicon) tied to the body (n-well) of the PMOSFET. The p-n junction photodiode that is used in a conventional APS has a good dynamic range but low photosensitivity. On the other hand, a high-gain GBT photodetector has a high level of photosensitivity but a narrow dynamic range. In addition, the pixel size of the GBT photodetector APS is less than that of the conventional photodiode APS because of its use of a PMOSFET-type photodetector, enabling increased image resolution. A CMOS binary image sensor can be designed with simple circuits, as a complex analog to digital converter (ADC) is not required for binary processing. Because of this feature, the binary image sensor has low power consumption and high speed, with the ability to switch back and forth between a binary mode and an analog mode. The proposed CMOS binary image sensor was simulated and designed using a standard CMOS $0.18{\mu}m$ process.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.4
• /
• pp.229-236
• /
• 2017

This paper presents an efficient object-based color image-retrieval algorithm that is suitable for the classification and retrieval of images from small to mid-scale datasets, such as images in PCs, tablets, phones, and cameras. The proposed method first finds salient regions by using regional feature vectors, and also finds several dominant colors in each region. Then, each salient region is partitioned into small sub-blocks, which are assigned 1 or 0 with respect to the number of pixels corresponding to a dominant color in the sub-block. This gives a binary map for the dominant color, and this process is repeated for the predefined number of dominant colors. Finally, we have several binary maps, each of which corresponds to a dominant color in a salient region. Hence, the binary maps represent the spatial distribution of the dominant colors in the salient region, and the union (OR operation) of the maps can describe the approximate shapes of salient objects. Also proposed in this paper is a matching method that uses these binary maps and which needs very few computations, because most operations are binary. Experiments on widely used color image databases show that the proposed method performs better than state-of-the-art and previous color-based methods.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.08a
• /
• pp.353-356
• /
• 2000

This paper proposes a 16-bit $\times$ 16-bit multiplier for 2 twos-complement binary numbers with complex structure and implements it on a FPGA.