• 제목/요약/키워드: simple processing

검색결과 2,246건 처리시간 0.029초

Simple Application Cases of Morphing Method using Geo-spatial Data

  • Lee, Ki-Won;Park, Yong-Jae
    • 대한원격탐사학회지
    • /
    • 제24권3호
    • /
    • pp.251-256
    • /
    • 2008
  • Morphing method, one of classic image processing algorithms, has been used in various application fields. The motivation of this work is to investigate its applicability in consideration to geo-spatial data including airborne or space-borne images. For this purpose, the Beier and Neely morphing algorithm is tentatively implemented in the form of a prototype with user interface. As the results, this feature-based morphing with paired image sets can be used for general users: image simulation using two or more images and construction of color-blending image between source image and destination image in different types. Some simple application cases were demonstrated. This scheme is the simple and useful approach for those who want to utilize both geo-spatial data sets and airborne/space-borne image sets.

확산음향장에서의 음원 지향성 간이추정: 수치시뮬레이션 (Simple Estimation of Sound Source Directivity in Diffused Acoustic Field: Numerical Simulation)

  • 김국현
    • 한국해양공학회지
    • /
    • 제33권5호
    • /
    • pp.421-426
    • /
    • 2019
  • The directivity of an underwater sound source should be measured in an acoustically open field such as a calm sea or lake, or an anechoic water tank facility. However, technical difficulties arise when practically implementing this in open fields. Signal processing-based techniques such as a sound intensity method and near-field acoustic holography have been adopted to overcome the problem, but these are inefficient in terms of acquisition and maintenance costs. This study established a simple directivity estimation technique with data acquisition, filtering, and analysis tools. A numerical simulation based on an acoustic radiosity method showed that the technique is practicable for sound source directivity estimation in a diffused reverberant acoustic field like a reverberant water tank.

아웃페인팅 기반 반려동물 자세 추정에 관한 예비 연구 (A Pilot Study on Outpainting-powered Pet Pose Estimation)

  • 이규빈;이영찬;유원상
    • 융합신호처리학회논문지
    • /
    • 제24권1호
    • /
    • pp.69-75
    • /
    • 2023
  • 최근 동물 행동 분석 및 건강관리 분야를 중심으로 딥러닝 기반 동물 자세 추정 기법에 대한 관심이 높아지고 있다. 그러나 기존 동물 자세 추정 기법은 영상에서 신체 부위가 가려지거나 존재하지 않을 경우 좋은 성능을 보이지 않는다. 특히 꼬리나 귀가 가려진 경우, 반려견의 행동 및 감정 분석의 성능에도 심각한 영향을 미친다. 본 논문에서는 이러한 다루기 힘든 문제를 해결하기 위해, 이미지 아웃페인팅 네트워크를 자세 추정 네트워크에 연결하여 이미지 외부에 존재하는 반려견의 신체를 복원한 확장된 이미지를 생성하여 반려견의 자세를 추정하는 단순하면서도 새로운 접근방법을 제안하였고, 제안된 방법의 실현가능성을 검토하는 예비 연구를 수행하였다. 이미지 아웃페인팅 모델로는 CE-GAN과 트랜스포머 기반의 BAT-Fill을 사용하였고, 자세 추정 모델로는 SimpleBaseline을 사용하였다. 실험 결과, 크롭된 입력 이미지에서 반려견의 자세를 추정하였을 때보다, BAT-Fill을 사용하여 아웃페인팅된 확장 이미지에서 반려견의 자세를 추정하였을 때 자세 추정의 성능이 향상되었다.

개선된 혼성영역 교차상관법에 의한 G.723.1의 피치검색시간 단축에 관한 연구 (A Study on the Pitch Search Time Reduction of G.723.1 Vocoder by Improved Hybrid Domain Cross-correlation)

  • 조왕래;최성영;배명진
    • 전기학회논문지
    • /
    • 제59권12호
    • /
    • pp.2324-2328
    • /
    • 2010
  • In this paper we proposed a new algorithm that can reduce the open-loop pitch estimation time of G.723.1. The time domain cross-correlation method is simple but has long processing time by recursive multiplication. For reduction of processing time, we use the method that compute the cross-correlation by multiplying the Fourier value of speech by it's complex conjugate. Also, we can reduce the processing time by omitting the bit-reversing of FFT and IFFT for time-frequency domain transform. As a result, the processing time of improved hybrid domain cross-correlation algorithm is reduced by 67.37% of conventional time domain cross-correlation.

AMDF를 이용한 Digital Sonar 의 반사신호처리에 관한 연구 (On the reflected signal processing of Digital Sonar using the AMDF)

  • 홍우영
    • 한국음향학회:학술대회논문집
    • /
    • 한국음향학회 1984년도 추계학술발표회 논문집
    • /
    • pp.91-95
    • /
    • 1984
  • Because of layer and scattering in the ocean, there are some problem in algorithm currently used for the recognition of targets. Those are time delay of processing and circuit design. The simple method of detecting direct sound wave in noise caused by time delay is proposed-recognized, estimated, and then direcxt sound wave is reconstructed by the AMDF and $\mu$-processor. 2KHz, 4KHz, 8KHz, 12KHz, 16KHz sound waves are used in experiment. To obtain a reference signal, anechoic water tank is used is processing and aluminium water tank used instead of real ocean. As a result, there are a few errors which caused by anechoic water tank error, decreasing of frequency make errors. Possibility of application to Sonar Signal Processing is proved.

  • PDF

공정 교체 시간을 고려한 배치작업의 일정계획 (Batch Scheduling of Incompatible Job Families with Sequence Independent Setup Times)

  • 김주일;이영훈
    • 한국경영과학회지
    • /
    • 제26권2호
    • /
    • pp.69-83
    • /
    • 2001
  • The problem of minimizing total tardiness on a batch processing machine with incompatible job families when there are sequence independent setup times between families is studied where all jobs of the same family have identical processing times and jobs of different families cannot be processed together. A batch processing machine can process a number of jobs, within a maximal batch size, simultaneously as a batch. The processing time required of each batch is equal to the one of jobs. A dynamic programming algorithm which gives the optimal solution, and several heuristics are presented. Performance of simple dispatching rules based on due dates are compared, and the best of them is used as an initial solution for the decomposition algorithm, which is shown to give good schedules in relatively short computational time.

  • PDF

라플라시안 피라미드 프로세싱과 백터 양자화 방법을 이용한 영상 데이타 압축 (Image Data Compression Using Laplacian Pyramid Processing and Vector Quantization)

  • 박광훈;차일환;윤대희
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
    • /
    • pp.1347-1351
    • /
    • 1987
  • This thesis aims at studying laplacian pyramid vector quantization which keeps a simple compression algorithm and stability against various kinds of image data. To this end, images are devied into two groups according to their statistical characteristics. At 0.860 bits/pixel and 0.360 bits/pixel respectively, laplacian pyramid vector quantization is compared to the existing spatial domain vector quantization and transform coding under the same condition in both objective and subjective value. The laplacian pyramid vector quantization is much more stable against the statistical characteristics of images than the existing vector quantization and transform coding.

  • PDF

전자부품 조립공정의 자동화를 \ulcorner나 실시간 영상처리 알고리즘에 관한 연구 (A Real-Time Image Processing Algorithms for An Automatic Assembly System of Electronic Components)

  • 유범재;오영석;오상록
    • 대한전기학회논문지
    • /
    • 제37권11호
    • /
    • pp.804-815
    • /
    • 1988
  • Real-time image processing algorithms to detect position and orientation of rectangular type electronic components are developed. The position detection algorithm is implemented with the use of projection method which is insensitive to noise. Also dynamic thresholding method of projection is employed in order to distinguish between the boundary of a component and any marking on the component. The orientation is determined by Hough transform of boundary candidates of a component, which is obtained a priori by a simple edge detection method. For real-time processing of both position and orientation for a component which is not aligned well, parallel processing method of image data is proposed and tested in real-time.

  • PDF

Special Cases on Two Machine Flow Shop Scheduling with Weighted WIP Costs

  • Yang, Jae-Hwan
    • Management Science and Financial Engineering
    • /
    • 제15권2호
    • /
    • pp.69-100
    • /
    • 2009
  • In this paper, we consider a relatively new two-machine flow shop scheduling problem where the unit time WIP cost increases as a job passes through various stages in the production process, and the objective is to minimize the total WIP (work-in-process) cost. Specifically, we study three special cases of the problem. First, we consider the problem where processing times on machine 1 are identical. Second, the problem with identical processing times on machine 2 is examined. The recognition version of the both problems is unary NP-complete (or NP-complete in strong sense). For each problem, we suggest two simple and intuitive heuristics and find the worst case bound on relative error. Third, we consider the problem where the processing time of a job on each machine is proportional to a base processing time. For this problem, we show that a known heuristic finds an optimal schedule.

빅데이터 분석을 위한 비용효과적 오픈 소스 시스템 설계 (Designing Cost Effective Open Source System for Bigdata Analysis)

  • 이종화;이현규
    • 지식경영연구
    • /
    • 제19권1호
    • /
    • pp.119-132
    • /
    • 2018
  • Many advanced products and services are emerging in the market thanks to data-based technologies such as Internet (IoT), Big Data, and AI. The construction of a system for data processing under the IoT network environment is not simple in configuration, and has a lot of restrictions due to a high cost for constructing a high performance server environment. Therefore, in this paper, we will design a development environment for large data analysis computing platform using open source with low cost and practicality. Therefore, this study intends to implement a big data processing system using Raspberry Pi, an ultra-small PC environment, and open source API. This big data processing system includes building a portable server system, building a web server for web mining, developing Python IDE classes for crawling, and developing R Libraries for NLP and visualization. Through this research, we will develop a web environment that can control real-time data collection and analysis of web media in a mobile environment and present it as a curriculum for non-IT specialists.