• Title/Summary/Keyword: Automatic Multi-Focus

Search Result 12, Processing Time 0.027 seconds

A Study on an Automatic Multi-Focus System for Cell Observation

  • Park, Jaeyoung;Lee, Sangjoon
    • Journal of Information Processing Systems
    • /
    • v.15 no.1
    • /
    • pp.47-54
    • /
    • 2019
  • This study is concerned with the mechanism and structure of an optical microscope and an automatic multi-focus algorithm for automatically selecting sharp images from multiple foci of a cell. To obtain precise cell images quickly, a z-axis actuator with a resolution of $0.1{\mu}m$ was designed to control an optical microscope Moreover, a lighting control system was constructed to select the color and brightness of light that best suit the object being viewed. Cell images are captured by the instrument and the sharpness of each image is determined using Gaussian and Laplacian filters. Next, cubic spline interpolation and peak detection algorithms are applied to automatically find the most vivid points among multiple images of a single object. A cancer cell imaging experiment using propidium iodide staining confirmed that a sharp multipoint image can be obtained using this microscope. The proposed system is expected to save time and effort required to extract suitable cell images and increase the convenience of cell analysis.

A Novel Automatic Block-based Multi-focus Image Fusion via Genetic Algorithm

  • Yang, Yong;Zheng, Wenjuan;Huang, Shuying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.7
    • /
    • pp.1671-1689
    • /
    • 2013
  • The key issue of block-based multi-focus image fusion is to determine the size of the sub-block because different sizes of the sub-block will lead to different fusion effects. To solve this problem, this paper presents a novel genetic algorithm (GA) based multi-focus image fusion method, in which the block size can be automatically found. In our method, the Sum-modified-Laplacian (SML) is selected as an evaluation criterion to measure the clarity of the image sub-block, and the edge information retention is employed to calculate the fitness of each individual. Then, through the selection, crossover and mutation procedures of the GA, we can obtain the optimal solution for the sub-block, which is finally used to fuse the images. Experimental results show that the proposed method outperforms the traditional methods, including the average, gradient pyramid, discrete wavelet transform (DWT), shift invariant DWT (SIDWT) and two existing GA-based methods in terms of both the visual subjective evaluation and the objective evaluation.

Automatic Focus Control for Assembly Alignment in a Lens Module Process (렌즈 모듈 생산 공정에서 조립 정렬을 위한 자동 초점 제어)

  • Kim, Hyung-Tae;Kang, Sung-Bok;Kang, Heui-Seok;Cho, Young-Joon;Park, Nam-Gue;Kim, Jin-Oh
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.27 no.2
    • /
    • pp.70-77
    • /
    • 2010
  • This study proposed an auto focusing method for a multi-focus image in assembling lens modules in digital camera phones. A camera module in a camera phone is composed of a lens barrel, an IR glass, a lens mount, a PCB board and aspheric lenses. Alignment among the components is one of the important factors in product quality. Auto-focus is essential to adjust image quality of an IR glass in a lens holder, but there are two focal points in the captured image due to thickness of IR glass. So, sharpness, probability and a scale factor are defined to find desired focus from a multi-focus image. The sharpness is defined as clarity of an image. Probability and a scale factors are calculated using pattern matching with a registered image. The presented algorithm was applied to a lens assembly machine which has 5 axes, two vacuum chucks and an inspection system. The desired focus can be determined on the local maximum of the sharpness, the probability and the scale factor in the experiment.

Design Classification and Development of Pattern Searching Algorithm Based on Pattern Design Elements - With focus on Automatic Pattern Design System for Baseball Uniforms Manufactured under Custom-MTM System - (패턴설계요소기반의 디자인 분류 및 패턴탐색 알고리즘개발 - 맞춤양산형 야구복 자동패턴 설계시스템을 위한 -)

  • Kang, In-Ae;Choi, Kueng-Mi;Jun, Jung-Ill
    • Fashion & Textile Research Journal
    • /
    • v.13 no.5
    • /
    • pp.734-742
    • /
    • 2011
  • This study has been undertaken as a basic research for automatic pattern design for baseball uniforms manufactured under custom-MTM system, propose building up of a system whereby various partial patterns are combined under an automatic design system and develop a multi-combination type pattern searching algorithm which allows development of a various designs. As a result of this, type classification based on pattern design elements includes side, open, collar, facing and panel type. Design have been divided into coarse classification ranging from level 1 to 7 according to pattern design elements, based on a design distribution chart. Out of 7 such levels, 3 major types determining design which are, more specifically, level 1 sleeve type, level 2 open type and level 3 collar type, have been taken and combined to determine a total of 12 types to be used for design classification codes. Respective name of style and patterns have been coded using alphabet and numerals. Totally, pattern searching algorithm of multi-combination type has been developed whereby combination of patterns belonging to a specific style can be retrieved automatically once that style name is designated on the automatic pattern design system.

Parallel Implementations of Digital Focus Indices Based on Minimax Search Using Multi-Core Processors

  • HyungTae, Kim;Duk-Yeon, Lee;Dongwoon, Choi;Jaehyeon, Kang;Dong-Wook, Lee
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.2
    • /
    • pp.542-558
    • /
    • 2023
  • A digital focus index (DFI) is a value used to determine image focus in scientific apparatus and smart devices. Automatic focus (AF) is an iterative and time-consuming procedure; however, its processing time can be reduced using a general processing unit (GPU) and a multi-core processor (MCP). In this study, parallel architectures of a minimax search algorithm (MSA) are applied to two DFIs: range algorithm (RA) and image contrast (CT). The DFIs are based on a histogram; however, the parallel computation of the histogram is conventionally inefficient because of the bank conflict in shared memory. The parallel architectures of RA and CT are constructed using parallel reduction for MSA, which is performed through parallel relative rating of the image pixel pairs and halved the rating in every step. The array size is then decreased to one, and the minimax is determined at the final reduction. Kernels for the architectures are constructed using open source software to make it relatively platform independent. The kernels are tested in a hexa-core PC and an embedded device using Lenna images of various sizes based on the resolutions of industrial cameras. The performance of the kernels for the DFIs was investigated in terms of processing speed and computational acceleration; the maximum acceleration was 32.6× in the best case and the MCP exhibited a higher performance.

Automatic Thresholding Selection for Image Segmentation Based on Genetic Algorithm (유전자알고리즘을 이용한 영상분할 문턱값의 자동선정에 관한 연구)

  • Lee, Byung-Ryong;Truong, Quoc Bao;Pham, Van Huy;Kim, Hyoung-Seok
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.6
    • /
    • pp.587-595
    • /
    • 2011
  • In this paper, we focus on the issue of automatic selection for multi-level threshold, and we greatly improve the efficiency of Otsu's method for image segmentation based on genetic algorithm. We have investigated and evaluated the performance of the Otsu and Valley-emphasis threshold methods. Based on this observation we propose a method for automatic threshold method that segments an image into more than two regions with high performance and processing in real-time. Our paper introduced new peak detection, combines with evolution algorithm using MAGA (Modified Adaptive Genetic Algorithm) and HCA (Hill Climbing Algorithm), to find the best threshold automatically, accurately, and quickly. The experimental results show that the proposed evolutionary algorithm achieves a satisfactory segmentation effect and that the processing time can be greatly reduced when the number of thresholds increases.

Neural and MTS Algorithms for Feature Selection

  • Su, Chao-Ton;Li, Te-Sheng
    • International Journal of Quality Innovation
    • /
    • v.3 no.2
    • /
    • pp.113-131
    • /
    • 2002
  • The relationships among multi-dimensional data (such as medical examination data) with ambiguity and variation are difficult to explore. The traditional approach to building a data classification system requires the formulation of rules by which the input data can be analyzed. The formulation of such rules is very difficult with large sets of input data. This paper first describes two classification approaches using back-propagation (BP) neural network and Mahalanobis distance (MD) classifier, and then proposes two classification approaches for multi-dimensional feature selection. The first one proposed is a feature selection procedure from the trained back-propagation (BP) neural network. The basic idea of this procedure is to compare the multiplication weights between input and hidden layer and hidden and output layer. In order to simplify the structure, only the multiplication weights of large absolute values are used. The second approach is Mahalanobis-Taguchi system (MTS) originally suggested by Dr. Taguchi. The MTS performs Taguchi's fractional factorial design based on the Mahalanobis distance as a performance metric. We combine the automatic thresholding with MD: it can deal with a reduced model, which is the focus of this paper In this work, two case studies will be used as examples to compare and discuss the complete and reduced models employing BP neural network and MD classifier. The implementation results show that proposed approaches are effective and powerful for the classification.

Introducing the Latest 3GPP Specifications and their Potential for Future AMI Applications

  • Koumadi, Koudjo M.;Park, Byong-seok;Myoung, Nogil
    • KEPCO Journal on Electric Power and Energy
    • /
    • v.2 no.2
    • /
    • pp.245-251
    • /
    • 2016
  • Despite the exponential throughput improvement in mobile communications systems, their ability to satisfy requirements of state-of-the-art and future applications of advanced metering infrastructure (AMI) is still under investigation. Challenges are mainly due to the inadequacy of third generation partnership project (3GPP) networks to support large amounts of devices simultaneously, while the number of AMI end-devices and the frequency of their data transmission increase with new AMI-based applications. In this introductory survey, innovative and future AMI applications and their communication requirements are first reviewed. Then, we identify challenges of 3GPP long term evolution (LTE) in enabling future AMI applications. More importantly, the latest improvements to LTE-A standard release 12 and 13 are reviewed and analyzed with regards to their potential to improve the quality of LTE-enabled AMI. It is found that 3GPP enhancements on machine type communications (MTC) standards will significantly enhance AMI communications. Beyond MTC specifications, non-MTC-specific enhancements such as carrier aggregation and multi-connectivity for user equipment will also contribute greatly to improving reliability and availability of AMI devices. The paper's focus is towards improved backhaul support for innovative and future AMI applications, beyond traditional automatic meter reading.

A Study of IndoorGML Automatic Generation using IFC - Focus on Primal Space - (IFC를 이용한 IndoorGML 데이터 자동 생성에 관한 연구 - Primal Space를 중심으로 -)

  • Nam, Sang Kwan;Jang, Hanme;Kang, Hye Young;Choi, Hyun Sang;Lee, Ji Yeong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.38 no.6
    • /
    • pp.623-633
    • /
    • 2020
  • As the time spent in indoor space has increased, the demand for services targeting indoor spaces also continues to increase. To provide indoor spatial information services, the construction of indoor spatial information should be done first. In the study, a method of generation IndoorGML, which is the international standard data format for Indoor space, from existing BIM data. The characteristics of IFC objects were investigated, and objects that need to be converted to IndoorGML were selected and classified into objects that restrict the expression of Indoor space and internal passages. Using the proposed method, a part of data set provided by the BIMserver github and the IFC model of the 21st Century Building in University of Seoul were used to perform experiments to generate PrimalSpaceFeatures of IndoorGML. As a result of the experiments, the geometric information of IFC objects was represented completely as IndoorGML, and it was shown that NavigableBoundary, one of major features of PrimalSpaceFeatures in IndoorGML, was accurately generated. In the future, the proposed method will improve to generate various types of objects such as IfcStair, and additional method for automatically generating MultiLayeredGraph of IndoorGML using PrimalSpaceFeatures should be developed to be sure of completeness of IndoorGML.

A Study on the Draft and Issues for the Revision of UNCITRAL Arbitration Rules (UNCITRAL 중재규칙 개정안의 내용과 쟁점에 관한 연구)

  • Lee, Kang-Bin
    • Journal of Arbitration Studies
    • /
    • v.17 no.2
    • /
    • pp.43-70
    • /
    • 2007
  • The purpose of this paper is to make research on the contents and discussions of the draft of revised UNCITRAL Arbitration Rules that have been discussed and considered by the Working Group. At its thirty-ninth session (New York, 19 June-7 July 2006), the Commission agreed that, in respect of future work of the Working Group, priority be given to a revision of the UNCITRAL Arbitration Rules (1976). At its forty-fifth session (Vienna, 11-15 September 2006), the Working Group undertook to identify areas where a revision of the UNCITRAL Arbitration Rules might be useful. At that session, it was considered that the focus of the revision should be on updating the Rules to meet changes that had taken place over the last thirty years in arbitral practice. The largely amended provisions of the draft of revised UNCITRAL Arbitration Rules are as follows : Notice of arbitration and response to the notice of arbitration (Article 3), Designating and appointing authorities (Article 4 bis), November of arbitrators (Article 5), Appointment of arbitrations (Article 6), Appointment of arbitrators in multi-party arbitration (Article 7 bis), Challenge of arbitrators (Article 9), Replacement of an arbitrator (Article 13), Pleas as to the jurisdiction of the arbitral tribunal (Article 21), Interim measures (Article 26), Form and effect of the award (Article 32), and Liability of arbitrators (Proposed additional provisions). There are some differences between the draft of revised UNCITRAL Arbitration Rules and the KCAB Arbitration Rules. In order to jnternationalize the Korea's commercial arbitration system, it is desirable that the main articles of the draft of revised UNCITRAL Arbitration Rules should be admitted to the KCAB Arbitration Rules. In conclusion, the Commission was generally of the view of any revision of the UNCITRAL Arbitration Rules should not alter the structure of the text, its spirit, its drafting style, and should respect the flexibility of the text rather than make it more complex. The Working Group agreed that harmonizing the provisions of the UNCITRAL Model Law should not be automatic but rather considered only where appropriate.

  • PDF