#### Filter Results:

#### Publication Year

2013

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

#### Data Set Used

Learn More

- A. Enis Çetin, Alican Bozkurt, Osman Günay, Yusuf Hakan Habiboglu, Kivanç Köse, Ibrahim Onaran +2 others
- GlobalSIP
- 2013

Two new optimization techniques based on projections onto convex space (POCS) framework for solving convex and some non-convex optimization problems are presented. The dimension of the minimization problem is lifted by one and sets corresponding to the cost function are defined. If the cost function is a convex function in R N the corresponding set is a… (More)

Recognizing fonts has become an important task in document analysis, due to the increasing number of available digital documents in different fonts and emphases. A generic font-recognition system independent of language, script and content is desirable for processing various types of documents. At the same time, categorizing calligraphy styles in… (More)

A new deconvolution algorithm based on orthogonal projections onto the epigraph set of a convex cost function is presented. In this algorithm, the dimension of the minimization problem is lifted by one and sets corresponding to the cost function are defined. As the utilized cost function is a convex function in R N , the corresponding epigraph set is also a… (More)

In many practical problems it is not necessary to compute the DFT in a perfect manner including some radar problems. In this article a new multiplication free algorithm for approximate computation of the DFT is introduced. All multiplications (a × b) in DFT are replaced by an operator which computes sign(a×b)(|a|+|b|). The new transform is especially useful… (More)

- ‹
- 1
- ›