• 제목/요약/키워드: Constraint coefficients

검색결과 56건 처리시간 0.025초

최소자승법을 이용한 가려지지 않은 원통형 물체의 자세측정 (Unoccluded Cylindrical Object Pose Measurement Using Least Square Method)

  • 주기세
    • 한국정밀공학회지
    • /
    • 제15권7호
    • /
    • pp.167-174
    • /
    • 1998
  • This paper presents an unoccluded cylindrical object pose measurement using a slit beam laser in which a robot recognizes all of the unoccluded objects from the top of jumbled objects, and picks them up one by one. The elliptical equation parameters of a projected curve edge on a slice are calculated using LSM. The coefficients of standard elliptical equation are compared with these parameters to estimate the object pose. The hamming distances between the estimated coordinates and the calculated ones are extracted as measures to evaluate a local constraint and a smoothing surface curvature. The edges between slices are linked using error function based on the edge types and the hamming distances. The linked edges on slices are compared with the model object's length to recognize the unoccluded object. This proposed method may provide a solution to the automation of part handling in manufacturing environments such as punch press operation or part assembly.

  • PDF

Minimum dynamic response of cantilever beams supported by optimal elastic springs

  • Aydin, Ersin
    • Structural Engineering and Mechanics
    • /
    • 제51권3호
    • /
    • pp.377-402
    • /
    • 2014
  • In this study, optimal distribution of springs which supports a cantilever beam is investigated to minimize two objective functions defined. The optimal size and location of the springs are ascertained to minimize the tip deflection of the cantilever beam. Afterwards, the optimization problem of springs is set up to minimize the tip absolute acceleration of the beam. The Fourier Transform is applied on the equation of motion and the response of the structure is defined in terms of transfer functions. By using any structural mode, the proposed method is applied to find optimal stiffness and location of springs which supports a cantilever beam. The stiffness coefficients of springs are chosen as the design variables. There is an active constraint on the sum of the stiffness coefficients and there are passive constraints on the upper and lower bounds of the stiffness coefficients. Optimality criteria are derived by using the Lagrange Multipliers. Gradient information required for solution of the optimization problem is analytically derived. Optimal designs obtained are compared with the uniform design in terms of frequency responses and time response. Numerical results show that the proposed method is considerably effective to determine optimal stiffness coefficients and locations of the springs.

퍼지 반박시정계획 문제에 관한 연구 (A Study on a Fuzzy Berth Assignment Programming Problem)

  • 금종수;이홍걸;이철영
    • 한국항해학회지
    • /
    • 제20권4호
    • /
    • pp.59-70
    • /
    • 1996
  • A berth assignment problem has a direct impact on assessment of charges made to ships and goods. In this paper, we concerned with of fuzzy mathematical programming models for a berth assignment problem to achieved an efficient berth operation in a fuzzy environment. In this paper, we focus on the berth assignment programming with fuzzy parameters which are based on personal opinions or subjective judgement. From the above point of view, assume that a goal and a constraint are given by fuzzy sets, respectively, which are characterized by membership functions. Let a fuzzy decision be defined as the fuzzy set resulting from the intersection of a goal and constraint. This paper deals with fuzziness in all parameters which are expressed by fuzzy numbers. A fuzzy parameter defined by a fuzzy number means a possibility distribution of the parameters. These fuzzy 0-1 integer programming problems are formulated by fuzzy functions whose concept is also called the extension principle. We deal with a berth assignment problem with triangular fuzzy coefficients and propose a branch and bound algorithm for solving the problem. We suggest three models of berth assignment to minimizing the objective functions such as total port time, total berthing time and maximum berthing time by using a revised Maximum Position Shift(MPS) concept. The berth assignment problem is formulated by min-max and fuzzy 0-1 integer programming. Finally, we gave the numerical solutions of the illustrative examples.

  • PDF

협 양자화 제약 조건을 이용한 부호화된 영상의 후처리 (On Post-Processing of Coded Images by Using the Narrow Quantization Constraint)

  • 박섭형;김동식;이상훈
    • 한국통신학회논문지
    • /
    • 제22권4호
    • /
    • pp.648-661
    • /
    • 1997
  • This paper presents a new method for post-processing of coded images based upon the low-pass filtering followed by the projection onto the NQCS (narrow quantization constraint set). We also investigate how the proposed method works on JPEG-coded real images. The starting point of the QCS-based post-processing techniques is the centroid of the QCS, where the original image belongs. The low-pass filtering followed by the projection onto the QCS makes the images lie on the boundary of the QCS. It is likely that, however, the original image is inside the QCS. Hence projection onto the NQCS gives a lower MSE (mean square error) than does the projection onto the QCS. Simulation results show that setting the narrowing coefficients of the NQCS to be 0.2 yields the best performance in most cases. Even though the JPEG-coded image is low-pass filtered and projected onto the NQCS repeatedly, there is no guarantee that the resultant image has a lower MSE and goes closer to the original image. Thus only one iteration is sufficient for the post-processing of the coded images. This is interesting because the main drawback of the iterative post-processing techniques is the heavy computational burden. The single iteration method reduces the computational burden and gives us an easy way to implement the real time VLSI post-processor.

  • PDF

화자 검증 시스템을 위한 PCA 기반 MFDWC 특징 파라미터 (A PCA-based MFDWC Feature Parameter for Speaker Verification System)

  • 함성준;정호열;정현열
    • 한국음향학회지
    • /
    • 제25권1호
    • /
    • pp.36-42
    • /
    • 2006
  • 본 논문에서는 화자검증 시스템의 성능향상을 위해서 주성분 분석 (PCA) 기반 Mel-Frequency Discrete Wavelet Coefficients (MFDWC) 추출방법을 제안한다. 제안된 방법에서는 멜척도 (Mel-scale)를 근사화한 각 레벨 (level)의 각 노드 (node) 에너지를 계산하기 위해 기존의 평균치 대신 주성분 분석을 이용한 첫 번째 eigenvector를 이용한다. 이 eigenvecto.의 제곱의 합은 1로서 일반적인 가중 함수 (weighting function)의 조건을 만족하고, 또한 각 화자마다 서로 다른 값을 갖게 되므로, 화자의 특징을 더 잘 나타내는 MFDWC를 추출할 수 있다. 화자검증은 Gaussian Mixture Model (GMM) 기반의 백그라운드 모델과 화자 모델과의 점수를 비교하는 이진 결정 (binary decision) 방법을 이용하여 Universal 백그라운드 모델 (UBM)과 각 화자 모델의 값을 프레임단위로 비교하여 대상 화자의 수락/거부 여부를 결정하는 방법을 채택하였다. 특징 파라미터에 따른 화자 검증 성능변화를 확인하기 위하여 제안된 화자종속 가중함수를 이용한 MFDWC를 특징 파라미터로 이용한 경우와 Mel-Frequency Cepstral Coefficients (MFCC), Linear Predictive Cepstral Coefficients (LPCC), 기존의 MFDWC를 특징 파라미터로 이용한 경우에 대하여 성능비교실험을 수행한 결과 각각 $0.80\%,\;5.14\%,\; 6.69\%$의 향상된 성능을 나타내어 제안한 방법의 유효성을 확인할 수 있었다.

An amplify-and-forward relaying scheme based on network coding for Deep space communication

  • Guo, Wangmei;Zhang, Junhua;Feng, Guiguo;Zhu, Kaijian;Zhang, Jixiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권2호
    • /
    • pp.670-683
    • /
    • 2016
  • Network coding, as a new technique to improve the throughput, is studied combined with multi-relay model in this paper to address the challenges of long distance and power limit in deep space communication. First, an amplify-and-forward relaying approach based on analog network coding (AFNC) is proposed in multi-relay network to improve the capacity for deep space communication system, where multiple relays are introduced to overcome the long distance link loss. The design of amplification coefficients is mathematically formulated as the optimization problem of maximizing SNR under sum-power constraint over relays. Then for a dual-hop relay network with a single source, the optimal amplification coefficients are derived when the multiple relays introduce non-coherent noise. Through theoretic analysis and simulation, it is shown that our approach can achieve the maximum transmission rate and perform better over single link transmission for deep space communication.

Speaker Verification with the Constraint of Limited Data

  • Kumari, Thyamagondlu Renukamurthy Jayanthi;Jayanna, Haradagere Siddaramaiah
    • Journal of Information Processing Systems
    • /
    • 제14권4호
    • /
    • pp.807-823
    • /
    • 2018
  • Speaker verification system performance depends on the utterance of each speaker. To verify the speaker, important information has to be captured from the utterance. Nowadays under the constraints of limited data, speaker verification has become a challenging task. The testing and training data are in terms of few seconds in limited data. The feature vectors extracted from single frame size and rate (SFSR) analysis is not sufficient for training and testing speakers in speaker verification. This leads to poor speaker modeling during training and may not provide good decision during testing. The problem is to be resolved by increasing feature vectors of training and testing data to the same duration. For that we are using multiple frame size (MFS), multiple frame rate (MFR), and multiple frame size and rate (MFSR) analysis techniques for speaker verification under limited data condition. These analysis techniques relatively extract more feature vector during training and testing and develop improved modeling and testing for limited data. To demonstrate this we have used mel-frequency cepstral coefficients (MFCC) and linear prediction cepstral coefficients (LPCC) as feature. Gaussian mixture model (GMM) and GMM-universal background model (GMM-UBM) are used for modeling the speaker. The database used is NIST-2003. The experimental results indicate that, improved performance of MFS, MFR, and MFSR analysis radically better compared with SFSR analysis. The experimental results show that LPCC based MFSR analysis perform better compared to other analysis techniques and feature extraction techniques.

Variance Reduction via Adaptive Control Variates (ACV) (Variance Reductin via Adaptive Control Variates(ACV))

  • Lee, Jae-Yeong
    • 한국시뮬레이션학회논문지
    • /
    • 제5권1호
    • /
    • pp.91-106
    • /
    • 1996
  • Control Variate (CV) is very useful technique for variance reduction in a wide class of queueing network simulations. However, the loss in variance reduction caused by the estimation of the optimum control coefficients is an increasing function of the number of control variables. Therefore, in some situations, it is required to select an optimal set of control variables to maximize the variance reduction . In this paper, we develop the Adaptive Control Variates (ACV) method which selects an optimal set of control variates during the simulation adatively. ACV is useful to maximize the simulation efficiency when we need iterated simulations to find an optimal solution. One such an example is the Simulated Annealing (SA) because, in SA algorithm, we have to repeat in calculating the objective function values at each temperature, The ACV can also be applied to the queueing network optimization problems to find an optimal input parameters (such as service rates) to maximize the throughput rate with a certain cost constraint.

  • PDF

A CANONICAL REPRESENTATION FOR THE SOLUTION OF FUZZY LINEAR SYSTEM AND FUZZY LINEAR PROGRAMMING PROBLEM

  • NEHI HASSAN MISHMAST;MALEKI HAMID REZA;MASHINCHI MASHAALAH
    • Journal of applied mathematics & informatics
    • /
    • 제20권1_2호
    • /
    • pp.345-354
    • /
    • 2006
  • In this paper first, we find a canonical symmetrical trapezoidal(triangular) for the solution of the fuzzy linear system $A\tilde{x}=\tilde{b}$, where the elements in A and $\tilde{b}$ are crisp and arbitrary fuzzy numbers, respectively. Then, a model for fuzzy linear programming problem with fuzzy variables (FLPFV), in which, the right hand side of constraints are arbitrary numbers, and coefficients of the objective function and constraint matrix are regarded as crisp numbers, is discussed. A numerical procedure for calculating a canonical symmetrical trapezoidal representation for the solution of fuzzy linear system and the optimal solution of FLPFV, (if there exist) is proposed. Several examples illustrate these ideas.

독립성분분석을 이용한 혼합물내의 순수물질 구성비 추정 (Estimation of Pure Component Fractions in a Mixture Using Independent Component Analysis)

  • 전치혁;이혜선;박해상;홍재화
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
    • /
    • pp.1066-1070
    • /
    • 2006
  • Independent component analysis (ICA) is a statistical method for linearly transforming observed high-dimensional multivariate data into several statistically independent components. ICA has gained wide-spread attention in a variety of fields including spectrum application. We focus on the application of ICA for separating independent sources from a set of mixtures and estimating their fractions in a mixture. The proposed method of estimating fractions is based on the regression model subject to the non-negativity constraint on coefficients. Simulation experiments are performed to demonstrate the performance of the proposed approach.

  • PDF