• Journal of Information Processing Systems
• /
• 제16권5호
• /
• pp.1129-1144
• /
• 2020

The thangka image inpainting method based on wavelet transform is not ideal for contour curves when the high frequency information is repaired. In order to solve the problem, a new image inpainting algorithm is proposed based on edge structural constraints and wavelet transform coefficients. Firstly, a damaged thangka image is decomposed into low frequency subgraphs and high frequency subgraphs with different resolutions using wavelet transform. Then, the improved fast marching method is used to repair the low frequency subgraphs which represent structural information of the image. At the same time, for the high frequency subgraphs which represent textural information of the image, the extracted and repaired edge contour information is used to constrain structure inpainting in the proposed algorithm. Finally, the texture part is repaired using texture synthesis based on the wavelet coefficient characteristic of each subgraph. In this paper, the improved method is compared with the existing three methods. It is found that the improved method is superior to them in inpainting accuracy, especially in the case of contour curve. The experimental results show that the hierarchical method combined with structural constraints has a good effect on the edge damage of thangka images.

• 융합신호처리학회논문지
• /
• 제2권4호
• /
• pp.77-84
• /
• 2001

신경망을 이용한 선형프로그랭 회로를 홉프필드가 제안한 이후로 이에 관한 많은 논문들이 발표되었으며, 그 중에는 비선형 프로그래밍 문제에 관한 것들도 많다. 그래서 비용함수가 비선형인 경우는 해결이 되었으나 제한조건이 비선형인 경우에는 해결되지 못한 상태이다. 이 논문에서는 제한조건이 비선형인 경우를 포함하는 즉 비용함수와 제한조건 모두 비선형인 경우를 풀 수 있는 일반적인 비선형프로그래밍 신경망을 제안하고자 한다.

• 대한산업공학회지
• /
• 제36권2호
• /
• pp.138-145
• /
• 2010

In this paper, we consider the information processing system, which organizes the collected data to meaningful information when the number of data collected from multiple sources reaches to a predetermined number, and performs any action by processing the collected data, or transmits to other devices or systems. We derive an analytical model to calculate the time until it takes to process information after starting to collect data. Therefore, in order to complete the processing data within certain time constraints, we develop some design criteria to control various parameters of the information processing system. Also, we analyze the discrete time model for packet switching networks considering data with no particular arrival nor drop pattern. We analyze the relationship between the number of required packets and average information processing time through numerical examples. By this, we show that the proposed model is able to design the system to be suitable for user's requirements being complementary the quality of information and the information processing time in the system with time constraints.

• 한국축산식품학회지
• /
• 제44권4호
• /
• pp.739-757
• /
• 2024

Camel milk plays a critical role in the diet of peoples belongs to the semi-arid and arid regions. Since prehistoric times, camel milk marketing was limited due to lacking the processing facilities in the camel-rearing areas, nomads practiced the self-consumption of raw and fermented camel milk. A better understanding of the techno-functional properties of camel milk is required for product improvement to address market and customer needs. Despite the superior nutraceutical and health promoting potential, limited camel dairy products are available compared to other bovines. It is a challenging impetus for the dairy industry to provide diversified camel dairy products to consumers with superior nutritional and functional qualities. The physicochemical behavior and characteristics of camel milk is different than the bovine milk, which poses processing and technological challenges. Traditionally camel milk is only processed into various fermented and non-fermented products; however, the production of commercially important dairy products (cheese, butter, yogurt, and milk powder) from camel milk still needs to be processed successfully. Therefore, the industrial processing and transformation of camel milk into various products, including fermented dairy products, pasteurized milk, milk powder, cheese, and other products, require the development of new technologies based on applied research. This review highlights camel milk's processing constraints and techno-functional properties while presenting the challenges associated with processing the milk into various dairy products. Future research directions to improve product quality have also been discussed.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2019년도 제59차 동계학술대회논문집 27권1호
• /
• pp.377-380
• /
• 2019

To accommodate for the difficult task of satisfying application's system timing constraints, we are developing Splash, a real time stream processing language for embedded AI applications. Splash is a graphical programming language that designs applications through data flow graph which, later automatically generates into codes. The codes are compiled and executed on top of the Splash runtime system. The Splash runtime system supports two aspects of the application. First, it supports the basic stream processing functions required for an application to operate on multiple streams of data. Second, it supports the checking and handling of the user configurated timing constraints. In this paper we explain the implementation of the first aspect of the Splash runtime system which is being developed using a real time communication middleware called DDS.

• 한국멀티미디어학회논문지
• /
• 제10권12호
• /
• pp.1741-1751
• /
• 2007

The imprecise computation technique ensures that all time-critical tasks produce their results before their deadlines by trading off the quality of the results for the computation time requirements of the tasks. In the imprecise computation, most scheduling problems of satisfying both 0/1 constraints and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. In the previous studies, the reasonable strategies of scheduling tasks with the 0/1 constraints on uniprocessors and multiprocessors for minimizing the total error are proposed. But, these algorithms are all off-line algorithms. Then, in the on-line scheduling, NORA(No Off-line tasks and on-line tasks Ready upon Arrival) algorithm can find a schedule with the minimum total error. In NORA algorithm, EDF(Earliest Deadline First) strategy is adopted in the scheduling of optional tasks. On the other hand, for the task system with 0/1 constraints, NORA algorithm may not suitable any more for minimizing total error of the imprecise tasks. Therefore, in this paper, an on-line algorithm is proposed to minimize total error for the imprecise real-time task system with 0/1 constraints. This algorithm is suitable for the imprecise on-line system with 0/1 constraints. Next, to evaluate performance of this algorithm, a series of experiments are done. As a consequence of the performance comparison, it has been concluded that IOSMTE(Imprecise On-line Scheduling to Minimize Total Error) algorithm proposed in this paper outperforms LOF(Longest Optional First) strategy and SOF(Shortest Optional First) strategy for the most cases.

• IEIE Transactions on Smart Processing and Computing
• /
• 제4권6호
• /
• pp.391-402
• /
• 2015

In this paper, we present implementation of backward movement control of truck-trailer vehicles using a fuzzy mode-based control scheme considering practical constraints and computational overhead. We propose a fuzzy feedback controller where output is predicted with the delay of a unit sampling period. Analysis and design of the proposed controller is very easy, because it is synchronized with sampling time. Stability analysis is also possible when quantization exists in the implementation of fuzzy control architectures, and we show that if the trivial solution of the fuzzy control system without quantization is asymptotically stable, then the solutions of the fuzzy control system with quantization are uniformly ultimately bounded. Experimental results using a toy truck show that the proposed control system outperforms a conventional system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권5호
• /
• pp.1569-1586
• /
• 2015

This paper considers the optimal cell association and resource allocation for load balancing in a heterogeneous cellular network subject to user's quality-of-service (QoS) constraints. We adopt the proportional fairness (PF) utility maximization formulation which also accommodates the QoS constraints in terms of minimum rate requirements. With equal resource allocation this joint optimization problem is either infeasible or requires relaxation that yields a solution which is difficult to implement. Nevertheless, we show that this joint optimization problem can be effectively solved without any priori assumption on resource allocation and yields a cell association scheme which enforces single BS association for each user. We re-formulated the joint optimization problem as a network-wide resource allocation problem with cardinality constraints. A reweighted heuristic l₁-norm regularization method is used to obtain a sparse solution to the re-formulated problem. The cell association scheme is then derived from the sparsity pattern of the solution, which guarantees a single BS association for each user. Compared with the previously proposed method based on equal resource allocation, the proposed framework results in a feasible cell association scheme and yields a robust solution on resource allocation that satisfies the QoS constraints. Our simulations illustrate the impact of user's minimum rate requirements on cell association and demonstrate that the proposed approach achieves load balancing and enforces single BS association for users.

• 산업경영시스템학회지
• /
• 제22권50호
• /
• pp.183-193
• /
• 1999

The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed. In this paper, we propose an efficient algorithm for mining quantitative association rules with item constraints. For categorical attributes, we map the values of the attribute to a set of consecutive integers. For quantitative attributes, we can partition the attribute into values or ranges. While such constraints can be applied as a post-processing step, integrating them into the mining algorithm can reduce the execution time. We consider the problem of integrating constraints that are boolean expressions over the presence or absence of items containing quantitative attributes into the association discovery algorithm using Apriori concept.

• IEIE Transactions on Smart Processing and Computing
• /
• 제2권4호
• /
• pp.197-202
• /
• 2013

Large gains in speech intelligibility can be obtained using the SNR-based binary mask approach. This approach retains the time-frequency (T-F) units of the mixture signal, where the target signal is stronger than the interference noise (masker) (e.g., SNR > 0 dB), and removes the T-F units, where the interfering noise is dominant. This paper introduces two alternative binary masks based on the distortion constraints to improve the speech intelligibility. The distortion constraints are induced by a gain function for estimating the short-time spectral amplitude. One binary mask is designed to retain the speech underestimated (T-F) units while removing the speech overestimated (T-F)units. The other binary mask is designed to retain the noise overestimated (T-F) units while removing noise underestimated (T-F) units. Listening tests with oracle binary masks were conducted to assess the potential of the two binary masks in improving the intelligibility. The results suggested that the two binary masks based on distortion constraints can provide large gains in intelligibility when applied to noise-corrupted speech.