• Title/Summary/Keyword: Constraint coefficients

Search Result 56, Processing Time 0.034 seconds

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

  • 주기세
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.15 no.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
    • /
    • v.51 no.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 (퍼지 반박시정계획 문제에 관한 연구)

  • 금종수;이홍걸;이철영
    • Journal of the Korean Institute of Navigation
    • /
    • v.20 no.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 (협 양자화 제약 조건을 이용한 부호화된 영상의 후처리)

  • 박섭형;김동식;이상훈
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.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

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

  • Hahm Seong-Jun;Jung Ho-Youl;Chung Hyun-Yeol
    • The Journal of the Acoustical Society of Korea
    • /
    • v.25 no.1
    • /
    • pp.36-42
    • /
    • 2006
  • A Principal component analysis (PCA)-based Mel-Frequency Discrete Wavelet Coefficients (MFDWC) feature Parameters for speaker verification system is Presented in this Paper In this method, we used the 1st-eigenvector obtained from PCA to calculate the energy of each node of level that was approximated by. met-scale. This eigenvector satisfies the constraint of general weighting function that the squared sum of each component of weighting function is unity and is considered to represent speaker's characteristic closely because the 1st-eigenvector of each speaker is fairly different from the others. For verification. we used Universal Background Model (UBM) approach that compares claimed speaker s model with UBM on frame-level. We performed experiments to test the effectiveness of PCA-based parameter and found that our Proposed Parameters could obtain improved average Performance of $0.80\%$compared to MFCC. $5.14\%$ to LPCC and 6.69 to existing MFDWC.

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)
    • /
    • v.10 no.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
    • /
    • v.14 no.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 Reductin via Adaptive Control Variates(ACV) (Variance Reduction via Adaptive Control Variates (ACV))

  • Lee, Jae-Yeong
    • Journal of the Korea Society for Simulation
    • /
    • v.5 no.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
    • /
    • v.20 no.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 (독립성분분석을 이용한 혼합물내의 순수물질 구성비 추정)

  • Jeon Chi-Hyeok;Lee Hye-Seon;Park Hae-Sang;Hong Jae-Hwa
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • 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