• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(2)
• /
• pp.124-127
• /
• 2000

With increasing design complexity, shrinking time-to-market window, and various demands from markets, the traditional design methodologies reach-ed a ceiling. In a search for a way to tackle these problems, novel concepts and methodologies have been proposed in the past years. The paper briefly presents the design issues, and concepts, introduces commercial tools, and finally proposes a conceptual methodology that addresses the issues.

• 천문학회보
• /
• 제35권2호
• /
• pp.36.1-36.1
• /
• 2010

The Redshift Search Receiver (RSR) is a sensitive, ultra-wideband spectrometer that is being built at the University of Massachusetts as one of the facility instruments for the 50-m Large Millimeter Telescope (LMT). It consists of four receivers each covering the entire 3 mm window from 74 to 111 GHz instantaneously. The primary goal of the receiver is to detect multiple molecular lines in galaxies at any distance and uniquely determine the redshift, in particular dust-obscured star forming systems at high-z which are not easily accessible. I will present some results from commissioning of the RSR on the Five College Radio Astronomy Observatory 14-m telescope, and discuss the future of the receiver.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.99-102
• /
• 2009

In this paper a hierarchical stereo matching algorithm based on feature extraction is proposed. The boundary (edge) as feature point in an image is first obtained by segmenting an image into red, green, blue and white regions. With the obtained boundary information, disparities are extracted by matching window on the image boundary, and the initial disparity map is generated when assigned the same disparity to neighbor pixels. The final disparity map is created with the initial disparity. The regions with the same initial disparity are classified into the regions with the same color and we search the disparity again in each region with the same color by changing block size and search range. The experiment results are evaluated on the Middlebury data set and it show that the proposed algorithm performed better than a phase based algorithm in the sense that only about 14% of the disparities for the entire image are inaccurate in the final disparity map. Furthermore, it was verified that the boundary of each region with the same disparity was clearly distinguished.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권2호
• /
• pp.825-836
• /
• 2016

In this paper, a speed-up technique for the non-local means (NLM) image denoising method based on local binary descriptor (LBD) is proposed. In the NLM, most of the computation time is spent on searching for non-local similar patches in the search window. The local binary descriptor which represents the structure of patch as binary strings is employed to speed up the search process in the NLM. The descriptor allows for a fast and accurate preselection of non-local similar patches by bitwise operations. Using this approach, a tradeoff between time-saving and noise removal can be obtained. Simulations exhibit that despite being principally constructed for speed, the proposed algorithm outperforms in terms of denoising quality as well. Furthermore, a parallel implementation on GPU brings NLM-LBD to real-time image denoising.

• 전자공학회논문지B
• /
• 제30B권11호
• /
• pp.84-92
• /
• 1993

Calibration of Engine models is a painstaking process but very important for successful application to automotive industry problems. A combined heuristic and machine learning approach has therefore been adopted to improve the efficiency of model calibration. We developed an intelligent calibration program called ICALIB. It has been used on a daily basis for engine model applications, and has reduced the time required for model calibrations from many hours to a few minutes on average. In this paper, we describe the heuristic control strategies employed in ICALIB such as a hill-climbing search based on a state distance estimation function, incremental problem solution refinement by using a dynamic tolerance window, and calibration target parameter ordering for guiding the search. In addition, we present the application of amachine learning program called GID3*for automatic acquisition of heuristic rules for ordering target parameters.

• 대한산업공학회지
• /
• 제37권3호
• /
• pp.171-179
• /
• 2011

In this paper, we deal with the vehicle routing problem that could establish operational plan of military engineer for survivability support of artillery position construction. We propose VRPTW(vehicle routing problem with time-window) model of special form that considered service level to reflect the characteristics of military operations rather than the logic of economic efficiencies in the objective function. Furthermore we suggest modified particle swarm optimization algorithm for service based vehicle routing problem solution that can be possible to search in complicated and uncertain area and control relation softly between global and local search.

• Journal of information and communication convergence engineering
• /
• 제21권1호
• /
• pp.62-67
• /
• 2023

This paper proposes an imputation method using a bidirectional k-nearest components search based local linear regression method. The bidirectional k-nearest-components search method selects components in the dynamic range from the missing points. Unlike the existing methods, which use a fixed-size window, the proposed method can flexibly select adjacent components in an imputation problem. The weight values assigned to the components around the missing points are calculated using local linear regression. The local linear regression method is free from the rank problem in a matrix of dependent variables. In addition, it can calculate the weight values that reflect the data flow in a specific environment, such as a blackout. The original missing values were estimated from a linear combination of the components and their weights. Finally, the estimated value imputes the missing values. In the experimental results, the proposed method outperformed the existing methods when the error between the original data and imputation data was measured using MAE and RMSE.

• 한국측량학회지
• /
• 제25권6_2호
• /
• pp.587-597
• /
• 2007

본 연구는 IKONOS Geo레벨 스테레오 영상으로부터 DEM을 제작하기 위한 토지피복 특성별 정합영역 크기를 결정하고자 한다. 사용된 매칭기법은 상관계수를 이용한 영역기반정합 기법을 적용하였고, 탐색영역을 최소화하기 위해 외부표정요소를 구한 후, 이로부터 정합선을 수립하여 정합하였다. 실험은 산림, 논 밭, 수계, 도심지의 4가지 토지피복 특성별로 수행되어졌으며, 토지피복별 평균 상관계수, 칼럼 라인의 시차영상을 분석한 후, 실험 영상에서 최적의 정합영역 크기를 선정하였다. 실험결과, 산림지역은 $119{\times}119$화소, 논 밭 지역은 $51{\times}51$화소, 물 지역은 $81{\times}81$화소, 도심지는 $21{\times}21$화소가 DEM 제작을 위한 가장 적절한 정합영역 크기로 선정되었다.

• 한국기계가공학회지
• /
• 제8권4호
• /
• pp.110-121
• /
• 2009

It is essential to embed product quality in the design process to win the global competition. Many components found in many products including automobiles and electronic devices are fabricated using sheet metal forming processes. Wrinkle and fracture are two types of defects frequently found in the sheet metal forming process. Reducing such defects is a hard problem as they are affected by many uncontrollable factors. Attempts to solve the problem based on traditional deterministic optimization theories are often led to failures. Furthermore, the wrinkle and fracture are conflicting defects in such a way that reducing one defect leads to increasing the other. Hence, it is a difficult task to reduce both of them at the same time. In this research, a new design method for reducing the rates of conflicting defects under uncontrollable factors is presented by using operating window and a sequential search procedure. A new SN ratio is proposed to overcome the problems of a traditional SN ratio used in the operating window technique. The method is applied to optimizing the robust design of a sheet metal forming process. To show the effectiveness of the proposed method, a comparison is made between the traditional and the proposed methods using simulation software, applied to a design of particular sheet metal forming process problem. The results show that the proposed method always gives a more robust design that is less sensitive to noises than the traditional method.

• 한국정보과학회논문지:데이타베이스
• /
• 제33권2호
• /
• pp.224-238
• /
• 2006

XML이 인터넷 상에서 데이타 교환의 표준으로 자리매김하면서 스트리밍 환경의 XML 데이타에 대한 효과적인 조인 질의 처리도 증가하고 있다. 튜플 단위로 처리하는 기존의 데이타베이스 기법을 스트리밍 XML 데이타에 적용했을 때 제한된 메모리 사용에 따른 메모리 한계를 초과하는 문제가 발생한다. 또한 구조적인 특징을 가지는 XML 데이타에 대한 질의 경로 탐색 및 특정 부분 데이타에 대한 접근에 소모되는 처리 비용이 급격히 증가하는 문제가 발생하게 된다. 근본적으로 전체 데이타가 아닌 부분 데이타를 저장하고 질의 처리해야 하는 스트리밍 환경에 적용하기에는 부적절하다. 따라서 스트리밍 XML 데이타에 맞는 저장 기법으로 적은 메모리의 사용을 통해 빠르게 조인 프레디킷을 만족하는 부분 스트리밍 데이타를 검색할 수 있는 새로운 기법이 요구된다. 본 논문에서는 적은 메모리 사용을 위한 저장 기법을 위해 PCDATA와 CDATA에 해당되는 부분만을 추출하여 저장한다. 그리고 빠른 조인 프레디킷(Predicate) 비교를 위해 DTD의 구조정보 중 지시자(Cardinality) "*" 와 "+"를 기초하여 영역 윈도우(Range Window)를 설정하여 질의에 만족하는 윈도우만을 선택적으로 조인하는 기법을 제안하여 문제를 해결한다.