Ivaylo Ilinkin

dblp:21/3110 · DBLP profile ↗
← Back
12ranked-venue papers
11as first author
2since 2021 · last 2023
0000-0002-0723-637XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Human-computer interaction and ubiquitous computing · 4 · 4 first-author · 1 since 2021Theory of computation · 4 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Human-computer interaction and pervasive computing
2 papers
Interaction techniques and input · 87% Usability and user experience research · 13%
Theoretical computer science
2 papers
Computational geometry · 100%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Interaction techniques and input
text entry
0.422017
Evaluation of Korean Text Entry Methods for Smartwatches · CHI 2017
Evaluation of text entry methods for Korean mobile phones, a user study · CHI 2010
Interaction techniques and input › text entry
smartwatch text entry
0.312017
Evaluation of Korean Text Entry Methods for Smartwatches · CHI 2017
Computational geometry › geometric optimization
parametric search
0.212013
Parametric search visualization · SoCG 2013
Computational geometry
visualization
0.212013
Parametric search visualization · SoCG 2013
Usability and user experience research
user study
0.122017
Evaluation of Korean Text Entry Methods for Smartwatches · CHI 2017
Evaluation of text entry methods for Korean mobile phones, a user study · CHI 2010
Interaction techniques and input › text entry
mobile text entry
0.112010
Evaluation of text entry methods for Korean mobile phones, a user study · CHI 2010
Geometric modeling and processing › mesh deformation
mesh morphing
0.112014
Visualization of Floater and Gotsman's Morphing Algorithm · SoCG 2014
Computational geometry
arrangement
0.012013
Parametric search visualization · SoCG 2013

Methods — techniques the papers use, named apart from their topics

user study · 0.4linear interpolation · 0.4convex combination · 0.4parametric search · 0.2
YearPublicationVenuePosition
2023 Stroke-Based Rendering and Planning for Robotic Performance of Artistic Drawing
abstract
We present a new robotic drawing system based on stroke-based rendering (SBR). Our motivation is the artistic quality of the whole performance. Not only should the generated strokes in the final drawing resemble the input image, but the stroke sequence should also exhibit a human artist's planning process. Thus, when a robot executes the drawing task, both the drawing results and the way the robot executes would look artistic. Our SBR system is based on image segmentation and depth estimation. It generates the drawing strokes in an order that allows for the intended shape to be perceived quickly and for its detailed features to be filled in and emerge gradually when observed by the human. This ordering represents a stroke plan that the drawing robot should follow to create an artistic rendering of images. We experimentally demonstrate that our SBR-based drawing makes visually pleasing artistic images, and our robotic system can replicate the result with proper sequences of stroke drawing.
Ivaylo Ilinkin, Daeun Song, Young J. Kim
IROS1
2023 Variations on "From Nand to Tetris" with Logisim and ARM
abstract
This paper shares experience with using Logisim to complement the hardware specification approach and accompanying simulator for the projects in "From Nand to Tetris" (N2T; Shocken et al., SIGCSE'09). Student feedback indicates that Logisim enhances the visualization of the main concepts and can be used effectively in parallel with the framework developed in N2T. This is achieved via an external Logisim library implemented by the authors that extends the rich set of components available in Logisim with the specialized circuits required in N2T (e.g ALU, CPU, Screen, Keyboard). Upon completing the projects the students are able to execute the same machine code for a Pong-like game on their Logisim and N2T computers.
Ivaylo Ilinkin
ITiCSE (1)1
2017 Evaluation of Korean Text Entry Methods for Smartwatches
abstract
This paper presents results from a user study designed to evaluate the effectiveness of Korean text entry methods for smartwatches. Specifically, the study compares the four popular text entry methods for smartphones in the context of smartwatch use (three multi-tap 3x4 keypad methods and a QWERTY-like method). A distinctive feature of text entry in Korea is that traditionally different manufacturers have developed their own text entry methods starting with particular physical layouts on feature phones that are now available as soft keypads on smartphones. This research considers the next step in this progression by studying the viability of adopting these text entry methods on smartwatches. The results from the user study indicate that existing methods can be effective for text entry on smartwatches; analysis of the data offers suggestions for improving the effectiveness of the methods.
Ivaylo Ilinkin, Sunghee Kim
CHI1
2014 Visualization of Floater and Gotsman's Morphing Algorithm
abstract
This video provides a visualization of an algorithm proposed by Floater and Gotsman for morphing two polygonal tilings. The algorithm represents the interior vertices of the tilings as convex combinations of their neighbors. At each time step the convex coefficients are linearly interpolated and the interior vertices of the intermediate tilings are found as the solutions to a system of linear equations.
Ivaylo Ilinkin
SoCG1
2014 Opportunities for android projects in a CS1 course
abstract
Mobile devices have become ubiquitous in our daily lives and are replacing the desktop for email, social networking, daily planner, and so on. A typical mobile device now integrates a wide range of accessories, such as camera, GPS receiver, accelerometer, and offers a touch-screen with gesture-based interaction. This makes mobile devices an exciting platform for software development and programming projects for mobile devices have great potential to provide engaging experiences for computer science majors.
Ivaylo Ilinkin
SIGCSE1
2013 Parametric search visualization
abstract
This video provides a visualization of parametric search using as the underlying application an algorithm for computing a tangent to a level in arrangement proposed by Matoušek [2]. The visualization is based on the framework of van~Oostrum and Veltkamp [6], which simplifies considerably the implementation of parametric search algorithms.
Ivaylo Ilinkin
SoCG1
2010 Evaluation of text entry methods for Korean mobile phones, a user study
abstract
This paper reports the results of a user study designed to evaluate text entry methods for mobile phones used in Korea. At present the keypad layout for Korean mobile phones has not been standardized and different manufacturers produce phones with different layouts. Included in the evaluation are three of the dominant text entry methods: Chon-ji-in, EZ-Hangul, and SKY. The metrics used in the analysis are key strokes per character, words per minute, and total error rate. The results suggest that SKY offers a good balance between speed, effort, and accuracy. The paper also introduces a phrase set that has high correlation with the Korean language and could be used in other experiments on Korean text entry methods.
Ivaylo Ilinkin, Sunghee Kim
CHI1
2010 Multiple structure alignment and consensus identification for proteins
abstract
BACKGROUND: An algorithm is presented to compute a multiple structure alignment for a set of proteins and to generate a consensus (pseudo) protein which captures common substructures present in the given proteins. The algorithm represents each protein as a sequence of triples of coordinates of the alpha-carbon atoms along the backbone. It then computes iteratively a sequence of transformation matrices (i.e., translations and rotations) to align the proteins in space and generate the consensus. The algorithm is a heuristic in that it computes an approximation to the optimal alignment that minimizes the sum of the pairwise distances between the consensus and the transformed proteins. RESULTS: Experimental results show that the algorithm converges quite rapidly and generates consensus structures that are visually similar to the input proteins. A comparison with other coordinate-based alignment algorithms (MAMMOTH and MATT) shows that the proposed algorithm is competitive in terms of speed and the sizes of the conserved regions discovered in an extensive benchmark dataset derived from the HOMSTRAD and SABmark databases. The algorithm has been implemented in C++ and can be downloaded from the project's web page. Alternatively, the algorithm can be used via a web server which makes it possible to align protein structures by uploading files from local disk or by downloading protein data from the RCSB Protein Data Bank. CONCLUSIONS: An algorithm is presented to compute a multiple structure alignment for a set of proteins, together with their consensus structure. Experimental results show its effectiveness in terms of the quality of the alignment and computational cost.
Ivaylo Ilinkin, Jieping Ye, Ravi Janardan
BMC Bioinform.1
2006 Multiple Structure Alignment and Consensus Identification for Proteins
Jieping Ye, Ivaylo Ilinkin, Ravi Janardan, Adam Isom
WABI2
2002 Terrain Polygon Decomposition, with Application to Layered Manufacturing
Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid
COCOON1
2002 A decomposition-based approach to layered manufacturing
Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram
Comput. Geom.1
2001 A Decomposition-Based Approach to Layered Manufacturing
Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram
WADS1