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

This paper addresses the factorization method to estimate the projective structure of a scene from feature (points) correspondences over images with occlusions. We propose both a column and a row space approaches to estimate the depth parameter using the subspace constraints. The projective depth parameters are estimated by maximizing projection onto the subspace based either on the Joint Projection matrix (JPM) or on the the Joint Structure matrix (JSM). We perform the maximization over significant observation and employ Tardif's Camera Basis Constraints (CBC) method for the matrix factorization, thus the missing data problem can be overcome. The depth estimation and the matrix factorization alternate until convergence is reached. Result of Experiments on both real and synthetic image sequences has confirmed the effectiveness of our proposed method.

• 경영과학
• /
• 제24권1호
• /
• pp.91-111
• /
• 2007

In this paper an effective two-phase approach adopting modified p-median mathematical model is proposed for grouping machines and parts in cellular manufacturing(CM). Unlike the conventional methods allowing machines and parts to be improperly assigned to cells and families, the proposed approach seeks to find the proper block diagonal solution where all the machines and parts are properly assigned to their most associated cells and families in term of the actual machine processing and part moves. Phase 1 uses the modified p-median formulation adopting new inter-machine similarity coefficient based on the non-binary production data-based part-machine incidence matrix(PMIM) that reflects both the operation sequences and production volumes for the parts to find machine cells. Phase 2 apollos iterative reassignment procedure to minimize inter-cell part moves and maximize within-cell machine utilization by reassigning improperly assigned machines and parts to their most associated cells and families. Computational experience with the data sets available on literature shows the proposed approach yields good-quality proper block diagonal solution.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.58-61
• /
• 2000

In this paper, we describe an effective method to enhance the color night images with spatio-temporal multi-scale retinex focused to the Intelligent Transportation System (ITS) applications such as in the single CCD based Electronic Toll Collection System (ETCS). The basic spatial retinex is known to provide color constancy while effectively removing local shades. However, it is relatively ineffective in night vision enhancement. Our proposed method, STMSR, exploits the iterative time averaging of image sequences to suppress the noise in consideration of the moving vehicles in image frame. In the STMSR method, the spatial term makes the dark images distinguishable and preserves the color information day and night while the temporal term reduces the noise effect for sharper and clearer reconstruction of the contents in each image frame. We show through representative simulations that incorporating both terms in the modeling produces the output sequential images visually more pleasing than the original dim images.

• Journal of Communications and Networks
• /
• 제8권3호
• /
• pp.313-322
• /
• 2006

We consider a power controlled code division multiple access (CDMA) system with multiple flow types. At each of the N nodes, there are F flow types with different signal-to-interference-and-noise-ratio (SINR) requirements. To keep the complexity of the transmitter low, we assume that each node uses the same power level for all its flows. The single flow case has been fully solved and is well-understood. We concentrate on the multiple flow case, and use a novel and different approach. For the uplink problem with N = 2 and F arbitrary, the necessary and sufficient conditions to have a solution are found and proved. For the general N > 1 uplink problem, we provide a necessary condition for the problem to have a solution and an iterative algorithm to find the optimum solution. For the downlink case with F > 1 some properties of the optimal sequences are obtained.

• Kyungpook Mathematical Journal
• /
• 제59권1호
• /
• pp.83-99
• /
• 2019

In this paper, we introduce a hybrid subgradient method for finding an element common to both the solution set of a class of pseudomonotone equilibrium problems, and the set of fixed points of a finite family of ${\kappa}$-strictly presudononspreading mappings in a real Hilbert space. We establish some weak and strong convergence theorems of the sequences generated by our iterative method under some suitable conditions. These convergence theorems are investigated without the Lipschitz condition for bifunctions. Our results complement many known recent results in the literature.

• Korean Journal of Mathematics
• /
• 제30권1호
• /
• pp.91-107
• /
• 2022

Controlled frames have been the subject of interest because of their ability to improve the numerical efficiency of iterative algorithms for inverting the frame operator. In this paper, we introduce the notion of controlled K-frame or controlled operator frame in Hilbert C^*-modules. We establish the equivalent condition for controlled K-frame. We investigate some operator theoretic characterizations of controlled K-frames and controlled Bessel sequences. Moreover, we establish the relationship between the K-frames and controlled K-frames. We also investigate the invariance of a controlled K-frame under a suitable map T. At the end, we prove a perturbation result for controlled K-frame.

• Journal of Communications and Networks
• /
• 제16권4호
• /
• pp.447-457
• /
• 2014

In this paper, we investigate the frequency domain channel estimation for multiple-input multiple-output (MIMO) single-carrier frequency-division multiple-access (SC-FDMA) systems. In MIMO SC-FDMA, code-division multiplexed (CDM) pilots such as cyclic-shifted Zadoff-Chu sequences have been adopted for channel estimation. However, most frequency domain channel estimation schemes were developed based on frequency-division multiplexing of pilots. We first develop a channel estimation error model by using CDM pilots, and then analyze the mean-square error (MSE) of various minimum MSE (MMSE) frequency domain channel estimation techniques. We show that the cascaded one-dimensional robust MMSE (C1D-RMMSE) technique is complexity-efficient, but it suffers from performance degradation due to the channel correlation mismatch when compared to the two-dimensional MMSE (2D-MMSE) technique. To improve the performance of C1D-RMMSE, we design a robust iterative channel estimation (RITCE) with a frequency replacement (FR) algorithm. After deriving the MSE of iterative channel estimation, we optimize the FR algorithm in terms of the MSE. Then, a low-complexity adaptation method is proposed for practical MIMO SC-FDMA systems, wherein FR is performed according to the reliability of the data estimates. Simulation results show that the proposed RITCE technique effectively improves the performance of C1D-RMMSE, thus providing a better performance-complexity tradeoff than 2D-MMSE.

• 대한전자공학회논문지SD
• /
• 제44권2호
• /
• pp.127-138
• /
• 2007

본 논문에서는 최대길이 의사무작위 이진 시퀀스(m-시퀀스)의 쉬프트-덧셈 특성에 근거한 위상천이를 이용하여 회로 출력에 나타나는 X-값을 효과적으로 마스크 함으로써 내장된 자체 테스트를 실현할 수 있는 기법을 제안한다. 이 기법은 패턴생성기인 LFSR의 출력을 적절하게 위상천이 하여 마스크 패턴을 생성할 수 있는 위상천이 네트워크를 이용한다. 테스트 절차 동안에 각 스캔 체인에 인가되는 마스크 패턴의 위상 천이 수는 재구성 가능하다. LFSR의 출력을 적절하게 위상 천이하여 모든 스캔 체인 마스크 패턴을 생성할 수 있는 위상천이 네트워크 합성 알고리즘을 제안한다. 본 논문에서 제안하는 X-마스크 회로는 각 스캔 체인 마스크 패턴을 생성할 수 있는 후보 위상천이 수가 많기 때문에 하드웨어 오버헤드를 효과적으로 감축할 수 있다. 실험을 통하여 제안된 위상천이를 이용한 X-마스크 회로는 기존의 연구 결과보다 훨씬 적은 저장공간과 하드웨어 오버헤드를 필요로 함을 증명한다.

• 대한공간정보학회지
• /
• 제16권2호
• /
• pp.49-56
• /
• 2008

영상등록은 영상모자�掠茱� 중 중요한 기술로 인식되고 있으며, 파노라마 영상생성이나 비디오 모니터링, 영상복원 등과 같은 다양한 분야에서 사용될 수 있다. 영상등록에서 중요한 처리과정은 많은 시간이 소요되는 특징점 검출과 추적이다. 본 연구에서는 연속된 영상자료에서 특징점을 검출하고 추적하기 위해서 KLT 특징점 추적자를 제안하였으며, 무인헬기에서 촬영된 연속영상프레임의 영상등록에 적용하여 효용성을 입증하였다. 그 결과 KLT추적자에 의한 반복처리는 연속영상의 첫 번째 프레임에서 추출된 특징점을 이용하여 전체 프레임에 걸쳐 성공적으로 추적할 수 있었다. 또한, 회전, 축척, 이동량이 다른 각각의 프레임들간의 특징점 추적은 KLT영상피라미드와 처리조건의 선택에 의해 정확도를 향상시킬 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권3호
• /
• pp.1702-1721
• /
• 2019

A workflow process (or business process) management system helps to define, execute, monitor and manage workflow models deployed on a workflow-supported enterprise, and the system is compartmentalized into a modeling subsystem and an enacting subsystem, in general. The modeling subsystem's functionality is to discover and analyze workflow models via a theoretical modeling methodology like ICN, to graphically define them via a graphical representation notation like BPMN, and to systematically deploy those graphically defined models onto the enacting subsystem by transforming into their textual models represented by a standardized workflow process definition language like XPDL. Before deploying those defined workflow models, it is very important to inspect its syntactical correctness as well as its structural properness to minimize the loss of effectiveness and the depreciation of efficiency in managing the corresponding workflow models. In this paper, we are particularly interested in verifying very large-scale and massively parallel workflow models, and so we need a sophisticated analyzer to automatically analyze those specialized and complex styles of workflow models. One of the sophisticated analyzers devised in this paper is able to analyze not only the structural complexity but also the data-sequence complexity, especially. The structural complexity is based upon combinational usages of those control-structure constructs such as subprocesses, exclusive-OR, parallel-AND and iterative-LOOP primitives with preserving matched pairing and proper nesting properties, whereas the data-sequence complexity is based upon combinational usages of those relevant data repositories such as data definition sequences and data use sequences. Through the devised and implemented analyzer in this paper, we are able eventually to achieve the systematic verifications of the syntactical correctness as well as the effective validation of the structural properness on those complicate and large-scale styles of workflow models. As an experimental study, we apply the implemented analyzer to an exemplary large-scale and massively parallel workflow process model, the Large Bank Transaction Workflow Process Model, and show the structural complexity analysis results via a series of operational screens captured from the implemented analyzer.